Sobolev gradient preconditioning for the electrostatic potential equation

Authors:
J. Karátson;L. Lóczi
Affiliations:
-;-
Venue:
Computers & Mathematics with Applications
Year:
2005

Citing 6
Cited 5

On finite element domain imbedding methods

SIAM Journal on Numerical Analysis
On the theory of equivalent operators and application to the numerical solution of uniformly elliptic partial differential equations

Advances in Applied Mathematics
Diagonal scalings of the Laplacian as preconditioners for other elliptic differential operators

SIAM Journal on Matrix Analysis and Applications
A Parallel Fast Direct Solver for Block Tridiagonal Systems with Separable Matrices of Arbitrary Dimension

SIAM Journal on Scientific Computing
Sobolev Space Preconditioning of Strongly Nonlinear 4th Order Elliptic Problems

NAA '00 Revised Papers from the Second International Conference on Numerical Analysis and Its Applications
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Recursive form of Sobolev gradient method for ODEs on long intervals

International Journal of Computer Mathematics
Sobolev gradient approach for the time evolution related to energy minimization of Ginzburg-Landau functionals

Journal of Computational Physics
Energy minimization related to the nonlinear Schrödinger equation

Journal of Computational Physics
Approximating time evolution related to Ginzburg-Landau functionals via Sobolev gradient methods in a finite-element setting

Journal of Computational Physics
Numerical approximation of time evolution related to Ginzburg-Landau functionals using weighted Sobolev gradients

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.10

Visualization

Abstract

Sobolev gradient type preconditioning is proposed for the numerical solution of the electrostatic potential equation. A constructive representation of the gradients leads to efficient Laplacian preconditioners in the iteration thanks to the available fast Poisson solvers. Convergence is then verified for the corresponding sequence in Sobolev space, implying mesh independent convergence results for the discretized problems. A particular study is devoted to the case of a ball: due to the radial symmetry of this domain, a direct realization without discretization is feasible. The simplicity of the algorithm and the fast linear convergence are finally illustrated in a numerical test example.