✦ LIBER ✦

Some properties of LSQR for large sparse linear least squares problems

✍ Scribed by Zhongxiao Jia

Book ID: 107347200
Publisher: Academy of Mathematics and Systems Science, Chinese Academy of Sciences
Year: 2010
Tongue: English
Weight: 153 KB
Volume: 23
Category: Article
ISSN: 1009-6124
DOI: 10.1007/s11424-010-7190-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computation of Optimal Backward Perturba

Computation of Optimal Backward Perturbation Bounds for Large Sparse Linear Least Squares Problems

✍ A. Malyshev; M. Sadkane 📂 Article 📅 2001 🏛 Springer Netherlands 🌐 English ⚖ 165 KB

Solving large and sparse linear least-sq

Solving large and sparse linear least-squares problems by conjugate gradient algorithms

✍ Z. Zlatev; H.B. Nielsen 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 563 KB

Solution of sparse linear least squares

Solution of sparse linear least squares problems using givens rotations

✍ Alan George; Michael T. Heath 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 838 KB

A Robust Preconditioner with Low Memory

A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems

✍ Benzi, Michele; Tuma, Miroslav 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 164 KB

Preconditioned GMRES methods with incomp

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

✍ Jun-Feng Yin; Ken Hayami 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 581 KB

We propose to precondition the GMRES method by using the incomplete Givens orthogonalization (IGO) method for the solution of large sparse linear least-squares problems. Theoretical analysis shows that the preconditioner satisfies the sufficient condition that can guarantee that the preconditioned G

Parallel algorithms for the iterative so

Parallel algorithms for the iterative solution of sparse least-squares problems

✍ R Morandi; F Sgallari 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 725 KB