Abstract: The polynomials which give the minimum for the minimax norm are very useful in practical applications of various numerical algorithms. However, except the well-known Chebyshev's polynomials ...

CHEBYSHEV_POLYNOMIAL is a C++ library which considers the Chebyshev polynomials T(i,x), U(i,x), V(i,x) and W(i,x). Functions are provided to evaluate the polynomials, determine their zeros, produce ...

Numerical techniques are presented for computing the roots of polynomial equations. By applying the recommended scaling and inversion rules, the basic Bistrow and Newton-Raphson iterative techniques ...

Methods in numerical analysis. Includes: Lagrange interpolation, Chebyshev polynomials for optimal node spacing, iterative techniques to solve linear systems (Gauss-Seidel, Jacobi, SOR), SVD, PCA, and ...

ABSTRACT: Due to the ability to model various complex phenomena where classical calculus failed, fractional calculus is getting enormous attention recently. There are several approaches available for ...

ABSTRACT: In this paper, a Chebyshev polynomial approximation for the solution of second-order partial differential equations with two variables and variable coefficients is given. Also, Chebyshev ...