Translator Disclaimer
2013 A FAST POISSON SOLVER BY CHEBYSHEV PSEUDOSPECTRAL METHOD USING REFLEXIVE DECOMPOSITION
Teng-Yao Kuo, Hsin-Chu Chen, Tzyy-Leng Horng
Taiwanese J. Math. 17(4): 1167-1181 (2013). DOI: 10.11650/tjm.17.2013.2574

Abstract

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 $\nabla^{2}u = f(x,y)$ in the Cartesian domain $\Omega = [-1,1] \times [-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.

Citation

Download Citation

Teng-Yao Kuo. Hsin-Chu Chen. Tzyy-Leng Horng. "A FAST POISSON SOLVER BY CHEBYSHEV PSEUDOSPECTRAL METHOD USING REFLEXIVE DECOMPOSITION." Taiwanese J. Math. 17 (4) 1167 - 1181, 2013. https://doi.org/10.11650/tjm.17.2013.2574

Information

Published: 2013
First available in Project Euclid: 10 July 2017

zbMATH: 06219268
MathSciNet: MR3085504
Digital Object Identifier: 10.11650/tjm.17.2013.2574

Subjects:
Primary: 35J05, 65F05, 65N35

Rights: Copyright © 2013 The Mathematical Society of the Republic of China

JOURNAL ARTICLE
15 PAGES


SHARE
Vol.17 • No. 4 • 2013
Back to Top