The following pages link to (Q4040428):
Displaying 50 items.
- Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals (Q1996878) (← links)
- A note on Korobov lattice rules for integration of analytic functions (Q1996890) (← links)
- Integration and approximation in cosine spaces of smooth functions (Q1996930) (← links)
- Integral equations and machine learning (Q1997552) (← links)
- Solvable integration problems and optimal sample size selection (Q2001207) (← links)
- Tractability of multivariate approximation over weighted standard Sobolev spaces (Q2001209) (← links)
- Generalized adaptive versus nonadaptive recovery from noisy information (Q2001212) (← links)
- Central configurations in planar \(n\)-body problem with equal masses for \(n=5,6,7\) (Q2005651) (← links)
- On a randomized backward Euler method for nonlinear evolution equations with time-irregular coefficients (Q2007856) (← links)
- Optimal approximation of stochastic integrals in analytic noise model (Q2009523) (← links)
- Computation of the output of a function with fuzzy inputs based on a low-rank tensor approximation (Q2013835) (← links)
- Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition (Q2016136) (← links)
- Tractability for Volterra problems of the second kind with convolution kernels (Q2034562) (← links)
- Randomized Runge-Kutta method -- stability and convergence under inexact information (Q2041068) (← links)
- Estimates of entropy numbers in probabilistic setting (Q2053551) (← links)
- Automatic approximation using asymptotically optimal adaptive interpolation (Q2066201) (← links)
- Complexity and tractability for a class of elliptic partial integro-differential equations (Q2074932) (← links)
- On the randomized Euler schemes for ODEs under inexact information (Q2084257) (← links)
- Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771) (← links)
- On linear spline algorithms of computerized tomography in the space of \(n\)-orbits (Q2101301) (← links)
- On the power of standard information for tractability for \(L_2\)-approximation in the average case setting (Q2121493) (← links)
- Optimal recovery of operator sequences (Q2126894) (← links)
- Sampling discretization and related problems (Q2136857) (← links)
- Optimal global approximation of systems of jump-diffusion SDEs on equidistant mesh (Q2143096) (← links)
- \((s, t)\)-weak tractability of multivariate linear problems in the average case setting (Q2153106) (← links)
- EC-\((t_1,t_2)\)-tractability of approximation in weighted Korobov spaces in the worst case setting (Q2171947) (← links)
- Optimal randomized quadrature for weighted Sobolev and Besov classes with the Jacobi weight on the ball (Q2171950) (← links)
- On the power of standard information for \(\mathbb{L}_2\)-approximation in the average case setting (Q2190474) (← 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)
- Lower bounds for finding stationary points I (Q2205972) (← links)
- On efficient weighted integration via a change of variables (Q2209530) (← links)
- Complexity of parametric initial value problems for systems of odes (Q2229039) (← links)
- Tractability of approximation in the weighted Korobov space in the worst-case setting -- a complete picture (Q2238843) (← links)
- A note on EC-tractability of multivariate approximation in weighted Korobov spaces for the standard information class (Q2238845) (← links)
- Rounding on the standard simplex: regular grids for global optimization (Q2250080) (← links)
- Complexity of parametric initial value problems in Banach spaces (Q2251912) (← links)
- Uniform weak tractability (Q2252048) (← links)
- The cost of deterministic, adaptive, automatic algorithms: cones, not balls (Q2252143) (← links)
- Quasi-polynomial tractability of linear problems in the average case setting (Q2252145) (← links)
- Minimal asymptotic error for one-point approximation of SDEs with time-irregular coefficients (Q2255720) (← links)
- Embeddings for infinite-dimensional integration and \(L_2\)-approximation with increasing smoothness (Q2274409) (← links)
- Absolute value information for IBC problems (Q2283126) (← links)
- Computational (numerical) diameter in a context of general theory of a recovery (Q2287015) (← links)
- Sampling numbers of a class of infinitely differentiable functions (Q2287284) (← links)
- Explicit error bounds for randomized Smolyak algorithms and an application to infinite-dimensional integration (Q2291479) (← links)
- \( \varepsilon \)-superposition and truncation dimensions in average and probabilistic settings for \(\infty \)-variate linear problems (Q2303418) (← links)
- Optimal confidence for Monte Carlo integration of smooth functions (Q2305562) (← links)
- A note on the complexity of a phaseless polynomial interpolation (Q2307487) (← links)
- Hyperbolic cross and the complexity of various classes of ill-posed linear problems (Q2320645) (← links)
