The complexity of evaluating interpolation polynomials
Copyright policy )The complexity of evaluating interpolation polynomials
It is well known that the complexity of computing all coefficients of the Lagrangian interpolation polynomial for n nodes and n values is of order n log n. Proving in this paper a more general theorem with respect to the complexity bounds of the tasks of computing the coefficients of the Lagrangian interpolation polynomials, the author derives from this the previous result about the complexity order n log n.
Numerical interpolation, Analysis of algorithms and problem complexity, coefficients of the Lagrangian interpolation polynomial, complexity bounds, Interpolation in approximation theory, Theoretical Computer Science, Computer Science(all)
Numerical interpolation, Analysis of algorithms and problem complexity, coefficients of the Lagrangian interpolation polynomial, complexity bounds, Interpolation in approximation theory, Theoretical Computer Science, Computer Science(all)
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).10 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!