๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A hybrid least squares QR-lattice algorithm using a priori errors

โœ Scribed by Miranda, M.D.; Gerken, M.

Book ID
119790722
Publisher
IEEE
Year
1997
Tongue
English
Weight
554 KB
Volume
45
Category
Article
ISSN
1053-587X

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

Recursive least-squares using a hybrid H
Recursive least-squares using a hybrid Householder algorithm on massively parallel SIMD systems
โœ E.J. Kontoghiorghes; M. Clint; H.-H. Naegeli ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 273 KB

Within the context of recursive least-squares, the implementation of a Householder algorithm for block updating the QR decomposition, on massively parallel SIMD systems, is considered. Initially, two implementations based on dierent mapping strategies for distributing the data matrices over the proc