s-numbers in information-based complexity
From MaRDI portal
Publication:757049
The paper gives a detailed analysis of various approximate methods for solving linear problems in the sense of information-based complexity. It is focused on the situations in which different classes yield the same error, and the maximal differences in the errors of different classes. These are treated in the worst case and average case settings.
Recommendations
Cites work
- Approximation of linear functionals on a Banach space with a Gaussian measure
- Average case optimality for linear problems
- Can adaption help on the average?
- Continuous selections. I
- Estimating the quality of computational algorithms. I
- Estimating the quality of computational algorithms. II
- Gaussian measures in Banach spaces
- HILBERT-Zahlen von Operatoren in BANACHräumen
- How powerful is continuous nonlinear information for linear problems?
- scientific article; zbMATH DE number 3834323 (Why is no real title available?)
- scientific article; zbMATH DE number 3877692 (Why is no real title available?)
- scientific article; zbMATH DE number 3977739 (Why is no real title available?)
- scientific article; zbMATH DE number 3665124 (Why is no real title available?)
- scientific article; zbMATH DE number 3688714 (Why is no real title available?)
- scientific article; zbMATH DE number 3751600 (Why is no real title available?)
- scientific article; zbMATH DE number 44104 (Why is no real title available?)
- scientific article; zbMATH DE number 3476334 (Why is no real title available?)
- scientific article; zbMATH DE number 3551404 (Why is no real title available?)
- scientific article; zbMATH DE number 3620605 (Why is no real title available?)
- scientific article; zbMATH DE number 3996455 (Why is no real title available?)
- scientific article; zbMATH DE number 3806598 (Why is no real title available?)
- scientific article; zbMATH DE number 3447547 (Why is no real title available?)
- scientific article; zbMATH DE number 3245885 (Why is no real title available?)
- Linear problems (with extended range) have linear optimal algorithms
- Orthogonal projections are optimal algorithms
- Probabilistic setting of information-based complexity
- Recent developments in information-based complexity
- s-Numbers of operators in Banach spaces
Cited in
(33)- Linear average and stochastic \(n\)-widths of Besov embeddings on Lipschitz domains
- Random approximation of Sobolev embeddings
- Optimal linear randomized methods for linear operators in Hilbert spaces
- Lower bounds for the complexity of Monte Carlo function approximation
- A minimax principle for the optimal error of Monte Carlo methods
- Average approximations and moments of measures
- Linear widths of a multivariate function space equipped with a Gaussian measure
- Continuous algorithms in \(n\)-term approximation and nonlinear widths
- Complexity of linear problems with a fixed output basis
- Exact asymptotic orders of various randomized widths on Besov classes
- Estimates of probabilistic widths of the diagonal operator of finite-dimensional sets with the Gaussian measure
- Optimal approximation of elliptic problems by linear and nonlinear mappings. III: Frames
- Optimal approximation of elliptic problems by linear and nonlinear mappings. I
- Approximation characteristics for diagonal operators in different computational settings
- Optimal approximation of elliptic problems by linear and nonlinear mappings. II
- The information-based complexity of approximation problem by adaptive Monte Carlo methods
- Optimal approximation of elliptic problems by linear and nonlinear mappings. IV: Errors in \(L_{2}\) and other norms
- Exponential tractability of \(L_2\)-approximation with function values
- Carl's inequality for quasi-Banach spaces
- The adaption problem for approximating linear operators
- Bernstein \(n\)-width of Besov embeddings on Lipschitz domains
- Perspectives on information-based complexity
- Ultrastability of nth minimal errors
- On nonlinear 𝑛-widths
- Applications of classical approximation theory to periodic basis function networks and computational harmonic analysis
- Optimal indirect estimation for linear inverse problems with discretely sampled functional data
- Homogeneous algorithms and solvable problems on cones
- Inequalities between s-numbers
- On the power of adaption and randomization
- Linear vs. nonlinear algorithms for linear problems
- Probabilistic and average widths of multivariate Sobolev spaces with mixed derivative equipped with the Gaussian measure
- Approximation of functions: optimal sampling and complexity
- Infinite-dimensional quadrature and approximation of distributions
This page was built for publication: s-numbers in information-based complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757049)
