Optimal and efficient parallel tridiagonal solvers using direct methods
From MaRDI portal
Recommendations
Cited in
(11)- On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver
- Optimizing Tridiagonal Solvers for Alternating Direction Methods on Boolean Cube Multiprocessors
- Revisiting parallel cyclic reduction and parallel prefix-based algorithms for block tridiagonal systems of equations
- Optimal Bounds for Solving Tridiagonal Systems with Preconditioning
- scientific article; zbMATH DE number 1302611 (Why is no real title available?)
- scientific article; zbMATH DE number 1760070 (Why is no real title available?)
- scientific article; zbMATH DE number 1877172 (Why is no real title available?)
- A direct incomplete factorization method for parallel solution of tridiagonal linear systems
- Manycore algorithms for batch scalar and block tridiagonal solvers
- Generalized scans and tridiagonal systems
- A cost-optimal parallel tridiagonal system solver
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)