A necessary and sufficient convergence condition of orthomin(k) methods for least squares problem with weight

DOI10.1007/BF02481151zbMath0732.65038OpenAlexW1995750471MaRDI QIDQ808624

Yoshio Oyanagi, Shao-Liang Zhang

Publication date: 1990

Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

convergenceleast squares problemconjugate directionCR-WLS(k) algorithmOrthomin(k)-method

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items (2)

Preconditioned GMRES methods for least squares problems ⋮ Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems

Cites Work

• Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• Methods of conjugate gradients for solving linear systems
• Unnamed Item
• Unnamed Item

This page was built for publication: A necessary and sufficient convergence condition of orthomin(k) methods for least squares problem with weight