Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases (Q1878479)
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: Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases |
scientific article; zbMATH DE number 2093523
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases |
scientific article; zbMATH DE number 2093523 |
Statements
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases (English)
0 references
20 August 2004
0 references
Sparse shifts
0 references
Early termination
0 references
Sparse polynomial
0 references
Sparse interpolation
0 references
Chebyshev basis
0 references
Pochhammer basis
0 references
0 references
0 references
