On parallel computations with banded matrices
From MaRDI portal
Theoretical paper on the algorithmic complexity of the direct solution of banded linear systems on parallel computers. The time complexity is improved compared to previous results. It should be mentioned that for engineering problems with large and sparse matrices iterative solvers are much more efficient.
Recommendations
- scientific article; zbMATH DE number 1003298
- Parallel Algorithms for Banded Linear Systems
- Publication:4886042
- Fast parallel band matrix arithmetic
- scientific article; zbMATH DE number 641557
- scientific article; zbMATH DE number 1444294
- On some parallel banded system solvers
- Solving banded systems on a parallel processor
- A parallel algorithm for band linear systems
Cited in
(10)- Computations with symmetric, positive definite and band matrices on a parallel vector processor
- On multisplitting methods for band matrices
- Fast parallel solvers for elliptic problems
- Parallel computation of a Krylov matrix for a sparse and structured input
- Efficient parallel factorization and solution of structured and unstructured linear systems
- scientific article; zbMATH DE number 218262 (Why is no real title available?)
- scientific article; zbMATH DE number 2111193 (Why is no real title available?)
- scientific article; zbMATH DE number 833711 (Why is no real title available?)
- scientific article; zbMATH DE number 7525476 (Why is no real title available?)
- Banded target matrices and recursive FSAI for parallel preconditioning
This page was built for publication: On parallel computations with banded matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1898464)