AbstractIt is known that computing all coefficients of the Lagrangian interpolation polynomial, given n nodes and n values, has nonscalar complexity of order n log n. We show that the evaluation of a single coefficient or of the value of the interpolation polynomial at some new point already has complexity of order n log n. These results are consequences of a more general theorem
AbstractEight different algorithms for polynomial interpolation are compared with respect to stabili...
Newton-Lagrange Interpolations are widely used in numerical analysis. However, it requires a quadrat...
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation ...
AbstractIt is known that computing all coefficients of the Lagrangian interpolation polynomial, give...
AbstractWe give complexity estimates for the problems of evaluation and interpolation on various pol...
AbstractWe give an algorithm for the interpolation of a polynomial A given by a straight-line progra...
Four problems are considered: 1) from an n-precision integer compute its residues modulo n single pr...
AbstractWe introduce and discuss a new computational model for the Hermite–Lagrange interpolation wi...
AbstractWe prove some inequalities on the asymptotic orders of complexity of the problems of polynom...
Lagrange interpolation is widely used in signal processing applications such as variable fractional ...
Given a way to evaluate an unknown polynomial with integer coefficients, we present new algorithms t...
Multipoint polynomial evaluation and interpolation are fundamental for modern algebraic and numerica...
AbstractLet a polynomial of degree n be given by its values at n+1 general points. Consider the prob...
We consider the two-variable interlace polynomial introduced by Arratia, Bollob`as and Sorkin (20...
AbstractWe present a very simple method to prove lower bounds for the nonscalar complexity of polyno...
AbstractEight different algorithms for polynomial interpolation are compared with respect to stabili...
Newton-Lagrange Interpolations are widely used in numerical analysis. However, it requires a quadrat...
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation ...
AbstractIt is known that computing all coefficients of the Lagrangian interpolation polynomial, give...
AbstractWe give complexity estimates for the problems of evaluation and interpolation on various pol...
AbstractWe give an algorithm for the interpolation of a polynomial A given by a straight-line progra...
Four problems are considered: 1) from an n-precision integer compute its residues modulo n single pr...
AbstractWe introduce and discuss a new computational model for the Hermite–Lagrange interpolation wi...
AbstractWe prove some inequalities on the asymptotic orders of complexity of the problems of polynom...
Lagrange interpolation is widely used in signal processing applications such as variable fractional ...
Given a way to evaluate an unknown polynomial with integer coefficients, we present new algorithms t...
Multipoint polynomial evaluation and interpolation are fundamental for modern algebraic and numerica...
AbstractLet a polynomial of degree n be given by its values at n+1 general points. Consider the prob...
We consider the two-variable interlace polynomial introduced by Arratia, Bollob`as and Sorkin (20...
AbstractWe present a very simple method to prove lower bounds for the nonscalar complexity of polyno...
AbstractEight different algorithms for polynomial interpolation are compared with respect to stabili...
Newton-Lagrange Interpolations are widely used in numerical analysis. However, it requires a quadrat...
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation ...
DOI
Add to ORKG