The power of adaptive algorithms for functions with singularities

DOI10.1007/s11784-009-0121-xzbMath1213.65047OpenAlexW2001334190MaRDI QIDQ2431380

Leszek Plaskota, Grzegorz W. Wasilkowski

Publication date: 13 April 2011

Published in: Journal of Fixed Point Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11784-009-0121-x

zbMATH Keywords

samplingcomplexityconvergencesingularitiesnumerical examplesadaptive algorithmsworst case errorsfunction approximation and integration

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25) Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32) Complexity and performance of numerical algorithms (65Y20)

Related Items (12)

Adaptive mesh selection asymptotically guarantees a prescribed local error for systems of initial value problems ⋮ High order approximation to non-smooth multivariate functions ⋮ Optimality of Euler-type algorithms for approximation of stochastic differential equations with discontinuous coefficients ⋮ Optimal solution of a class of non-autonomous initial-value problems with unknown singularities ⋮ Some Results on the Complexity of Numerical Integration ⋮ Strong approximation of solutions of stochastic differential equations with time-irregular coefficients via randomized Euler algorithm ⋮ Solving systems of IVPs with discontinuous derivatives-numerical experiments ⋮ Adaptive mesh point selection for the efficient solution of scalar IVPs ⋮ Optimal adaptive solution of piecewise regular systems of IVPs with unknown switching hypersurface ⋮ Adaptive Itô-Taylor algorithm can optimally approximate the Itô integrals of singular functions ⋮ Algebraic Fourier reconstruction of piecewise smooth functions ⋮ Construction of nonlinear approximation schemes for piecewise smooth data

This page was built for publication: The power of adaptive algorithms for functions with singularities