New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set
type: Item
instance of: scholarly article
title: New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set
zbMATH Open document ID: 0914.65002
DOI: 10.1016/S0898-1221(97)00283-6
publication date: 1999-06-07T00:00:00Z
review text: Let \(A=\{\cos((2k+1)/(2n+2))\pi \}_{k=0,\ldots,n}\), the author proves the following results: interpolation to a polynomial of a degree at most \(n\) on the node set \(A\) can be performed by using \(O(n\log n)\) arithmetic operations; a polynomial of degree at most \(n\) can be evaluated on the node set \(A\) at the cost of \(O(n\log n)\) arithmetic operations.
Mathematics Subject Classification ID: 65D05
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 1192718
zbMATH Keywords: polynomial interpolation
zbMATH Keywords: Chebyshev nodes
zbMATH Keywords: computational complexity
zbMATH Keywords: fast algorithms
author: Victor Y. Pan
reviewed by: Nicolae Ţăndăreanu
MaRDI profile type: Publication
cites work: Q3960030
cites work: Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
cites work: A Fast Algorithm for the Multiplication of Generalized Hilbert Matrices with Vectors
cites work: Q4314299
full work available at URL: s0898-1221(97)00283-6
OpenAlex ID: W2050062373
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 1192718