Implementing Adams methods with preassigned stepsize ratios (Q966392): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: ode45 / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: ODEPACK / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031344228 / rank | |||
Normal rank | |||
Latest revision as of 02:49, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Implementing Adams methods with preassigned stepsize ratios |
scientific article |
Statements
Implementing Adams methods with preassigned stepsize ratios (English)
0 references
23 April 2010
0 references
Summary: Runge-Kutta and Adams methods are the most popular codes to solve numerically nonstiff ODEs. The Adams methods are useful to reduce the number of function calls, but they usually require more CPU time than the Runge-Kutta methods. In this work we develop a numerical study of a variable step length Adams implementation, which can only take preassigned step-size ratios. Our aim is the reduction of the CPU time of the code by means of the precalculation of some coefficients. We present several numerical tests that show the behaviour of the proposed implementation.
0 references
