Optimal adaptive implicit time stepping
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916807438237696 |
|---|---|
| author | Feischl, Michael Niederkofler, David |
| author_facet | Feischl, Michael Niederkofler, David |
| contents | We revisit adaptive time stepping, one of the classical topics of numerical analysis and computational engineering. While widely used in application and subject of many theoretical works, a complete understanding is still missing. Apart from special cases, there does not exist a complete theory that shows how to choose the time steps such that convergence towards the exact solution is guaranteed with the optimal convergence rate. In this work, we use recent advances in adaptive mesh refinement to propose an adaptive time stepping algorithm that is mathematically guaranteed to be optimal in the sense that it achieves the best possible convergence of the error with respect to the number of time steps, and it can be implemented using a time stepping scheme as a black box. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_18809 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Optimal adaptive implicit time stepping Feischl, Michael Niederkofler, David Numerical Analysis We revisit adaptive time stepping, one of the classical topics of numerical analysis and computational engineering. While widely used in application and subject of many theoretical works, a complete understanding is still missing. Apart from special cases, there does not exist a complete theory that shows how to choose the time steps such that convergence towards the exact solution is guaranteed with the optimal convergence rate. In this work, we use recent advances in adaptive mesh refinement to propose an adaptive time stepping algorithm that is mathematically guaranteed to be optimal in the sense that it achieves the best possible convergence of the error with respect to the number of time steps, and it can be implemented using a time stepping scheme as a black box. |
| title | Optimal adaptive implicit time stepping |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2506.18809 |