Determining the number of fast and slow components in decomposition of arbitrarily large linear dynamical models
From MaRDI portal
Publication:1816026
DOI10.1007/BF01246510zbMath0875.65054OpenAlexW2321080796MaRDI QIDQ1816026
A. Z. Grishchenko, V. V. Khilenko
Publication date: 18 December 1996
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01246510
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solution of ill-posed problems involving ordinary differential equations (65L08)
Related Items (9)
Finding maximum (in modulus) complex-conjugate eigenvalues of arbitrarily high dimension ⋮ Application of decomposition algorithms to accelerate the processing of large data arrays in the GIS ⋮ Modeling the control effects of the banking system on the functioning of the economy. I: Dynamics and adjustment of crisis situations ⋮ Application of blockchain technologies for improving the quality of ACS of complex dynamic systems ⋮ Modeling the control effects of the banking system on the functioning of the economy. II: Selection and special features of application of optimization algorithms ⋮ Mathematical modeling of the effect of ``splashing out and optimization of management of banking and economic systems under globalization conditions ⋮ Organization of parallel computational processes to compute step boundary layer models ⋮ Order reduction method and adequate simplification of SAE models with uncertain coefficients ⋮ An algorithm for decomposition control and prediction of trajectories of nonlinear stochastic systems under different-speed processes in their dynamics
Cites Work
This page was built for publication: Determining the number of fast and slow components in decomposition of arbitrarily large linear dynamical models
