Abstract
We propose and analyze two algorithms for multiple integration and L1-approximation of functions \(f:[0,1]^s \to \mathbb{R}\) that have bounded mixed derivatives of order 2. The algorithms are obtained by applying Smolyak's construction (see [8]) to one-dimensional composite midpoint rules (for integration) and to one-dimensional piecewise linear interpolation algorithm (for L1-approximation). Denoting by n the number of function evaluations used, the worst case error of the obtained Smolyak's cubature is asymptotically bounded from above by $$\frac{{16\pi ^2 s}}{{3(s - 1)((s - 2)!)^3 }} \cdot \frac{{(\log _2 n)^{3(s - 1)} }}{{n^2 }} \cdot (1 + o(1))$$ as n→∞. The error of the corresponding algorithm for L1-approximation is bounded by the same expression multiplied by 4s−1.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.