On maximal order for local and global numerical problems

DOI10.1016/0022-0000(81)90004-0zbMath0473.65028OpenAlexW2042455758MaRDI QIDQ1158734

Arthur G. Werschulz

Publication date: 1981

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(81)90004-0

zbMATH Keywords

linear informationmaximal orderexistence of nonadaptive linear algorithmslocal quadrature problem

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximal order for quadratures using n evaluations
• Optimal order for approximation of derivatives
• Maximal Order and Order of Information for Numerical Quadrature
• An Order Bound for Runge–Kutta Methods
• On the optimality of linear methods for operator approximation in convex classes of functions

This page was built for publication: On maximal order for local and global numerical problems