A package for computations with sparse resultants
From MaRDI portal
Publication:2121682
Abstract: We introduce the Macaulay2 package SparseResultants, which provides general tools for computing sparse resultants, sparse discriminants, and hyperdeterminants. We give some background on the theory and briefly show how the package works.
Recommendations
- A package for computations with classical resultants
- scientific article; zbMATH DE number 5302296
- scientific article; zbMATH DE number 1263319
- scientific article; zbMATH DE number 503188
- SPARSEM: A subroutine package to operate with large sparse matrices
- Sparse polynomial arithmetic with the BPAS library
- A multiprecise integer arithmetic package
- Sparse resultants and straight-line programs
- Sparse matrix multiplication package (SMMP)
Cites work
- A package for computations with classical resultants
- A Poisson formula for the sparse resultant
- A subdivision-based algorithm for the sparse resultant
- Deformation techniques for sparse systems
- Hyperdeterminants
- Macaulay style formulas for sparse resultants
- Matrices in elimination theory
- On the Newton polytope of the resultant
- Residues and Resultants
- Singularities of hyperdeterminants
- The Binet--Cauchy theorem for the hyperdeterminant of boundary format multi-dimensional matrices
- The computational complexity of the Chow form
- The hyperdeterminant and triangulations of the 4-cube
- Using Algebraic Geometry
Cited in
(7)- A package for computations with classical resultants
- Kinematic singularities of Feynman integrals and principal \(A\)-determinants
- Decomposable sparse polynomial systems
- Macaulay style formulas for sparse resultants
- scientific article; zbMATH DE number 5556006 (Why is no real title available?)
- SparseResultants
- Sparse trace tests
This page was built for publication: A package for computations with sparse resultants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2121682)