Numerical Computation of Monodromy Action Over R

Explore numerical computation of monodromy action over real numbers in this 37-minute conference talk by Margaret Regan from Duke University. Delve into a new approach for computing monodromy groups over real numbers, which is performed piece-wise to obtain tiered characteristics of real solution sets. Learn about the complex monodromy group as a geometric invariant encoding solution structures for parameterized polynomial systems. Examine an application in kinematics to understand the computational method and its impact on calibration. Cover topics including motivation, complex monodromy groups, real monodromy structure, and the 3RPR mechanism. Gain insights from this presentation, part of the Workshop on Real Algebraic Geometry and Algorithms for Geometric Constraint Systems at the Fields Institute.

Intro
Outline
Motivation
Complex monodromy group
Example 2
Real monodromy structure
3RPR mechanism
Summary