A Fast Poisson Solver by Chebyshev Pseudospectral Method Using Reflexive Decomposition
نویسندگان
چکیده
Poisson equation is frequently encountered in mathematical modeling for scientific and engineering applications. Fast Poisson numerical solvers for 2D and 3D problems are, thus, highly requested. In this paper, we consider solving the Poisson equation ∇2u = f(x, y) in the Cartesian domain Ω = [−1, 1] × [−1, 1], subject to all types of boundary conditions, discretized with the Chebyshev pseudospectral method. The main purpose of this paper is to propose a reflexive decomposition scheme for orthogonally decoupling the linear system obtained from the discretization into independent subsystems via the exploration of a special reflexive property inherent in the second-order Chebyshev collocation derivative matrix. The decomposition will introduce coarse-grain parallelism suitable for parallel computations. This approach can be applied to more general linear elliptic problems discretized with the Chebyshev pseudospectral method, so long as the discretized problems possess reflexive property. Numerical examples with error analysis are presented to demonstrate the validity and advantage of the proposed approach.
منابع مشابه
An error minimized pseudospectral penalty direct Poisson solver
This paper presents a direct Poisson solver based on an error minimized Chebyshev pseudospectral penalty formulation for problems defined on rectangular domains. In this study the penalty parameters are determined analytically such that the discrete L2 error is minimized. Numerical experiments are conducted and the results show that the penalty scheme computes numerical solutions with better ac...
متن کاملRoundoo Error Analysis of the Fast Cosine Transform and of Its Application to the Chebyshev Pseudospectral Method
The roundoo error analysis of several algorithms commonly used to compute the Fast Cosine Transform and the derivatives using the Chebyshev pseudospectral method are studied. We derive precise expressions for the algorithmic error, and using them we give new theoretical upper bounds and produce a statistical analysis. The results are compared with numerical experiments.
متن کاملA parallel Poisson solver using the fast multipole method on networks of workstations
We present a parallel Poisson solver on distributed computing environments. In the solver, the parallel implementation of the Fast Multipole Method (FMM) is designed to minimize amount of data communication and the number of data transfers and synchronizations. The experimental results show linear speedup, good load balancing, and reasonable performance under failure and demonstrate the viabili...
متن کاملA Direct Adaptive Poisson Solver of Arbitrary Order Accuracy
We present a direct, adaptive solver for the Poisson equation which can achieve any prescribed order of accuracy. It is based on a domain decomposition approach using local spectral approximation, as well as potential theory and the fast multipole method. In two space dimensions, the algorithm requires O(NK) work where N is the number of discretization points and K is the desired order of accur...
متن کاملSolving Differential Equations by Using a Combination of the First Kind Chebyshev Polynomials and Adomian Decomposition Method
In this paper, we are going to solve a class of ordinary differential equations that its source term are rational functions. We obtain the best approximation of source term by Chebyshev polynomials of the first kind, then we solve the ordinary differential equations by using the Adomian decomposition method
متن کامل