QR factorization for the regularized least squares problem on hypercubes

DOI10.1016/0167-8191(93)90076-WMaRDI QIDQ688204zbMATH OpenOpenAlexFDO

Authors Jian-Ping Zhu

Publication date 23 January 1994

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(93)90076-w

zbMATH Keywords

performancehybrid algorithmHouseholder transformationQR factorizationTikhonov's regularization methodtiming resultsGiven's rotationsill-conditioned least squares problemIntel hypercubesover-determined system

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Recommendations

• QR Factorization for Linear Least-Squares Problems on a Hypercube Multiprocessor
• QR Factorization of a Dense Matrix on a Hypercube Multiprocessor
• A coarse-grained parallel QR-factorization algorithm for sparse least squares problems
• Fast Inverse $QR$ Factorization for Toeplitz Matrices
• scientific article; zbMATH DE number 712354

Cited in

(2)

• Using Perturbed $QR$ Factorizations to Solve Linear Least-Squares Problems
• QR Factorization for Linear Least-Squares Problems on a Hypercube Multiprocessor

This page was built for publication: QR factorization for the regularized least squares problem on hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688204)