Computation of optimal backward perturbation bounds for large sparse linear least squares problems
From MaRDI portal
Publication:5960913
DOI10.1023/A:1021952203842zbMATH Open0994.65041MaRDI QIDQ5960913
Publication date: 10 October 2002
Published in: BIT (Search for Journal in Brave)
algorithmnumerical examplessparse matricesbackward perturbation boundLanczos bidiagonalizationlarge sparse linear least squares problems
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Related Items (3)
Optimal backward perturbation bounds for the linear least squares problem โฎ On optimal backward perturbation bounds for the linear least squares problem โฎ Title not available (Why is that?)
Uses Software
Recommendations
- Title not available (Why is that?) ๐ ๐
- On optimal backward perturbation bounds for the linear least squares problem ๐ ๐
- Estimation of optimal backward perturbation bounds for the linear least squares problem ๐ ๐
- Bounds for an estimate of the optimal backward error for linear least squares problems ๐ ๐
- Backward perturbation analysis for scaled total least-squares problems ๐ ๐
- Backward Perturbation Bounds for Linear Least Squares Problems ๐ ๐
- Solving Sparse Linear Systems with Sparse Backward Error ๐ ๐
- Optimal backward perturbation bounds for the linear least squares problem ๐ ๐
- Optimal backward perturbation bounds for the linear least-squares problem with multiple right-hand sides ๐ ๐
- Optimal backward perturbation bounds for the LSS problem ๐ ๐
This page was built for publication: Computation of optimal backward perturbation bounds for large sparse linear least squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5960913)