Convergence order of a numerical scheme for sweeping process (Q2862459)
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 6227457
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence order of a numerical scheme for sweeping process |
scientific article; zbMATH DE number 6227457 |
Statements
15 November 2013
0 references
differential inclusions
0 references
subdifferential calculus
0 references
prediction-correction algorithm
0 references
convergence
0 references
inequality constraints
0 references
Convergence order of a numerical scheme for sweeping process (English)
0 references
\textit{J. Venel} [Numer. Math. 118, No. 2, 367--400 (2011; Zbl 1222.65064)] has introduced an implementable algorithm to compute discrete solutions of sweeping processes. The authors prove that the convergence of this algorithm is of order \(\frac{1}{2}\). The considered sweeping process involves a set-valued map given by a finite number of inequality constraints.
0 references
0.7732499241828918
0 references
0.7679750919342041
0 references
0.7475978136062622
0 references
0.7452532649040222
0 references
0.7419435977935791
0 references
