Abstract | ||
---|---|---|
The main advantage of minimal realization procedures related to balancing is that the determination of the order of the minimal realization relies on a single, numerically reliable, rank decision. Moreover, usually the same procedures can be also used to compute reduced order approximations of the given system. The paper presents eight minimal realization methods related to balancing techniques and compares their numerical performances. New derivations for some existing methods are provided and several new methods are suggested. The performed numerical tests confirm the superiority of recently developed square-root methods over other existing methods. |
Year | DOI | Venue |
---|---|---|
1991 | 10.1007/BFb0021056 | EUROCAST |
Keywords | Field | DocType |
related techniques,minimal realization | Numerical tests,Computer science,Theoretical computer science,Minimal realization,Computer engineering | Conference |
ISBN | Citations | PageRank |
3-540-55354-1 | 2 | 0.67 |
References | Authors | |
1 | 1 |