Constructing Sylvester-type resultant matrices using the Dixon formulation

DOI10.1016/J.JSC.2003.11.003MaRDI QIDQ2643539zbMATH OpenOpenAlexFDO

Authors Arthur Chtcherba, Deepak Kapur

Publication date 24 August 2007

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jsc.2003.11.003

zbMATH Keywords

supportresultantDixon methodBKK boundCayley-Dixon constructiondialytic matricesdialytic methodDixon resultant formulationSylvester-type matricesBézoutians

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Determinants, permanents, traces, other special matrix functions (15A15) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Computational aspects and applications of commutative rings (13P99)

Recommendations

• On the solving of matrix equation of Sylvester type
• Structure of the inverse to the Sylvester resultant matrix
• An extended fast algorithm for constructing the Dixon resultant matrix
• An application of Sylvester matrices
• Closed-form solutions to Sylvester-conjugate matrix equations
• Complexity of constructing Dixon resultant matrix
• scientific article; zbMATH DE number 67107
• scientific article; zbMATH DE number 1076236
• Symbolic and numeric methods for exploiting structure in constructing resultant matrices
• Solving the system of Sylvester matrix equations

Cites work

• scientific article; zbMATH DE number 107777 (Why is no real title available?)
• scientific article; zbMATH DE number 3563286 (Why is no real title available?)
• scientific article; zbMATH DE number 1206418 (Why is no real title available?)
• scientific article; zbMATH DE number 1263399 (Why is no real title available?)
• scientific article; zbMATH DE number 575960 (Why is no real title available?)
• scientific article; zbMATH DE number 578220 (Why is no real title available?)
• scientific article; zbMATH DE number 2151215 (Why is no real title available?)
• scientific article; zbMATH DE number 953014 (Why is no real title available?)
• A subdivision-based algorithm for the sparse resultant
• Conditions for exact resultants using the Dixon formulation
• Efficient incremental algorithms for the sparse resultant and the mixed volume
• Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation
• Generalized resultants over unirational algebraic varieties
• Matrices in elimination theory
• Multigraded resultants of Sylvester type
• Multihomogeneous resultant formulae by means of complexes
• Product formulas for resultants and Chow forms
• Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation

Cited in

(8)

• On the Mixed Cayley-Sylvester Resultant Matrix
• Index reduction of differential algebraic equations by differential Dixon resultant
• Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation
• Discussion of the relation among three multi-polynomial resultants
• Applications of an improved Dixon elimination method for the inverse kinematics of 6R manipulators
• scientific article; zbMATH DE number 2145003 (Why is no real title available?)
• Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation
• Koszul-type determinantal formulas for families of mixed multilinear systems

This page was built for publication: Constructing Sylvester-type resultant matrices using the Dixon formulation

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