2017
Nov
20

# Leonard Schulman, "Analysis of a Classical Matrix Preconditioning Algorithm"

2:00pm to 3:00pm

## Location:

Room 130, Feldman Building, Givat Ram

There are several prominent computational problems for which
simple iterative methods are widely preferred in practice despite
an absence of runtime or performance analysis (or "worse", actual
evidence that more sophisticated methods have superior
performance according to the usual criteria). These situations
raise interesting challenges for the analysis of algorithms.
We are concerned in this work with one such simple method: a
classical iterative algorithm for balancing matrices via scaling
transformations. This algorithm, which goes back to Osborne and