✦ LIBER ✦

Rank revealing QR factorizations

✍ Scribed by Tony F. Chan

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 878 KB
Volume: 88-89
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(87)90103-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Low-rank revealing QR factorizations

✍ Tony F. Chan; Per Christian Hansen 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 643 KB

Computing nonnegative rank factorization

Computing nonnegative rank factorizations

✍ Stephen L. Campbell; George D. Poole 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 430 KB

The nonnegative rank factorizations of n

The nonnegative rank factorizations of nonnegative matrices

✍ Ji-Cheng Chen 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 579 KB

QR-PLSR: Reduced-rank regression for hig

QR-PLSR: Reduced-rank regression for high-speed hardware implementation

✍ Frank Westad; Klaus Diepold; Harald Martens 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 630 KB

A version of PLS regression is described that intends to combine the computer hardware implementation advantages of the algebraic technique of 'QR decomposition' with the statistical, interpretative and computational advantages of PLS regression. With a QR decomposition based on Givens rotations, th

Parallel tiled QR factorization for mult

Parallel tiled QR factorization for multicore architectures

✍ Alfredo Buttari; Julien Langou; Jakub Kurzak; Jack Dongarra 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB

A family of parallel QR factorization al

A family of parallel QR factorization algorithms

✍ Meyer, Gerard G.L.; Pascale, Mike 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 624 KB

Rapid computation of the QR factorization of a matrix is fundamental to many scientific and engineering problems. The paper presents a family of algorithms parameterized by the number of processors available P, arithmetic grain aggregation parameters gl ,@, . . . ,gp, and communication grain aggrega