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

Full description

Bibliographic Details

Published in:	SIAM journal on computing Vol. 24; no. 2; pp. 387 - 397
Main Authors:	Lakshman, Y. N., Saunders, B. David
Format:	Journal Article
Language:	English
Published:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.04.1995
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!