𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computationally efficient algorithms for state estimation with ellipsoidal approximations

✍ Scribed by D. G. Maksarov; J. P. Norton

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
205 KB
Volume
16
Category
Article
ISSN
0890-6327

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Computationally efficient algorithms for computing minimal‐volume ellipsoidal bounds on the state of a linear, discrete‐time dynamical system are presented. Ellipsoidally bounded noise is considered, rather than the scalar‐noise case usually treated; the latter is covered as a degenerate special case of the former. The algorithms have differing accuracy and computational requirements, resulting from differing specifications of the bounds. The paper compares these alternative approaches to computing ellipsoidal bounds on state, giving simulation results to illustrate the performance of the algorithms. Copyright Β© 2002 John Wiley & Sons, Ltd.

πŸ“œ SIMILAR VOLUMES

Efficient Approximation Algorithms for T
Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles
✍ Piotr Berman; Bhaskar DasGupta; S Muthukrishnan; Suneeta Ramaswami πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 202 KB

We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE, and d-RPACK) studied in the literature. Most of our algorithms are highly efficient since their running times are near-linear in the sparse input size rather than in the domain size. In add

A computationally efficient algorithm fo
A computationally efficient algorithm for the solution of eigenproblems for large structures with non-proportional damping using Lanczos method
✍ Kim, Man-Cheol; Lee, In-Won πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 168 KB πŸ‘ 2 views

In this paper, a solution method is presented to solve the eigenproblem arising in the dynamic analysis of non-proportional damping systems with symmetric matrices. The method is based on the Lanczos method to generate one pair of Krylov subspaces consisting of trial vectors, which is then used to r

Efficient Algorithm for Finding Ground-S
Efficient Algorithm for Finding Ground-States in the Random Field Ising Model with an External Field
✍ Carlos Frontera; JΓΌrgen Goicoechea; Jordi Ortı́n; Eduard Vives πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 68 KB

We present an efficient algorithm that, combined with a max-flow, min-cut minimization algorithm, makes it possible to find the ground states of the Gaussian Random Field Ising model when the external applied field B is continuously varied from -∞ to +∞. The algorithm exactly finds all the possible