An interpolation algorithm for computing Dixon resultants
From MaRDI portal
Publication:2109984
Recommendations
Cites work
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 1253976 (Why is no real title available?)
- scientific article; zbMATH DE number 1254250 (Why is no real title available?)
- scientific article; zbMATH DE number 1263399 (Why is no real title available?)
- scientific article; zbMATH DE number 2151215 (Why is no real title available?)
- A fast parallel sparse polynomial GCD algorithm
- An extended fast algorithm for constructing the Dixon resultant matrix
- Complexity of constructing Dixon resultant matrix
- Dixon-EDF: the premier method for solution of parametric polynomial systems
- Fast rational function reconstruction
- Improved Division by Invariant Integers
- Interpolating polynomials from their values
- Maximal quotient rational reconstruction
- Modern computer algebra
- Resultants, implicit parameterizations, and intersections of surfaces
- Sparse interpolation of multivariate rational functions
- The Berlekamp-Massey algorithm revisited
- The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects
- The Evaluation of Determinants by Expansion by Minors and the General Problem of Substitution
Cited in
(6)- scientific article; zbMATH DE number 2058003 (Why is no real title available?)
- Computing Dixon polynomial via interpolation algorithms
- Solving Parametric Linear Systems Using Sparse Rational Function Interpolation
- Heuristics to sift extraneous factors in Dixon resultants
- A new interpolation algorithm for computing dixon resultants
- Computing the Dixon resultant with the Maple package DR
This page was built for publication: An interpolation algorithm for computing Dixon resultants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109984)