W.-S.: Symbolic-numeric sparse polynomial interpolation in Chebyshev basis and trigonometric interpolation

W.-S.: Symbolic-numeric sparse polynomial interpolation in Chebyshev basis and trigonometric interpolation (2004)

by Mark Giesbrecht , George Labahn , Wen-shin Lee

Venue:	In: Proceedings of Computer Algebra in Scientific Computing (CASC 2004
Citations:	3 - 2 self

Datum	Value	Source
TITLE	W.-S.: Symbolic-numeric sparse polynomial interpolation in Chebyshev basis and trigonometric interpolation	INFERENCE
AUTHOR NAME	Mark Giesbrecht	SVM HeaderParse 0.2
AUTHOR AFFIL	School of Computer Science, University of Waterloo; Waterloo, Ontario N2L 3G1	SVM HeaderParse 0.2
AUTHOR ADDR	Canada	SVM HeaderParse 0.2
AUTHOR NAME	George Labahn	SVM HeaderParse 0.2
AUTHOR AFFIL	School of Computer Science, University of Waterloo; Waterloo, Ontario N2L 3G1	SVM HeaderParse 0.2
AUTHOR ADDR	Canada	SVM HeaderParse 0.2
AUTHOR NAME	Wen-shin Lee	SVM HeaderParse 0.2
AUTHOR AFFIL	INRIA, GALAAD	SVM HeaderParse 0.2
AUTHOR ADDR	BP 93, 06902 Sophia-Antipolis, France	SVM HeaderParse 0.2
ABSTRACT	We consider the problem of efficiently interpolating an “approximate” black-box polynomial p(x) that is sparse when represented in the Chebyshev basis. Our computations will be in a traditional floating-point environment, and their numerical sensitivity will be investigated. As well, we consider the related problem of interpolating a sparse linear combination of (approximate) trigonometric functions. The costs of all our algorithms will be sensitive to the sparsity of the output. 1	SVM HeaderParse 0.2
YEAR	2004	INFERENCE
VENUE	In: Proceedings of Computer Algebra in Scientific Computing (CASC 2004	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
CITATIONS	16 found	ParsCit 1.0