Fast algorithms for polynomial evaluation and differentiation at special knots
Abstract
We present fast evaluating and differentiating algorithms for the Hermite interpolating polynomials with the knots of multiplicity 2, which are generated dynamically in a field K = (K,+,⋅) by the recurrent formula of the formX^i = αx^i-1+β (i=1,2,..,n-1; x^0=γ).As in the case of Lagrange-Newton interpolating algorithms, the running time of these algorithms is C(n) + O(n) base operations from the field K, where C(n) = O(nlog n) denotes the time needed to compute the wrapped convolution in Kn.
Full Text:
PDFDOI: http://dx.doi.org/10.17951/ai.2007.6.1.95-102
Date of publication: 2015-01-04 00:00:00
Date of submission: 2016-04-27 10:20:02
Statistics
Total abstract view - 732
Downloads (from 2020-06-17) - PDF - 0
Indicators
Refbacks
- There are currently no refbacks.
Copyright (c) 2015 Annales UMCS Sectio AI Informatica
This work is licensed under a Creative Commons Attribution 4.0 International License.