Simple backward error bounds for linear least-squares problems
DOI10.1016/J.LAA.2013.03.007zbMATH Open1281.65065OpenAlexW2062278821MaRDI QIDQ389595FDOQ389595
David Titley-Peloquin, Serge Gratton, Pavel Jiránek
Publication date: 21 January 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2013.03.007
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cites Work
- Title not available (Why is that?)
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Faster least squares approximation
- Accuracy and Stability of Numerical Algorithms
- Optimal backward perturbation bounds for the linear least squares problem
- Estimation of optimal backward perturbation bounds for the linear least squares problem
- Estimating the Backward Error in LSQR
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- Stopping Criteria for the Iterative Solution of Linear Least Squares Problems
- New Fast Algorithms for Structured Linear Least Squares Problems
- Backward Perturbation Bounds for Linear Least Squares Problems
- On the Accuracy of the Karlson--Waldén Estimate of the Backward Error for Linear Least Squares Problems
Cited In (6)
Uses Software
This page was built for publication: Simple backward error bounds for linear least-squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389595)
