An adaptive multi-grid algorithm for the numerical solution of quasilinear potential equations (Q1062436): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Solution of Large Sparse Nonlinear Systems by Monotone Convergent Iterations and Applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multi-Level Adaptive Solutions to Boundary-Value Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Numerical Solution of the Minimal Surface Equation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4130879 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3909923 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Zur Diskretisierung nichtlinearer elliptischer Differentialgleichungen. (On the discretization of nonlinear elliptic differential equations) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4404374 / rank | |||
Normal rank |
Latest revision as of 18:38, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An adaptive multi-grid algorithm for the numerical solution of quasilinear potential equations |
scientific article |
Statements
An adaptive multi-grid algorithm for the numerical solution of quasilinear potential equations (English)
0 references
1985
0 references
This paper describes an iterative method for the numerical solution of a class of quasilinear potential equations using an adaptive multi-grid algorithm (MG-algorithm). The method of solution has been illustrated using one iteration step of MG-cycle. The prolongation and restriction operators, which need coarse-to-fine as well as fine-to-coarse grid transfer, have been chosen of very simple linear structure. A simple error estimation has been carried out to show that the correction equation suggested by \textit{A. Brandt} [Math. Comput. 31, 333-390 (1977; Zbl 0373.65054)] has to be modified to get an efficient MG-algorithm. Another simple approach has been suggested which is based on a two-level version and uses a linear correction equation only on the coarser grid. We also present computational results of several numerical experiments applied on a specific example of the minimal surface problem. A comparison between our methods and other methods applied on the example of the minimal surface problem has been presented.
0 references
quasilinear potential equations
0 references
adaptive multi-grid algorithm
0 references
error estimation
0 references
numerical experiments
0 references
minimal surface problem
0 references
comparison
0 references
0 references