𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for solving sparse Nonlinear Least Squares problems

✍ Scribed by J. M. Martínez

Publisher
Springer Vienna
Year
1987
Tongue
English
Weight
809 KB
Volume
39
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matrix stretching for sparse least squar
Matrix stretching for sparse least squares problems
✍ Mikael Adlers; Åke Björck 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB

For linear least squares problems min x Ax -b 2 , where A is sparse except for a few dense rows, a straightforward application of Cholesky or QR factorization will lead to catastrophic fill in the factor R. We consider handling such problems by a matrix stretching technique, where the dense rows ar

A coarse-grained parallel QR-factorizati
A coarse-grained parallel QR-factorization algorithm for sparse least squares problems
✍ Tz. Ostromsky; P.C. Hansen; Z. Zlatev 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 599 KB

A sparse QR-factorization algorithm SPARQR for coarse-grained parallel computations is described. The coefficient matrix, which is assumed to be general sparse, is reordered in an attempt to bring as many zero elements in the lower left corner as possible. The reordered matrix is then partitioned in