Implementation of some concurrent algorithms for matrix factorization

DOI10.1016/0167-8191(86)90004-9MaRDI QIDQ1075017zbMATH OpenOpenAlexFDO

Authors Jack Dongarra, Ahmed H. Sameh, Danny C. Sorensen

Publication date 1986

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(86)90004-9

zbMATH Keywords

performance analysisparallel processesNumerical experimentsQR-factorizationDenelcor HEP computerHouseholder methodpipelined Givens method

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• QR factorization of a dense matrix on a shared-memory multiprocessor
• A pipelined Givens method for computing the QR factorization of a sparse matrix
• Parallel algorithms for QR decomposition on a shared memory multiprocessor
• Parallel QR factorization by Householder and modified Gram-Schmidt algorithms
• scientific article; zbMATH DE number 2090652

Cited in

(11)

• A parallel QR algorithm for the nonsymmetric eigenvalue problem
• Linear algebra on high performance computers
• Sparse QR factorization on a massively parallel computer
• Adaptive blocking in the QR factorization
• Efficient householder QR factorization for superscalar processors
• QR factorization of a dense matrix on a shared-memory multiprocessor
• Parallel solvers for discrete‐time algebric Riccati equations
• scientific article; zbMATH DE number 3930228 (Why is no real title available?)
• Assignment and scheduling in parallel matrix factorization
• Algorithms and experiments for structural mechanics on high-performance architectures
• A pipelined Givens method for computing the QR factorization of a sparse matrix

This page was built for publication: Implementation of some concurrent algorithms for matrix factorization

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