An Algorithm to Improve Nearly Orthonormal Sets of Vectors on a Vector Processor

DOI10.1137/0608032zbMath0631.65036OpenAlexW2141709668MaRDI QIDQ3768264

Bernard Philippe

Publication date: 1987

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0608032

zbMATH Keywords

iterative algorithmpolar decompositionsquare rootorthonormal matrixvector computerssymmetric orthogonalization

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Orthogonalization in numerical linear algebra (65F25)

Related Items (7)

On optimal symmetric orthogonalisation and square roots of a normal matrix ⋮ Minimum-correction second-moment matching: theory, algorithms and applications ⋮ An Iterative Method for the Computation of a Matrix Inverse Square Root ⋮ On the computation of a matrix inverse square root ⋮ Symmetric approximation of frames and bases in Hilbert spaces ⋮ Algorithms for the matrix \(p\)th root ⋮ Optimal orthogonalization processes

Cites Work

• On the Iterative Solution of the Matrix Equation AX 2 - I = 0
• Newton's Method for the Matrix Square Root
• An Iterative Algorithm for Computing the Best Estimate of an Orthogonal Matrix
• Some Metric Inequalities in the Space of Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Algorithm to Improve Nearly Orthonormal Sets of Vectors on a Vector Processor