Fast Poisson solvers for MIMD computers
From MaRDI portal
A Fourier analysis cyclic reduction algorithm is proposed for the two- dimensional Poisson equation. The complexity of this algorithm versus the number of steps of reduction is analyzed and various performance laws are plotted. The paper concludes with some experimental results.
Recommendations
Cited in
(17)- The cyclic reduction algorithm: From Poisson equation to stochastic processes and beyond. In memoriam of Gene H. Golub
- Parallel marching Poisson solvers
- Vector and parallel methods for the direct solution of Poisson's equation
- The application of VLSI Poisson solvers to the biharmonic problem
- Fast finite difference Poisson solvers on heterogeneous architectures
- scientific article; zbMATH DE number 3845037 (Why is no real title available?)
- OPTIMIZATION OF CONNECTION MACHINE PERFORMANCE
- Approximate Cyclic Reduction for Solving Poisson’s Equation
- scientific article; zbMATH DE number 4074407 (Why is no real title available?)
- scientific article; zbMATH DE number 4106201 (Why is no real title available?)
- scientific article; zbMATH DE number 1330406 (Why is no real title available?)
- scientific article; zbMATH DE number 3994972 (Why is no real title available?)
- scientific article; zbMATH DE number 766240 (Why is no real title available?)
- scientific article; zbMATH DE number 4182748 (Why is no real title available?)
- FLUPS: a Fourier-based library of unbounded Poisson solvers
- A fast parallel algorithm for the Poisson equation on a disk
- A simple spectral algorithm for solving large-scale Poisson equation in 2D
This page was built for publication: Fast Poisson solvers for MIMD computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1098255)