๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Polynomials generated by a three term recurrence relation: bounds for complex zeros

โœ Scribed by A.P. da Silva; A. Sri Ranga


Book ID
108198784
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
398 KB
Volume
397
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the Zeros of a Class of Polynomials D
โœ E.K. Ifantis; P.N. Panagopoulos ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 316 KB

Let \(P\_{N+1}(x)\) be the polynomial which is defined recursively by \(P\_{0}(x)=0\), \(P\_{1}(x)=1, \quad\) and \(\alpha\_{n} P\_{n+1}(x)+\alpha\_{n-1} P\_{n-1}(x)+b\_{n} P\_{n}(x)=x d\_{n} P\_{n}(x), \quad n=1, \quad 2, \ldots, N\), where \(\alpha\_{n}, b\_{n}, d\_{n}\) are real sequences with \(

Newton sum rules of polynomials defined
โœ P. Natalini; P.E. Ricci ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 252 KB

We derive a general formula for computing the Newton sum rules of every polynomial belonging to a given polynomial set. We use the following tools: a recursive computation of the coefficients of the given polynomial in terms of the coefficients of the three-term recurrence relation, the generalized