Interpolating polynomials from their values

DOI10.1016/S0747-7171(08)80018-1zbMath0702.65011OpenAlexW2026317840MaRDI QIDQ915342

Publication date: 1990

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80018-1

zbMATH Keywords

algorithms interpolating polynomials sparse polynomials

Mathematics Subject Classification ID

Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Complexity and performance of numerical algorithms (65Y20)

Related Items

Early termination in sparse interpolation algorithms, Black-box polynomial resultants, On learning multivariate polynomials under the uniform distribution, Exploring crypto dark matter: new simple PRF candidates and their applications, Sparse polynomial interpolation based on diversification, Faster sparse multivariate polynomial interpolation of straight-line programs, Sparse polynomial interpolation based on derivatives, Prony's method in several variables: symbolic solutions by universal interpolation, Structured matrices in the application of bivariate interpolation to curve implicitization, Sparse shifts for univariate polynomials, Implicitization of curves and (hyper)surfaces using predicted support, On enumerating monomials and other combinatorial structures by polynomial interpolation, Sparse multivariate polynomial interpolation on the basis of Schubert polynomials, A New Black Box Factorization Algorithm - the Non-monic Case, Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs, Factoring multivariate polynomials represented by black boxes: a Maple + C implementation, Fairness in temporal slot assignment, Integral reduction with Kira 2.0 and finite field methods, Interpolation of dense and sparse rational functions and other improvements in \texttt{FireFly}, On the evaluation of some sparse polynomials, Balancing act: multivariate rational reconstruction for IBP, Reconstructing rational functions with \texttt{FireFly}, An explicit separation of relativised random polynomial time and relativised deterministic polynomial time, Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators, Random arithmetic formulas can be reconstructed efficiently, Foreword, Solving structured linear systems with large displacement rank, A fast parallel sparse polynomial GCD algorithm, Symbolic-numeric sparse interpolation of multivariate polynomials, Solutions of systems of algebraic equations and linear maps on residue class rings, Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?, On the complexities of multipoint evaluation and interpolation, Incremental delay enumeration: space and time, An effective algorithm of computing symbolic determinants with multivariate polynomial entries, The complexity of sparse Hensel lifting and sparse polynomial factorization, Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations, A modular method to compute the rational univariate representation of zero-dimensional ideals, Using Sparse Interpolation in Hensel Lifting, Interpolation of polynomials given by straight-line programs, Results and techniques for higher order calculations within the gradient-flow formalism, Reconstructing Algebraic Functions from Mixed Data, An effective hybrid algorithm for computing symbolic determinants, An interpolation algorithm for computing Dixon resultants, The complexity of sparse polynomial interpolation over finite fields, Using sparse interpolation to solve multivariate diophantine equations

Cites Work