Deterministic and stochastic error bounds in numerical analysis
From MaRDI portal
Publication:1210836
DOI10.1007/BFb0079792zbMath0656.65047MaRDI QIDQ1210836
Publication date: 5 June 1993
Published in: Lecture Notes in Mathematics (Search for Journal in Brave)
optimizationapproximationMonte Carlo methodsquadratureoptimal algorithmsaverage errorstochastic error boundsdeterministic error boundsmaximal errors
Monte Carlo methods (65C05) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx) Error analysis and interval analysis (65Gxx)
Related Items
Optimal pointwise approximation of SDE's from inexact information, Sampling discretization and related problems, Complexity of stochastic integration in Sobolev classes, On tractability of weighted integration over bounded and unbounded regions in 鈩漗{饾暏}, On strong tractability of weighted multivariate integration, The average error of quadrature formulas for functions of bounded variation, Perspectives on information-based complexity, Kolmogorov and Linear Widths on Generalized Besov Classes in the Monte Carlo Setting, The curse of dimensionality for numerical integration of smooth functions, Efficient Approximation of SDEs Driven by Countably Dimensional Wiener Process and Poisson Random Measure, Complexity of Banach Space Valued and Parametric Integration, Complexity of Banach space valued and parametric stochastic It么 integration, On the randomized complexity of Banach space valued integration, Embeddings of weighted Hilbert spaces and applications to multivariate and infinite-dimensional integration, Optimal randomized quadrature for weighted Sobolev and Besov classes with the Jacobi weight on the ball, A universal algorithm for multivariate integration, A Monte Carlo Method for Integration of Multivariate Smooth Functions, Existence, uniqueness and approximation of solutions to Carath茅odory delay differential equations, Asymptotic Bounds for Smoothness Parameter Estimates in Gaussian Process Interpolation, Euler scheme for approximation of solution of nonlinear ODEs under inexact information, Recovery of Sobolev functions restricted to iid sampling, Component-by-component construction of randomized rank-1 lattice rules achieving almost the optimal randomized error rate, Complexity of Monte Carlo integration for Besov classes on the unit sphere, Some Results on the Complexity of Numerical Integration, Complexity of approximating H枚lder classes from information with varying Gaussian noise, Optimal approximation of infinite-dimensional holomorphic functions, Higher-Order Monte Carlo through Cubic Stratification, Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case, Randomized derivative-free Milstein algorithm for efficient approximation of solutions of SDEs under noisy information, On the properties of the exceptional set for the randomized Euler and Runge-Kutta schemes, Randomized approximation numbers on Besov classes with mixed smoothness, Consistency of randomized integration methods, On the Power of Restricted Monte Carlo Algorithms, Maximum Likelihood Estimation and Uncertainty Quantification for Gaussian Process Approximation of Deterministic Functions, Strong approximation of solutions of stochastic differential equations with time-irregular coefficients via randomized Euler algorithm, Sampling discretization of the uniform norm, Multivariate Approximation in Downward Closed Polynomial Spaces, On the Complexity of Parametric ODEs and Related Problems, Hilbert space analysis of Latin Hypercube Sampling, Weak and quasi-polynomial tractability of approximation of infinitely differentiable functions, On sub-polynomial lower error bounds for quadrature of SDEs with bounded smooth coefficients, On weak tractability of the Clenshaw-Curtis Smolyak algorithm, OPTIMAL POINTWISE APPROXIMATION OF INFINITE-DIMENSIONAL ORNSTEIN鈥揢HLENBECK PROCESSES, Complexity of parametric initial value problems for systems of odes, A note on the complexity and tractability of the heat equation, Simple Monte Carlo and the Metropolis algorithm, Computation of local radius of information in SM-IBC identification of nonlinear systems, Bounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothness, High dimensional numerical problems, Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms, The Monte Carlo Algorithm with a Pseudorandom Generator, Complexity of parametric initial value problems in Banach spaces, A new algorithm and worst case complexity for Feynman-Kac path integration., Minimal asymptotic error for one-point approximation of SDEs with time-irregular coefficients, The Monte Carlo Complexity of Fredholm Integral Equations, The randomized complexity of initial value problems, Quadrature Formulas for Monotone Functions, Discontinuous information in the worst case and randomized settings, Monte Carlo approximation of weakly singular integral operators, The randomized information complexity of elliptic PDE, Optimal algorithms for global optimization in case of unknown Lipschitz constant, On the complexity of parabolic initial-value problems with variable drift, Quantum complexity of integration, A lower bound for the worst-case cubature error on spheres of arbitrary dimension, What is the complexity of surface integration?, Complexity of neural network approximation with limited information: A worst case approach, Random bit multilevel algorithms for stochastic differential equations, The curse of dimensionality for the class of monotone functions and for the class of convex functions, The power of adaption for approximating functions with singularities, Average case complexity of multivariate integration, Tractability of the approximation of high-dimensional rank one tensors, Integration and approximation of multivariate functions: average case complexity with isotropic Wiener measure, Optimal quadrature for Haar wavelet spaces, On optimal recovery in \(L_2\), Randomized Runge-Kutta method -- stability and convergence under inexact information, Convergence analysis of deterministic kernel-based quadrature rules in misspecified settings, Optimal query error of quantum approximation on some Sobolev classes, The information-based complexity of approximation problem by adaptive Monte Carlo methods, On the optimal convergence rate of universal and nonuniversal algorithms for multivariate integration and approximation, Strong convergence rates of probabilistic integrators for ordinary differential equations, A modern retrospective on probabilistic numerics, Information based complexity for high dimensional sparse functions, Nonparametric Estimation of Probability Density Functions for Irregularly Observed Spatial Data, NUMERICAL VALIDATION OF PROBABILISTIC LAWS TO EVALUATE FINITE ELEMENT ERROR ESTIMATES, Stable high-order randomized cubature formulae in arbitrary dimension, Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance, Unnamed Item, Asymptotic normality of extensible grid sampling, Numerical integration and discrepancy, a new approach, The power of standard information for multivariate approximation in the randomized setting, Improved bounds on the randomized and quantum complexity of initial-value problems, Optimal lower bounds for cubature error on the sphere \(S^2\), Constructive Quantization and Multilevel Algorithms for Quadrature of Stochastic Differential Equations, Smolyak's algorithm for weighted \(L_1\)-approximation of multivariate functions with bounded \(r\)th mixed derivatives over \(\mathbb R^d\), Error bounds of MCMC for functions with unbounded stationary variance, An optimal Monte Carlo algorithm for multivariate Feynman鈥揔ac path integrals, Discrepancy Theory and Quasi-Monte Carlo Integration, Hyper-Gaussian regularized Whittaker鈥揔otel鈥檔ikov鈥揝hannon sampling series, Sampling based approximation of linear functionals in reproducing kernel Hilbert spaces, Monte Carlo integration of \(C^r\) functions with adaptive variance reduction: an asymptotic analysis, Sampling discretization error of integral norms for function classes with small smoothness, Lower Bounds for the Number of Random Bits in Monte Carlo Algorithms, Sample Size Estimates for Risk-Neutral Semilinear PDE-Constrained Optimization, From Monte Carlo to quantum computation, Optimal sampling points in reproducing kernel Hilbert spaces, Randomized and quantum complexity of nonlinear two-point BVPs, Optimal stochastic quadrature formulas for convex functions, Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces, Where does smoothness count the most for Fredholm equations of the second kind with noisy information?, Lower bound on complexity of optimization of continuous functions, Set membership identification of nonlinear systems, Infinite-dimensional quadrature and approximation of distributions, Uniform recovery of high-dimensional \(C^r\)-functions, The price of pessimism for multidimensional quadrature, Complexity of weighted approximation over \(\mathbb{R}^d\), The quantum setting with randomized queries for continuous problems, The quantum query complexity of elliptic PDE, Integration and \(L_ 2\)-approximation: Average case setting with isotropic Wiener measure for smooth functions, Product rules are optimal for numerical integration in classical smoothness spaces, Approximation of infinitely differentiable multivariate functions is not strongly tractable, Global optimization in clustering using hyperbolic cross points, The complexity of Fredholm equations of the second kind: noisy information about everything, Construction of interlaced scrambled polynomial lattice rules of arbitrary high order, Lower bounds for the complexity of linear functionals in the randomized setting, Optimal adaptive sampling recovery, On a problem in quantum summation., Optimal algorithms for doubly weighted approximation of univariate functions, Quadrature for self-affine distributions on \(\mathbb R^d\), Optimal recovery of Besov classes of generalized smoothness and Sobolev classes on the sphere, Approximation of piecewise H枚lder functions from inexact information, Cubature formulas, discrepancy, and nonlinear approximation, My dream quadrature rule, Open problems for tractability of multivariate integration., Average error bounds of trigonometric approximation on periodic Wiener spaces, Higher order scrambled digital nets achieve the optimal rate of the root mean square error for smooth integrands, Unified set membership theory for identification, prediction and filtering of nonlinear systems, A construction of polynomial lattice rules with small gain coefficients, Stochastic comparisons of stratified sampling techniques for some Monte Carlo estimators, Tractability of infinite-dimensional integration in the worst case and randomized settings, B-spline quasi-interpolant representations and sampling recovery of functions with mixed smoothness, Intractability results for positive quadrature formulas and extremal problems for trigonometric polynomials, Monte Carlo complexity of parametric integration, Complexity of parametric integration in various smoothness classes, A survey of average case complexity for linear multivariate problems, Integration error for multivariate functions from anisotropic classes, Random bit quadrature and approximation of distributions on Hilbert spaces, A study on the average case error of composite Newton-Cotes quadratures., Complexity of oscillatory integration for univariate Sobolev spaces, On the complexity of computing quadrature formulas for marginal distributions of SDEs, The complexity of function approximation on Sobolev spaces with bounded mixed derivative by linear Monte Carlo methods, Random approximation of Sobolev embeddings, Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces, Complexity of weighted approximation over \(\mathbb{R}\), Corrections to Probabilistic analysis of numerical methods for integral equations, Lattice rules with random \(n\) achieve nearly the optimal \(\mathcal{O}(n^{-\alpha-1/2})\) error independently of the dimension, The complexity of optimizing over a simplex, hypercube or sphere: a short survey, Optimal linear randomized methods for linear operators in Hilbert spaces, Adaptive approximation of the minimum of Brownian motion, The convergence rate of the sandwich algorithm for approximating convex functions, On average complexity of global optimization problems, On convergence rate of a rectangular partition based global optimization algorithm, Lower bounds for the complexity of Monte Carlo function approximation, Function approximation and integration on the Wiener space with noisy data, Algorithms and complexity for functions on general domains, Average case complexity of linear multivariate problems. I: Theory, Average case complexity of linear multivariate problems. II: Applications, Solvable integration problems and optimal sample size selection, On a randomized backward Euler method for nonlinear evolution equations with time-irregular coefficients, What is the complexity of volume calculation?, On the randomized solution of initial value problems, The randomized complexity of indefinite integration, On the quantum and randomized approximation of linear functionals on function spaces, Linear vs. nonlinear algorithms for linear problems, Randomized and quantum algorithms yield a speed-up for initial-value problems, Probabilistic and average widths of multivariate Sobolev spaces with mixed derivative equipped with the Gaussian measure, Computation of the output of a function with fuzzy inputs based on a low-rank tensor approximation, A note on level-2 condition numbers, Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition, Adaptive It么-Taylor algorithm can optimally approximate the It么 integrals of singular functions, Computational complexity of the integration problem for anisotropic classes, Multi-level Monte Carlo algorithms for infinite-dimensional integration on \(\mathbb R^{\mathbb N}\), Average-case results for zero finding, Breaking the curse for uniform approximation in Hilbert spaces via Monte Carlo methods, On the complexity of computing the \(L_q\) norm, A generalized Hellinger distance for Choquet integral, Randomized approximation of Sobolev embeddings. II, Randomized approximation of Sobolev embeddings. III, Recovery algorithms for high-dimensional rank one tensors, Non-linear sampling recovery based on quasi-interpolant wavelet representations, On the power of standard information for multivariate approximation in the worst case setting, Monte Carlo complexity of global solution of integral equations, New averaging technique for approximating weighted integrals, What Monte Carlo models can do and cannot do efficiently?, Optimal recovery on the classes of functions with bounded mixed derivative, Spatial shape-preserving interpolation using \(\nu\)-splines, On the power of standard information for \(L_{\infty}\) approximation in the randomized setting, Delayed curse of dimension for Gaussian integration, Spatial adaption for predicting random functions, Quantum summation with an application to integration., Worst case complexity of weighted approximation and integration over \(\mathbb{R}^d\), Determining zeroes of increasing Lipschitz functions, Probabilistic analysis of numerical methods for integral equations, On piecewise-polynomial approximation of functions with a bounded fractional derivative in an \(L_ p\)-norm