Combinatorial excess intersection
DOI10.1016/J.JSC.2014.09.034zbMATH Open1316.14111arXiv1212.2249OpenAlexW2053509893MaRDI QIDQ480696FDOQ480696
Authors: Jose Israel Rodriguez
Publication date: 9 December 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.2249
Recommendations
- A saturation algorithm for homogeneous binomial ideals
- Numerical decomposition of the solution sets of polynomial systems into irreducible components
- A special homotopy continuation method for a class of polynomial systems
- A polyhedral homotopy algorithm for real zeros
- Multiplication matrices and ideals of projective dimension zero
- Homotopies for connected components of algebraic sets with application to computing critical sets
- Certified numerical homotopy tracking
- Mixed cell computation in HOM4ps
- scientific article; zbMATH DE number 2084924
- On approximate linearized triangular decompositions
Symbolic computation and algebraic computation (68W30) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Computational aspects in algebraic geometry (14Qxx)
Cites Work
- Algorithm 795
- Lectures on Polytopes
- Title not available (Why is that?)
- How to integrate a polynomial over a simplex
- Software for numerical algebraic geometry: a paradigm and progress towards its implementation
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Segre classes on smooth projective toric varieties
- Computing intersection numbers of Chern classes
- Segre classes as integrals over polytopes
- Algebraic geometric comparison of probability distributions
- Chern numbers of smooth varieties via homotopy continuation and intersection theory
Cited In (1)
Uses Software
This page was built for publication: Combinatorial excess intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q480696)