Solving separable elliptic equations by the block stride reduction algorithm
DOI10.1080/00207160108805033zbMATH Open0967.65039OpenAlexW2021028583MaRDI QIDQ4528035FDOQ4528035
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
Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05) Boundary value problems for second-order elliptic equations (35J25) Finite difference methods for boundary value problems involving PDEs (65N06)
Cites Work
- Algorithm 541: Efficient Fortran Subprograms for the Solution of Separable Elliptic Partial Differential Equations [D3]
- A Cyclic Reduction Algorithm for Solving Block Tridiagonal Systems of Arbitrary Dimension
- A direct Method for the Discrete Solution of Separable Elliptic Equations
- On Direct Methods for Solving Poisson’s Equations
- A Parallel and Vector Variant of the Cyclic Reduction Algorithm
- Some Aspects of the Cyclic Reduction Algorithm for Block Tridiagonal Linear Systems
- Approximate Cyclic Reduction for Solving Poisson’s Equation
- SOME FAST ELLIPTIC SOLVERS ON PARALLEL ARCHITECTURES AND THEIR COMPLEXITIES
- Cyclic and stride reduction methods for generalised tridiagonal matrices
This page was built for publication: Solving separable elliptic equations by the block stride reduction algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4528035)
