𝔖 Bobbio Scriptorium
✦   LIBER   ✦

QD-algorithms and recurrence relations for biorthogonal polynomials

✍ Scribed by Zélia da Rocha

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
203 KB
Volume
107
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis

Biorthogonal polynomials P (i; j) n include as particular cases vector orthogonal polynomials of dimension d and -d(d ∈ N ). We pay special attention to the cases of dimension 1 and -1. We discuss the problem of computing P (i; j) n using only one or several recurrence relations. Furthermore, we deduce all recurrence relations of a certain type that give P (i; j) n from two other biorthogonal polynomials. The coe cients that appear in any two independent relations satisfy some identities from which it is possible to establish QD-like algorithms.

📜 SIMILAR VOLUMES

Zeros of polynomials and recurrence rela
Zeros of polynomials and recurrence relations with periodic coefficients
✍ Jacek Gilewicz; Elie Leopold 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 126 KB

The location of all zeros of a ÿnite family of polynomials deÿned by three term recurrence relations with periodic coe cients is analyzed with the help of reference to the Chebyshev polynomials. In some particular cases the distribution of these zeros in the gaps between the intervals which support

Systolic algorithm for polynomial interp
Systolic algorithm for polynomial interpolation and related problems
✍ H. Schroder; V.K. Murthy; E.V. Krishnamurthy 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 362 KB

This paper describes a systolic algorithm for interpolation and evaluation of polynomials over any field using a linear array of processors. The periods of these algorithms are O(n) for interpolatin and O(1) for evaluation. This algorithm is readily adapted for Chinese remaindering, easily generahze