Hybrid sparse resultant matrices for bivariate systems
DOI10.1145/384101.384106zbMATH Open1356.68274OpenAlexW1966341842MaRDI QIDQ2958910FDOQ2958910
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
Recommendations
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)
Cited In (9)
- Title not available (Why is that?)
- Matrices in elimination theory
- On the Mixed Cayley-Sylvester Resultant Matrix
- Toric Sylvester forms
- Hybrid sparse resultant matrices for bivariate polynomials
- Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation
- Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomials
- The resultant of an unmixed bivariate system
- Toric resultants and applications to geometric modelling
Uses Software
This page was built for publication: Hybrid sparse resultant matrices for bivariate systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958910)