Solving separable elliptic equations by the block stride reduction algorithm
From MaRDI portal
Publication:4528035
DOI10.1080/00207160108805033zbMath0967.65039MaRDI QIDQ4528035
Publication date: 3 September 2001
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160108805033
35J25: Boundary value problems for second-order elliptic equations
65Y05: Parallel numerical computation
65N06: Finite difference methods for boundary value problems involving PDEs
65F05: Direct numerical methods for linear systems and matrix inversion
Cites Work
- SOME FAST ELLIPTIC SOLVERS ON PARALLEL ARCHITECTURES AND THEIR COMPLEXITIES
- Approximate Cyclic Reduction for Solving Poisson’s Equation
- A Parallel and Vector Variant of the Cyclic Reduction Algorithm
- Algorithm 541: Efficient Fortran Subprograms for the Solution of Separable Elliptic Partial Differential Equations [D3]
- A direct Method for the Discrete Solution of Separable Elliptic Equations
- Some Aspects of the Cyclic Reduction Algorithm for Block Tridiagonal Linear Systems
- A Cyclic Reduction Algorithm for Solving Block Tridiagonal Systems of Arbitrary Dimension
- Cyclic and stride reduction methods for generalised tridiagonal matrices
- On Direct Methods for Solving Poisson’s Equations