𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast relaxation method for solving the difference problem for the poisson equation on a sequence of grids

✍ Scribed by E.A. Ayrjan; E.P. Zhidkov; B.N. Khoromsky


Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
390 KB
Volume
29
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

✦ Synopsis


A method for accelerating the convergence of iterative processes on a sequence of grids is proposed, which makes use of the decomposition of the difference solution into powers of the discretization step. Approximation solutions from a number of auxiliary grids are extrapolated to the exact solution on the finest grid. In the case of a difference problem for the Poisson equation the error of such extrapolation on the last grid is quickly suppressed by simple iterations due to some smoothness properties of the difference-operator eigenfunctions. The results of numerical experiments are presented which illustrate the high efficiency of the proposed method for solution of the given problem.


πŸ“œ SIMILAR VOLUMES


A fast-adaptive composite grid algorithm
✍ Daniel Ritter; Markus StΓΌrmer; Ulrich RΓΌde πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 254 KB

## Abstract Fast solvers for Poisson's equation with boundary conditions at infinity are an important building block for molecular dynamics. One issue that arises when this equation is solved numerically is the infinite size of the domain. This prevents a direct solution so that other concepts have

Solving the finite difference linearized
✍ M. E. Davis; J. A. McCammon πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 485 KB πŸ‘ 1 views

Comparisons have been made between relaxation methods and certain preconditioned conjugate gradient techniques for solving the system of linear equations arising from the finite-difference form of the linearized Poisson-Boltzmann equation. The incomplete Cholesky conjugate gradient (ICCG) method of