Name
Abstract | ||
|---|---|---|
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 with local computations involving derivatives, called a "local trace test." We conclude by demonstrating this local approach with examples from kinematics and tensor decomposition. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-42432-3_16 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Numerical algebraic geometry,Trace test,Numerical irreducible decomposition | Discrete mathematics,Applied mathematics,Kinematics,Polynomial,Computer science,System of polynomial equations,Numerical algebraic geometry,Solution set,Matrix polynomial,Tensor decomposition,Computation | Conference |
Volume | ISSN | Citations |
9725 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel A. Brake | 1 | 17 | 3.56 |
| Jonathan D. Hauenstein | 2 | 269 | 37.65 |
| Alan C. Liddell Jr. | 3 | 18 | 2.88 |