On the optimality of linear methods for operator approximation in convex classes of functions
From MaRDI portal
Publication:5669258
Cited in
(50)- Optimal sequential and non-sequential procedures for evaluating a functional
- The adaption problem for approximating linear operators
- On the existence of optimal affine methods for approximating linear functionals
- An analogue of the two-constants theorem and optimal recovery of analytic functions
- On the adaptive and continuous information problems
- Generalized adaptive versus nonadaptive recovery from noisy information
- Bounds on the error of Fejér and Clenshaw-Curtis type quadrature for analytic functions
- Infinite-dimensional quadrature and approximation of distributions
- Uniform weak tractability of weighted integration
- Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case
- The curse of dimensionality for numerical integration of smooth functions. II
- Are linear algorithms always good for linear problems?
- Pendulum accelerometer with digital control and new functionality
- Optimal recovery of integral operators and its applications
- scientific article; zbMATH DE number 2098906 (Why is no real title available?)
- Computing a quantity of interest from observational data
- Adaption helps for some nonconvex classes
- Uniform recovery of high-dimensional C^r-functions
- Multivariate integration for analytic functions with Gaussian kernels
- Identification of nonstationary aerodynamic characteristics of an aircraft based on flight data
- Computational complexity of the integration problem for anisotropic classes
- Multivariate integration in \(C^{\infty}([0,1]^{d})\) is not strongly tractable.
- On maximal order for local and global numerical problems
- ABC on IBC
- On adaptive and non-adaptive stochastic and deterministic algorithms
- Complexity of oscillatory integration for univariate Sobolev spaces
- Interpolation of Lipschitz functions
- The immersed interface method for a nonlinear chemical diffusion equation with local sites of reactions
- On the optimal recovery of integrals of set-valued functions
- Average case complexity of linear multivariate problems. I: Theory
- Optimal approximation of elliptic problems by linear and nonlinear mappings. II
- Optimal randomized quadrature for weighted Sobolev and Besov classes with the Jacobi weight on the ball
- Product rules are optimal for numerical integration in classical smoothness spaces
- Intractability results for integration in tensor product spaces
- Optimal solution of nonlinear equations satisfying a Lipschitz condition
- Information of varying cardinality
- Methods for solving ill-conditioned systems of linear equations that improve the conditionality
- Analog of the Hadamard theorem and related extremal problems on the class of analytic functions
- Non-axisymmetric buckling and post-critical behaviour of elastic spherical shells in the case of a double critical value of the load
- Coefficients of Euler-Maclaurin formulas for numerical integration
- An Efficient Algorithm for the Classical Least Squares Approximation
- A survey of information-based complexity
- Homogeneous algorithms and solvable problems on cones
- Some results on the complexity of numerical integration
- Convergence rates for an adaptive dual weighted residual finite element algorithm
- A method of accelerated statistical simulation and its application in the problems with inherent error
- Testing linear operators
- Complexity of linear problems with a fixed output basis
- On adaption with noisy information
- О ЧИСЛЕННЫХ МЕТОДАХ РЕШЕНИЯ БЕСКОНЕЧНЫХ СИСТЕМ ЛИНЕЙНЫХ АЛГЕБРАИЧЕСКИХ УРАВНЕНИЙ
This page was built for publication: On the optimality of linear methods for operator approximation in convex classes of functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5669258)
