Pages that link to "Item:Q1210836"
From MaRDI portal
The following pages link to Deterministic and stochastic error bounds in numerical analysis (Q1210836):
Displaying 50 items.
- Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition (Q2016136) (← links)
- A generalized Hellinger distance for Choquet integral (Q2035261) (← links)
- On optimal recovery in \(L_2\) (Q2041064) (← links)
- Randomized Runge-Kutta method -- stability and convergence under inexact information (Q2041068) (← links)
- Stable high-order randomized cubature formulae in arbitrary dimension (Q2077255) (← links)
- Sampling based approximation of linear functionals in reproducing kernel Hilbert spaces (Q2114113) (← links)
- Sampling discretization and related problems (Q2136857) (← links)
- Optimal randomized quadrature for weighted Sobolev and Besov classes with the Jacobi weight on the ball (Q2171950) (← links)
- Complexity of approximating Hölder classes from information with varying Gaussian noise (Q2192676) (← links)
- Randomized derivative-free Milstein algorithm for efficient approximation of solutions of SDEs under noisy information (Q2199772) (← links)
- Complexity of parametric initial value problems for systems of odes (Q2229039) (← links)
- Bounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothness (Q2238847) (← links)
- Complexity of parametric initial value problems in Banach spaces (Q2251912) (← links)
- Minimal asymptotic error for one-point approximation of SDEs with time-irregular coefficients (Q2255720) (← links)
- Random bit multilevel algorithms for stochastic differential equations (Q2274401) (← links)
- The curse of dimensionality for the class of monotone functions and for the class of convex functions (Q2275488) (← links)
- Convergence analysis of deterministic kernel-based quadrature rules in misspecified settings (Q2291733) (← links)
- Strong convergence rates of probabilistic integrators for ordinary differential equations (Q2302455) (← links)
- A modern retrospective on probabilistic numerics (Q2302460) (← links)
- Information based complexity for high dimensional sparse functions (Q2303421) (← links)
- Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance (Q2325336) (← links)
- Asymptotic normality of extensible grid sampling (Q2329748) (← links)
- Error bounds of MCMC for functions with unbounded stationary variance (Q2344860) (← links)
- Optimal pointwise approximation of SDE's from inexact information (Q2360711) (← links)
- Error bounds in divided difference expansions. A probabilistic perspective (Q2368688) (← links)
- Complexity of Banach space valued and parametric stochastic Itô integration (Q2396717) (← links)
- Embeddings of weighted Hilbert spaces and applications to multivariate and infinite-dimensional integration (Q2404051) (← links)
- A universal algorithm for multivariate integration (Q2407672) (← links)
- Strong approximation of solutions of stochastic differential equations with time-irregular coefficients via randomized Euler algorithm (Q2437367) (← links)
- Weak and quasi-polynomial tractability of approximation of infinitely differentiable functions (Q2442807) (← links)
- On weak tractability of the Clenshaw-Curtis Smolyak algorithm (Q2451171) (← links)
- A note on the complexity and tractability of the heat equation (Q2465287) (← links)
- Simple Monte Carlo and the Metropolis algorithm (Q2465298) (← links)
- Computation of local radius of information in SM-IBC identification of nonlinear systems (Q2465827) (← links)
- Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms (Q2472367) (← links)
- The randomized complexity of initial value problems (Q2483198) (← links)
- Monte Carlo approximation of weakly singular integral operators (Q2489142) (← links)
- The randomized information complexity of elliptic PDE (Q2489143) (← links)
- Optimal algorithms for global optimization in case of unknown Lipschitz constant (Q2489149) (← links)
- On the complexity of parabolic initial-value problems with variable drift (Q2489153) (← links)
- A lower bound for the worst-case cubature error on spheres of arbitrary dimension (Q2494379) (← links)
- Optimal query error of quantum approximation on some Sobolev classes (Q2519327) (← links)
- The information-based complexity of approximation problem by adaptive Monte Carlo methods (Q2519328) (← links)
- Improved bounds on the randomized and quantum complexity of initial-value problems (Q2576279) (← links)
- Optimal lower bounds for cubature error on the sphere \(S^2\) (Q2577528) (← links)
- Smolyak's algorithm for weighted \(L_1\)-approximation of multivariate functions with bounded \(r\)th mixed derivatives over \(\mathbb R^d\) (Q2583235) (← links)
- Complexity of stochastic integration in Sobolev classes (Q2633847) (← links)
- The average error of quadrature formulas for functions of bounded variation (Q2640814) (← links)
- Complexity of Monte Carlo integration for Besov classes on the unit sphere (Q2680637) (← links)
- On the properties of the exceptional set for the randomized Euler and Runge-Kutta schemes (Q2692799) (← links)