2020
DOI: 10.21105/joss.02515
|View full text |Cite
|
Sign up to set email alerts
|

NodePy: A package for the analysis of numerical ODE solvers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1

Relationship

3
3

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 21 publications
0
3
0
Order By: Relevance
“…We ran simulations of all three test cases described above and measured the performance of each scheme (in terms of the number of right-hand side evaluations). We used a brute-force search over the domain ∈ [10 −8 , 10 −1 ] , sampling at each power of ten, and 1 ∈ [0.1, 1.0] , 2 ∈ [−0.4, −0.05] , 3 ∈ [0.0, 0.1] sampling at an interval of 0.01 in each parameter, and restricting a priori to parameter values yielding step size control stability for the given scheme (computed using NodePy [43]). The final time for these simulations was set to t = 8 for ( 14), t = 4 for (15), and t = 20 for ( 16) to make the brute-force optimization feasible.…”
Section: Optimization Of Step Size Controllersmentioning
confidence: 99%
“…We ran simulations of all three test cases described above and measured the performance of each scheme (in terms of the number of right-hand side evaluations). We used a brute-force search over the domain ∈ [10 −8 , 10 −1 ] , sampling at each power of ten, and 1 ∈ [0.1, 1.0] , 2 ∈ [−0.4, −0.05] , 3 ∈ [0.0, 0.1] sampling at an interval of 0.01 in each parameter, and restricting a priori to parameter values yielding step size control stability for the given scheme (computed using NodePy [43]). The final time for these simulations was set to t = 8 for ( 14), t = 4 for (15), and t = 20 for ( 16) to make the brute-force optimization feasible.…”
Section: Optimization Of Step Size Controllersmentioning
confidence: 99%
“…For this, we used the algorithms implemented in RK-Opt [61], which are based on MATLAB [62]. We used NodePy [63] to verify the desired properties of the resulting five-stage second-order method RK3S* with low-storage coefficients listed in Table 1. The minimum-storage implementation [60] is shown in Algorithm 1.…”
Section: Time Integration Schemesmentioning
confidence: 99%
“…∈ [−0.4, −0.05], 3 ∈ [0.0, 0.1] sampling at an interval of 0.01 in each parameter, and restricting a priori to parameter values yielding step size control stability for the given scheme (computed using NodePy[43]). The final times for these simulations were set to = 8 for (5.3), = 4 for (5.4), and = 20 for (5.5) to make the brute-force optimization feasible.…”
mentioning
confidence: 99%