glen/dyna3
1
0
Fork 0
Code Issues 14 Pull Requests 1 Actions Projects Releases 2 Wiki Activity

Add challenging examples with respect to performance and finding witnesses

Vectornaut 2024-02-13 21:00:41 +00:00
parent ec05e29ef9
commit 2d1fccd845
1 changed files with 9 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
Engine-prototype.md

@ -5,6 +5,13 @@
* In tests with no scale constraint (based on commit 8e33987), hyperplanes through the origin tend to hit around 1.5 times as many real solutions as ones through the trivial solution.
* In tests with a scale constraint (based on commit af1d31f), the hit ratio drops to 1.0 to 1.2, and becomes more variable.
### Challenging examples
With three mutually tangent spheres, `HomotopyContinuation` doesn't seem to find solutions, even though we know there are some. One solution, in $[r, s, x, y, z]$ coordinates, is:
* $[0, 0, 0, 0, 1]$ (plane perpendicular to $z$ axis)
* $[1, 0, 0, 0, 1]$ (unit sphere above plane, touching at $[x, y] = [0 ,0]$)
* $[1, 4, 0, 2, 1]$ (unit sphere above plane, touching at $[x, y] = [0, 2]$)
## Rational points
One strategy for exploring a positive-dimensional solution variety is to enumerate rational points. When the user drags the display, we move numerically along the solution variety, snapping to the nearest known rational point when the drag ends.
@ -28,6 +35,8 @@ The size of the Gröbner basis depends a lot on the variable order. For the exam
* One point on a sphere
* Two points on a sphere
* Three mutually tangent spheres
* Two spheres, and a bunch of points which are each on both spheres
* With the current system for turning a construction into a system of equations, the Gröbner basis calculation becomes overwhelmingly big with three points and two spheres. Removing one of the points makes the calculation totally manageable.
## General simplifications