In this work we present recent results on application of low-rank tensor decompositions to modelling of aggregation kinetics taking into account multi-particle collisions (for three and more particles). Such kinetics can be described by system of nonlinear differential equations with right-hand side requiring $N^D$ operations for its straight-forward evaluation, where $N$ is number of particles size classes and $D$ is number of particles colliding simultaneously. Such a complexity can be significantly reduced by application low rank tensor decompositions (either Tensor Train or Canonical Polyadic) to acceleration of evaluation of sums and convolutions from right-hand side. Basing on this drastic reduction of complexity for evaluation of right-hand side we further utilize standard second order Runge-Kutta time integration scheme and demonstrate that our approach allows to obtain numerical solutions of studied equations with very high accuracy in modest times. We also show preliminary results on parallel scalability of novel approach and conclude that it can be efficiently utilized with use of supercomputers.
[1]
P. Krapivsky.
Aggregation processes with n-particle elementary reactions
,
1991
.
[2]
S A Matveev,et al.
Oscillations in Aggregation-Shattering Processes.
,
2017,
Physical review letters.
[3]
E. Tyrtyshnikov,et al.
TT-cross approximation for multidimensional arrays
,
2010
.
[4]
V. Galkin.
Kinetic method for solving systems of differential equations
,
2013
.
[5]
Sergey Pavlov,et al.
“Zhores” — Petaflops supercomputer for data-driven modeling, machine learning and artificial intelligence installed in Skolkovo Institute of Science and Technology
,
2019,
Open Engineering.
[6]
Ivan Oseledets,et al.
Tensor-Train Decomposition
,
2011,
SIAM J. Sci. Comput..