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

A simplified realization algorithm for singular systems

โœ Scribed by M.A. Christodoulou; B.G. Mertzios

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
566 KB
Volume
326
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

โœฆ Synopsis

ARSTKACT : A procedure ,for realizing a generalized transfer ,function matrix into a minimal state space sinqular system is presented. The procedure is a simpliJication of the methods based on Hankel matrices. Compared to existing methods, the proposed one reduces the computing time and the memory storage required, since it uses Hankel matrices oj'smalk~ order. An e.~ample of the teehn~q~e is given.

๐Ÿ“œ SIMILAR VOLUMES

An algorithm for constructing irreducibl
An algorithm for constructing irreducible realization of time invariant systems
โœ H.D. Albertson; B.F. Womack ๐Ÿ“‚ Article ๐Ÿ“… 1968 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 568 KB

A simple, logical ckpyroaclk to the proatem of constructing irredvciak (minimumstute) realizations of time invariant rystem is presented. Two algorithms are given, me for determining the dimension of the irreducible realization and the other for actual construction of the realization using simple al

A simplified scheme for realizing multi-
A simplified scheme for realizing multi-atom NOON state
โœ Zhi-Rong Zhong ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 135 KB

We present a scheme for realizing a multi-atom NOON state via cavity QED system. The scheme bases on the Jaynes-Cumming mode with collective atomic bosonic mode. In the process, a series of control atoms are sent through two single mode cavities which are initially in vacuum states and have the same

An optimal algorithm for realizing a Del
An optimal algorithm for realizing a Delaunay triangulation
โœ Timothy Lambert ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 456 KB

## Dillencourt ( 1990) gives a constructive proof for the realizability as a Delaunay triangulation of any triangulation of the interior of a simple polygon. A naive implementation of the construction will take 0( n\*) time. I give a simple O(n) algorithm for this problem. An application of this a