Full C(N)D-study of computational capabilities of Lagrange polynomials
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4013838 (Why is no real title available?)
- scientific article; zbMATH DE number 3156637 (Why is no real title available?)
- scientific article; zbMATH DE number 3877692 (Why is no real title available?)
- scientific article; zbMATH DE number 3827201 (Why is no real title available?)
- scientific article; zbMATH DE number 4048299 (Why is no real title available?)
- scientific article; zbMATH DE number 41621 (Why is no real title available?)
- scientific article; zbMATH DE number 52274 (Why is no real title available?)
- scientific article; zbMATH DE number 3596197 (Why is no real title available?)
- scientific article; zbMATH DE number 515830 (Why is no real title available?)
- scientific article; zbMATH DE number 1156190 (Why is no real title available?)
- scientific article; zbMATH DE number 3062245 (Why is no real title available?)
- scientific article; zbMATH DE number 3073200 (Why is no real title available?)
- scientific article; zbMATH DE number 3091971 (Why is no real title available?)
- scientific article; zbMATH DE number 3101429 (Why is no real title available?)
- Best approximation of functions specified with an error at a finite number of points
- Computational (numerical) diameter in a context of general theory of a recovery
- DIAMETERS OF SETS IN NORMED LINEAR SPACES AND THE APPROXIMATION OF FUNCTIONS BY TRIGONOMETRIC POLYNOMIALS
- Discretization of solutions to a wave equation, numerical differentiation, and function recovery with the help of computer (computing) diameter
- Discretization of solutions to the Poisson's equation in the Korobov class
- Equivalence of computed tomography problem with the problem of recovery of functions by finite convolutions in a scheme of computational (numerical) diameter
- Exact orders of computational (numerical) diameters in problems of reconstructing functions and sampling solutions of the Klein-Gordon equation from Fourier coefficients
- Formulas for approximate calculation of the Chebyshev coefficients
- Function spaces in Lipschitz domains and optimal rates of convergence for sampling
- Informative cardinality of trigonometric Fourier coefficients and their limiting error in the discretization of a differentiation operator in multidimensional Sobolev classes
- Multivariate approximation
- Noisy Information and Computational Complexity
- On a quadrature formula for trigonometric integrals.
- On the construction of tables and on interpolation. Part 1: Univariate tables. Part 2: Bi-variate tables. (Tracts for Computers, Nos. 2-3.).
- On the discretization of solutions of the wave equation with initial conditions from generalized Sobolev classes
- On the informative power of all possible linear functionals for the discretization of solutions of the Klein-Gordon equation in the metric of \(L ^{2,\infty}\)
- On the informativeness of linear functionals.
- On the numerical quadrature of highly-oscillating integrals II: Irregular oscillators
- Optimal evaluation of integrals of rapidly oscillating functions
- Optimal reconstruction and extremum theory.
- Optimal recovery of values of functions and their derivatives from inaccurate data on the Fourier transform
- Order estimates of the norms of derivatives of functions with zero values on linear functionals and their applications
- Parallel information-based complexity
- Sampling discretization and related problems
- Some problems in approximation theory and numerical analysis
- The Radon transform in the scheme of C(N)D-investigations and the quasi-Monte Carlo theory
This page was built for publication: Full C(N)D-study of computational capabilities of Lagrange polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6992988)
