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 \(
โฆ 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
Location of the zeros of polynomials sat
โ
J Gilewicz; E Leopold
๐
Article
๐
1985
๐
Elsevier Science
๐
English
โ 618 KB
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
Three-Term Recurrence Relation for Polyn
โ
A. A. Dovgoshei
๐
Article
๐
2001
๐
Springer
๐
English
โ 115 KB
A three-stage variable-shift iteration f
โ
M. A. Jenkins; J. F. Traub
๐
Article
๐
1970
๐
Springer-Verlag
๐
English
โ 645 KB
MAGNA CARTAThe Great CharterPreamble
๐
Fiction
๐
English
โ 11 KB
๐ 18 views