Clenshaw algorithm in the interpolation problem by the Chebyshev collocation method Chebyshev polynomials. The method is valid when the desired function is bounded and has a finite number
PSEUDOSPECTRAL METHOD FOR SECOND-ORDER AUTONOMOUS NONLINEAR DIFFERENTIAL EQUATIONS on the
Chebyshev differentiation matrix with
Chebyshev-Gauss-Lobatto points to solve these problems. Moreover, we
Local Lipschitz property for the Chebyshev center mapping over N-nets Chebyshev center. If dimension of Euclidean or Lobachevsky space is greater than 1 and the net consists
POLYA-SZEGO AND CHEBYSHEV TYPES INEQUALITIES VIA AN EXTENDED GENERALIZED MITTAG-LEFFLER FUNCTION of the
Chebyshev quotient are presented. Those inequalities include an extended generalized Mittag-Leffler function
ANALYSIS AND SYNTHESIS OF THE CHEBYSHEV POLYNOMIALS IN THE REGRESSION ANALYSIS PROBLEMS orthogonal polynomials, or the
Chebyshev polynomials, aimed to improve stability of approximated regression
Local Lipschitz property for the Chebyshev center mapping over N-nets Chebyshev center. If dimension of Euclidean or Lobachevsky space is greater than 1 and the net consists