Adaptive time-stepping for aggregation-shattering kinetics

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Matveev, Sergey A., Zhilin, Viktor, Smirnov, Alexander P.
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866913654831579136
author Matveev, Sergey A.
Zhilin, Viktor
Smirnov, Alexander P.
author_facet Matveev, Sergey A.
Zhilin, Viktor
Smirnov, Alexander P.
contents We propose an experimental study of adaptive time-stepping methods for efficient modeling of the aggregation-fragmentation kinetics. Precise modeling of this phenomena usually requires utilization of the large systems of nonlinear ordinary differential equations and intensive computations. We concentrate on performance of three explicit Runge-Kutta time-integration methods and provide simulations for two types of problems: finding of equilibrium solutions and simulations for kinetics with periodic solutions. The first class of problems may be analyzed through the relaxation of the solution to the stationary state after large time. In this case, the adaptive time-stepping may help to reach it using big steps reducing cost of the calculations without loss of accuracy. In the second case, the problem becomes numerically unstable at certain points of the phase space and may require tiny steps making the simulations very time-consuming. Adaptive criteria allows to increase the steps for most of points and speedup simulations significantly.
format Preprint
id arxiv_https___arxiv_org_abs_2407_16559
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Adaptive time-stepping for aggregation-shattering kinetics
Matveev, Sergey A.
Zhilin, Viktor
Smirnov, Alexander P.
Numerical Analysis
Statistical Mechanics
F.2.1; G.1.7
We propose an experimental study of adaptive time-stepping methods for efficient modeling of the aggregation-fragmentation kinetics. Precise modeling of this phenomena usually requires utilization of the large systems of nonlinear ordinary differential equations and intensive computations. We concentrate on performance of three explicit Runge-Kutta time-integration methods and provide simulations for two types of problems: finding of equilibrium solutions and simulations for kinetics with periodic solutions. The first class of problems may be analyzed through the relaxation of the solution to the stationary state after large time. In this case, the adaptive time-stepping may help to reach it using big steps reducing cost of the calculations without loss of accuracy. In the second case, the problem becomes numerically unstable at certain points of the phase space and may require tiny steps making the simulations very time-consuming. Adaptive criteria allows to increase the steps for most of points and speedup simulations significantly.
title Adaptive time-stepping for aggregation-shattering kinetics
topic Numerical Analysis
Statistical Mechanics
F.2.1; G.1.7
url https://arxiv.org/abs/2407.16559