๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Strongly optimal algorithms and optimal information in estimation problems

โœ Scribed by M Milanese; R Tempo; A Vicino

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
844 KB
Volume
2
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Square-root algorithms for parallel proc
Square-root algorithms for parallel processing in optimal estimation
โœ M. Morf; J.R. Dobbins; B. Friedlander; T. Kailath ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 707 KB

Explicit square-root algorithms allow measurements for the standard state estimation problem to be processed in parallel with little communication between processors. A particular consequence is the development of compact square-root doubling formulae.

Conditionally optimal algorithms and est
Conditionally optimal algorithms and estimation of reduced order models
โœ B.Z Kacewicz; M Milanese; A Vicino ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 610 KB

The paper presents some extensions of the optimality results obtained in previous work on algorithms used in the field of system identification in the light of information-based complexity. In particular, a class of conditional algorithms is defined by means of a restriction on the space of solution