Algorithm 777: HOMPACK90: a suite of Fortran 90 codes for globally convergent homotopy algorithms
ACM Transactions on Mathematical Software (TOMS)
Journal of Symbolic Computation - Special issue on symbolic numeric algebra for polynomials
Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
SIAM Journal on Numerical Analysis
Computing the multiplicity structure in solving polynomial systems
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Newton's method with deflation for isolated singularities of polynomial systems
Theoretical Computer Science
Finding the Homology of Submanifolds with High Confidence from Random Samples
Discrete & Computational Geometry
Numerical primary decomposition
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Computing intersection numbers of Chern classes
Journal of Symbolic Computation
Hi-index | 0.00 |
Homotopy continuation provides a numerical tool for computing the equivalence of a smooth variety in an intersection product. Intersection theory provides a theoretical tool for relating the equivalence of a smooth variety in an intersection product to the degrees of the Chern classes of the variety. A combination of these tools leads to a numerical method for computing the degrees of Chern classes of smooth projective varieties in P^n. We illustrate the approach through several worked examples.