An iterative algorithm for approximate orthogonalisation of symmetric matrices

DOI10.1080/00207160310001650134zbMath1053.65029OpenAlexW2042603350MaRDI QIDQ4464267

Constantin Popa, Ulrich Rüde, Marcus Mohr

Publication date: 27 May 2004

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160310001650134

zbMATH Keywords

convergencepseudo-inversematrix iterationtruncated Neumann series

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09) Orthogonalization in numerical linear algebra (65F25)

Related Items (1)

Numerical solution of symmetric least-squares problems with an inversion-free Kovarik-type algorithm

Cites Work

• Unnamed Item
• A method for improving orthogonality of rows and columns of matrices
• Rank-Deficient and Discrete Ill-Posed Problems
• Some Iterative Methods for Improving Orthonormality

This page was built for publication: An iterative algorithm for approximate orthogonalisation of symmetric matrices