On the optimality of linear methods for operator approximation in convex classes of functions
From MaRDI portal
Publication:5669258
DOI10.1016/0041-5553(71)90017-6zbMath0254.41013OpenAlexW2000169527MaRDI QIDQ5669258
Publication date: 1973
Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0041-5553(71)90017-6
Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation by arbitrary linear expressions (41A45)
Related Items (47)
A survey of information-based complexity ⋮ Are linear algorithms always good for linear problems? ⋮ Optimal recovery of integral operators and its applications ⋮ Identification of nonstationary aerodynamic characteristics of an aircraft based on flight data ⋮ Infinite-dimensional quadrature and approximation of distributions ⋮ Uniform recovery of high-dimensional \(C^r\)-functions ⋮ Computing a quantity of interest from observational data ⋮ On the existence of optimal affine methods for approximating linear functionals ⋮ Testing linear operators ⋮ Product rules are optimal for numerical integration in classical smoothness spaces ⋮ On adaption with noisy information ⋮ Optimal randomized quadrature for weighted Sobolev and Besov classes with the Jacobi weight on the ball ⋮ The adaption problem for approximating linear operators ⋮ On the optimal recovery of integrals of set-valued functions ⋮ Multivariate integration for analytic functions with Gaussian kernels ⋮ ABC on IBC ⋮ Some Results on the Complexity of Numerical Integration ⋮ Uniform Weak Tractability of Weighted Integration ⋮ О ЧИСЛЕННЫХ МЕТОДАХ РЕШЕНИЯ БЕСКОНЕЧНЫХ СИСТЕМ ЛИНЕЙНЫХ АЛГЕБРАИЧЕСКИХ УРАВНЕНИЙ ⋮ Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case ⋮ Coefficients of Euler-Maclaurin formulas for numerical integration ⋮ On maximal order for local and global numerical problems ⋮ A method of accelerated statistical simulation and its application in the problems with inherent error ⋮ The curse of dimensionality for numerical integration of smooth functions. II ⋮ An Efficient Algorithm for the Classical Least Squares Approximation ⋮ Multivariate integration in \(C^{\infty}([0,1^{d})\) is not strongly tractable.] ⋮ Complexity of oscillatory integration for univariate Sobolev spaces ⋮ Complexity of linear problems with a fixed output basis ⋮ Pendulum accelerometer with digital control and new functionality ⋮ Average case complexity of linear multivariate problems. I: Theory ⋮ Generalized adaptive versus nonadaptive recovery from noisy information ⋮ Unnamed Item ⋮ The immersed interface method for a nonlinear chemical diffusion equation with local sites of reactions ⋮ Computational complexity of the integration problem for anisotropic classes ⋮ Interpolation of Lipschitz functions ⋮ Adaption helps for some nonconvex classes ⋮ Convergence rates for an adaptive dual weighted residual finite element algorithm ⋮ Optimal approximation of elliptic problems by linear and nonlinear mappings. II ⋮ An analogue of the two-constants theorem and optimal recovery of analytic functions ⋮ Optimal sequential and non-sequential procedures for evaluating a functional ⋮ On the adaptive and continuous information problems ⋮ On adaptive and non-adaptive stochastic and deterministic algorithms ⋮ Information of varying cardinality ⋮ Analog of the Hadamard theorem and related extremal problems on the class of analytic functions ⋮ Optimal solution of nonlinear equations satisfying a Lipschitz condition ⋮ Non-axisymmetric buckling and post-critical behaviour of elastic spherical shells in the case of a double critical value of the load ⋮ Bounds on the error of Fejér and Clenshaw-Curtis type quadrature for analytic functions
This page was built for publication: On the optimality of linear methods for operator approximation in convex classes of functions
