|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
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 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.
INDEX TERMS
Primary Classification:
General Terms:
Keywords:
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...
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||