Parallel algorithms for the solution of narrow banded systems
From MaRDI portal
For an \(n\times n\) matrix with semibandwidth m, by using a linear array of \(p<n/(2m-2)\) processors, two parallel algorithms are presented. They are stable and the order of parallelism is \(O(n^{1/2}/m^{1/2})\).
Recommendations
Cites work
Cited in
(9)- A tearing-based hybrid parallel banded linear system solver
- On some parallel banded system solvers
- On design of wavefront-driven algorithms for processing large-scale band- limited matrices on rotary arrays
- A note on the parallel Cholesky factorization of wide banded matrices
- scientific article; zbMATH DE number 3913540 (Why is no real title available?)
- Solving narrow banded systems on ensemble architectures
- A practical parallel algorithm for solving band symmetric positive definite systems of linear equations
- scientific article; zbMATH DE number 1330400 (Why is no real title available?)
- scientific article; zbMATH DE number 910868 (Why is no real title available?)
This page was built for publication: Parallel algorithms for the solution of narrow banded systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1824980)