### Abstract

Original language | English |
---|---|

Pages (from-to) | 2275-2294 |

Number of pages | 19 |

Journal | SIAM Journal on Scientific Computing |

Volume | 21 |

Issue number | 6 |

DOIs | |

Publication status | Published - 2000 |

### Fingerprint

### Keywords

- adaptivity
- fixed point
- long time simulations
- stability
- stepsize
- applied mathematics
- computer science

### Cite this

*SIAM Journal on Scientific Computing*,

*21*(6), 2275-2294. https://doi.org/10.1137/S1064827597331400

}

*SIAM Journal on Scientific Computing*, vol. 21, no. 6, pp. 2275-2294. https://doi.org/10.1137/S1064827597331400

**Phase space error control for dynamical systems.** / Higham, D.J.; Humphries, A.R.; Wain, R.J.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Phase space error control for dynamical systems

AU - Higham, D.J.

AU - Humphries, A.R.

AU - Wain, R.J.

PY - 2000

Y1 - 2000

N2 - Variable time-stepping algorithms for initial value ordinary differential equations are traditionally designed to solve a problem for a fixed initial condition and over a finite time. It can be shown that these algorithms may perform poorly for long time computations with initial conditions that lie in a small neighborhood of a fixed point. In this regime there are orbits that are bounded in space but unbounded in time, and the classical error-per-step or error-per-unit-step philosophy may be improved upon. A new error criterion is introduced that essentially bounds the truncation error at each step by a fraction of the solution arc length over the corresponding time interval. This new control can be incorporated within a standard algorithm as an additional constraint at negligible additional computational cost. It is shown that this new criterion has a positive effect on the linear stability properties and hence improves behavior in the neighborhood of stable fixed points. Furthermore, spurious fixed points and period two solutions are prevented. The new criterion is shown to be admissible in the sense that it can always be satisfied with nonzero stepsizes. Implementation details and numerical results are given.

AB - Variable time-stepping algorithms for initial value ordinary differential equations are traditionally designed to solve a problem for a fixed initial condition and over a finite time. It can be shown that these algorithms may perform poorly for long time computations with initial conditions that lie in a small neighborhood of a fixed point. In this regime there are orbits that are bounded in space but unbounded in time, and the classical error-per-step or error-per-unit-step philosophy may be improved upon. A new error criterion is introduced that essentially bounds the truncation error at each step by a fraction of the solution arc length over the corresponding time interval. This new control can be incorporated within a standard algorithm as an additional constraint at negligible additional computational cost. It is shown that this new criterion has a positive effect on the linear stability properties and hence improves behavior in the neighborhood of stable fixed points. Furthermore, spurious fixed points and period two solutions are prevented. The new criterion is shown to be admissible in the sense that it can always be satisfied with nonzero stepsizes. Implementation details and numerical results are given.

KW - adaptivity

KW - fixed point

KW - long time simulations

KW - stability

KW - stepsize

KW - applied mathematics

KW - computer science

UR - http://dx.doi.org/ 10.1137/S1064827597331400

U2 - 10.1137/S1064827597331400

DO - 10.1137/S1064827597331400

M3 - Article

VL - 21

SP - 2275

EP - 2294

JO - SIAM Journal on Scientific Computing

JF - SIAM Journal on Scientific Computing

SN - 1064-8275

IS - 6

ER -