scientific article; zbMATH DE number 515830
From MaRDI portal
Publication:4283336
zbMATH Open0794.65005MaRDI QIDQ4283336FDOQ4283336
Authors: Stefan Heinrich 
Publication date: 31 August 1994
Title of this publication is not available (Why is that?)
Recommendations
numerical integrationcomplexityMonte Carlo methodslinear functionalsapproximation of functionsFredholm integral equationsMonte Carlo algorithminformation-based complexity theoryorthogonal spline basis
Monte Carlo methods (65C05) Complexity and performance of numerical algorithms (65Y20) Numerical quadrature and cubature formulas (65D32) Numerical methods for integral equations (65R20) Algorithms for approximation of functions (65D15) Fredholm integral equations (45B05)
Cited In (56)
- Proof of the theory-to-practice gap in deep learning via sampling complexity bounds for neural network approximation spaces
- Neural network approximation and estimation of classifiers with classification boundary in a Barron class
- Sampling complexity of deep approximation spaces
- High dimensional numerical problems
- Approximation with random bases: pro et contra
- Error analysis of a randomized numerical method
- Title not available (Why is that?)
- Solvable integration problems and optimal sample size selection
- A Monte Carlo method for integration of multivariate smooth functions
- Monte Carlo integration of \(C^r\) functions with adaptive variance reduction: an asymptotic analysis
- Randomized approximation of Sobolev embeddings. II
- Randomized approximation of Sobolev embeddings. III
- Title not available (Why is that?)
- The quantum query complexity of elliptic PDE
- Complexity of neural network approximation with limited information: A worst case approach
- A note on level-2 condition numbers
- Error bounds of MCMC for functions with unbounded stationary variance
- Complexity of Monte Carlo integration for Besov classes on the unit sphere
- Monte Carlo complexity of global solution of integral equations
- Optimal linear randomized methods for linear operators in Hilbert spaces
- Quantum complexity of integration
- Deterministic and stochastic error bounds in numerical analysis
- Quantum integration in Sobolev classes
- From Monte Carlo to quantum computation
- Randomized approximation numbers on Besov classes with mixed smoothness
- Monte Carlo complexity of parametric integration
- Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms
- Stable high-order randomized cubature formulae in arbitrary dimension
- Quantum summation with an application to integration.
- Optimal confidence for Monte Carlo integration of smooth functions
- Optimization of projection methods for solving ill-posed problems
- Optimal quadrature for Haar wavelet spaces
- The randomized complexity of indefinite integration
- Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces
- Quantum approximation. II: Sobolev embeddings
- Optimal recovery of Besov classes of generalized smoothness and Sobolev classes on the sphere
- Coin Tossing Algorithms for Integral Equations and Tractability
- Optimal Monte Carlo methods for \(L^2\)-approximation
- A Strong Law of Large Numbers for Scrambled Net Integration
- Recovery of Sobolev functions restricted to iid sampling
- Computational (numerical) diameter in a context of general theory of a recovery
- Optimal randomized quadrature for weighted Sobolev and Besov classes with the Jacobi weight on the ball
- Higher order scrambled digital nets achieve the optimal rate of the root mean square error for smooth integrands
- Title not available (Why is that?)
- Randomized Newton-Raphson
- Multivariate algorithms and information-based complexity
- Integration error for multivariate functions from anisotropic classes
- Random approximation of a general symmetric equation
- My dream quadrature rule
- Exact asymptotic orders of various randomized widths on Besov classes
- Consistency of randomized integration methods
- The complexity of function approximation on Sobolev spaces with bounded mixed derivative by linear Monte Carlo methods
- Variance reduction by means of deterministic computation: Collision estimate
- Some results on the complexity of numerical integration
- Monte Carlo approximation of weakly singular integral operators
- The randomized information complexity of elliptic PDE
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 Q4283336)
