An Algorithm to Improve Nearly Orthonormal Sets of Vectors on a Vector Processor
From MaRDI portal
Publication:3768264
DOI10.1137/0608032zbMATH Open0631.65036OpenAlexW2141709668MaRDI QIDQ3768264FDOQ3768264
Authors: 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
Recommendations
iterative algorithmpolar decompositionsquare rootorthonormal matrixvector computerssymmetric orthogonalization
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some Metric Inequalities in the Space of Matrices
- Title not available (Why is that?)
- On the Iterative Solution of the Matrix Equation AX 2 - I = 0
- An Iterative Algorithm for Computing the Best Estimate of an Orthogonal Matrix
- Newton's Method for the Matrix Square Root
Cited In (14)
- On optimal symmetric orthogonalisation and square roots of a normal matrix
- Optimal orthogonalization processes
- Least-squares orthogonalization using semidefinite programming
- A Block Orthogonalization Procedure with Constant Synchronization Requirements
- Symmetric approximation of frames and bases in Hilbert spaces
- Simple unit vectors orthogonal to a given vector
- Minimum-correction second-moment matching: theory, algorithms and applications
- An Iterative Method for the Computation of a Matrix Inverse Square Root
- A unified view of the orthogonalization methods
- On the computation of a matrix inverse square root
- Title not available (Why is that?)
- A VLSI algorithm for computing the Euclidean norm of a 3D vector
- Algorithms for the matrix \(p\)th root
- Time-stepping and preserving orthonormality
This page was built for publication: An Algorithm to Improve Nearly Orthonormal Sets of Vectors on a Vector Processor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768264)
