Deterministic and stochastic error bounds in numerical analysis

From MaRDI portal
Revision as of 06:25, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1210836

DOI10.1007/BFB0079792zbMath0656.65047MaRDI QIDQ1210836

Erich Novak

Publication date: 5 June 1993

Published in: Lecture Notes in Mathematics (Search for Journal in Brave)




Related Items (only showing first 100 items - show all)

Optimal pointwise approximation of SDE's from inexact informationSampling discretization and related problemsComplexity of stochastic integration in Sobolev classesOn tractability of weighted integration over bounded and unbounded regions in ℝ^{𝕤}On strong tractability of weighted multivariate integrationThe average error of quadrature formulas for functions of bounded variationPerspectives on information-based complexityKolmogorov and Linear Widths on Generalized Besov Classes in the Monte Carlo SettingThe curse of dimensionality for numerical integration of smooth functionsEfficient Approximation of SDEs Driven by Countably Dimensional Wiener Process and Poisson Random MeasureComplexity of Banach Space Valued and Parametric IntegrationComplexity of Banach space valued and parametric stochastic Itô integrationOn the randomized complexity of Banach space valued integrationEmbeddings of weighted Hilbert spaces and applications to multivariate and infinite-dimensional integrationOptimal randomized quadrature for weighted Sobolev and Besov classes with the Jacobi weight on the ballA universal algorithm for multivariate integrationA Monte Carlo Method for Integration of Multivariate Smooth FunctionsExistence, uniqueness and approximation of solutions to Carathéodory delay differential equationsAsymptotic Bounds for Smoothness Parameter Estimates in Gaussian Process InterpolationEuler scheme for approximation of solution of nonlinear ODEs under inexact informationRecovery of Sobolev functions restricted to iid samplingComponent-by-component construction of randomized rank-1 lattice rules achieving almost the optimal randomized error rateComplexity of Monte Carlo integration for Besov classes on the unit sphereSome Results on the Complexity of Numerical IntegrationComplexity of approximating Hölder classes from information with varying Gaussian noiseOptimal approximation of infinite-dimensional holomorphic functionsHigher-Order Monte Carlo through Cubic StratificationRandomized complexity of parametric integration and the role of adaption. I: Finite dimensional caseRandomized derivative-free Milstein algorithm for efficient approximation of solutions of SDEs under noisy informationOn the properties of the exceptional set for the randomized Euler and Runge-Kutta schemesRandomized approximation numbers on Besov classes with mixed smoothnessConsistency of randomized integration methodsOn the Power of Restricted Monte Carlo AlgorithmsMaximum Likelihood Estimation and Uncertainty Quantification for Gaussian Process Approximation of Deterministic FunctionsStrong approximation of solutions of stochastic differential equations with time-irregular coefficients via randomized Euler algorithmSampling discretization of the uniform normMultivariate Approximation in Downward Closed Polynomial SpacesOn the Complexity of Parametric ODEs and Related ProblemsHilbert space analysis of Latin Hypercube SamplingWeak and quasi-polynomial tractability of approximation of infinitely differentiable functionsOn sub-polynomial lower error bounds for quadrature of SDEs with bounded smooth coefficientsOn weak tractability of the Clenshaw-Curtis Smolyak algorithmOPTIMAL POINTWISE APPROXIMATION OF INFINITE-DIMENSIONAL ORNSTEIN–UHLENBECK PROCESSESComplexity of parametric initial value problems for systems of odesA note on the complexity and tractability of the heat equationSimple Monte Carlo and the Metropolis algorithmComputation of local radius of information in SM-IBC identification of nonlinear systemsBounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothnessHigh dimensional numerical problemsOptimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithmsThe Monte Carlo Algorithm with a Pseudorandom GeneratorComplexity of parametric initial value problems in Banach spacesA new algorithm and worst case complexity for Feynman-Kac path integration.Minimal asymptotic error for one-point approximation of SDEs with time-irregular coefficientsThe Monte Carlo Complexity of Fredholm Integral EquationsThe randomized complexity of initial value problemsQuadrature Formulas for Monotone FunctionsDiscontinuous information in the worst case and randomized settingsMonte Carlo approximation of weakly singular integral operatorsThe randomized information complexity of elliptic PDEOptimal algorithms for global optimization in case of unknown Lipschitz constantOn the complexity of parabolic initial-value problems with variable driftQuantum complexity of integrationA lower bound for the worst-case cubature error on spheres of arbitrary dimensionWhat is the complexity of surface integration?Complexity of neural network approximation with limited information: A worst case approachRandom bit multilevel algorithms for stochastic differential equationsThe curse of dimensionality for the class of monotone functions and for the class of convex functionsThe power of adaption for approximating functions with singularitiesAverage case complexity of multivariate integrationTractability of the approximation of high-dimensional rank one tensorsIntegration and approximation of multivariate functions: average case complexity with isotropic Wiener measureOptimal quadrature for Haar wavelet spacesOn optimal recovery in \(L_2\)Randomized Runge-Kutta method -- stability and convergence under inexact informationConvergence analysis of deterministic kernel-based quadrature rules in misspecified settingsOptimal query error of quantum approximation on some Sobolev classesThe information-based complexity of approximation problem by adaptive Monte Carlo methodsOn the optimal convergence rate of universal and nonuniversal algorithms for multivariate integration and approximationStrong convergence rates of probabilistic integrators for ordinary differential equationsA modern retrospective on probabilistic numericsInformation based complexity for high dimensional sparse functionsNonparametric Estimation of Probability Density Functions for Irregularly Observed Spatial DataNUMERICAL VALIDATION OF PROBABILISTIC LAWS TO EVALUATE FINITE ELEMENT ERROR ESTIMATESStable high-order randomized cubature formulae in arbitrary dimensionSharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distanceUnnamed ItemAsymptotic normality of extensible grid samplingNumerical integration and discrepancy, a new approachThe power of standard information for multivariate approximation in the randomized settingImproved bounds on the randomized and quantum complexity of initial-value problemsOptimal lower bounds for cubature error on the sphere \(S^2\)Constructive Quantization and Multilevel Algorithms for Quadrature of Stochastic Differential EquationsSmolyak'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 varianceAn optimal Monte Carlo algorithm for multivariate Feynman–Kac path integralsDiscrepancy Theory and Quasi-Monte Carlo IntegrationHyper-Gaussian regularized Whittaker–Kotel’nikov–Shannon sampling seriesSampling based approximation of linear functionals in reproducing kernel Hilbert spacesMonte Carlo integration of \(C^r\) functions with adaptive variance reduction: an asymptotic analysis







This page was built for publication: Deterministic and stochastic error bounds in numerical analysis