نتایج جستجو برای: chebyshev polynomials

تعداد نتایج: 40529  

2015
S. NEMATI Y. ORDOKHANI I. MOHAMMADI S. Nemati Y. Ordokhani I. Mohammadi

In this paper, we will introduce a method to find a numerical solution of nonlinear age-structured population model using second-kind Chebyshev polynomials. This method convert the nonlinear age-structured population models to an equivalent differential equation. We introduce two variable second-kind Chebyshev polynomials and their basic properties. These properties will be used to reduce the o...

2008
Hacène Belbachir Farid Bencherif

In this paper we generalize to bivariate Fibonacci and Lucas polynomials, properties obtained for Chebyshev polynomials. We prove that the coordinates of the bivariate polynomials over appropriate bases are families of integers satisfying remarkable recurrence relations.

Journal: :Zeitschrift für Analysis und ihre Anwendungen 2008

Journal: :Mathematics of Computation 2004

Journal: :Journal of Statistical Planning and Inference 2010

2009
Gospava B. Djordjević Dragan S. Djordjević

We study several classes of polynomials, which are related to the Chebyshev, Morgan-Voyce, Horadam and Jacobsthal polynomials. Thus, we unify some of well-known results.

2007
Mohammed A. Abutheraa David Lester

We show that Chebyshev Polynomials are a practical representation of computable functions on the computable reals. The paper presents error estimates for common operations and demonstrates that Chebyshev Polynomial methods would be more efficient than Taylor Series methods for evaluation of transcendental functions. Keywords—Approximation Theory, Chebyshev Polynomial, Computable Functions, Comp...

2002
Ren - Cang Li

A common practice for computing an elementary transcendental function nowadays has two phases: reductions of input arguments to fall into a tiny interval and polynomial approximations for the function within the interval. Typically the interval is made tiny enough so that one won’t have to go for polynomials of very high degrees for accurate approximations. Often approximating polynomials as su...

2012
Asamoah Nkwanta

Riordan matrix methods and properties of generating functions are used to prove that the entries of two Catalan-type Riordan arrays are linked to the Chebyshev polynomials of the first kind. The connections are that the rows of the arrays are used to expand the monomials (1/2) (2x) and (1/2) (4x) in terms of certain Chebyshev polynomials of degree n. In addition, we find new integral representa...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید