- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- The Inverse Function Theorems of Lawrence Graves
Open Collections
BIRS Workshop Lecture Videos
BIRS Workshop Lecture Videos
The Inverse Function Theorems of Lawrence Graves Dontchev, Asen
Description
The classical inverse/implicit function theorems revolves around solving an equation in terms of a parameter and tell us when the solution mapping associated with this equation is a (differentiable) function. Already in 1927 Hildebrandt and Graves observed that one can put aside differentiability obtaining that the solution mapping is just Lipschitz continuous. The idea has evolved in subsequent extensions most known of which are various reincarnations of the Lyusternik-Graves theorem. In the last several decades it has been widely accepted that in order to derive estimates for the solution mapping and put them in use for proving convergence of algorithms, it is sufficient to differentiate what you can and leave the rest as is, hoping that the resulting problem is easier to handle. More sophisticated results have been obtained by employing various forms of metric regularity of mappings acting in metric spaces, aiming at applications to numerical analysis.
Item Metadata
Title |
The Inverse Function Theorems of Lawrence Graves
|
Creator | |
Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
Date Issued |
2017-09-18T15:00
|
Description |
The classical inverse/implicit function theorems revolves around solving an
equation in terms of a parameter and tell us
when the solution mapping associated with this equation
is a (differentiable) function.
Already in 1927 Hildebrandt and Graves observed that one can put aside differentiability
obtaining that the solution mapping is just Lipschitz continuous.
The idea has evolved in subsequent
extensions most known of which are various reincarnations of the
Lyusternik-Graves theorem. In the last several decades
it has been widely accepted that in order to derive estimates for the solution mapping
and put them in use for proving convergence of algorithms,
it is sufficient to differentiate what you can and leave the rest as is, hoping that the resulting problem
is easier to handle. More sophisticated results have
been obtained by employing various forms of metric regularity
of mappings acting in metric spaces, aiming at
applications to numerical analysis.
|
Extent |
35 minutes
|
Subject | |
Type | |
File Format |
video/mp4
|
Language |
eng
|
Notes |
Author affiliation: AMS and the University of Michigan
|
Series | |
Date Available |
2018-03-27
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0364484
|
URI | |
Affiliation | |
Peer Review Status |
Unreviewed
|
Scholarly Level |
Other
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International