Fast Conversion Algorithms for Orthogonal Polynomials
classification
💻 cs.SC
keywords
conversionorthogonalalgorithmalgorithmsbasispolynomialsarbitrarycomplexity
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.