An iterative algorithm for approximate orthogonalisation of symmetric matrices
From MaRDI portal
Recommendations
- On a modified Kovarik algorithm for symmetric matrices
- Modified Kovarik Algorithm For Approximate Orthogonalization Of Arbitrary Matrices
- A new version of Kovarik’s approximate orthogonalization algorithm without matrix inversion
- An iterative method for orthogonal projections of generalized inverses
- An iterative method for the symmetric ortho-symmetric solutions of a class of matrix equation
Cites work
Cited in
(8)- On numerical solution of arbitrary symmetric linear systems by approximate orthogonalization
- Iterative algorithms for Gram-Schmidt orthogonalization
- Orthogonal matrix and its application in Bloom's threshold scheme
- Modified Kovarik Algorithm For Approximate Orthogonalization Of Arbitrary Matrices
- Approximating Matrices with Multiple Symmetries
- Numerical solution of symmetric least-squares problems with an inversion-free Kovarik-type algorithm
- Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice
- Approximating orthogonal matrices by permutation matrices
This page was built for publication: An iterative algorithm for approximate orthogonalisation of symmetric matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4464267)