𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast conversion algorithms for orthogonal polynomials

✍ Scribed by Alin Bostan; Bruno Salvy; Éric Schost

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
419 KB
Volume
432
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis

We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversion algorithm from an arbitrary orthogonal basis to the monomial basis, and deduce a new algorithm of the same complexity for the converse operation.

📜 SIMILAR VOLUMES

A fast and stable algorithm for splittin
A fast and stable algorithm for splitting polynomials
✍ G. Malajovich; J.P. Zubelli 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 928 KB

This paper concerns the fast numerical factorization of degree a + b polynomials in a neighborhood of the polynomial x a. We want to obtain the so-called splitting of one such polynomial, i.e., a degree a factor with roots close to zero and a degree b factor with roots close to infinity. An importan