Inexact catching-up algorithm for Moreau's sweeping processes (Q6917704)
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 8104592
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inexact catching-up algorithm for Moreau's sweeping processes |
scientific article; zbMATH DE number 8104592 |
Statements
Inexact catching-up algorithm for Moreau's sweeping processes (English)
0 references
13 October 2025
0 references
In this work, an inexact version of the catching-up algorithm for sweeping processes is given. More precisely, the authors introduce a notion of approximate projection, which is compatible with any numerical method for approximating exact projections and provide several properties of the new approximate projections. Based on these properties the convergence of the inexact catching-up algorithm (in three general frameworks: prox-regular moving sets, subsmooth moving sets, and merely closed sets) is proved. Then, as application, the authors use the numerical method for treating complementarity dynamical systems.
0 references
sweeping process
0 references
differential inclusions
0 references
approximate projection
0 references
electrical circuits
0 references
complementarity dynamical systems
0 references
0 references
0 references
0 references
0 references
0 references
0 references
