DC FieldValueLanguage
dc.contributor.authorSarsembayev, M.en_US
dc.contributor.authorUrmashev, Bayadauleten_US
dc.contributor.authorMladenović, Nenaden_US
dc.contributor.authorZaslavskyi, Volodymyren_US
dc.date.accessioned2020-08-10T10:50:37Z-
dc.date.available2020-08-10T10:50:37Z-
dc.date.issued2020-07-27-
dc.identifier.issn1060-0396-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/3968-
dc.description.abstractThe paper focuses on the problem of chemical kinetics, calculation of variations in the concentration of substances in the reactions over time, and creation of a mass kinetic solver to solve the problem using modern parallelization technologies. A mathematical model of variation in the concentration of substances in a system with a one-dimensional approximation and the possibility of accelerating the calculations using the CUDA technology is described. The calculation performed on NVIDIA graphic processor shows that an increase in the number of reactions much reduces the computing time as compared with the computing time on the central processors.en_US
dc.publisherSpringer Linken_US
dc.relation.ispartofCybernetics and Systems Analysisen_US
dc.subjectcombustion | combustion mechanisms | CUDA | graphic processors | parallel computing | Runge–Kutta methoden_US
dc.titleUsing the Cuda Technology to Speed up Computations in Problems of Chemical Kineticsen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s10559-020-00284-z-
dc.identifier.scopus2-s2.0-85088778209-
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage675-
dc.relation.lastpage682-
dc.relation.issue4-
dc.relation.volume56-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairetypeArticle-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

Page view(s)

29
checked on Dec 30, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.