On maximal order for local and global numerical problems
From MaRDI portal
Publication:1158734
DOI10.1016/0022-0000(81)90004-0zbMath0473.65028MaRDI QIDQ1158734
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
linear information; maximal order; existence of nonadaptive linear algorithms; local quadrature problem
65J05: General theory of numerical analysis in abstract spaces
41A55: Approximate quadratures
65D32: Numerical quadrature and cubature formulas
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