Adaptive Interpolation Algorithm Using TT-Decomposition for Modeling Dynamical Systems with Interval Parameters
Tóm tắt
Problems with inexactly specified parameters arise in many applications, and they are often formulated as dynamical systems with interval parameters. For such systems, it is required to know how to obtain an interval estimate of solution given the interval values of the parameters. The main idea underlying the adaptive interpolation algorithm is to construct an adaptive hierarchical grid based on the kd-tree over the set formed by the interval initial conditions and parameters of the problem. In this grid, each cell contains an interpolation grid. For each point in time, depending on the features of solution, the decomposition is adaptively rearranged. At each step, the algorithm produces a piecewise polynomial function that interpolates the dependence of the problem solution on the parameter values with prescribed accuracy. As the number of interval parameters grows, the number of nodes in the interpolation grid grows exponentially, which restricts the algorithm scope. To mitigate this drawback, it is proposed to use the TT-decomposition of the multidimensional arrays in which the values of nodes of the interpolation grids are stored instead of these arrays. The efficiency of the proposed modification of the algorithm is demonstrated on model problems. In particular, the combustion of hydrogen–oxygen mixture in the presence of indeterminacy in the constants of chemical reaction rates is simulated.
Tài liệu tham khảo
R. E. Moore, R. B. Kearfott, and M. J. Cloud, Introduction to Interval Analysis (SIAM, 2009).
S. P. Shary and B. Moradi, “Solving interval linear least squares problems by PPS-methods,” Numer. Alg. 2020. https://doi.org/10.1007/s11075-020-00958-x
E. E. Tyrtyshnikov, “Tensor approximation of matrices generated by asymptotically smooth functions,” Mat. Sb. 194 (6), 147–160 (2003).
E. E. Tyrtyshnikov and E. M. Shcherbakova, “Methods for nonnegative matrix factorization based on low-rank cross approximations,” Comput. Math. Mat. Phys. 59, 1251–1266 (2019).
D. A. Zheltkov and E. E. Tyrtyshnikov, “A parallel implementation of the matrix criss-cross method,” Vychisl. Met. Program. 16, 369–375 (2015).
S. A. Goreinov, N. L. Zamarashkin, and E. E. Tyrtyshnikov, “Pseudoskeletal approximations using submatrices of maximum size,” Mat. Zametki 62, 619–623 (1997).
I. V. Oseledets, “Tensor-train decomposition,” SIAM J. Sci. Comput. 33, 2295–2317 (2011).
I. Oseledets and E. Tyrtyshnikov, “TT-cross approximation for multidimensional arrays,” Lin. Alg. Appl. 432 (1), 70–88 (2010).
A. Yu. Morozov and D. L. Reviznikov, “Adaptive interpolation algorithm based on a kd-tree for numerical integration of systems of ordinary differential equations with interval initial conditions,” Differ. Equations 54, pp. 945–956. https://doi.org/10.1134/S0012266118070121
A. Yu. Morozov, D. L. Reviznikov, and V. Yu. Gidaspov, “Adaptive interpolation algorithm based on a kd-tree for the problems of chemical kinetics with interval parameters,” Math. Models Comput. Simul. 11, 622–633 (2019). https://doi.org/10.31857/S023408790001940-8
A. Yu. Morozov, A. A. Zhuravlev, and D. L. Reviznikov, “Sparse grid adaptive interpolation in problems of modeling dynamic systems with interval parameters,” Mathematics, 9 (4), (2021). https://doi.org/10.3390/math9040298
A. Yu. Morozov and D. L. Reviznikov, “Modelling of dynamic systems with interval parameters on graphic processors,” Program. Ingeneria 10 (2), 69–76 (2019). https://doi.org/10.17587/prin.10.69-76
S. V. Dolgov, V. A. Kazeev, and B. N. Khoromskij, “Direct tensor-product solution of one-dimensional elliptic equations with parameter-dependent coefficients,” Math. Comput. Simul. 145, 136–155 (2018). https://doi.org/10.1016/j.matcom.2017.10.009
C. Olivier, D. Ryckelynck, and J. Cortial, “Multiple tensor train approximation of parametric constitutive equations in elasto-viscoplasticity,” Math. Comput. Appl. 24 (1), (2019). https://doi.org/10.3390/mca24010017
F. L. Hitchcock, “The expression of a tensor or a polyadic as a sum of products,” J. Math. Phys. B (1), 164–189 (1927).
L. R. Tucker, “Some mathematical notes on three-mode factor analysis,” Psychometrika 31, 279–311 (1966).
ttpy. URL: https://github.com/oseledets/ttpy. Cited March 7, 2021.
V. A. Vaitiev and S. A. Mustafina, “Search of uncertainty domains of kinetic parameters in mathematical models of chemical kinetics based on interval computations,” Vestn. Uzho-Ural’sk. Gos. Univ., Ser. Mat. Model. Program. 7 (2), 99–110 (2014).
V. Yu. Gidaspov and N. S. Severina, Elementary Models and Computational Algorithms in Physical Fluid Dynamics.Thermodynamica and Chemical Kinetics: Textbook (Faktorial, Moscow, 2014) [in Russian].
V. P. Glushko, L. V. Gurvich, I. V. Veits, et al., Thermodynamic Properties of Some Substances (Nauka, Moscow, 1978–2004), Vol. 1 [in Russian].
J. Warnatz, U. Maas, and R. Dibble, Combustion. Physical and Chemical Fundamentals, Modelling and Simulation, Experiments, Pollutant Formation (Springer, Berlin, 2001).
A. M. Starik, N. S. Titova, A. S. Sharipov, and V. E. Kozlov, “Syngas oxidation mechanism,” Combust., Explos., Shock Waves 46, 491–506 (2010).
E. A. Novikov and M. I. Golushko, “(m, 3) third-order method for stiff nonautonomous systems of ODEs,” Vychisl. Tekhnol. 3 (3), 48–54 (1998).
E. I. Vasilev and T. A. Vasilyeva, “Multi-implicit methods with automatic error control in applications with chemical reactions,” Comput. Math. Math. Phys. 59, 1570–1580 (2019).