Optimal algorithms for parallel Givens factorization on a coarse-grained PRAM

DOI10.1145/174652.174660MaRDI QIDQ4299013zbMATH OpenOpenAlexFDO

Authors Michel Cosnard, El Mostafa Daoudi

Publication date 29 June 1994

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/174652.174660

zbMATH Keywords

asymptotically optimal algorithmoptimal time complexityparallel Givens factorization

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Orthogonalization in numerical linear algebra (65F25) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• scientific article; zbMATH DE number 4155892
• scientific article; zbMATH DE number 3999132
• Systolic givens factorization of dense rectangular matrices
• Distributed Orthogonal Factorization: Givens and Householder Algorithms
• Parallel QR decomposition of a rectangular matrix

Cited in

(3)

• scientific article; zbMATH DE number 4155892 (Why is no real title available?)
• Systolic givens factorization of dense rectangular matrices
• A fault tolerant systolic mesh for linear system solution

This page was built for publication: Optimal algorithms for parallel Givens factorization on a coarse-grained PRAM

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