The following pages link to (Q4389411):
Displaying 34 items.
- Optimal recovery of integral operators and its applications (Q290799) (← links)
- Adaptive parameter choice for one-sided finite difference schemes and its application in diabetes technology (Q454822) (← links)
- Tractability of infinite-dimensional integration in the worst case and randomized settings (Q647921) (← links)
- Linear algorithms for recovering linear functionals from jittered information (Q652453) (← links)
- One-dimensional global optimization for observations with noise (Q814080) (← links)
- Optimal recovery of operators and multidimensional Carlson type inequalities (Q895984) (← links)
- Approximation of piecewise Hölder functions from inexact information (Q895991) (← links)
- Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces (Q935068) (← links)
- On the power of standard information for multivariate approximation in the worst case setting (Q1019157) (← links)
- New averaging technique for approximating weighted integrals (Q1023278) (← links)
- Average case \(L_\infty\)-approximation in the presence of Gaussian noise (Q1266109) (← links)
- Approximating band- and energy-limited signals in the presence of jitter (Q1279914) (← links)
- Why does information-based complexity use the real number model? (Q1292417) (← links)
- The complexity of indefinite elliptic problems with noisy data (Q1383441) (← links)
- Efficient approximation schemes for economic lot-sizing in continuous time (Q1751154) (← links)
- Information-based nonlinear approximation: an average case setting (Q1772685) (← links)
- Where does smoothness count the most for Fredholm equations of the second kind with noisy information? (Q1887113) (← links)
- Generalized adaptive versus nonadaptive recovery from noisy information (Q2001212) (← links)
- Optimal approximation of stochastic integrals in analytic noise model (Q2009523) (← links)
- Randomized Runge-Kutta method -- stability and convergence under inexact information (Q2041068) (← 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)
- Absolute value information for IBC problems (Q2283126) (← links)
- A note on the complexity of a phaseless polynomial interpolation (Q2307487) (← links)
- Optimal pointwise approximation of SDE's from inexact information (Q2360711) (← links)
- ABC on IBC (Q2422730) (← links)
- Optimal recovery of solutions of the generalized heat equation in the unit ball from inaccurate data (Q2465296) (← links)
- Disintegration of Gaussian measures and average-case optimal algorithms (Q2465308) (← links)
- Computability of Solutions of Operator Equations (Q4921442) (← links)
- Optimal Recovery of Monotone Operators in Partially Ordered <i>L</i>-Spaces (Q5119512) (← links)
- Complexity of neural network approximation with limited information: A worst case approach (Q5946400) (← links)
- Euler scheme for approximation of solution of nonlinear ODEs under inexact information (Q6064949) (← links)
- Optimal recovery and generalized Carlson inequality for weights with symmetry properties (Q6154549) (← links)
- Optimal recovery of linear operators from information of random functions (Q6649714) (← links)
