A cascadic multigrid algorithm for semilinear elliptic problems (Q1590741): Difference between revisions
From MaRDI portal
Removed claims |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s002110000198 / rank | |||
| Property / author | |||
| Property / author: Gisela Timmermann / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: J. D. P. Donnelly / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S002110000198 / rank | |||
Normal rank | |||
Latest revision as of 22:15, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A cascadic multigrid algorithm for semilinear elliptic problems |
scientific article |
Statements
A cascadic multigrid algorithm for semilinear elliptic problems (English)
0 references
4 October 2001
0 references
A multigrid algorithm for a semilinear elliptic problem is proposed in which the nonlinear equations arising from a finite element discretization are solved using a single Newton iteration on each grid. Starting from an accurate approximation and a small initial grid the method is shown to have an error of the same order as the discretization error.
0 references
cascadic multigrid algorithm
0 references
error bound
0 references
finite element method
0 references
Newton method
0 references
semilinear elliptic problem
0 references
