DocumentCode :
3038120
Title :
On a special case of the two-variable Newton interpolation polynomial
Author :
Varsamis, Dimitris N. ; Karampetakis, Nicholas P.
Author_Institution :
Dept. of Inf. & Commun, Technol. Educ. Instn. of Serres, Serres, Greece
fYear :
2012
fDate :
6-8 Dec. 2012
Firstpage :
1
Lastpage :
6
Abstract :
The paper, proposes two new algorithms for the construction of a two-variable Newton-interpolation polynomial, for the special case where we have a rectangular basis with equidistant points. The complexity of the proposed algorithms is better than the ones given in [1] since it is based only on additions. One of the two algorithms is based on matrix multiplications and thus it is easily implemented in programming languages which supports such kind of operations.
Keywords :
computational complexity; interpolation; matrix multiplication; polynomials; algorithm complexity; equidistant points; matrix multiplications; programming languages; rectangular basis; two-variable Newton interpolation polynomial; Approximation algorithms; Complexity theory; Discrete Fourier transforms; Interpolation; Polynomials; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, Computing and Control Applications (CCCA), 2012 2nd International Conference on
Conference_Location :
Marseilles
Print_ISBN :
978-1-4673-4694-8
Type :
conf
DOI :
10.1109/CCCA.2012.6417866
Filename :
6417866
Link To Document :
بازگشت