QR Factorization of a Dense Matrix on a Hypercube Multiprocessor

DOI10.1137/0911057MaRDI QIDQ3497119zbMATH OpenOpenAlexFDO

Authors

Publication date 1990

Published in SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0911057

zbMATH Keywords

algorithmscomputational experimentsGivens rotationshypercube architectureiPSC hypercube multiprocessor systemparallel computer systemQR factorization

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• QR Factorization for Linear Least-Squares Problems on a Hypercube Multiprocessor
• Parallel QR factorization using the torus-wrap mapping
• A Parallel QR Factorization Algorithm with Controlled Local Pivoting
• Parallel quadrant interlocking factorization on hypercube computers
• QR factorization of a dense matrix on a shared-memory multiprocessor

Cited in

(7)

• Parallel QR factorization using the torus-wrap mapping
• Sparse Orthogonal Decomposition on a Hypercube Multiprocessor
• QR Factorization for Linear Least-Squares Problems on a Hypercube Multiprocessor
• Parallel Algorithms and Subcube Embedding on a Hypercube
• Improved parallel QR method for large least squares problems involving Kronecker products
• QR factorization for the regularized least squares problem on hypercubes
• Parallel quadrant interlocking factorization on hypercube computers

This page was built for publication: QR Factorization of a Dense Matrix on a Hypercube Multiprocessor

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