ACM Home Page
Please provide us with feedback. Feedback
Digital filters in adaptive time-stepping
Full text PdfPdf (529 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 29 ,  Issue 1  (March 2003) table of contents
Pages: 1 - 26  
Year of Publication: 2003
ISSN:0098-3500
Author
Gustaf Söderlind  Lund University, Lund, Sweden
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 75,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/641876.641877
What is a DOI?

ABSTRACT

Adaptive time-stepping based on linear digital control theory has several advantages: the algorithms can be analyzed in terms of stability and adaptivity, and they can be designed to produce smoother stepsize sequences resulting in significantly improved regularity and computational stability. Here, we extend this approach by viewing the closed-loop transfer map Hϕ : logϕ ↦ log h as a digital filter, processing the signal logϕ (the principal error function) in the frequency domain, in order to produce a smooth stepsize sequence log h. The theory covers all previously considered control structures and offers new possibilities to construct stepsize selection algorithms in the asymptotic stepsize-error regime. Without incurring extra computational costs, the controllers can be designed for special purposes such as higher order of adaptivity (for smooth ODE problems) or a stronger ability to suppress high-frequency error components (nonsmooth problems, stochastic ODEs). Simulations verify the controllers' ability to produce stepsize sequences resulting in improved regularity and computational stability.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
de Swart, J. J. B. 1997. Parallel software for implicit differential equations. Ph.D. dissertation, CWI, Amsterdam, The Netherlands.
 
3
 
4
5
6
 
7
 
8
 
9
 
10
Hairer, E. and Wanner, G. 1996. Solving Ordinary Differential Equations II: Stiff and Differential-algebraic Problems, 2nd revised edition. Springer-Verlag, Berlin, Germany.
11
12
 
13
Hall, G. and Higham, D. 1988. Analysis of stepsize selection schemes for Runge--Kutta codes. IMA J.Num.Anal. 8, 305--310.
 
14
 
15
Söderlind, G. 2002. Automatic control and adaptive time-stepping. Numer. Alg. 31, 281--310.
 
16
Watts, H. A. 1984. Step size control in ordinary differential equation solvers. Trans. Soc. Comput. Sim. 1, 15--25.
 
17
Zonneveld, J. A. 1964. Automatic numerical integration. Ph.D. dissertation. Math. Centre Tracts 8. CWI, Amsterdam, The Netherlands.

CITED BY  9


REVIEW

"John Charles Butcher : Reviewer"

Traditional codes for initial-value problems adapt to changing conditions by varying the stepsize as the integration progresses. The aim is to keep the local truncation error close to a user-supplied tolerance. Since the revolutionary work of Gust  more...