A new version of Kovarik’s approximate orthogonalization algorithm without matrix inversion

DOI10.1080/00207160512331331174zbMath1085.65038OpenAlexW2045695397MaRDI QIDQ5699921

Constantin Popa, Dana Petcu

Publication date: 27 October 2005

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

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

zbMATH Keywords

algorithmsconvergencecollocationToeplitz matricesrectangular matricesintegral equations of the first kindapproximate orthogonalization

Mathematics Subject Classification ID

Orthogonalization in numerical linear algebra (65F25)

Related Items (1)

A class of iterative methods for computing polar decomposition

Cites Work

• Unnamed Item
• Unnamed Item
• A total least squares method for Toeplitz systems of equations
• A method for improving orthogonality of rows and columns of matrices
• Modified Kovarik Algorithm For Approximate Orthogonalization Of Arbitrary Matrices
• Some Iterative Methods for Improving Orthonormality
• Extension of an approximate orthogonalization algorithm to arbitrary rectangular matrices

This page was built for publication: A new version of Kovarik’s approximate orthogonalization algorithm without matrix inversion