Parallel QR factorization by Householder and modified Gram-Schmidt algorithms

DOI10.1016/0167-8191(90)90163-4zbMath0715.65018OpenAlexW2006580379MaRDI QIDQ751755

Peter Whitman, Dianne P. O'Leary

Publication date: 1990

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(90)90163-4

zbMATH Keywords

parallel implementationsQR factorizationrectangular matricesmessage passing systemsGram-Schmidt algorithmHouseholder algorithms

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Unnamed Item ⋮ A NEW MODIFIED GRAM-SCHMIDT ORTHOGONAL MATRIX FACTORIZATION BASED ALGORITHM FOR PARALLEL SOLUTION OF LINEAR EQUATIONS ⋮ Gram-Schmidt orthogonalization: 100 years and more ⋮ High level synthesis FPGA implementation of the Jacobi algorithm to solve the eigen problem ⋮ An analytical solution to applied mathematics-related Love's equation using the Boubaker polynomials expansion scheme ⋮ A novel parallel algorithm based on the Gram-Schmidt method for tridiagonal linear systems of equations ⋮ The implementation of parallel Gram-Schmidt orthogonalisation algorithms on a ring of transputers ⋮ An efficient parallel procedure for the simulation of crack growth using the cohesive surface methodology ⋮ A parallel Davidson-type algorithm for several eigenvalues ⋮ ANALYSIS OF DIFFERENT PARTITIONING SCHEMES FOR PARALLEL GRAM-SCHMIDT ALGORITHMS ⋮ A Krylov multisplitting algorithm for solving linear systems of equations

This page was built for publication: Parallel QR factorization by Householder and modified Gram-Schmidt algorithms