An interpolation algorithm for computing Dixon resultants
DOI10.1007/978-3-031-14788-3_11OpenAlexW4300221964MaRDI QIDQ2109984FDOQ2109984
Authors: Ayoola Jinadu, Michael Monagan
Publication date: 21 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-14788-3_11
Recommendations
resultantparametric polynomial systemsDixon resultantKronecker substitutionsparse rational function interpolation
Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05) Solving polynomial systems; resultants (13P15)
Cites Work
- The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects
- Title not available (Why is that?)
- Interpolating polynomials from their values
- Modern computer algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- An extended fast algorithm for constructing the Dixon resultant matrix
- Complexity of constructing Dixon resultant matrix
- Fast rational function reconstruction
- Maximal quotient rational reconstruction
- Sparse interpolation of multivariate rational functions
- Title not available (Why is that?)
- The Berlekamp-Massey algorithm revisited
- A Fast Parallel Sparse Polynomial GCD Algorithm
- The Evaluation of Determinants by Expansion by Minors and the General Problem of Substitution
- Resultants, implicit parameterizations, and intersections of surfaces
- Title not available (Why is that?)
- Improved Division by Invariant Integers
- Dixon-EDF: The Premier Method for Solution of Parametric Polynomial Systems
Cited In (4)
Uses Software
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)