2014
DOI: 10.1063/1.4887558
|View full text |Cite
|
Sign up to set email alerts
|

GPU acceleration of Runge Kutta-Fehlberg and its comparison with Dormand-Prince method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(8 citation statements)
references
References 3 publications
0
7
0
Order By: Relevance
“…The number of operations of this model is in the order of , meaning that when comparing 50 and 100 age categories, the latter has 4 times as many operations. As noted by previous work [ 21 – 23 ], small-scale ODE integration cannot fully utilize the GPU. By increasing the amount of age categories, the number of ODE equations grows proportionally and allows more GPU threads to be effectively used.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The number of operations of this model is in the order of , meaning that when comparing 50 and 100 age categories, the latter has 4 times as many operations. As noted by previous work [ 21 – 23 ], small-scale ODE integration cannot fully utilize the GPU. By increasing the amount of age categories, the number of ODE equations grows proportionally and allows more GPU threads to be effectively used.…”
Section: Resultsmentioning
confidence: 99%
“…Amidst a plethora of numerical integration algorithms, Runge-Kutta methods are a family of implicit and explicit iterative methods, with a wide variety of orders and schemes [ 20 ]. Seen et al [ 21 ] implemented a Runge-Kutta-Fehlberg (commonly denoted RK45 ) with adaptive step size on an NVIDIA GPU. The authors demonstrated that the GPU outperforms a CPU implementation, given that the problem dimensions are large enough, as in 200 equations, or more.…”
Section: Related Workmentioning
confidence: 99%
“…There are many numerical methods for CUDA to solve ODE. This article uses the most common Runge-Kutta-Merson method, interested can refer to [44][45][46][47].…”
Section: Using Matlab/cuda To Accelerate the Best Solutionmentioning
confidence: 99%
“…Methods like Runge-Kutta are multi-steps iterated methods [16][17][18][19]; this means one can distribute calculations of each step on different computing nodes. But at the end of each step, the different computing nodes should send their results to one node to sum-up or combine them appropriately and then calculate a new value.…”
Section: Introductionmentioning
confidence: 99%