Chebyshev polynomials and continued fractions related
Keywords:Chebyshev polynomials, continued fractions, Binet formula, Cassini identity
Let p, q be complex polynomials, deg p > deg q > 0. We consider the family of polynomials defined by the recurrence Pn+1 = 2pPn–qPn–1 for n = 1, 2, 3, … with arbitrary P1 and P0 as well as the domain of the convergence of the infinite continued fraction
Donald E. Knuth, The Art of Computer Programming, Addison Wesley, 2nd edition, 1973. Google Scholar
John C. Mason, David Handscomb, Chebyshev polynomials, Chapman & Hall, 2003. Google Scholar
How to Cite
Copyright (c) 2019 University of Applied Sciences in Tarnow, Poland & Author
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.