Hybrid sparse resultant matrices for bivariate systems
From MaRDI portal
Publication:2958910
DOI10.1145/384101.384106zbMath1356.68274OpenAlexW1966341842MaRDI QIDQ2958910
Ioannis Z. Emiris, Carlos D'Andrea
Publication date: 3 February 2017
Published in: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/384101.384106
Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30) Computer science aspects of computer-aided design (68U07) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Determinants, permanents, traces, other special matrix functions (15A15)
Related Items
Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation, Hybrid sparse resultant matrices for bivariate polynomials, Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomials
Uses Software