The Approximation Problem and specifically, "direct" rational Chebyshev approximation is discussed. A brief summary is made of "direct" Chebyshev approximation. The remainder of the thesis is devoted to various aspects of a "Remes-type" Algorithm for rational Chebyshev approximation, as proposed by Fraser and Hart. It is finally concluded that the inherent difficulties of the method would generally outweigh the advantages of the rational approximation which it obtains. / Science, Faculty of / Mathematics, Department of / Graduate

Lee, King Leung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2011. / Includes bibliographical references (leave 95). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.6 / Chapter 1.1 --- Organization --- p.10 / Chapter 2 --- Semigroups and Cones --- p.13 / Chapter 2.1 --- Relation between Semigroups and Cones --- p.13 / Chapter 2.2 --- Subadditive Functions on Semigroups --- p.23 / Chapter 2.3 --- Relation between Cones and Bases --- p.29 / Chapter 3 --- General Theories of Okounkov Bodies --- p.33 / Chapter 3.1 --- Okounkov Bodies and Volumes --- p.33 / Chapter 3.2 --- Relation of Subadditive Functions on Semigroups and Okounkov Bodies --- p.39 / Chapter 3.3 --- Convex Functions on Okounkov Bodies --- p.47 / Chapter 4 --- Okounkov Bodies and Complex Geometry --- p.55 / Chapter 4.1 --- Holomorphic Line Bundles --- p.55 / Chapter 4.2 --- Chebyshev Transform --- p.65 / Chapter 4.3 --- Bernstein-Markov Norms --- p.74 / Chapter 5 --- Applications of Okounkov Bodies --- p.81 / Chapter 5.1 --- Relative Energy of Weights --- p.81 / Chapter 5.2 --- Computational Methods and Some Examples --- p.89 / Bibliography --- p.95

We present a combinatorial interpretation of Chebyshev polynomials. The nth Chebyshev polynomial of the first kind, Tn(x), counts the sum of all weights of n-tilings using light and dark squares of weight x and dominoes of weight −1, and the first tile, if a square must be light. If we relax the condition that the first square must be light, the sum of all weights is the nth Chebyshev polynomial of the second kind, Un(x). In this paper we prove many of the beautiful Chebyshev identities using the tiling interpretation.

No description available.

Thesis (Ph. D.)--University of Washington, 1998. / Vita. Includes bibliographical references (leaves [141]-148).

No description available.

The purpose of this paper is to investigate the nature and practical uses of Chebyshev polynomials. Chapter I gives recognition to mathematicians responsible for studies in this area. Chapter II enumerates several mathematical situations in which the polynomials naturally arise and suggests reasons for the pursuance of their study. Chapter III includes: Chebyshev polynomials as related to "best" polynomial approximation, Chebyshev series, and methods of producing polynomial approximations to continuous functions. Chapter IV discusses the use of Chebyshev polynomials to solve certain differential equations and Chebyshev-Gauss quadrature.

This project presents a modified method of numerical integration for a “well behaved� function over the finite interval [-1,1]. Similar to the Clenshaw-Curtis quadrature rule, this new algorithm relies on expressing the integrand as an expansion of Chebyshev polynomials of the second kind. The truncated series is integrated term-by-term yielding an approximation for the integral of which we wish to compute. The modified method is then contrasted with its predecessor Clenshaw-Curtis, as well as the classical method of Gauss-Legendre in terms of convergence behavior, error analysis and computational efficiency. Lastly, illustrative examples are shown which demonstrate the dependence that the convergence has on the given function to be integrated.

No description available.

No description available.