ACM Home Page
Please provide us with feedback. Feedback
A-Stable Composite Multistep Methods
Full text PdfPdf (1.04 MB)
Source Journal of the ACM (JACM) archive
Volume 20 ,  Issue 1  (January 1973) table of contents
Pages: 7 - 26  
Year of Publication: 1973
ISSN:0004-5411
Authors
Harry M. Sloate  General Electric Electronics Laboratory, Electronics Park 3-120, Syracuse, New York
Theodore A. Bickart  Department of Electrical and Computer Engineering, 111 Link Hall, Syracuse University, Syracuse, New York
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 24,   Citation Count: 2
Additional Information:

abstract   references   cited by   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/321738.321740
What is a DOI?

ABSTRACT

Consider the set of multistep formulas ∑l-1jmn-k &agr;ijxmn+j - hl-1jmn-k&bgr;ijxmn+j = 0, i = 1, ···, l, where xmn+j = ymn+j for j= -k, ···, -1 and xn = ƒn = ƒ(xn , tn). These formulas are solved simultaneously for the xmn+j with j = 0, ···, l - 1 in terms of the xmn+j with j = -k, ··· , - 1, which are assumed to be known. Then ymn+j is defined to be xmn+j for j = 0, ··· , m - 1. For j = m, ··· , l - 1, xmn+j is discarded. The set of y's generated in this manner for successive values of n provide an approximate solution of the initial value problem: y = ƒ(y, t), y(t0) = y0. It is conjectured that if the method, which is referred to as the composite multistep method, is A-stable, then its maximum order is 2l. In addition to noting that the conjecture conforms to Dahlquist's bound of 2 for l = 1, the conjecture is verified for k = 1. A third-order A-stable method with m = l = 2 is given as an example, and numerical results established in applying a fourth-order A-stable method with m = 1 and l = 2 are described. A-stable methods with m = l offer the promise of high order and a minimum of function evaluations—evaluation of ƒ(y, t) at solution points. Furthermore, the prospect that such methods might exist with k = 1—only one past point—means that step-size control can be easily implemented


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
CURTISS, C F., AND HIRSCItFELDER, J O. Integration of stiff equations. Proc. Nat. Acad. Sc~. 38 (1952), 235--243.
 
2
DAHLQUIST, G. G. A special stability problem for linear multistep methods. BIT (1963), 27-43.
 
3
LINIGER, W., AND WILLOUGHBY, R.A. Efficient numerical integration of stiff systems of ordinary differential equations SIAM J. Num Anal. 7 (1970), 47-66.
 
4
I:~OSENBROCK, H.H. Some general imphcit processes for the numerical solution of diferential equations. Comput J. 5 (1963), 329-330.
 
5
CALAHAN, D.A. A stable accurate method of numerical integration for nonlinear systems. Proc. IEEE 56 (1968), 744.
 
6
ALLEN, n. H., AND POTTLE, C. Stable integration methods for electronic circuit analysis with widely separated time constants. Proc. Sixth Annual Allerton Conf. on Circuit and System Theory, U. of illinois, Urbana, Ill., 1968, pp. 311-320.
 
7
EHLE, B.L. High order A-stable methods for the numerical solution of systems of D.E.'s. BIT 8 (1968), 276-278.
8
 
9
DONELSON, J., IiI, AND HANSEN, E Cyclic composite multistep predictor-corrector methods. SIAM J Num. Anal. 9 (1971), 137-157.
 
10
GANTMACHER, F R The Theory of Matrices, Vol. I Chelsea, New York, 1959, pp. 130-145.
 
11
KELLY, L.G. Handbook of Numerical Methods and Applications Addison-Wesley, Reading, Mass., 1967.
 
12
HENRICZ, P. D~screte Vamable Methods zn Ordznary D~fferent~al Equatwns. Wiley, New York, 1962.
 
13
URABE, M. Theory of errors in numerical integration of ordinary differential equations. Tech. Sum Rep 183, US Army Math. Res Ctr, U. of Wisconsin, Madison, Wis., 1960
14
 
15
SLOATE, H.M. Simultaneous implicit formulas for the solution of stiff systems of differential equations. Ph.D. D1ss., Syracuse U, Syracuse, N.Y., 1971.
 
16
 
17
MILLIMAN, L. D., MASSENA, W. A, AND DICKHAUT, R.A. CIRCUS User's Grade. US Army Material Command, Harry Diamond Labs., Washington, D.C.
18
 
19
3RAYTON, R K, GUSTAVSON, F G, AND LINIGER, W. A numerical analysis of the transient behawor of a transistor c~rcmt IBM J Res. Devel 10 (1966), 292-299.


Collaborative Colleagues:
Harry M. Sloate: colleagues
Theodore A. Bickart: colleagues