Fast Lagrange-Newton transformations

DOI10.1016/J.JCO.2006.12.004MaRDI QIDQ2371307zbMATH OpenOpenAlexFDO

Authors Ryszard Smarzewski, Joanna Kapusta

Publication date 4 July 2007

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jco.2006.12.004

zbMATH Keywords

computational complexitycryptographydiscrete Fourier transformfast algorithmsHorner transformationspecial configurations of knotsthreshold secret sharing schemewrapped convolution

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• The formulae and algorithms for Lagrange-power basis transformation and Lagrange-Newton transformation
• A parallel algorithm for Lagrange interpolation polynomial
• Fast algorithms for multivariate interpolation and evaluation at special points
• scientific article; zbMATH DE number 7709336
• An efficient algorithm for multivariate Maclaurin-Newton transformation

Cites work

• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 3378720 (Why is no real title available?)
• On the computational power of pushdown automata
• Polynomial evaluation and interpolation on special sets of points
• X-splines of odd degree

Cited in

(5)

• The formulae and algorithms for Lagrange-power basis transformation and Lagrange-Newton transformation
• Fast multidimensional Bernstein-Lagrange algorithms
• Fast transforms over finite fields of characteristic two
• An efficient algorithm for multivariate Maclaurin-Newton transformation
• Fast algorithms for multivariate interpolation and evaluation at special points

This page was built for publication: Fast Lagrange-Newton transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2371307)