Optimal and efficient parallel tridiagonal solvers using direct methods

DOI10.1023/B:SUPE.0000040615.60545.C6MaRDI QIDQ2386702zbMATH OpenOpenAlexFDO

Authors Eunice E. Santos

Publication date 25 August 2005

Published in The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:supe.0000040615.60545.c6

zbMATH Keywords

direct methodsparallel algorithmstridiagonal linear systemsprefix summing\(\log P\) modelodd-even cyclic reduction

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1760070
• Parallel Factorizations for Tridiagonal Matrices
• A parallel algorithm for solving tridiagonal linear systems
• scientific article; zbMATH DE number 1302611
• Optimized cyclic reduction for the solution of linear tridiagonal systems on parallel computers

Cited in

(9)

• Manycore algorithms for batch scalar and block tridiagonal solvers
• Optimal Bounds for Solving Tridiagonal Systems with Preconditioning
• Generalized scans and tridiagonal systems
• scientific article; zbMATH DE number 1760070 (Why is no real title available?)
• A cost-optimal parallel tridiagonal system solver
• A direct incomplete factorization method for parallel solution of tridiagonal linear systems
• scientific article; zbMATH DE number 1877172 (Why is no real title available?)
• On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver
• Revisiting parallel cyclic reduction and parallel prefix-based algorithms for block tridiagonal systems of equations

This page was built for publication: Optimal and efficient parallel tridiagonal solvers using direct methods

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