Decomposing Solution Sets of Polynomial Systems Using Derivatives [chapter]

Daniel A. Brake, Jonathan D. Hauenstein, Alan C. Liddell
2016 Lecture Notes in Computer Science  
A core computation in numerical algebraic geometry is the decomposition of the solution set of a system of polynomial equations into irreducible components, called the numerical irreducible decomposition. One approach to validate a decomposition is what has come to be known as the "trace test." This test, described by Sommese, Verschelde, and Wampler in 2002, relies upon path tracking and hence could be called the "tracking trace test." We present a new approach which replaces path tracking
more » ... local computations involving derivatives, called a "local trace test." We conclude by demonstrating this local approach with examples from kinematics and tensor decomposition.
doi:10.1007/978-3-319-42432-3_16 fatcat:eugxstgp4bf6nklwk4ia53oeta