large polynomial systems
Recently Published Documents


TOTAL DOCUMENTS

2
(FIVE YEARS 0)

H-INDEX

1
(FIVE YEARS 0)

2017 ◽  
Vol 9 (2) ◽  
Author(s):  
Mark M. Plecnik ◽  
Ronald S. Fearing

In this work, a new method is introduced for solving large polynomial systems for the kinematic synthesis of linkages. The method is designed for solving systems with degrees beyond 100,000, which often are found to possess quantities of finite roots that are orders of magnitude smaller. Current root-finding methods for large polynomial systems discover both finite and infinite roots, although only finite roots have meaning for engineering purposes. Our method demonstrates how all infinite roots can be precluded in order to obtain substantial computational savings. Infinite roots are avoided by generating random linkage dimensions to construct startpoints and start systems for homotopy continuation paths. The method is benchmarked with a four-bar path synthesis problem.


Author(s):  
Mark M. Plecnik ◽  
Ronald S. Fearing

In this work, a new method is introduced for solving large polynomial systems for the kinematic synthesis of linkages. The method is designed for solving systems with degrees beyond 100,000, which often are found to possess a number of finite roots that is orders of magnitude smaller. Current root-finding methods for large polynomial systems discover both finite and infinite roots, although only finite roots have meaning for engineering purposes. Our method demonstrates how all infinite roots can be avoided in order to obtain substantial computational savings. Infinite roots are avoided by generating random linkage dimensions to construct start-points and start-systems for homotopy continuation paths. The method is benchmarked with a four-bar path synthesis problem.


Sign in / Sign up

Export Citation Format

Share Document