An Iterative Algorithm for Computing the Best Estimate of an Orthogonal Matrix
From MaRDI portal
Publication:5626145
DOI10.1137/0708036zbMath0221.65075OpenAlexW2054276177WikidataQ54271601 ScholiaQ54271601MaRDI QIDQ5626145
Publication date: 1971
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0708036
Related Items
An adaptive constraint method for paraunitary filter banks with applications to spatiotemporal subspace tracking ⋮ The matrix sign decomposition and its relation to the polar decomposition ⋮ A fixed-point method for approximate projection onto the positive semidefinite cone ⋮ Correction of numerical error when two direction cosine columns are used as kinematical variables ⋮ Optimal orthonormalization of the strapdown matrix by using singular value decomposition ⋮ Wasserstein generative adversarial uncertainty quantification in physics-informed neural networks ⋮ An Algorithm to Improve Nearly Orthonormal Sets of Vectors on a Vector Processor ⋮ Approximating Probability Distributions by Using Wasserstein Generative Adversarial Networks ⋮ Unnamed Item ⋮ Computational methods of linear algebra ⋮ Algorithms for the orthographic-\(n\)-point problem ⋮ On iterative algorithms for the polar decomposition of a matrix and the matrix sign function ⋮ On the determination of an orthogonal transformation
