Analysis of a classical matrix preconditioning algorithm

DOI10.1145/2746539.2746556MaRDI QIDQ2941580zbMATH OpenOpenAlexWikidataFDO

Authors 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, https://authors.library.caltech.edu/58889/

zbMATH Keywords

matrix balancingmatrix scalingnumerical linear algebrapreconditioning matrices

Mathematics Subject Classification ID

Preconditioners for iterative methods (65F08)

Abstract: We study a classical iterative algorithm for balancing matrices in the $L_{i}nfty$ norm via a scaling transformation. This algorithm, which goes back to Osborne and Parlett & Reinsch in the 1960s, is implemented as a standard preconditioner in many numerical linear algebra packages. Surprisingly, despite its widespread use over several decades, no bounds were known on its rate of convergence. In this paper we prove that, for any irreducible $nimesn$ (real or complex) input matrix~$A$, a natural variant of the algorithm converges in $O(n^{3}log(nho/varepsilon))$ elementary balancing operations, where $ho$ measures the initial imbalance of~$A$ and $varepsilon$ is the target imbalance of the output matrix. (The imbalance of~$A$ is $ma{x}_i|log(a_i^{extout}/a_i^{extin})|$, where $a_i^{extout},a_i^{extin}$ are the maximum entries in magnitude in the $i$th row and column respectively.) This bound is tight up to the $logn$ factor. A balancing operation scales the $i$th row and column so that their maximum entries are equal, and requires $O(m/n)$ arithmetic operations on average, where $m$ is the number of non-zero elements in~$A$. Thus the running time of the iterative algorithm is $ildeO(n^{2}m)$. This is the first time bound of any kind on any variant of the Osborne-Parlett-Reinsch algorithm. We also prove a conjecture of Chen that characterizes those matrices for which the limit of the balancing process is independent of the order in which balancing operations are performed.

Recommendations

• Analysis of a Classical Matrix Preconditioning Algorithm
• Matrix balancing in \(L_p\) norms: bounding the convergence rate of Osborne's iteration
• scientific article; zbMATH DE number 7376020
• A fast algorithm for matrix balancing
• On the Complexity of Matrix Balancing

Cites work

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

Cited in

(6)

• Stochastic matrix-free equilibration
• Matrix balancing in \(L_p\) norms: bounding the convergence rate of Osborne's iteration
• Analysis of a Classical Matrix Preconditioning Algorithm
• scientific article; zbMATH DE number 7376020 (Why is no real title available?)
• Quantum algorithms for matrix scaling and matrix balancing
• A case where balancing is harmful

Describes a project that uses

Uses Software

• Graphs

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 Q2941580)