Convergence to equilibrium for discretized gradient-like systems with analytic features (Q2856622)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6220955
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence to equilibrium for discretized gradient-like systems with analytic features |
scientific article; zbMATH DE number 6220955 |
Statements
Convergence to equilibrium for discretized gradient-like systems with analytic features (English)
0 references
30 October 2013
0 references
gradient-like systems
0 references
Lyapunov stability
0 references
Allen-Cahn equation
0 references
sine-Gordon equation
0 references
descent algorithm
0 references
convergence
0 references
Łojasiewicz gradient inequality
0 references
damped wave equations
0 references
General conditions that guarantee that the sequence generated by a descent algorithm converges to an equilibrium point are presented. The convergence result is based on the Łojasiewicz gradient inequality. Optimal convergence rates are extracted and a stability result is given. Various standard time discretizations of gradient-like flows are used for the application of the delivered results and schemes with variable time step are considered and optimal conditions on the maximal step size are derived. Applications to time and space discretizations of Allen-Cahn, sine-Gordon and damped wave equations are demonstrated.
0 references
0.8312983512878418
0 references
0.8080476522445679
0 references
0.7964298129081726
0 references
0.7851201295852661
0 references
0.7798876166343689
0 references
