Numerical Analysis 2000 Vol. III: Linear Algebra
Iterative solution of linear systems in the 20th century
Eigenvalue computation in the 20th century
QR-like algorithms for eigenvalue problems
The ubiquitous Kronecker product
Preconditioning eigenvalues and some comparison of solvers
For tridiagonals T replace T with LDLt
An overview of relative sin Θ theorems for invariant subspaces of complex matrices
The trace minimization method for the symmetric generalized eigenvalue problem
Successive overrelaxation (SOR) and related methods
On asynchronous iterations
Iterative methods for large continuation problems
The matrix and polynomial approaches to Lanczos-type algorithms
Analysis of acceleration strategies for restarted minimal residual methods
Refining an approximate inverse
Scalable preconditioned conjugate gradient inversion of vector finite element mass matrices
Robust multigrid methods for nonsmooth coefficient elliptic linear systems
The Rook's pivoting strategy
Numerical methods in control
Krylov-subspace methods for reduced-order modeling in circuit simulation
Tikhonov regularization and the L-curve for large discrete ill-posed problems
Symbiosis between linear algebra and optimization
Some computational problems arising in adaptive optics imaging systems
Numerical linear algebra algorithms and software
The impact of high-performance computing in the solution of linear systems: trends and problems
Index
