Maximal Order and Order of Information for Numerical Quadrature

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Maximal Order and Order of Information for Numerical Quadrature

Full text

Pdf (533 KB)

Source

Journal of the ACM (JACM) archive
Volume 26 , Issue 3 (July 1979) table of contents

Pages: 527 - 537

Year of Publication: 1979

ISSN:0004-5411

Author

Arthur G. Werschulz

Department of Mathematics, University of Maryland, Baltimore County, 5401 Wilkens Avenue, Baltimore, MD

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 17, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

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/322139.322149 What is a DOI?

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	BUTCHER, J C An order bound for Runge-Kutta methods SIAM J Numer Anal 12 (1975), 304-315
	2	GHIZZETTI, A, AND OSSICINI, A Quadrature Formulas Academic Press, New York, 1970
	3	HENRICl, P Dtscrete Variable Methods m Ordinary Dtfferenttal Equattons Wiley, New York, 1962
	4	H. T. Kung , J. F. Traub, Optimal Order of One-Point and Multipoint Iteration, Journal of the ACM (JACM), v.21 n.4, p.643-651, Oct. 1974 [doi>10.1145/321850.321860]
	5	MEERSMAN, R On maximal order of famdms of iterations for nonlinear equations Doct Th, Vnje Untversttett Brussei, Brussels, Belgtum, 1976
	6	RALSTON, A A First Course m Numerical Analysts McGraw-Hall, New York, 1969
	7	SZEOO, G Orthogonal Polynomtals Amer Math Soc Colloquium Pubhcauons, Vol XXIII, Amer Math Soc, Providence, R 1, 1939
	8	TRAUB, J F. Iteranve Methods for the Solutton of Equations Prentice-Hall, Englewood Chffs, N.J, 1964
	9	TRAUB, J F, AND WO2~NIAKOWSKI, H Strict lower and upper bounds on ~teratlve computaaonal complexity in Analytic Computattonal Complexity, J F Traub, Ed, Academic Press, New York, 1976, pp 15-34
	10	WERSCHULZ, A G Computational complexity of one-step methods for a scalar autonomous dlfferenttal equatton Rep, Comptr Sc~ Dept, Carneg~e-Mellon U, Pmsburgh, Pa, 1976
	11	WO~NIAKOWSKI, H Generahzed mformauon and maximal order of iteration for operator equations SIAM J Numer Anal 12 (1975), 121-135