Sparse Polynomial Interpolation in Nonstandard Bases

In this paper, we consider the problem of interpolating univariate polynomials over a field of characteristic zeros that are sparse in (a) the Pochhammer basis, or (b) the Chebyshev basis. The polynomials are assumed to be given by black boxes, i.e., one can obtain the value of a polynomial at any p...

Celý popis

Podrobná bibliografia

Vydané v:	SIAM journal on computing Ročník 24; číslo 2; s. 387 - 397
Hlavní autori:	Lakshman, Y. N., Saunders, B. David
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.04.1995
Predmet:	Algorithms Codes Exact sciences and technology Mathematics Methods of scientific computing (including symbolic computation, algebraic computation) Numerical analysis. Scientific computation Polynomials Sciences and techniques of general use Sparse polynomial BCH code Tchebychev polynomial Polynomial interpolation Algorithm complexity
ISSN:	0097-5397, 1095-7111
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!