QR Factorization of a Dense Matrix on a Hypercube Multiprocessor
DOI10.1137/0911057zbMATH Open0711.65018OpenAlexW2087314423MaRDI QIDQ3497119FDOQ3497119
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
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
algorithmscomputational experimentsQR factorizationGivens rotationsparallel computer systemhypercube architectureiPSC hypercube multiprocessor system
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Graph theory (including graph drawing) in computer science (68R10) Numerical algorithms for specific classes of architectures (65Y10)
Cited In (6)
- QR factorization for the regularized least squares problem on hypercubes
- Sparse Orthogonal Decomposition on a Hypercube Multiprocessor
- Parallel QR factorization using the torus-wrap mapping
- QR Factorization for Linear Least-Squares Problems on a Hypercube Multiprocessor
- Parallel quadrant interlocking factorization on hypercube computers
- Improved parallel QR method for large least squares problems involving Kronecker products
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)
