An interpolation algorithm for computing Dixon resultants

DOI10.1007/978-3-031-14788-3_11OpenAlexW4300221964MaRDI QIDQ2109984

Ayoola Jinadu, Michael B. Monagan

Publication date: 21 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-14788-3_11

zbMATH Keywords

Dixon resultantresultantparametric polynomial systemsKronecker substitutionsparse rational function interpolation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05) Solving polynomial systems; resultants (13P15)

Uses Software

• Maple
• POLY
• Dixon-EDF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse interpolation of multivariate rational functions
• Interpolating polynomials from their values
• Resultants, implicit parameterizations, and intersections of surfaces
• An extended fast algorithm for constructing the Dixon resultant matrix
• The Berlekamp-Massey algorithm revisited
• Modern Computer Algebra
• Fast rational function reconstruction
• A Fast Parallel Sparse Polynomial GCD Algorithm
• Complexity of constructing Dixon resultant matrix
• The Evaluation of Determinants by Expansion by Minors and the General Problem of Substitution
• Dixon-EDF: The Premier Method for Solution of Parametric Polynomial Systems
• Maximal quotient rational reconstruction
• The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects
• Improved Division by Invariant Integers

This page was built for publication: An interpolation algorithm for computing Dixon resultants