This paper presents an overview of least-squares steepest descent using Sobolev gradients for several prototype dierential equations. In the linear case, the method is viewed as a very eective preconditioning strategy for the basic iterative method which arises from steepest descent, in particular,
Sobolev gradient preconditioning for the electrostatic potential equation
✍ Scribed by J. Karátson; L. Lóczi
- Book ID
- 104007699
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 611 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
✦ Synopsis
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. ~) 2005 Elsevier Ltd. All rights reserved.
📜 SIMILAR VOLUMES