Yet another eigenvalue algorithm for solving polynomial systems
From MaRDI portal
Cites work
- A criterion for detecting m-regularity
- A fast recursive orthogonalization scheme for the Macaulay matrix
- A normal form algorithm for tensor rank decomposition
- A stabilized normal form algorithm for generic systems of polynomial equations
- An inequality for Hilbert series of graded algebras.
- Analysis of normal-form algorithms for solving systems of polynomial equations
- Applications of polynomial systems. With contributions by Carlos D'Andrea, Alicia Dickenstein, Jonathan Hauenstein, Hal Schenck, and Jessica Sidman
- Bilinear Systems with Two Supports
- Certifying zeros of polynomial systems using interval arithmetic
- Condition. The geometry of numerical algorithms
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- Gröbner basis over semigroup algebras. Algorithms and applications for sparse polynomial systems
- HomotopyContinuation.jl: a package for homotopy continuation in Julia
- scientific article; zbMATH DE number 4076472 (Why is no real title available?)
- scientific article; zbMATH DE number 1253975 (Why is no real title available?)
- scientific article; zbMATH DE number 1273646 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 1504686 (Why is no real title available?)
- scientific article; zbMATH DE number 1515218 (Why is no real title available?)
- Ideals, Varieties, and Algorithms
- Koszul-type determinantal formulas for families of mixed multilinear systems
- Matrices in elimination theory
- Multigraded Sylvester forms, duality and elimination matrices
- Numerical Polynomial Algebra
- Numerical root finding via Cox rings
- Numerically solving polynomial systems with Bertini
- On the complexity of sparse elimination
- Polymake.jl: a new interface to \texttt{polymake}
- Powers of ideals and the cohomology of stalks and fibers of morphisms
- Résolution des systèmes d'équations algébriques
- Solving a sparse system using linear algebra
- Solving polynomial systems via truncated normal forms
- Sparse Gröbner bases: the unmixed case
- Stickelberger and the Eigenvalue Theorem
- The number of roots of a system of equations
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Toric eigenvalue methods for solving sparse polynomial systems
- Toric varieties
- Towards Mixed Gröbner Basis Algorithms
- Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
- Using Algebraic Geometry
This page was built for publication: Yet another eigenvalue algorithm for solving polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6846967)
