A new algorithm for sparse interpolation of multivariate polynomials

DOI10.1016/j.tcs.2008.09.002zbMath1181.68328OpenAlexW1976472241MaRDI QIDQ2378491

Annie A. M. Cuyt, Wen-Shin Lee

Publication date: 8 January 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/10067/759370151162165141

zbMATH Keywords

black box polynomialearly terminationgeneralized eigenvalue\(qd\)-algorithmHadamard polynomialsymbolic-numeric sparse interpolation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Nonnumerical algorithms (68W05)

Related Items

An improved early termination sparse interpolation algorithm for multivariate polynomials ⋮ Reliable root detection with the qd-algorithm: When Bernoulli, Hadamard and Rutishauser cooperate ⋮ Sparse interpolation of multivariate rational functions ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reliable root detection with the qd-algorithm: When Bernoulli, Hadamard and Rutishauser cooperate
• Padé-type approximation and general orthogonal polynomials
• Early termination in sparse interpolation algorithms
• Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm
• A Stable Numerical Method for Inverting Shape from Moments
• Symbolic-numeric sparse interpolation of multivariate polynomials