Analysis of a Classical Matrix Preconditioning Algorithm

DOI10.1145/2988227zbMATH Open1412.65016OpenAlexW2614899618MaRDI QIDQ4640282FDOQ4640282

Authors: Leonard J. Schulman, Alistair Sinclair 

Publication date: 17 May 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://authors.library.caltech.edu/58889/

Recommendations

• Analysis of a classical matrix preconditioning algorithm
• Analysis of Preconditioners for Domain Decomposition
• Analysis of Preconditioning Techniques for Ill-Conditioned Toeplitz Matrices
• Matrix algebras in optimal preconditioning
• Algebraic Analysis of the Hierarchical Basis Preconditioner
• scientific article; zbMATH DE number 54281
• Analysis of preconditioning strategies for collocation linear systems
• A unifying approach to abstract matrix algebra preconditioning
• Preconditioning linear systems via matrix function evaluation
• Analysis of Preconditioners for Saddle-Point Problems

zbMATH Keywords

numerical linear algebrapreconditioning matricesmatrix scalingmatrix balancing

Mathematics Subject Classification ID

Preconditioners for iterative methods (65F08) Numerical computation of matrix norms, conditioning, scaling (65F35)

Cited In (5)

• Directed shortest paths via approximate cost balancing
• Analysis of a classical matrix preconditioning algorithm
• Stochastic matrix-free equilibration
• Near-linear convergence of the random Osborne algorithm for matrix balancing
• Matrix balancing in \(L_p\) norms: bounding the convergence rate of Osborne's iteration

This page was built for publication: Analysis of a Classical Matrix Preconditioning Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640282)