𝔖 Bobbio Scriptorium
✦   LIBER   ✦

QR factorization for the regularized least squares problem on hypercubes

✍ Scribed by Jianping Zhu

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
496 KB
Volume
19
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A note on the equivalence of a class of
A note on the equivalence of a class of factorized Broyden families for nonlinear least squares problems
✍ Hideho Ogasawara πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 74 KB

This note is concerned with the recently proposed two factorized quasi-Newton updates for solving nonlinear least squares problems. One is a class of updates proposed by Yabe and Yamaki (SIAM Journal on Optimization 5 (1995) 770-791), which was designed as a factorized version of the structured Broy