On maximal order for local and global numerical problems

DOI10.1016/0022-0000(81)90004-0MaRDI QIDQ1158734zbMATH OpenOpenAlexFDO

Authors A. 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

existence of nonadaptive linear algorithmslinear informationlocal quadrature problemmaximal order

Mathematics Subject Classification ID

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

Cites work

• An Order Bound for Runge–Kutta Methods
• scientific article; zbMATH DE number 3688714 (Why is no real title available?)
• scientific article; zbMATH DE number 3635377 (Why is no real title available?)
• scientific article; zbMATH DE number 3182507 (Why is no real title available?)
• Maximal Order and Order of Information for Numerical Quadrature
• Maximal order for quadratures using n evaluations
• On the optimality of linear methods for operator approximation in convex classes of functions
• Optimal order for approximation of derivatives

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1158734)