@Article{JCM-32-5,
author = {},
title = {Poisson Preconditioning for Self-Adjoint Elliptic Problems},
journal = {Journal of Computational Mathematics},
year = {2014},
volume = {32},
number = {5},
pages = {560--578},
abstract = {<p style="text-align: justify;">In this paper, we formulate interface problem and Neumann elliptic boundary value problem into a form of linear operator equations with self-adjoint positive definite operators. We prove that in the discrete level the condition number of these operators is independent of the mesh size. Therefore, given a prescribed error tolerance, the classical conjugate gradient algorithm converges within a fixed number of iterations. The main computation task at each iteration is to solve a Dirichlet Poisson boundary value problem in a rectangular domain, which can be furnished with fast Poisson solver. The overall computational complexity is essentially of linear scaling.</p>},
issn = {1991-7139},
doi = {https://doi.org/10.4208/jcm.1405-m4293},
url = {https://global-sci.com/article/84656/poisson-preconditioning-for-self-adjoint-elliptic-problems}
}