Optimal tridiagonal solvers on mesh interconnection networks

DOI10.1007/3-540-49164-3_3MaRDI QIDQ4249156zbMATH OpenFDO

Authors Eunice E. Santos

Publication date 16 June 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-49164-3_3

zbMATH Keywords

algorithmslower boundsmesh interconnection networkodd-even cyclic reductiontridiagonal linear systems

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Numerical algorithms for specific classes of architectures (65Y10)

Recommendations

• Optimal and efficient parallel tridiagonal solvers using direct methods
• Optimal parallel algorithms for solving tridiagonal linear systems
• On designing optimal parallel triangular solvers.
• Parallel Factorizations for Tridiagonal Matrices

Cited in

(3)

• Optimal and efficient parallel tridiagonal solvers using direct methods
• Optimizing Tridiagonal Solvers for Alternating Direction Methods on Boolean Cube Multiprocessors
• Optimal parallel algorithms for solving tridiagonal linear systems

This page was built for publication: Optimal tridiagonal solvers on mesh interconnection networks

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