QR Factorization of a Dense Matrix on a Hypercube Multiprocessor

DOI10.1137/0911057zbMath0711.65018MaRDI QIDQ3497119

No author found.

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

algorithms; computational experiments; QR factorization; Givens rotations; parallel computer system; hypercube architecture; iPSC hypercube multiprocessor system

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

68R10: Graph theory (including graph drawing) in computer science

65Y05: Parallel numerical computation

65F05: Direct numerical methods for linear systems and matrix inversion

65Y10: Numerical algorithms for specific classes of architectures

Related Items

Improved parallel QR method for large least squares problems involving Kronecker products