zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Successive Galerkin approximation algorithms for nonlinear optimal and robust control. (English) Zbl 0945.49021
Summary: Nonlinear optimal control and nonlinear control are two of the most significant paradigms in nonlinear systems theory. Unfortunately, these problems require the solution of Hamilton-Jacobi equations, which are extremely difficult to solve in practice. To make matters worse, approximation techniques for these equations are inherently prone to the so-called ‘curse of dimensionality’. While there have been many attempts to approximate these equations, solutions resulting in closed-loop control with well-defined stability and robustness have remained elusive. This paper describes a recent breakthrough in approximating the Hamilton-Jacobi-Bellman and Hamilton-Jacobi-Isaacs equations. Successive approximation and Galerkin approximation methods are combined to derive a novel algorithm that produces stabilizing, closed-loop control laws with well-defined stability regions. In addition, we show how the structure of the algorithm can be exploited to reduce the amount of computation from exponential to polynomial growth in the dimension of the state space. The algorithms are illustrated with several examples.
MSC:
49L20Dynamic programming method (infinite-dimensional problems)
93B36H -control
49M15Newton-type methods in calculus of variations
65M60Finite elements, Rayleigh-Ritz and Galerkin methods, finite methods (IVP of PDE)
93B40Computational methods in systems theory