Note on blended linear multistep formulas

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Note on blended linear multistep formulas

Full text

Pdf (122 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 12 , Issue 3 (September 1986) table of contents

Pages: 223 - 224

Year of Publication: 1986

ISSN:0098-3500

Authors

Robert D. Skeel	Univ. of Illinois at Urbana-Champaign, Urbana, IL
Thu V. Vu	Univ. of Illinois at Urbana-Champaign, Urbana, IL

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 18, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/7921.7925 What is a DOI?

ABSTRACT

The blended linear multistep methods of Skeel and Kong (1977) are fairly simply expressed in Nordsieck form, but the underlying multistep method turns out to be much more complicated.

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	G. D. Byrne , A. C. Hindmarsh, A Polyalgorithm for the Numerical Solution of Ordinary Differential Equations, ACM Transactions on Mathematical Software (TOMS), v.1 n.1, p.71-96, March 1975 [doi>10.1145/355626.355636]
	2	HENRICl, P. Discrete Variable Methods in Ordinary Di/ferential Equations. Wiley, New York, 1962.
	3	SKEEL, R.D. Equivalent forms of multistep methods. Math. Comput. 33, 1229-1250.
	4	Robert D. Skeel , Antony K. Kong, Blended Linear Multistep Methods, ACM Transactions on Mathematical Software (TOMS), v.3 n.4, p.326-345, Dec. 1977 [doi>10.1145/355759.355762]