On the parallel complexity of Gaussian elimination with pivoting

DOI10.1006/JCSS.1996.0077MaRDI QIDQ676441zbMATH OpenOpenAlexFDO

Authors Mauro Leoncini

Publication date 15 September 1997

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/532cef1301f753fb2f174d302c6bddd5e6d3d855

zbMATH Keywords

Gaussian elimination algorithmpartial pivoting strategy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Gaussian Elimination with Pivoting is P-Complete
• Parallel Complexity of Numerically Accurate Linear System Solvers
• Stability of a pivoting strategy for parallel Gaussian elimination
• Parallel sparse Gaussian elimination with partial pivoting
• Parallel complexity of Householder QR factorization

Cited in

(12)

• scientific article; zbMATH DE number 3999131 (Why is no real title available?)
• Stability of a pivoting strategy for parallel Gaussian elimination
• Communication complexity of the Gaussian elimination algorithm on multiprocessors
• A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices
• Parallel complexity of Householder QR factorization
• scientific article; zbMATH DE number 3907653 (Why is no real title available?)
• Gaussian Elimination with Pivoting is P-Complete
• scientific article; zbMATH DE number 5872172 (Why is no real title available?)
• Cost-optimal Gaussian Elimination Algorithm on RCC-FULL
• Impact of communications of the complexity of the parallel Gaussian elimination
• scientific article; zbMATH DE number 2069330 (Why is no real title available?)
• The growth factor and efficiency of Gaussian elimination with rook pivoting

This page was built for publication: On the parallel complexity of Gaussian elimination with pivoting

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