Parallel Complexity of Numerically Accurate Linear System Solvers
DOI10.1137/S0097539797327118zbMath0945.65022OpenAlexW2047030348MaRDI QIDQ4268855
Giovanni Manzini, Luciano Margara, Mauro Leoncini
Publication date: 28 October 1999
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539797327118
Gaussian eliminationnumerical stabilityparallel complexityQR decompositionmatrix factorizationpivotingP-complete problemsNC algorithmsGivens methodsinherently sequential algorithms
Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (1)
This page was built for publication: Parallel Complexity of Numerically Accurate Linear System Solvers