Gaussian Elimination with Pivoting is P-Complete

DOI10.1137/0402037MaRDI QIDQ4729237zbMATH OpenOpenAlexFDO

Authors Stephen A. Vavasis

Publication date 1989

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0402037

zbMATH Keywords

Gaussian eliminationlog-space completeparallel algorithmsparallel computerpivoting

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05)

Recommendations

• On the parallel complexity of Gaussian elimination with pivoting
• Parallel Complexity of Numerically Accurate Linear System Solvers
• Gaussian elimination with pivoting on hypercubes
• Parallel complexity of Householder QR factorization
• Stability of a pivoting strategy for parallel Gaussian elimination

Cited in

(3)

• Parallel Complexity of Numerically Accurate Linear System Solvers
• On the parallel complexity of Gaussian elimination with pivoting
• Entry growth in Gaussian elimination

This page was built for publication: Gaussian Elimination with Pivoting is P-Complete

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