Geodesic
Identification and Discretization of the Linear Differential Equations with Constant Coefficients
Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 14 (2014) no. 3, pp. 29-42 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

In the first part of the article the problem and methods of solving the approximation and identification variational problems of the finite sequence have been stated. The method proposed is based on applying the dynamic models of the sequences under study. The peculiarities of using the models for such types of problems in the form of the ordinary linear difference equations with constant or maybe unknown coefficients have been shown here. In the second part, some problems of the discretization of the differential equations by means of the proposed problem of identification are studied. It is realized by obtaining an exact difference description of the differential equations solutions on the uniform net on the finite interval. Also, well-known analytical and proposed variational methods of the uniform discretization have been considered and compared here. With the use of the variational discretization it is not necessary to know differential coefficients. The conditions for realizing differential equations solutions on the net have been studied. Necessary and sufficient conditions for the uniqueness of the variational discretization and identification have been obtained. It is shown that under these conditions the results of the analytical and variational discretization coincide.
Keywords: variational approximation and identbfication, differential equation discretization, Gamilton–Kayley theorem, characteristic polynomial, corner subspace.
Mots-clés : orthogonal projection 
@article{VNGU_2014_14_3_a2,
     author = {A. O. Egorshin},
     title = {Identification and {Discretization} of the {Linear} {Differential} {Equations} with {Constant} {Coefficients}},
     journal = {Sibirskij \v{z}urnal \v{c}istoj i prikladnoj matematiki},
     pages = {29--42},
     year = {2014},
     volume = {14},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VNGU_2014_14_3_a2/}
}
TY  - JOUR
AU  - A. O. Egorshin
TI  - Identification and Discretization of the Linear Differential Equations with Constant Coefficients
JO  - Sibirskij žurnal čistoj i prikladnoj matematiki
PY  - 2014
SP  - 29
EP  - 42
VL  - 14
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/VNGU_2014_14_3_a2/
LA  - ru
ID  - VNGU_2014_14_3_a2
ER  - 
%0 Journal Article
%A A. O. Egorshin
%T Identification and Discretization of the Linear Differential Equations with Constant Coefficients
%J Sibirskij žurnal čistoj i prikladnoj matematiki
%D 2014
%P 29-42
%V 14
%N 3
%U http://geodesic.mathdoc.fr/item/VNGU_2014_14_3_a2/
%G ru
%F VNGU_2014_14_3_a2
A. O. Egorshin. Identification and Discretization of the Linear Differential Equations with Constant Coefficients. Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 14 (2014) no. 3, pp. 29-42. http://geodesic.mathdoc.fr/item/VNGU_2014_14_3_a2/

[1] A. O. Egorshin, “On linear differential equation discretization”, Bull. of South Ural State Univ. Series “Math. Modelling, Prog. and Comp. Soft.”, 40(299):14 (2012), 59–88 (in Russian)

[2] A. O. Egorshin, “On one variational smoothing problem”, Vestn. Udmurt. Univ. Mat. Mekh. Komp'yut. Nauki, 2011, no. 4, 9–22 (in Russian)

[3] A. O. Egorshin, “Problem of the piecewise-linear dynamical approximation”, Vestn. Udmurt. Univ. Mat. Mekh. Komp'yut. Nauki, 2012, no. 4, 30–45 (in Russian)

[4] A. O. Egorshin, “Least square method and fast algorithms of identification and filtration (VI method)”, Avtometriya, 1988, no. 1, 30–42 (in Russian)

[5] A. O. Egorshin, “Parameters optimization of the stationary models in unitary space”, Automation and Remote Control, 65:12 (2004), 1734–1756 (in Russian) | DOI

[6] Yu. V. Linnik, Method of least squares and principles of the theory of observations, Pergamon Press, New York–Oxford–London–Paris, 1961

[7] A. O. Egorshin, “On counter orthogonalization processes”, Num. Analysis and Appl., 5:4 (2012), 307–319 | DOI

[8] A. O. Egorshin, “On one estimation method of modeling equation coefficients for sequences”, Sib. Zh. Ind. Mat., 3:2(6) (2000), 78–96 (in Russian)

[9] A. O. Egorshin, “Numerical closed methods of linear objects identification”, Optimal'lnye i Samonastraivajushchiesia sistemy, Institute Automation and Electrometry of Siberian Branch of Russian Academy of Sciences, Novosibirsk, 1971, 40–53 (in Russian)

[10] Osborne M. R., Smyth G. K., “A Modified Prony Algorithm for Fitting Functions Defined by Difference Equations”, SIAM J. Sci. Statist. Comput., 12 (1991), 362–382 | DOI

[11] Aoki M., Yue P. C., “On A Priori Error Estimates of Some Identification Methods”, IEEE Trans. on Automat. Control, AC-15 (1970), 541–548 | DOI

[12] A. O. Egorshin, “On tracking extremum parameters in the identificatiin variationl problem”, J. of Math. Sci., 195:6 (2013), 791–804 | DOI

[13] F. R. Gantmacher, The Theory of Matrices, Chelsea Publishing Company, N.Y., 1959

[14] A. I. Mal'cev, Foundations of Linear Algebra, W. H. Freeman Co., San Francisco–London, 1963