Skip to Main content Skip to Navigation
Reports

Fast Conversion Algorithms for Orthogonal Polynomials

Alin Bostan 1, * Bruno Salvy 1 Éric Schost 2
* Corresponding author
1 ALGORITHMS - Algorithms
Inria Paris-Rocquencourt
Abstract : 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.
Document type :
Reports
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/inria-00273508
Contributor : Alin Bostan <>
Submitted on : Tuesday, April 15, 2008 - 2:41:11 PM
Last modification on : Tuesday, December 8, 2020 - 9:52:10 AM
Long-term archiving on: : Thursday, May 20, 2010 - 11:21:48 PM

Files

BoSaSc08b.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00273508, version 1
  • ARXIV : 0804.2373

Collections

Citation

Alin Bostan, Bruno Salvy, Éric Schost. Fast Conversion Algorithms for Orthogonal Polynomials. [Research Report] 2008, pp.12. ⟨inria-00273508⟩

Share

Metrics

Record views

189

Files downloads

278