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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on computing Jg. 24; H. 2; S. 387 - 397
Hauptverfasser:	Lakshman, Y. N., Saunders, B. David
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.04.1995
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!