Fast conversion algorithms for orthogonal polynomials (Q1044602)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast conversion algorithms for orthogonal polynomials |
scientific article; zbMATH DE number 5650034
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast conversion algorithms for orthogonal polynomials |
scientific article; zbMATH DE number 5650034 |
Statements
Fast conversion algorithms for orthogonal polynomials (English)
0 references
18 December 2009
0 references
Efficient conversion algorithms for orthogonal polynomials are presented. A known conversion algorithm from an arbitrary orthogonal basis to the monomial basis is described first and a new algorithm with same complexity is deduced for the conversion operation.
0 references
fast algorithms
0 references
transposed algorithms
0 references
basis conversion
0 references
orthogonal polynomials
0 references
conversion algorithms
0 references
complexity
0 references
0 references
0 references
0 references
0 references
0 references
0.93671465
0 references
0.8988781
0 references
0.8929696
0 references
0.8878192
0 references
0.88700676
0 references
0.8851755
0 references
0.88422793
0 references
0.8821507
0 references
0.88152885
0 references
