Interpolating polynomials from their values
From MaRDI portal
The author discusses algorithms for solving the problem of interpolating polynomials from their values and presents solutions to both the zero avoidance problem and the interpolating problem for sparse polynomials.
Recommendations
Cites work
- An Improved Multivariate Polynomial Factoring Algorithm
- Approximate formulas for some functions of prime numbers
- Factoring Multivariate Polynomials Over the Integers
- Factoring sparse multivariate polynomials
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3942888 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3723860 (Why is no real title available?)
- scientific article; zbMATH DE number 3528170 (Why is no real title available?)
- Irreducibility of multivariate polynomials
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
Cited in
(56)- Interpolation of polynomials given by straight-line programs
- An effective hybrid algorithm for computing symbolic determinants
- Solutions of systems of algebraic equations and linear maps on residue class rings
- The complexity of sparse polynomial interpolation over finite fields
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Sparse multivariate polynomial interpolation on the basis of Schubert polynomials
- A modular method to compute the rational univariate representation of zero-dimensional ideals
- Early termination in sparse interpolation algorithms
- Sparse shifts for univariate polynomials
- A fast parallel sparse polynomial GCD algorithm
- Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?
- An interpolation algorithm for computing Dixon resultants
- Sparse polynomial interpolation based on diversification
- Sparse polynomial interpolation based on derivatives
- Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs
- Incremental delay enumeration: space and time
- The complexity of sparse Hensel lifting and sparse polynomial factorization
- Results and techniques for higher order calculations within the gradient-flow formalism
- Prony's method in several variables: symbolic solutions by universal interpolation
- Faster sparse multivariate polynomial interpolation of straight-line programs
- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
- Reconstructing rational functions with \texttt{FireFly}
- Sparse polynomial interpolation by variable shift in the presence of noise and outliers in the evaluations
- Using sparse interpolation in Hensel lifting
- Black-box polynomial resultants
- On learning multivariate polynomials under the uniform distribution
- Interpolation polynomials. Application in findingsome combinatorial formulas
- Implicitization of curves and (hyper)surfaces using predicted support
- On enumerating monomials and other combinatorial structures by polynomial interpolation
- Reconstructing Algebraic Functions from Mixed Data
- On the evaluation of some sparse polynomials
- Random arithmetic formulas can be reconstructed efficiently
- Using sparse interpolation to solve multivariate Diophantine equations
- scientific article; zbMATH DE number 6469260 (Why is no real title available?)
- Symbolic-numeric sparse interpolation of multivariate polynomials
- Foreword
- A New Black Box Factorization Algorithm - the Non-monic Case
- 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}
- Balancing act: multivariate rational reconstruction for IBP
- One loop QCD corrections to \(gg\rightarrow t\bar{t}H\) at \(\mathcal{O}(\epsilon^2)\)
- Amplitudes, supersymmetric black hole scattering at \(\mathcal{O}(G^5)\), and loop integration
- Efficient reduction of Feynman integrals on supercomputers
- Sparse multiplication of multivariate linear differential operators
- A new black box GCD algorithm using Hensel lifting
- On the decidability of sparse univariate polynomial interpolation
- Reconstructing Laurent expansion of rational functions using p-adic numbers
- A Maple program to factor multivariate polynomials given by black boxes
- Fast interpolation and multiplication of unbalanced polynomials
- On the complexities of multipoint evaluation and interpolation
- Structured matrices in the application of bivariate interpolation to curve implicitization
- 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
- Solving structured linear systems with large displacement rank
- An effective algorithm of computing symbolic determinants with multivariate polynomial entries
This page was built for publication: Interpolating polynomials from their values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915342)
