Numerical solution of symmetric least-squares problems with an inversion-free Kovarik-type algorithm
From MaRDI portal
Publication:5451467
Recommendations
- A numerical algorithm for the optimal approximation solution to inverse eigenvalue problem for symmetric matrices
- Numerical algorithms for solving the least squares symmetric problem of matrix equation \(AXB + CXD = E\)
- The total least squares solution for the inverse problems of symmetric matrices
- scientific article; zbMATH DE number 2091955
- Least-squares solution for inverse problem of symmetric and self-orthogonally similar matrices
- On numerical solution of arbitrary symmetric linear systems by approximate orthogonalization
- An iterative method for the least-squares minimum-norm symmetric solution
- scientific article; zbMATH DE number 2219228
- A refined variant of the inverse-free Krylov subspace method for symmetric generalized eigenvalue problems
- scientific article; zbMATH DE number 5205430
Cites work
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 3353461 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- An iterative algorithm for approximate orthogonalisation of symmetric matrices
- Projections and preconditioning for inconsistent least-squares problems
- Rank-Deficient and Discrete Ill-Posed Problems
- Some Iterative Methods for Improving Orthonormality
Cited in
(2)
This page was built for publication: Numerical solution of symmetric least-squares problems with an inversion-free Kovarik-type algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451467)