Campuses:

Iterative methods for linear systems

Friday, April 20, 2007 - 10:30am - 11:20am
Peter Bürgisser (Universität Paderborn)
The running time of many iterative numerical algorithms is
dominated by the condition number of the input,
a quantity measuring the sensitivity of the solution with
regard to small perturbations of the input.
Examples are iterative methods of linear algebra,
interior-point methods of linear and convex optimization,
as well as homotopy methods for solving systems of polynomial
equations.

Spielman and Teng introduced in 2001 the seminal concept of
smoothed analysis, which
Subscribe to RSS - Iterative methods for linear systems