computational complexitycubature formulasmaximumtopological degreeextremal pointfunction inversefunctional evaluationslinear problems on Hilbert spacesrandom methods
Numerical mathematical programming methods (65K05) Numerical quadrature and cubature formulas (65D32) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Algorithms for approximation of functions (65D15) Degree, winding number (55M25) Numerical solutions to equations with linear operators (65J10)
Recommendations
Cites work
- scientific article; zbMATH DE number 3850380 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A Retrospective and Prospective Survey of the Monte Carlo Method
- An estimate of the mean remainder term in quadrature formulae
- Approximation of linear functionals on a Banach space with a Gaussian measure
- Average complexity for linear operators over bounded domains
- Complexity of computing topological degree of Lipschitz functions in n dimensions
- How powerful is continuous nonlinear information for linear problems?
- Information of varying cardinality
- Stochastic Quadrature Formulas
- The Monte Carlo method
Cited in
(19)- Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition
- Complexity of Banach space valued and parametric stochastic Itô integration
- The algorithm designer versus nature: A game-theoretic approach to information-based complexity
- Randomized approximation of Sobolev embeddings. II
- Infinite-dimensional quadrature and approximation of distributions
- Optimal linear randomized methods for linear operators in Hilbert spaces
- Integration and approximation of multivariate functions: average case complexity with isotropic Wiener measure
- Average case complexity of linear multivariate problems
- Computational complexity of continuous problems
- Approximate evaluations of characteristic polynomials of Boolean functions
- The randomized complexity of indefinite integration
- Liberating the dimension for function approximation and integration
- On the power of standard information for \(L_{\infty}\) approximation in the randomized setting
- Measures of uncertainty and information in computation
- Integration error for multivariate functions from anisotropic classes
- The power of standard information for multivariate approximation in the randomized setting
- Stochastic properties of quadrature formulas
- Average case complexity of linear multivariate problems. II: Applications
- On piecewise-polynomial approximation of functions with a bounded fractional derivative in an \(L_ p\)-norm
This page was built for publication: Randomization for continuous problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122297)
