Abstract
Geometric constraint problem is equivalent to the problem of solving a set of nonlinear equations substantially. Nonlinear equations can be solved by classical Newton-Raphson algorithm. Path tracking is the iterative application of Newton-Raphson algorithm. The Homotopy iteration method based on the path tracking is appropriate for solving all polynomial equations. Due to at every step of path tracking we get rid off the estimating tache, and the number of divisor part is less, so the calculation efficiency is higher than the common continuum method and the calculation complexity is also less than the common continuum method.
Chapter PDF
Similar content being viewed by others
References
Yuan Bo, Research and Implementation of Geometric Constraint Solving Technology, Doctor dissertation, Tsinghua University, 1999
Chen Yong, Li Yong, Zhang Jian, Yan Jing, an iteration method based on the homotopy function—homotopy iteration method, the numerical calculation and computer appliance. 2:6 (2001), 149–155
Light R, Gossard D, Modification of geometric models through variational geometry[J], Computer Aided Design, 1982, 14(4): 209–214
Zhang Jiyuan, Shen Shoufan, Span analysis method determined framework kinematics solutions, Mechanism Engineering Journal, 27:2 (1991), 75–79
E.L. Allgower & K. Georg, Numerical Continuation Methods, An Introduction. Springer-Verlag, 1990
E.L. Allgower & K. Georg, Continuation and Path Following, Acta Numerical, 1993, p. 1–84
T.Y. LI, Numerical Solutions of Multivariate Polynomial Systems by Homotopy Continuation Methods, Acta Numerical, 1997, Vol.6, p.399–436
Wang Ketang, Gao Tangan, the introduction of homotopy method, Chongqing Press, 1990
Tsai, L.W., Morgan, A., Solving the Kinematics of the Most General Six-and-Five-Degree of Freedom Manipulators by Continuation Methods, ASME Journal of Mechanisms, Transmissions and Automation in Desig, 107 (1985), 189–200
Morgan, A.P., Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems, Prentice-Hall, 1987.
Li, T.Y., Yorke, J.A., The Random Product Homotopy and deficient Polynomial Systems, Numerische Mathemetik, 51 (1987), 481–500
Li, T.Y., Yorke, J.A., The Cheater’s Homotopy: An efficient Procedure for Solving System of Polynomial Equations, SIAM, Journal of Numerical Analysis, 18:2(1988), 173–177.
Morgan, A.P., Sommese, A.J., Coefficient Parameters Polynomial Continuation, Appl. Math. Comput. 29(1989), 123–160.oyouniurougan
Chen Y., Yan, J., An iteration Method Based on Homotopy Function For Solving Polynomial Systems and Application to Machanisms Problems, Journal of Southwest Jiaotong University, 5:1 (1997), 36–41
Chen. Y., Yan J.,The Homotopy Iteration and its application in the a general 6-SPS Parallel Robert Position Problem, Mechanism Science and Technology, 16:2 (1997), 189–194
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this paper
Cite this paper
Cao, C., Lu, Y., Li, W. (2005). The Research of Geometric Constraint Soving Based on the Path Tracking Homotopy Iteration Method. In: Shi, Z., He, Q. (eds) Intelligent Information Processing II. IIP 2004. IFIP International Federation for Information Processing, vol 163. Springer, Boston, MA. https://doi.org/10.1007/0-387-23152-8_11
Download citation
DOI: https://doi.org/10.1007/0-387-23152-8_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23151-8
Online ISBN: 978-0-387-23152-5
eBook Packages: Computer ScienceComputer Science (R0)