A parallel numerical algorithm for near symmetric and banded systems
From MaRDI portal
Publication:1854945
DOI10.1016/S0096-3003(99)00226-XzbMath1024.65026WikidataQ126670731 ScholiaQ126670731MaRDI QIDQ1854945
Publication date: 28 January 2003
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Cites Work
- Unnamed Item
- A new method for solving symmetric circulant tridiagonal systems of linear equations
- A parallel algorithm for solving Toeplitz linear systems
- A fast algorithm for solving special tridiagonal systems
- On the stability of the cyclic reduction without back substitution for tridiagonal systems
- On the Solution of Circulant Linear Systems
- A new fourth order method for computing eigenvalues of two-point boundary value problems
- A fast method for solving second Order boundary value volterra Integro-differential equations
- A split-correct parallel algorithm for solving tridiagonal symmetric toeplitz systems
- On a Finite Difference Analogue of an Elliptic Boundary Problem which is Neither Diagonally Dominant Nor of Non‐negative Type
- Solving banded and near symmetric systems
This page was built for publication: A parallel numerical algorithm for near symmetric and banded systems