Bernard Philippe
Abstract
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.
OpenAlex reports 22 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Orthogonalization, Orthonormal basis, Orthonormality, Mathematics, Matrix (chemical analysis), Algorithm, Combinatorics, Composite material