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

An ILUCG algorithm which minimizes in the euclidean norm

โœ Scribed by M Petravic; G Kuo-Petravic

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
274 KB
Volume
32
Category
Article
ISSN
0021-9991

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An algorithm for minimizing the norm of
An algorithm for minimizing the norm of state feedback controllers in eigenvalue assignment
โœ S.M. Karbassi ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 408 KB

Minimization of the norm of parametric feedback controllers which assign desired eigenvalues to the closed-loop system is achieved by implementation of vector companion forms described in an earlier paper. The simple algorithm which emerges gives insight into the mechanism by which parametric eigenv

An approximation algorithm for a bottlen
An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane
โœ Lusheng Wang; Zimao Li ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 95 KB

We study a bottleneck Steiner tree problem: given a set P = {p 1 , p 2 , . . . , p n } of n terminals in the Euclidean plane and a positive integer k, find a Steiner tree with at most k Steiner points such that the length of the longest edges in the tree is minimized. The problem has applications in

An algorithm for constructing a minimal
An algorithm for constructing a minimal partial realization in the multivariable case
โœ Margreet Kuijper ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 631 KB

It is known that the Berlekamp-Massey algorithm from information theory can be used to compute scalar minimal partial realizations. Recently, it has been interpreted in terms of exact modeling of behaviors. In this paper, we extend these results to the multivariable case. We put the behavioral theor