Article
Licensed
Unlicensed
Requires Authentication
Chebyshev polynomials and best approximation of some classes of functions
-
,
Published/Copyright:
August 7, 2015
Abstract
In this research using properties of Chebyshev polynomialswe explicitly determine the best uniform polynomial approximation of some classes of functions. In this way we present some new theorems about the best approximation of these classes.
Received: 2012-8-10
Accepted: 2013-8-13
Published Online: 2015-8-7
Published in Print: 2015-3-1
© 2015 by Walter de Gruyter Berlin/Boston
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Frontmatter
- A multipoint Birkhoff type boundary value problem
- Performance estimation of linear algebra numerical libraries
- Finite element analysis of the stationary power-law Stokes equations driven by friction boundary conditions
- Chebyshev polynomials and best approximation of some classes of functions
- Multigrid methods for Hdiv-conforming discontinuous Galerkin methods for the Stokes equations
- Unified error bounds for all Newton–Cotes quadrature rules
- Optimal bilinear control of eddy current equations with grad–div regularization
Keywords for this article
Best polynomial approximation;
alternating set;
Chebyshev polynomials;
uniform norm
Articles in the same Issue
- Frontmatter
- A multipoint Birkhoff type boundary value problem
- Performance estimation of linear algebra numerical libraries
- Finite element analysis of the stationary power-law Stokes equations driven by friction boundary conditions
- Chebyshev polynomials and best approximation of some classes of functions
- Multigrid methods for Hdiv-conforming discontinuous Galerkin methods for the Stokes equations
- Unified error bounds for all Newton–Cotes quadrature rules
- Optimal bilinear control of eddy current equations with grad–div regularization
