✦ LIBER ✦

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

✍ Scribed by R Morandi; F Sgallari

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 725 KB
Volume: 13
Category: Article
ISSN: 0167-8191
DOI: 10.1016/0167-8191(90)90129-w

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convergence of block iterative methods a

Convergence of block iterative methods applied to sparse least-squares problems

✍ W. Niethammer; J.de Pillis; R.S. Varga 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 697 KB

Parallel solution of certain Toeplitz le

Parallel solution of certain Toeplitz least-squares problems

✍ A. Bojańczyk; R.P. Brent 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 691 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

Parallel algorithms for least median of

Parallel algorithms for least median of squares regression

✍ Chong-wei Xu; Wei-Kei Shiue 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 939 KB

An iterative penalty method for the leas

An iterative penalty method for the least squares solution of boundary value problems

✍ D. G. Zeitoun; J. P. Laible; G. F. Pinder 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 426 KB 👁 2 views

This article is concerned with iterative techniques for linear systems of equations arising from a least squares formulation of boundary value problems. In its classical form, the solution of the least squares method is obtained by solving the traditional normal equation. However, for nonsmooth boun

A parallel multisplitting solution of th

A parallel multisplitting solution of the least squares problem

✍ R. A. Renaut 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB 👁 2 views

The linear least squares problem, min x Ax-b 2 , is solved by applying a multisplitting(MS) strategy in which the system matrix is decomposed by columns into p blocks. The b and x vectors are partitioned consistently with the matrix decomposition. The global least squares problem is then replaced by