SOME FAST ELLIPTIC SOLVERS ON PARALLEL ARCHITECTURES AND THEIR COMPLEXITIES

DOI10.1142/S012905338900007XzbMath0726.65027OpenAlexW2148028096MaRDI QIDQ3350655

Yousef Saad, Efstratios Gallopoulos

Publication date: 1989

Published in: International Journal of High Speed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905338900007x

zbMATH Keywords

parallel processingpartial fractionsalternating-direction methodblock tridiagonal matriceshypercube computersparallel computational complexitydistributed memory architecturesblock cyclic reduction algorithmfast parallel solver

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Parallel numerical computation (65Y05) Finite difference methods for boundary value problems involving PDEs (65N06) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (5)

Solving separable elliptic equations by the block stride reduction algorithm ⋮ Incomplete partial fractions for parallel evaluation of rational matrix functions ⋮ On the performance of a direct parallel method for solving separable elliptic equations based on block cyclic eduction ⋮ Vector and parallel methods for the direct solution of Poisson's equation ⋮ AN EXPERIMENT IN HURRICANE TRACK PREDICTION USING PARALLEL COMPUTING METHODS

This page was built for publication: SOME FAST ELLIPTIC SOLVERS ON PARALLEL ARCHITECTURES AND THEIR COMPLEXITIES