Parallel Algorithms for Banded Linear Systems
From MaRDI portal
Recommendations
Cited in
(21)- A tearing-based hybrid parallel banded linear system solver
- On some parallel banded system solvers
- A parallel partition method for solving banded systems of linear equations
- Optical processing of banded matrix algorithms using outer product concepts
- Solving banded systems on a parallel processor
- Constrained minimax approximation and optimal preconditioners for Toeplitz matrices
- Interior point methods for optimal control of discrete time systems
- Convergence analysis for a parallel Jacobi algorithm
- A specialised cyclic reduction algorithm for linear algebraic equation systems with quasi-tridiagonal matrices
- Efficiency results for Gaussian elimination on the iPSC/2 hypercube
- Parallel direct methods for solving banded linear systems
- Parallel algorithms for the solution of narrow banded systems
- On parallel computations with banded matrices
- scientific article; zbMATH DE number 1618023 (Why is no real title available?)
- Optimal, quasi-optimal and superlinear band-Toeplitz preconditioners for asymptotically ill-conditioned positive definite Toeplitz systems
- scientific article; zbMATH DE number 1810503 (Why is no real title available?)
- scientific article; zbMATH DE number 29780 (Why is no real title available?)
- The design, implementation, and evaluation of a symmetric banded linear solver for distributed-memory parallel computers
- scientific article; zbMATH DE number 2111193 (Why is no real title available?)
- A parallel elimination method for the solution of banded linear systems
- scientific article; zbMATH DE number 822187 (Why is no real title available?)
This page was built for publication: Parallel Algorithms for Banded Linear Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3361788)