Solving of a minimal realization problem in Maple
Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie, Tome 7 (2014) no. 4, pp. 76-89
Voir la notice de l'article provenant de la source Math-Net.Ru
In the computer algebra system Maple, we have created a package MinimalRealization to solve the minimal realization problem for a discrete-time linear time-invariant system. The package enables to construct the minimal realization of a system starting with either a finite sequence of Markov parameters of a system, or a transfer function, or any non-minimal realization. It is designed as a user library and consists of 11 procedures: Approx EssPoly, ApproxNullSpace, Approxrank, ExactEssPoly, Frac tion al FactorizationG, FractionalFactorizationMP, MarkovParameters, MinimalityTest, Mini malRealizationG, MinimalRealizationMP, Realization2MinimalRealization. The realization algorithm is based on solving of sequential problems: (1) determination of indices and essential polynimials (procedures ExactEssPoly, ApproxEssPoly), (2) construction of a right fractional factorization of the transfer function (FractionalFactorizationG, FractionalFactorizationMP), (3) construction of the minimal realization by the given fractional factorization (Mini malRealizationG, Mini malRealizationMP, Realization2MinimalRealization). We can solve the problem both in the case of exact calculations (in rational arithmetic) and in the presence of rounding errors, or for input data which are disturbed by noise. In the latter case the problem is ill-posed because it requires finding the rank and the null space of a matrix. We use the singular value decomposition as the most accurate method for calculation of the numerical rank (Approxrank) and the numerical null space (ApproxNullSpace). Numerical experiments with the package MinimalRealization demonstrate good agreement between the exact and approximate solutions of the problem.
Keywords:
discrete-time linear time-invariant systems; fractional factorization; mini mal realization; algorithms for solving of realization problem.
@article{VYURU_2014_7_4_a5,
author = {V. M. Adukov and A. S. Fadeeva},
title = {Solving of a minimal realization problem in {Maple}},
journal = {Vestnik \^U\v{z}no-Uralʹskogo gosudarstvennogo universiteta. Seri\^a, Matemati\v{c}eskoe modelirovanie i programmirovanie},
pages = {76--89},
publisher = {mathdoc},
volume = {7},
number = {4},
year = {2014},
language = {en},
url = {http://geodesic.mathdoc.fr/item/VYURU_2014_7_4_a5/}
}
TY - JOUR AU - V. M. Adukov AU - A. S. Fadeeva TI - Solving of a minimal realization problem in Maple JO - Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie PY - 2014 SP - 76 EP - 89 VL - 7 IS - 4 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VYURU_2014_7_4_a5/ LA - en ID - VYURU_2014_7_4_a5 ER -
%0 Journal Article %A V. M. Adukov %A A. S. Fadeeva %T Solving of a minimal realization problem in Maple %J Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie %D 2014 %P 76-89 %V 7 %N 4 %I mathdoc %U http://geodesic.mathdoc.fr/item/VYURU_2014_7_4_a5/ %G en %F VYURU_2014_7_4_a5
V. M. Adukov; A. S. Fadeeva. Solving of a minimal realization problem in Maple. Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie, Tome 7 (2014) no. 4, pp. 76-89. http://geodesic.mathdoc.fr/item/VYURU_2014_7_4_a5/