scientific article; zbMATH DE number 1254015

MaRDI QIDQ4226997zbMATH OpenFDO

Authors Mark Giesbrecht

Publication date 29 September 1999

zbMATH Keywords

parallel algorithmsparse systems of linear diophantine equations

Mathematics Subject Classification ID

Linear Diophantine equations (11D04) Computer solution of Diophantine equations (11Y50) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

Recommendations

• Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
• scientific article; zbMATH DE number 176134
• scientific article; zbMATH DE number 1684382

Cited in

(8)

• Efficient matrix preconditioners for black box linear algebra
• Certified dense linear system solving
• Certified sparse linear system solving
• Solving very sparse rational systems of equations
• Lower time bounds for solving linear diophantine equations on several parallel computational models
• scientific article; zbMATH DE number 1121981 (Why is no real title available?)
• Sparse Solutions of Linear Diophantine Equations
• On efficient sparse integer matrix Smith normal form computations

This page was built for publication:

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