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

Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids

โœ Scribed by Mario A Lopez; Shlomo Reisner

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
316 KB
Volume
33
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

โœฆ Synopsis

We present efficient and simple algorithms for the approximation of a d-dimensional ellipsoid by polytopes of a prescribed size which are either contained in or contain the ellipsoid. The polytopes provided by our algorithms have a high degree of regularity, which enables us to construct their j-skeletons, j s 0, . . . , d y 1, efficiently. The rate of approximation, as measured by the symmetric distance and up to a constant, is best possible by any algorithm.

๐Ÿ“œ SIMILAR VOLUMES

Computationally efficient algorithms for
Computationally efficient algorithms for state estimation with ellipsoidal approximations
โœ D. G. Maksarov; J. P. Norton ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 205 KB

## 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 degenerat

High resolution algorithms for multidime
High resolution algorithms for multidimensional population balance equations
โœ Rudiyanto Gunawan; Irene Fusman; Richard D. Braatz ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› American Institute of Chemical Engineers ๐ŸŒ English โš– 223 KB

## Abstract Population balance equations have been used to model a wide range of processes including polymerization, crystallization, cloud formation, and cell dynamics. Rather than developing new algorithms specific to population balance equations, it is proposed to adapt the highโ€resolution finit