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

DOI10.1145/174652.174660zbMath0802.65024OpenAlexW2086030296MaRDI QIDQ4299013

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

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

Related Items (1)

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