Iterative refinement of linear least squares solutions I
From MaRDI portal
Publication:5542530
DOI10.1007/BF01939321zbMath0159.20404OpenAlexW4233049725MaRDI QIDQ5542530
Publication date: 1967
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01939321
Related Items (35)
Mixed precision algorithms in numerical linear algebra ⋮ Iterative refinement for constrained and weighted linear least squares ⋮ Solution of augmented linear systems using orthogonal factorizations ⋮ A survey of the advances in the exploitation of the sparsity in the solution of large problems ⋮ A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems ⋮ Sparse linear problems and the least squares method ⋮ On the modified Gram-Schmidt algorithm for weighted and constrained linear least squares problems ⋮ Solution of sparse rectangular systems using LSQR and Craig ⋮ Computer Solution and Perturbation Analysis of Generalized Linear Least Squares Problems ⋮ Gram-Schmidt orthogonalization: 100 years and more ⋮ On the augmented system approach to sparse least-squares problems ⋮ Computational methods of linear algebra ⋮ Perturbation theory for pseudo-inverses ⋮ Comparison of two pivotal strategies in sparse plane rotations ⋮ The solution of large-scale least-squares problems on supercomputers ⋮ A note on iterative refinement for seminormal equations ⋮ Iterative refinement enhances the stability of \(QR\) factorization methods for solving linear equations ⋮ On Iterative Solution of the Extended Normal Equations ⋮ Iterative refinement of the singular-value decomposition solution to the regression equations ⋮ Extended version with the analysis of dynamic system for iterative refinement of solution ⋮ Improved componentwise verified error bounds for least squares problems and underdetermined linear systems ⋮ A method for least squares solution of systems with a cyclic rectangular coefficient matrix ⋮ Ein Verfahren zur Behandlung von Ausgleichsaufgaben mit Intervallkoeffizienten ⋮ Solving the linear least squares problem with very high relative accuracy ⋮ Perturbation analysis of saddle-point problems ⋮ Minimum residual methods for augmented systems ⋮ A direct error analysis for least squares ⋮ Stability analysis of the method of seminormal equations for linear least squares problems ⋮ Improved Gram-Schmidt type downdating methods ⋮ Three-Precision GMRES-Based Iterative Refinement for Least Squares Problems ⋮ Extensions of the Augmented Block Cimmino Method to the Solution of Full Rank Rectangular Systems ⋮ Binary cascades iterative refinement in doubled-mantissa arithmetics ⋮ A strictly improving linear programming Phase I algorithm ⋮ Component-wise perturbation analysis and error bounds for linear least squares solutions ⋮ Solving symmetric indefinite systems in an interior-point method for linear programming
Cites Work
- Numerical methods for solving linear least squares problems
- Elimination with weighted row combinations for solving linear equations and least squares problems
- Note on the iterative refinement of least squares solution
- Iterative refinement of the solution of a positive definite system of equations
- Iterative Refinement in Floating Point
- Solving linear least squares problems by Gram-Schmidt orthogonalization
- Unnamed Item
This page was built for publication: Iterative refinement of linear least squares solutions I
