Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

CORR
2008
Springer

favoriteEmaildiscussreport

57views Education» more CORR 2008»

Fast Conversion Algorithms for Orthogonal Polynomials

13 years 4 months ago

Fast Conversion Algorithms for Orthogonal Polynomials

Download www.csd.uwo.ca

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. Key words: Fast algorithms, transposed algorithms, basis conversion, orthogonal polynomials.

Alin Bostan, Bruno Salvy, Éric Schost

Real-time Traffic

Algorithms | Conversion Algorithm | CORR 2008 | Education | Orthogonal Polynomials |

claim paper

Related Content

» H2O Reversible HexagonalOrthogonal Grid Conversion by 1D Filtering

» Fast nonmontecarlo transient noise analysis for highprecision analogRF circuits by stochas...

» A fast accurate implicit polynomial fitting approach

» Random Sampling of Sparse Trigonometric Polynomials II Orthogonal Matching Pursuit versus ...

» Piecewise Circular Approximation of Spirals and Polar Polynomials

» Power Series Composition and Change of Basis

» Efficient Legendre moment computation for grey level images

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Alin Bostan, Bruno Salvy, Éric Schost

Comments (0)