Affordable Access

Publisher Website

Fast evaluation and interpolation at the Chebyshev sets of points

Authors
Journal
Applied Mathematics Letters
0893-9659
Publisher
Elsevier
Publication Date
Volume
2
Issue
3
Identifiers
DOI: 10.1016/0893-9659(89)90064-5
Disciplines
  • Computer Science
  • Mathematics

Abstract

Abstract Stable polynomial evaluation and interpolation at n Chebyshev or adjusted (expanded) Chebyshev points is performed using O( nlog 2 n) arithmetic operations, to be compared with customary algorithms either using on the order of n 2 operations or being unstable. We also evaluate a polynomial of degree d at the sets of n Chebyshev or adjusted (expanded) Chebyshev points using O( d log d log n) if n ≤ d or O(( d log d + n) log d) arithmetic operations if n > d.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Polynomial evaluation and interpolation on special...

on Journal of Complexity Jan 01, 2005

New fast algorithms for polynomial interpolation a...

on Computers & Mathematics with A... Jan 01, 1998

Fast algorithms for multivariate interpolation and...

on Journal of Complexity Jan 01, 2009

Lagrange Interpolation on Chebyshev Points of Two...

on Journal of Approximation Theor... Jan 01, 1996
More articles like this..