scientific article; zbMATH DE number 515830
From MaRDI portal
Publication:4283336
zbMath0794.65005MaRDI QIDQ4283336
Publication date: 31 August 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexitynumerical integrationFredholm integral equationsMonte Carlo algorithmMonte Carlo methodslinear functionalsapproximation of functionsinformation-based complexity theoryorthogonal spline basis
Monte Carlo methods (65C05) Numerical methods for integral equations (65R20) Algorithms for approximation of functions (65D15) Numerical quadrature and cubature formulas (65D32) Fredholm integral equations (45B05) Complexity and performance of numerical algorithms (65Y20)
Related Items (43)
From Monte Carlo to quantum computation ⋮ Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces ⋮ Quantum approximation. II: Sobolev embeddings ⋮ Optimization of projection methods for solving ill-posed problems ⋮ The quantum query complexity of elliptic PDE ⋮ Optimal randomized quadrature for weighted Sobolev and Besov classes with the Jacobi weight on the ball ⋮ A Monte Carlo Method for Integration of Multivariate Smooth Functions ⋮ Quantum integration in Sobolev classes ⋮ Recovery of Sobolev functions restricted to iid sampling ⋮ Complexity of Monte Carlo integration for Besov classes on the unit sphere ⋮ Exact asymptotic orders of various randomized widths on Besov classes ⋮ Optimal recovery of Besov classes of generalized smoothness and Sobolev classes on the sphere ⋮ Some Results on the Complexity of Numerical Integration ⋮ My dream quadrature rule ⋮ Monte Carlo integration of \(C^r\) functions with adaptive variance reduction: an asymptotic analysis ⋮ Neural network approximation and estimation of classifiers with classification boundary in a Barron class ⋮ Randomized approximation numbers on Besov classes with mixed smoothness ⋮ Consistency of randomized integration methods ⋮ Higher order scrambled digital nets achieve the optimal rate of the root mean square error for smooth integrands ⋮ Monte Carlo complexity of parametric integration ⋮ Integration error for multivariate functions from anisotropic classes ⋮ 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 ⋮ Optimal Monte Carlo methods for \(L^2\)-approximation ⋮ High dimensional numerical problems ⋮ Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms ⋮ Solvable integration problems and optimal sample size selection ⋮ The randomized complexity of indefinite integration ⋮ Monte Carlo approximation of weakly singular integral operators ⋮ The randomized information complexity of elliptic PDE ⋮ Quantum complexity of integration ⋮ A note on level-2 condition numbers ⋮ Complexity of neural network approximation with limited information: A worst case approach ⋮ Computational (numerical) diameter in a context of general theory of a recovery ⋮ Randomized approximation of Sobolev embeddings. II ⋮ Randomized approximation of Sobolev embeddings. III ⋮ Optimal quadrature for Haar wavelet spaces ⋮ Optimal confidence for Monte Carlo integration of smooth functions ⋮ Monte Carlo complexity of global solution of integral equations ⋮ A Strong Law of Large Numbers for Scrambled Net Integration ⋮ Stable high-order randomized cubature formulae in arbitrary dimension ⋮ Error bounds of MCMC for functions with unbounded stationary variance ⋮ Quantum summation with an application to integration.
This page was built for publication:
