𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel algorithms for large least squares problems involving kronecker products

✍ Scribed by Charles T Fulton; Limin Wu

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
578 KB
Volume
30
Category
Article
ISSN
0362-546X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Improved parallel QR method for large le
Improved parallel QR method for large least squares problems involving Kronecker products
✍ Donald W. Fausett; Charles T. Fulton; Hany Hashish πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 894 KB

A new algorithm is presented for the efficient solution of large least squares problems in which the coefficient matrix of the linear system is a Kronecker product of two smaller dimension matrices. The solution algorithm is based on QR factorizations of the smaller dimension matrices. Near perfect

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