Information of varying cardinality
Journal of Complexity
Information-based complexity
On the complexity of stochastic integration
Mathematics of Computation
Optimal adaptive solution of initial-value problems with unknown singularities
Journal of Complexity
Uniform Approximation of Piecewise r-Smooth and Globally Continuous Functions
SIAM Journal on Numerical Analysis
Improved bounds on the randomized and quantum complexity of initial-value problems
Journal of Complexity
Journal of Computational and Applied Mathematics
Optimal solution of a class of non-autonomous initial-value problems with unknown singularities
Journal of Computational and Applied Mathematics
Hi-index | 7.29 |
We deal with numerical approximation of stochastic Ito integrals of singular functions. We first consider the regular case of integrands belonging to the Holder class with parameters r and @r. We show that in this case the classical Ito-Taylor algorithm has the optimal error @Q(n^-^(^r^+^@r^)). In the singular case, we consider a class of piecewise regular functions that have continuous derivatives, except for a finite number of unknown singular points. We show that any nonadaptive algorithm cannot efficiently handle such a problem, even in the case of a single singularity. The error of such algorithm is no less than n^-^m^i^n^{^1^/^2^,^r^+^@r^}. Therefore, we must turn to adaptive algorithms. We construct the adaptive Ito-Taylor algorithm that, in the case of at most one singularity, has the optimal error O(n^-^(^r^+^@r^)). The best speed of convergence, known for regular functions, is thus preserved. For multiple singularities, we show that any adaptive algorithm has the error @W(n^-^m^i^n^{^1^/^2^,^r^+^@r^}), and this bound is sharp.