Optimal linear randomized methods for linear operators in Hilbert spaces
From MaRDI portal
Publication:1190530
DOI10.1016/0885-064X(92)90032-7zbMath0754.65049MaRDI QIDQ1190530
Publication date: 26 September 1992
Published in: Journal of Complexity (Search for Journal in Brave)
Hilbert spacesMonte Carlo methodslinear operatorsinformation-based complexityrandomized methods\(s\)-numberslinear stochastic \(n\)-widths
Monte Carlo methods (65C05) Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50) Complexity and performance of numerical algorithms (65Y20)
Related Items
The quantum setting with randomized queries for continuous problems ⋮ Liberating the Dimension for Function Approximation and Integration ⋮ Bernstein Numbers and Lower Bounds for the Monte Carlo Error ⋮ Optimal Monte Carlo methods for \(L^2\)-approximation ⋮ Discontinuous information in the worst case and randomized settings ⋮ Optimal algorithms for diagonal operators on N-widths in different computational setting ⋮ Approximation characteristics for diagonal operators in different computational settings ⋮ On the power of standard information for \(L_{\infty}\) approximation in the randomized setting ⋮ Linear average and stochastic \(n\)-widths of Besov embeddings on Lipschitz domains ⋮ The power of standard information for multivariate approximation in the randomized setting
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- s-numbers in information-based complexity
- Can adaption help on the average?
- Average case optimality for linear problems
- Randomization for continuous problems
- Random approximation of Sobolev embeddings
- Deterministic and stochastic error bounds in numerical analysis
- DIAMETERS OF SETS IN NORMED LINEAR SPACES AND THE APPROXIMATION OF FUNCTIONS BY TRIGONOMETRIC POLYNOMIALS
This page was built for publication: Optimal linear randomized methods for linear operators in Hilbert spaces
