On a regularization technique for Kovarik-like approximate orthogonalization algorithms
This paper deals with four versions of Kovarik-like iterative orthogonalization algorithms for approximating the minimal norm solution of symmetric least squares problems. The authors previously observed in practical applications the so-called ``divergent behaviour of these algorithms, that is, a too big number of iterations can deteriorate dramatically the computed solution. In the present paper, the authors establish an almost optimal formula for the number of iterations necessary to obtain a sufficiently accurate approximation as well as to avoid the above mentioned troubles.
- On a stopping rule for iterative orthogonalization of symmetric matrices
- Some properties and applications of a modified Kovarik algorithm
- A new version of Kovarik’s approximate orthogonalization algorithm without matrix inversion
- A fast Kaczmarz-Kovarik algorithm for consistent least-squares problems
- On a modified Kovarik algorithm for symmetric matrices
- A quadratically convergent class of modifications for Kovarik's method
- scientific article; zbMATH DE number 5533899 (Why is no real title available?)
- On a stopping rule for iterative orthogonalization of symmetric matrices
- Modified Kovarik Algorithm For Approximate Orthogonalization Of Arbitrary Matrices
This page was built for publication: On a regularization technique for Kovarik-like approximate orthogonalization algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2919609)
