Iterative refinement of linear least squares solutions II

DOI10.1007/BF01939974zbMath0177.43204MaRDI QIDQ5567413

Åke Björck

Publication date: 1968

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

numerical analysis

Related Items (18)

The weighted generalized inverses of a partitioned matrix ⋮ Some comments on the solution of linear equations ⋮ A survey of the advances in the exploitation of the sparsity in the solution of large problems ⋮ Analysis of a parameter identification problem ⋮ Gram-Schmidt orthogonalization: 100 years and more ⋮ On the weighting method for least squares problems with linear equality constraints ⋮ An improved version of a high accuracy surface modeling method ⋮ Test procedures and test problems for least squares algorithms ⋮ Computational methods of linear algebra ⋮ Comparison of two pivotal strategies in sparse plane rotations ⋮ A note on iterative refinement for seminormal equations ⋮ A robust multiquadric method for digital elevation model construction ⋮ Ein Verfahren zur Behandlung von Ausgleichsaufgaben mit Intervallkoeffizienten ⋮ Solution of linear least squares via the ABS algorithm ⋮ The generalized Cholesky factorization method for saddle point problems ⋮ Numerical aspects of Gram-Schmidt orthogonalization of vectors ⋮ Improved Gram-Schmidt type downdating methods ⋮ The representation and approximation for the weighted Moore-Penrose inverse

Cites Work

• Unnamed Item
• Smallest Least Squares Solutions of Linear Equations
• Studies with generalized matrix algebra
• Least squares, singular values and matrix approximations
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• On Least Squares Solutions of Linear Equations

This page was built for publication: Iterative refinement of linear least squares solutions II