scientific article; zbMATH DE number 193625
From MaRDI portal
Publication:4040428
Recommendations
Cited in
(only showing first 100 items - show all)- Efficient finite-dimensional solution of initial value problems in infinite-dimensional Banach spaces
- Randomized Runge-Kutta method -- stability and convergence under inexact information
- Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information
- An optimal Monte Carlo algorithm for multivariate Feynman–Kac path integrals
- Quadrature Formulas for Monotone Functions
- Average errors for zero finding: Lower bounds for smooth or monotone functions
- \((s, t)\)-weak tractability of multivariate linear problems in the average case setting
- Measures of uncertainty and information in computation
- Computability of solutions of operator equations
- Complexity of operators on compact sets
- On the power of standard information for \(\mathbb{L}_2\)-approximation in the average case setting
- Optimal stochastic quadrature formulas for convex functions
- Randomized derivative-free Milstein algorithm for efficient approximation of solutions of SDEs under noisy information
- Simple characterizations of exponential tractability for linear multivariate problems
- Optimal recovery on the classes of functions with bounded mixed derivative
- Average errors for zero finding: Lower bounds
- On the power of standard information for \(L_{\infty}\) approximation in the randomized setting
- Some basic information on information-based complexity theory
- Quasi-Monte Carlo image synthesis in a nutshell
- Some results on the complexity of numerical integration
- Polya's characterization theorem for complex random variables
- A study on the average case error of composite Newton-Cotes quadratures.
- Complexity of Monte Carlo integration for Besov classes on the unit sphere
- Multivariate integration for analytic functions with Gaussian kernels
- Numerical integration in log-Korobov and log-cosine spaces
- Tractability of quasilinear problems II: Second-order elliptic problems
- Identification in \({\mathcal H}_ \infty\) using Pick's interpolation
- Corrections to Probabilistic analysis of numerical methods for integral equations
- Robust approximate modelling of stable linear systems†
- Linear ill-posed problems are solvable on the average for all Gaussian measures
- Average case complexity of elliptic partial differential equations
- On optimal allocations for estimating the surface of a random field
- ABC on IBC
- On the power of standard information for tractability for \(L_2\)-approximation in the average case setting
- Complexity of approximating Hölder classes from information with varying Gaussian noise
- Tractability of the Fredholm problem of the second kind
- A quasi-fast solver for weakly singular integral equations of the second kind
- Nonlinear system identification in Sobolev spaces
- Sampling discretization and related problems
- Efficient approximate solution of jump-diffusion SDEs via path-dependent adaptive step-size control
- Order-free Recursion on the Real Numbers
- An efficient primal dual prox method for non-smooth optimization
- Worst-case optimality of smoothing algorithms for parametric system identification
- Fast solvers of weakly singular integral equations of the second kind
- Tractability of multivariate approximation over weighted standard Sobolev spaces
- Nonparametric estimation of probability density functions for irregularly observed spatial data
- The complexity of function approximation on Sobolev spaces with bounded mixed derivative by linear Monte Carlo methods
- Near-optimality of linear recovery from indirect observations
- Optimal quadrature formulas for the Sobolev space \(H^1\)
- A stochastically quasi-optimal search algorithm for the maximum of the simple random walk
- Complexity of stochastic integration in Sobolev classes
- Efficient solution of IVPs with right-hand sides having discontinuities on an unknown hypersurface
- Tractability of \(\mathbb{L}_2\)-approximation in hybrid function spaces
- Tractability of \(L_2\)-approximation and integration in weighted Hermite spaces of finite smoothness
- Disintegration of Gaussian measures and average-case optimal algorithms
- Worst case identification of continuous time systems via interpolation
- On applicability of the sparse grid method in the worst case setting
- Complexity of parametric initial value problems in Banach spaces
- Testing linear operators
- Tractability of multivariate integration in hybrid function spaces
- On the optimal convergence rate of universal and nonuniversal algorithms for multivariate integration and approximation
- Optimality properties in finite sample li identification with bounded noise
- Optimal recovery of isotropic classes of twice-differentiable functions defined on \(d\)-dimensional Euclidean space
- Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals
- Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition
- Perspectives on information-based complexity
- Average case optimality
- On tractability of weighted integration over bounded and unbounded regions in ℝ^{𝕤}
- On linear versus nonlinear approximation in the average case setting
- Automatic integration using asymptotically optimal adaptive simpson quadrature
- OPTIMAL POINTWISE APPROXIMATION OF INFINITE-DIMENSIONAL ORNSTEIN–UHLENBECK PROCESSES
- Bernstein numbers and lower bounds for the Monte Carlo error
- The curse of dimensionality for numerical integration on general domains
- scientific article; zbMATH DE number 3972186 (Why is no real title available?)
- The Monte Carlo Algorithm with a Pseudorandom Generator
- Mixed settings for linear problems
- Model quality evaluation in set membership identification
- Optimal recovery of multivariate functions restricted by second-order differential operator
- Monte Carlo methods for uniform approximation on periodic Sobolev spaces with mixed smoothness
- On average complexity of global optimization problems
- The cost of deterministic, adaptive, automatic algorithms: cones, not balls
- Information distance and conditional complexities
- Integral equations and machine learning
- The algorithm designer versus nature: A game-theoretic approach to information-based complexity
- On the quantum and randomized approximation of linear functionals on function spaces
- The average errors for Hermite-Fejér interpolation on the Wiener space
- Invertibility of random fredholm operators
- Optimal Monte Carlo methods for \(L^2\)-approximation
- The complexity of Fredholm equations of the second kind: noisy information about everything
- A new approximate algorithm for the Chebyshev center
- On the optimal recovery of integrals of set-valued functions
- Convergence analysis of central and minimax algorithms in scalar regressor models
- The difficulty of Monte Carlo approximation of multivariate monotone functions
- In Praise of Numerical Computation
- Approximation of infinitely differentiable multivariate functions is not strongly tractable
- The quantum setting with randomized queries for continuous problems
- Determining zeroes of increasing Lipschitz functions
- Parameter choice methods using minimization schemes
- Average case tractability of non-homogeneous tensor product problems with the absolute error criterion
- Exponential Tractability of Linear Tensor Product Problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4040428)
