Solving the linear least squares problem with very high relative accuracy

DOI10.1007/BF02238802zbMath0722.65018OpenAlexW1574126875MaRDI QIDQ756369

Jolanta Głuchowska, Alicja Smoktunowicz

Publication date: 1990

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02238802

zbMATH Keywords

algorithmlinear least squares problemfloating point arithmeticiterative refinementsmulti-precision arithmeticstime costtotal error

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Roundoff error (65G50)

Cites Work

• Binary cascades iterative refinement in doubled-mantissa arithmetics
• Iterative refinement for linear systems in variable-precision arithmetic
• Numerical stability for solving nonlinear equations
• Stability analysis of the method of seminormal equations for linear least squares problems
• Iterative refinement of linear least squares solutions I
• Solving linear least squares problems by Gram-Schmidt orthogonalization
• Perturbation theory for pseudo-inverses
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving the linear least squares problem with very high relative accuracy