English

Fast Conversion Algorithms for Orthogonal Polynomials

Symbolic Computation 2013-06-19 v1

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.

Keywords

Cite

@article{arxiv.0804.2373,
  title  = {Fast Conversion Algorithms for Orthogonal Polynomials},
  author = {Alin Bostan and Bruno Salvy and Éric Schost},
  journal= {arXiv preprint arXiv:0804.2373},
  year   = {2013}
}
R2 v1 2026-06-21T10:31:03.602Z