⌘+K

Pulse Explore Communities Researchers Journals

Home Communities Explore

July 1, 1987SIAM Journal on Algebraic and Discrete Methods

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

Bernard Philippe

View at Publisher

Ask AI

Bookmark

Share

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.

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Bernard Philippe (1987) studied this question.

synapsesocial.com/papers/6a118f35197952f0fdac7ad2 https://doi.org/10.1137/0608032

View at Publisher

Ask AI

Bookmark

Share

Keep reading

Synapse has enriched 5 related papers. Consider them for comparative context:

1An Iterative Algorithm for Computing the Best Estimate of an Orthogonal MatrixOriginal Research · 1971 · 91 citations
2Latent Subsets for Dual Intersecting SystemsSIAM Journal on Algebraic and Discrete Methods · Thu,
3On One-Sided Jacobi Methods for Parallel ComputationSIAM Journal on Algebraic and Discrete Methods · Thu,
4The Null Space Problem II. AlgorithmsSIAM Journal on Algebraic and Discrete Methods · Thu,
5A Dynamic Programming Approach to the Dominating Set Problem on k -TreesSIAM Journal on Algebraic and Discrete Methods · Thu,

More from SIAM Journal on Algebraic and Discrete Methods

Network ResilienceWed,
Computing a Sparse Basis for the Null SpaceWed,
Inherited Matrix Entries: Principal Submatrices of the InverseWed,
A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room SquaresWed,
Group Convolutions and Matrix TransformsWed,