Distributed Orthogonal Factorization: Givens and Householder Algorithms
From MaRDI portal
Publication:3468541
DOI10.1137/0910067zbMath0693.65031OpenAlexW2042025615MaRDI QIDQ3468541
Publication date: 1989
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0910067
parallel algorithmsorthogonal factorizationGivens rotationsHouseholder transformationshybrid algorithmdistributed memory multiprocessorshypercube multiprocessor
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Parallel numerical computation (65Y05) Orthogonalization in numerical linear algebra (65F25)
Related Items
Scaling Up Parallel Computation of Tiled QR Factorizations by a Distributed Scheduling Runtime System and Analytical Modeling, On elliptical motions on a general ellipsoid, A novel parallel algorithm based on the Gram-Schmidt method for tridiagonal linear systems of equations, Improved parallel QR method for large least squares problems involving Kronecker products, Numerical algorithms for high-performance computational science