Distributed Orthogonal Factorization: Givens and Householder Algorithms

DOI10.1137/0910067MaRDI QIDQ3468541zbMATH OpenOpenAlexFDO

Authors Alex Pothen, Padma Raghavan

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

zbMATH Keywords

distributed memory multiprocessorsGivens rotationsHouseholder transformationshybrid algorithmhypercube multiprocessororthogonal factorizationparallel algorithms

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Orthogonalization in numerical linear algebra (65F25) Parallel numerical computation (65Y05)

Recommendations

• Distributed Sparse Gaussian Elimination and Orthogonal Factorization
• Parallel Sparse Orthogonal Factorization on Distributed-Memory Multiprocessors
• A Fan-In Algorithm for Distributed Sparse Numerical Factorization
• Distributed matrix completion and robust factorization
• Distributed Schur Complement Techniques for General Sparse Linear Systems
• Hyperbolic Householder Algorithms for Factoring Structured Matrices
• scientific article; zbMATH DE number 641618
• scientific article; zbMATH DE number 554769
• Distributed Computation of Linear Matrix Equations: An Optimization Perspective

Cited in

(13)

• Parallel Gram-Schmidt orthogonalisation on a network of transputers
• Parallel strategies for computing the orthogonal factorizations used in the estimation of econometric models
• Sparse Orthogonal Decomposition on a Hypercube Multiprocessor
• scientific article; zbMATH DE number 4054915 (Why is no real title available?)
• Systolic givens factorization of dense rectangular matrices
• Orthogonal Reduction on Vector Computers
• Optimal algorithms for parallel Givens factorization on a coarse-grained PRAM
• scientific article; zbMATH DE number 883313 (Why is no real title available?)
• Numerical algorithms for high-performance computational science
• 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

This page was built for publication: Distributed Orthogonal Factorization: Givens and Householder Algorithms

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