zbMATH — the first resource for mathematics

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.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
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)
Optimal recursive iterative algorithm for discrete nonlinear least-squares estimation. (English) Zbl 0855.93100
The authors propose a new two-step algorithm for discrete nonlinear systems which avoids linearizing the quadratic cost function by splitting the minimization into two parts. The linear first-step problem is solved by use of the Kalman filter while the nonlinear second-step problem is solved via an iterative Gauss-Newton algorithm. In the static state situation, optimality is proved when the time variation of the system can be separated from the unknowns. Under suitable assumptions, optimality is also established in the dynamic state situation. An analytical comparison is made in which the extended and iterated extended Kalman filters are shown to be both biased and suboptimal. Finally, two illustrative examples are provided.
Reviewer: B.Bercu (Orsay)
93E24Least squares and related methods in stochastic control
93C10Nonlinear control systems
93C55Discrete-time control systems