Analysis of a Classical Matrix Preconditioning Algorithm

DOI10.1145/2746539.2746556zbMath1321.65045arXiv1504.03026OpenAlexW1974453261MaRDI QIDQ2941580

Leonard J. Schulman, Alistair Sinclair

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.03026

zbMATH Keywords

numerical linear algebrapreconditioning matricesmatrix scalingmatrix balancing

Mathematics Subject Classification ID

Preconditioners for iterative methods (65F08)

Related Items (1)

Unnamed Item

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming

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