A fast algorithm for matrix balancing

DOI10.1093/IMANUM/DRS019MaRDI QIDQ2841064zbMATH OpenOpenAlexWikidataFDO

Authors Philip A. Knight, Daniel Ruiz

Publication date 24 July 2013

Published in IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2007/1073/

zbMATH Keywords

sparse matricesdoubly stochastic matrixinexact Newton methodconjugate gradient iterationmatrix balancingSinkhorn-Knopp algorithm

Mathematics Subject Classification ID

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

Recommendations

• A Comparative Study of Algorithms for Matrix Balancing
• On the Complexity of Matrix Balancing
• Vector and parallel computing for matrix balancing
• Balancing an arbitrary matrix using computations with Stieltjes matrices
• Matrix Balancing on a Massively Parallel Connection Machine
• Interval-constrained matrix balancing
• scientific article; zbMATH DE number 7376020
• Balancing sparse matrices for computing eigenvalues
• scientific article; zbMATH DE number 2096649
• Near-linear convergence of the random Osborne algorithm for matrix balancing

Cited in

(31)

• A Comparative Study of Algorithms for Matrix Balancing
• Analysis of a classical matrix preconditioning algorithm
• scientific article; zbMATH DE number 7376020 (Why is no real title available?)
• Stochastic matrix-free equilibration
• Semidual regularized optimal transport
• Boosting of image denoising algorithms
• The Sinkhorn–Knopp Algorithm: Convergence and Applications
• An empirical Bayes approach for the identification of long-range chromosomal interaction from Hi-C data
• Numerical algorithm for finding balanced metrics
• Matrix Balancing on a Massively Parallel Connection Machine
• An entropy optimizing RAS-equivalent algorithm for iterative matrix balancing
• Matrix Balancing Based Interior Point Methods for Point Set Matching Problems
• Arbitrarily regularizable graphs
• Introducing the Class of SemiDoubly Stochastic Matrices: A Novel Scaling Approach for Rectangular Matrices
• scientific article; zbMATH DE number 7651215 (Why is no real title available?)
• Lagrangian numerical methods for ocean biogeochemical simulations
• Accelerating the Sinkhorn-Knopp iteration by Arnoldi-type methods
• Scaling matrices and counting the perfect matchings in graphs
• Network modelling of topological domains using Hi-C data
• Translocation Detection from Hi-C Data via Scan Statistics
• Matrix balancing in \(L_p\) norms: bounding the convergence rate of Osborne's iteration
• On the Complexity of Matrix Balancing
• The mechanism analysis for the fractional quantum dynamics on a comb structure with the absorbing boundary conditions
• Numerical simulation of the two-dimensional fractional Schrödinger equation for describing the quantum dynamics on a comb with the absorbing boundary conditions
• Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling
• On Sinkhorn's DAD theorem and the self-consistency equation in COSMO-based activity coefficient models
• MATRIX BALANCING PROBLEM AND BINARY AHP(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• A note on overrelaxation in the Sinkhorn algorithm
• Statistical curve models for inferring 3D chromatin architecture
• Constructive quantum scaling of unitary matrices
• Preconditioning techniques based on the Birkhoff-von Neumann decomposition

This page was built for publication: A fast algorithm for matrix balancing

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