Algorithm 277: Computation of Chebyshev series coefficients

  title={Algorithm 277: Computation of Chebyshev series coefficients},
  author={Lyle B. Smith},
  journal={Commun. ACM},
  • L. B. Smith
  • Published 1 February 1966
  • Mathematics
  • Commun. ACM
modification of the classical least squares method is utilized to approximate a solution to the system of nonlinear equations of condition. After every iteration, the statistic E squared is computed as a measure of the goodness of fit. Commencing with the second iteration, the successive values of E squared are differenced, and when the difference in absolute value becomes less than epsilon, the calculations cease. If the number of iterations necessary to achieve this result exceeds 1 max… 
Applications of multi-threading paradigms to stimulate turbulent flows
Rather than running an application that solves the Navier-Stokes equations on one computer, a platform is developed that allows a group of computers to communicate with one another working together to obtain a solution of a specific flow problem.
Computation of Legendre series coefficients
Several algorithms are available for the computation of coefficients of the truncated Chebyshev series expansion on [-1, 1] ƒ(x), but the commonly used algorithms are less suitable for practical use since it requires the abscissas and weights of the Gauss-Legendre quadrature formulas.


Truncation Errors in Two Chebyshev Series Approximations
However, in attempting to find a suitable polynomial approximation to a general function f(x), the integral occurring in equation (1.3) cannot be evaluated explicitly, and recourse has to be made to
A Comparison of ``Best'' Polynomial Approximations with Truncated Chebyshev Series Expansions
Introduction. In the numerical solution of mathematical problems it is common to represent a function of a real variable by the leading terms of its infinite Chebyshev series expansion. The purpose