Algorithms for Approximate Solution of ODE Ensembles Using Clustering and Sensitivity Matrices

Algorithms for solving ensembles of ODEs with sets of different input data arising from modeling chemical kinetics are considered with an operator splitting scheme for multiphysical calculations. The efficiency of an algorithm combining clustering of an input data ensemble and estimating of the solution within the cluster is evaluated by using a sensitivity matrix obtained by solving adjoint equations. The algorithm is implemented on the basis of numerical schemes consistent in the sense of a discrete Lagrange identity for solving ODE systems of the production-destruction type. The contribution of the clustering and the sensitivity matrix to the performance of the algorithm is evaluated. The results of testing with atmospheric chemistry scenarios show that the algorithm reduces the calculation time with an acceptable decrease in accuracy.

Institutions

Publication Details

Journal
Numerical Analysis and Applications
Published
2025-06-01
DOI
https://doi.org/10.1134/s1995423925020053
Primary Topic
Logistics and Infrastructure Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Algorithms for Approximate Solution of ODE Ensembles Using Clustering and Sensitivity Matrices

Numerical Analysis and Applications
Logistics and Infrastructure Analysis
article

Algorithms for Approximate Solution of ODE Ensembles Using Clustering and Sensitivity Matrices

article en

Abstract

Algorithms for solving ensembles of ODEs with sets of different input data arising from modeling chemical kinetics are considered with an operator splitting scheme for multiphysical calculations. The efficiency of an algorithm combining clustering of an input data ensemble and estimating of the solution within the cluster is evaluated by using a sensitivity matrix obtained by solving adjoint equations. The algorithm is implemented on the basis of numerical schemes consistent in the sense of a discrete Lagrange identity for solving ODE systems of the production-destruction type. The contribution of the clustering and the sensitivity matrix to the performance of the algorithm is evaluated. The results of testing with atmospheric chemistry scenarios show that the algorithm reduces the calculation time with an acceptable decrease in accuracy.

Numerical Analysis and ApplicationsVol. 18(2)
Institute of Computational Mathematics and Mathematical Geophysics (RU), Novosibirsk State Technical University (RU)
Openalex Percentile: Top 36%
Logistics and Infrastructure Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Algorithms for Approximate Solution of ODE Ensembles Using Clustering and Sensitivity Matrices · Numerical Analysis and Applications (2025) | TGRS Research Map | TGRS