2010
DOI: 10.1007/s11228-010-0162-8
|View full text |Cite
|
Sign up to set email alerts
|

An Implicit Function Theorem for One-sided Lipschitz Mappings

Abstract: Implicit function theorems are derived for nonlinear set valued equations that satisfy a relaxed one-sided Lipschitz condition. We discuss a local and a global version and study in detail the continuity properties of the implicit set-valued function. Applications are provided to the Crank-Nicolson scheme for differential inclusions and to the analysis of differential algebraic inclusions.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 14 publications
(23 reference statements)
0
4
0
Order By: Relevance
“…The construction of the spatial discretization of the implicit Euler scheme, however, requires explicit knowledge of the one-sided Lipschitz constant and the modulus of continuity of the right-hand side and is very sensitive to illestimated constants. This is the main motivation for the development of the semi-implicit Euler schemes (4) and (20a, 20b) analyzed in the present paper. In addition, their performance is considerably better than that of the implicit Euler scheme, because instead of implicit inclusions only implicit equations have to be solved for computing their images.…”
Section: Introductionmentioning
confidence: 96%
See 1 more Smart Citation
“…The construction of the spatial discretization of the implicit Euler scheme, however, requires explicit knowledge of the one-sided Lipschitz constant and the modulus of continuity of the right-hand side and is very sensitive to illestimated constants. This is the main motivation for the development of the semi-implicit Euler schemes (4) and (20a, 20b) analyzed in the present paper. In addition, their performance is considerably better than that of the implicit Euler scheme, because instead of implicit inclusions only implicit equations have to be solved for computing their images.…”
Section: Introductionmentioning
confidence: 96%
“…A set-valued implicit Euler scheme has been analyzed in [6]. It has very good analytical properties, and it is based on an implicit function theorem that is given in [4]. If applied to stiff differential inclusions, it is considerably more efficient than the explicit Euler scheme, because it senses the correct asymptotic behavior, while the reachable sets of the explicit Euler scheme do not only oscillate, but grow exponentially in diameter if the temporal step-size is not small enough.…”
Section: Introductionmentioning
confidence: 99%
“…So the assumption in [5, Corollary 2 (ii)] that dist (ȳ, F (x)) is small enough holds trivially. Also note that "a slightly generalized definition of metric regularity" in [5] is nothing else but the usual definition of this property because F : R n ⇒ R n in [13] means neither that dom F = R n nor that x is an interior point of dom F .…”
Section: Primal and Dual Infinitesimal Conditionsmentioning
confidence: 99%
“…The infimum of κ > 0 for which there exists a neighborhood U ofx in X such that (5) holds is called the subregularity modulus of F at (x,ȳ) and is denoted by subreg F (x,ȳ);…”
Section: Introductionmentioning
confidence: 99%