An Algorithm to Improve Nearly Orthonormal Sets of Vectors on a Vector Processor
Bernard Philippe · SIAM Journal on Algebraic and Discrete Methods · 1987
The symmetric orthogonalization, which is obtained from the polar decomposition of a matrix, is optimal. We propose an iterative algorithm to compute this orthogonalization on vector computers. It is especially efficient when the original matrix is near an orthonormal matrix.