Iterative refinement of linear least squares solutions II

DOI10.1007/BF01939974zbMATH Open0177.43204MaRDI QIDQ5567413FDOQ5567413

Authors: Åke Björck 

Publication date: 1968

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

numerical analysis

Cites Work

• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• Title not available (Why is that?)
• Least squares, singular values and matrix approximations
• Smallest Least Squares Solutions of Linear Equations
• On Least Squares Solutions of Linear Equations
• Studies with generalized matrix algebra

Cited In (18)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5567413)