Fast algorithms for multivariate interpolation and evaluation at special points
DOI10.1016/J.JCO.2009.02.001zbMATH Open1169.65303OpenAlexW2002933343MaRDI QIDQ2272149FDOQ2272149
Authors: Joanna Kapusta, Ryszard Smarzewski 
Publication date: 6 August 2009
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2009.02.001
Recommendations
- An efficient algorithm for multivariate Maclaurin-Newton transformation
- Fast Lagrange-Newton transformations
- Multi-point evaluation in higher dimensions
- Polynomial evaluation and interpolation and transformations of matrix structures
- Multivariate polynomial interpolation under projectivities. I: Lagrange and Newton interpolation formulas
computational complexitytensor productmultivariate interpolationfast algorithmsinterpolating algorithmmultivariate evaluationmultivariate Lagrange-Newton transformation
Complexity and performance of numerical algorithms (65Y20) Multidimensional problems (41A63) Numerical interpolation (65D05) Interpolation in approximation theory (41A05)
Cites Work
Cited In (8)
- Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts
- An efficient algorithm for multivariate Maclaurin-Newton transformation
- Fast multipoint evaluation and interpolation of polynomials in the LCH-basis over F P r
- Fast multidimensional Bernstein-Lagrange algorithms
- Fast Lagrange-Newton transformations
- Multiple point evaluation on combined tensor product supports
- A fast algorithm for scalar Nevanlinna-Pick interpolation
- Fast strategy for PU interpolation: An application for the reconstruction of separatrix manifolds
This page was built for publication: Fast algorithms for multivariate interpolation and evaluation at special points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272149)
