Numerical solution of symmetric least-squares problems with an inversion-free Kovarik-type algorithm
From MaRDI portal
Publication:5451467
DOI10.1080/00207160701421151zbMATH Open1152.65046OpenAlexW1966557773MaRDI QIDQ5451467FDOQ5451467
Authors: Marcus Mohr, Constantin Popa
Publication date: 27 March 2008
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160701421151
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
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)
Cites Work
- Title not available (Why is that?)
- Rank-Deficient and Discrete Ill-Posed Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Projections and preconditioning for inconsistent least-squares problems
- An iterative algorithm for approximate orthogonalisation of symmetric matrices
- 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)