Pages that link to "Item:Q1210836"

The following pages link to Deterministic and stochastic error bounds in numerical analysis (Q1210836):

Displayed 35 items.

• Simple Monte Carlo and the Metropolis algorithm (Q2465298) ‎ (← links)
• Computation of local radius of information in SM-IBC identification of nonlinear systems (Q2465827) ‎ (← links)
• Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms (Q2472367) ‎ (← links)
• The randomized complexity of initial value problems (Q2483198) ‎ (← links)
• Monte Carlo approximation of weakly singular integral operators (Q2489142) ‎ (← links)
• The randomized information complexity of elliptic PDE (Q2489143) ‎ (← links)
• Optimal algorithms for global optimization in case of unknown Lipschitz constant (Q2489149) ‎ (← links)
• On the complexity of parabolic initial-value problems with variable drift (Q2489153) ‎ (← links)
• A lower bound for the worst-case cubature error on spheres of arbitrary dimension (Q2494379) ‎ (← links)
• Optimal query error of quantum approximation on some Sobolev classes (Q2519327) ‎ (← links)
• The information-based complexity of approximation problem by adaptive Monte Carlo methods (Q2519328) ‎ (← links)
• Improved bounds on the randomized and quantum complexity of initial-value problems (Q2576279) ‎ (← links)
• Optimal lower bounds for cubature error on the sphere \(S^2\) (Q2577528) ‎ (← links)
• Smolyak's algorithm for weighted \(L_1\)-approximation of multivariate functions with bounded \(r\)th mixed derivatives over \(\mathbb R^d\) (Q2583235) ‎ (← links)
• The average error of quadrature formulas for functions of bounded variation (Q2640814) ‎ (← links)
• Hilbert space analysis of Latin Hypercube Sampling (Q2701646) ‎ (← links)
• Average case complexity of multivariate integration (Q3355138) ‎ (← links)
• The power of standard information for multivariate approximation in the randomized setting (Q3426031) ‎ (← links)
• An optimal Monte Carlo algorithm for multivariate Feynman–Kac path integrals (Q3438649) ‎ (← links)
• OPTIMAL POINTWISE APPROXIMATION OF INFINITE-DIMENSIONAL ORNSTEIN–UHLENBECK PROCESSES (Q3548301) ‎ (← links)
• The Monte Carlo Algorithm with a Pseudorandom Generator (Q3987938) ‎ (← links)
• Perspectives on information-based complexity (Q3992024) ‎ (← links)
• Quadrature Formulas for Monotone Functions (Q4005728) ‎ (← links)
• The Monte Carlo Complexity of Fredholm Integral Equations (Q4293967) ‎ (← links)
• High dimensional numerical problems (Q4377209) ‎ (← links)
• Optimal quadrature for Haar wavelet spaces (Q4433131) ‎ (← links)
• Integration and approximation of multivariate functions: average case complexity with isotropic Wiener measure (Q4695332) ‎ (← links)
• On tractability of weighted integration over bounded and unbounded regions in ℝ^{𝕤} (Q4813614) ‎ (← links)
• On strong tractability of weighted multivariate integration (Q4813615) ‎ (← links)
• On the optimal convergence rate of universal and nonuniversal algorithms for multivariate integration and approximation (Q5470052) ‎ (← links)
• Numerical integration and discrepancy, a new approach (Q5852033) ‎ (← links)
• A new algorithm and worst case complexity for Feynman-Kac path integration. (Q5926791) ‎ (← links)
• Quantum complexity of integration (Q5938578) ‎ (← links)
• What is the complexity of surface integration? (Q5946397) ‎ (← links)
• Complexity of neural network approximation with limited information: A worst case approach (Q5946400) ‎ (← links)