ACM Home Page
Please provide us with feedback. Feedback
An evaluation of some new cyclic linear multistep formulas for stiff ODEs
Full text PdfPdf (576 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 11 ,  Issue 3  (September 1985) table of contents
Pages: 263 - 270  
Year of Publication: 1985
ISSN:0098-3500
Authors
P. E. Tischer  Department of Computer Science, Monash University, Clayton, Victoria, Australia 3168
G. K. Gupta  Department of Computer Science, Monash University, Clayton, Victoria, Australia 3168
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 18,   Citation Count: 0
Additional Information:

abstract   references   index terms   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/214408.214417
What is a DOI?

ABSTRACT

We evaluate several sets of cyclic linear multistep formulas (CLMFs). One of these sets was derived by Tischer and Sacks-Davis. Three new sets of formulas have been derived and we present their characteristics.The formulas have been evaluated by comparing the performance of four versions of a code which implements CLMFs. The four versions are very similar and each version implements one of the sets of CLMFs being studied. We compare the performance of these codes with that of a widely used code, LSODE. One of the new sets of CLMFs is not only much more efficient in solving stiff problems that have a Jacobian with eigenvalues close to the imaginary axis but is almost as efficient as LSODE in solving other problems. This is a significant improvement over the ony other CLMF code available, STINT from Tendler, Bickart, and Picel.


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
ALBRECHT, P. On the order of composite multistep methods for ordinary differential equations. Numer. Math. 29 (1978), 381-396.
 
2
DAHLQUIST, G.G. Convergence and stability in the numerical solution of ordinary differential equations. Math. Scandinavica 4 (1956), 33-53.
 
3
DONELSON, J. III AND HANSEN, E. Cyclic composite multistep predictor-corrector methods. SINUM 8, 1 (1971), 137-147.
 
4
ENRIGHT, W. H. Using a test package for the automatic assessment of methods for ODE's. In Performance Evaluation of Numerical So{tware (1979) I. D. Fosdick, Ed. North Holland, New York.
5
 
6
HINDMARSH, A. C. GEAR: Ordinary differential equation system solver. Rep. UICD-30001, Rev. 3, Univ. of California, Lawrence Livermore Laboratories, Livermore Calif., 1974.
 
7
HINDMARSH, A.C. LSODE and LSODI, two new initial value ordinary differential equation solvers. ACM-SIGNUM Newsletter, 15, pp. 10-11.
8
 
9
TlSCHER, P.E. Propagated error behaviour of multistep formulas. Tech. Rep. (under preparation), Department of Computer Science, Monash University, Clayton, Victoria, Australia, 1985.
 
10
TISCHER, P.E. The cyclic use of linear multistep formulas for the solution of stiff differential equations. Ph.D. dissertation, Dept. of Computer Science, Monash University, Clayton, Victoria, Australia, 1983.
 
11
TISCHEa, P. E. AND GUPTA, G.K. A cyclic method stiff ODE solver. Tech. Rep. No. 38, Dept. of Computer Science, Monash University, Clayton, Victoria, Australia, 1983.
 
12
TISCHER, P. E. AND SACKS-DAVIS A new class of cyclic multistep formulae for stiff systems. SIAM J. Sci. Star. Comp. 4, 4 (1983), 733-746.

Collaborative Colleagues:
P. E. Tischer: colleagues
G. K. Gupta: colleagues