An extended fast algorithm for constructing the Dixon resultant matrix

MaRDI QIDQ2458355zbMATH OpenFDO

Authors Shizhong Zhao, Hongguang Fu

Publication date 31 October 2007

Published in Science in China. Series A (Search for Journal in Brave)

zbMATH Keywords

Dixon resultant matrixSylvester resultant matrixtruncated formal power series

Mathematics Subject Classification ID

Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1189069
• A recursive algorithm for constructing complicated Dixon matrices
• Complexity of constructing Dixon resultant matrix
• Heuristics to accelerate the Dixon resultant
• scientific article; zbMATH DE number 1263399

Cited in

(14)

• Three kinds of extraneous factors in Dixon resultants
• Fast computation of the Bézout and Dixon resultant matrices
• Index reduction of differential algebraic equations by differential Dixon resultant
• An interpolation algorithm for computing Dixon resultants
• Heuristics to sift extraneous factors in Dixon resultants
• Heuristics to accelerate the Dixon resultant
• Constructing Sylvester-type resultant matrices using the Dixon formulation
• Complexity of constructing Dixon resultant matrix
• scientific article; zbMATH DE number 4169960 (Why is no real title available?)
• Applying Dixon resultants in cryptography
• scientific article; zbMATH DE number 1189069 (Why is no real title available?)
• Differential elimination with Dixon resultants
• Computing the Dixon resultant with the Maple package DR
• A recursive algorithm for constructing complicated Dixon matrices

Describes a project that uses

Uses Software

• Fermat
• Maple

This page was built for publication: An extended fast algorithm for constructing the Dixon resultant matrix

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