Computing the Dixon resultant with the Maple package DR

DOI10.1007/978-3-319-56932-1_19MaRDI QIDQ4610015zbMATH OpenOpenAlexFDO

Authors Manfred Minimair

Publication date 5 April 2018

Published in Applications of Computer Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-56932-1_19

zbMATH Keywords

Dixon matrixpolynomial systemresultant

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Determinants, permanents, traces, other special matrix functions (15A15) Symbolic computation and algebraic computation (68W30)

Recommendations

• Heuristics to accelerate the Dixon resultant
• Computations of multi-resultant with mechanization
• An interpolation algorithm for computing Dixon resultants
• Dixon-EDF: the premier method for solution of parametric polynomial systems
• scientific article; zbMATH DE number 2151215

Cites work

• An extended fast algorithm for constructing the Dixon resultant matrix
• Application of Dixon resultant to satellite trajectory control by pole placement
• Cayley-Dixon projection operator for multi-univariate composed polynomials
• Comparing acceleration techniques for the Dixon and Macaulay resultants
• Computing the Dixon resultant with the Maple package DR
• Conditions for determinantal formula for resultant of a polynomial system
• Fast computation of the Bézout and Dixon resultant matrices
• Heuristics to accelerate the Dixon resultant
• scientific article; zbMATH DE number 1263399 (Why is no real title available?)
• scientific article; zbMATH DE number 1983346 (Why is no real title available?)
• scientific article; zbMATH DE number 2051431 (Why is no real title available?)
• Matrices in elimination theory
• Multivariate resultants in Bernstein basis
• Solving the Selesnick-Burrus filter design equations using computational algebra and algebraic geometry
• The \textsc{SDEval} benchmarking toolkit

Cited in

(7)

• An interpolation algorithm for computing Dixon resultants
• Computations of multi-resultant with mechanization
• DR
• Dixon-EDF: the premier method for solution of parametric polynomial systems
• Computing the Dixon resultant with the Maple package DR
• A new interpolation algorithm for computing dixon resultants
• Iterated resultants and rational functions in real quantifier elimination

Describes a project that uses

Uses Software

• Fermat
• Maple
• SageMath
• SDeval

This page was built for publication: Computing the Dixon resultant with the Maple package DR

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4610015)