Analysis of a damped nonlinear multilevel method (Q1120957)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Analysis of a damped nonlinear multilevel method |
scientific article |
Statements
Analysis of a damped nonlinear multilevel method (English)
0 references
1989
0 references
Let H be a real Hilbert space and n: \(H\to H'\) be a nonlinear operator which is monotone in the sense of Minty. Moreover n is assumed to be a gradient operator. Given a family of subspaces \(S_ h\), the corresponding operators \(n_ h: S_ h\to S_ h'\) define the discrete analoga of n. Specifically, the discretization of the nonlinear equation \(n(u)=f\) is considered. The uniform ellipticity of the Fréchet derivative \(Dn(u)(v,v)\geq \gamma \| v\|^ 2\) guarantees \(\| u_ 1-u_ 2\| \leq \gamma^{-1}\| f_ 1-f_ 2\|,\) if \(n(u_ i)=f_ i\). Therefore one has a generalization of Céa's lemma and convergence. The authors define a nonlinear multilevel algorithm with a fairly general class of nonlinear relaxations for the smoothing. An essential ingredient is a damping parameter which helps to control the multigrid iteration and global convergence can be proved. Numerical results show that damping may indeed be necessary in some cases to obtain convergence. Moreover they illustrate that the damped Newton nonlinear multigrid method is a very efficient method.
0 references
monotone operator
0 references
numerical examples
0 references
Hilbert space
0 references
gradient operator
0 references
Céa's lemma
0 references
nonlinear multilevel algorithm
0 references
nonlinear relaxations
0 references
smoothing
0 references
damping parameter
0 references
multigrid iteration
0 references
global convergence
0 references
damped Newton nonlinear multigrid method
0 references
0 references