On the performance of a direct parallel method for solving separable elliptic equations based on block cyclic eduction
DOI10.1080/00207169308804221zbMath0798.65097OpenAlexW2087754791MaRDI QIDQ4291053
Kevin Kelleher, S. Lakshmivarahan, Sudarshan K. Dhall
Publication date: 5 May 1994
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169308804221
finite difference methodnumerical experimentsparallel computationpolynomial factorizationelliptic equationspartial fraction expansionshared memory parallel computerblock cyclic reduction algorithm
Boundary value problems for second-order elliptic equations (35J25) Parallel numerical computation (65Y05) Finite difference methods for boundary value problems involving PDEs (65N06) Direct numerical methods for linear systems and matrix inversion (65F05)
Cites Work
- Unnamed Item
- Comparison of performance of three parallel versions of the block cyclic reduction algorithm for solving linear elliptic partial differential equations
- 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
- On Direct Methods for Solving Poisson’s Equations
This page was built for publication: On the performance of a direct parallel method for solving separable elliptic equations based on block cyclic eduction
