A Parallel QR Factorization Algorithm with Controlled Local Pivoting

DOI10.1137/0912002zbMath0718.65017OpenAlexW2032512096MaRDI QIDQ5750330

Christian H. Bischof

Publication date: 1991

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

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

zbMATH Keywords

rankimplementationrange spacesparallel QR factorizationHouseholder algorithm with column pivotingIntel iPSC/1 and iPSC/2 hypercubes

Mathematics Subject Classification ID

Factorization of matrices (15A23) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Gaussian quadrature for matrix valued functions on the real line, Randomized QR with Column Pivoting, Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting, Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations, Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra, Improved parallel QR method for large least squares problems involving Kronecker products, A block algorithm for computing rank-revealing QR factorizations, ALORA: affine low-rank approximations