Scaling by binormalization

DOI10.1023/B:NUMA.0000016606.32820.69MaRDI QIDQ1430251zbMATH OpenOpenAlexFDO

Authors Oren E. Livne, Gene H. Golub

Publication date 27 May 2004

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:numa.0000016606.32820.69

zbMATH Keywords

BIN algorithmbinormalizationconvergenceGauss-Seidel-Newton methodnumerical experimentsoptimal conditioningoptimal scalingrelaxation methods

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Review text

The authors develop an algorithm (BIN) for diagonally scale a symmetric matrix by a fast iterative binormalization technique. The convergence properties of this algorithm and the possible relation to optimal conditioning of the matrix are investigated. Analogous algorithms, for nonsymmetric and rectangular matrices are also developed. The conclusion of the authors is that BIN is a novel iterative binormalization algorithm that may be useful in many applications. Numerical experiments are made for the BIN algorithm and the NBIN algorithm (extended of BIN to non-symmetric matrices).

Recommendations

• scientific article; zbMATH DE number 2050051
• Scaling for orthogonality
• scientific article; zbMATH DE number 1047675
• Polynomial Scaling
• scientific article; zbMATH DE number 1116653
• On the scaling of multidimensional matrices
• Binary tree approach to scaling in unimodal maps
• On the scaling methods by Pinchuk and Frankel
• Linear scaling and the DIRECT algorithm
• scientific article; zbMATH DE number 1303659

Cited in

(13)

• Evolutionary soft co-clustering: formulations, algorithms, and applications
• Iterative preconditioned methods in Krylov spaces: trends of the 21st century
• Optimal orthogonalization processes
• On moment methods in Krylov subspaces
• ILU preconditioners for nonsymmetric saddle-point matrices with application to the incompressible Navier-Stokes equations
• Max-balanced Hungarian scalings
• A Parallel Matrix Scaling Algorithm
• An Algorithm for Optimal ℓ₂ Scaling of Matrices
• Scaling linear optimization problems prior to application of the simplex method
• Constructive quantum scaling of unitary matrices
• Scaling for orthogonality
• Scaling, reordering, and diagonal pivoting in ILU preconditionings
• Quantum algorithms for matrix scaling and matrix balancing

This page was built for publication: Scaling by binormalization

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