Parallel Complexity of Numerically Accurate Linear System Solvers

DOI10.1137/S0097539797327118MaRDI QIDQ4268855zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

Gaussian eliminationGivens methodsinherently sequential algorithmsmatrix factorizationNC algorithmsnumerical stabilityP-complete problemsparallel complexitypivotingQR decomposition

Mathematics Subject Classification ID

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

Recommendations

• Parallel complexity of Householder QR factorization
• On the parallel complexity of Gaussian elimination with pivoting
• scientific article; zbMATH DE number 4076454
• Gaussian Elimination with Pivoting is P-Complete
• Parallel sparse Gaussian elimination with partial pivoting

Cited in

(7)

• The theoretical cost of sequential and parallel algorithms for solving linear systems of equations
• On Mathematical Aspects of Dual Variables in Continuum Mechanics. Part 1: Mathematical Principles
• Parallel complexity of Householder QR factorization
• Gaussian Elimination with Pivoting is P-Complete
• A quasi-random approach to matrix spectral analysis
• On the parallel complexity of Gaussian elimination with pivoting
• Parallelism and fast solution of linear systems

This page was built for publication: Parallel Complexity of Numerically Accurate Linear System Solvers

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