期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
An Iteration Method Based on Homotopy Function for Solving Polynomial Systems and Application to Mechanisms Problems 被引量:1
1
作者 Chen Yong Yan Jing School of Mechanical Engineering, Southwest Jiaotong University, Chengdu 610031, China 《Journal of Modern Transportation》 1997年第1期37-44,共8页
A new iterating method based on homotopy function is developed in this paper. All solutions can be found easily without the need of choosing proper initial values. Compared to the homotopy continuation method, the sol... A new iterating method based on homotopy function is developed in this paper. All solutions can be found easily without the need of choosing proper initial values. Compared to the homotopy continuation method, the solution process of the present method is simplified, and the computation efficiency as well as the reliability for obtaining all solutions is also improved. By application of the method to the mechanisms problems, the results are satisfactory. 展开更多
关键词 numerical iteration method homotopy iteration algorithm polynomial systems kinematic analysis and synthesis of mechanisms
在线阅读 下载PDF
Progressive explicit formulae for root-finding problems based on reparameterization
2
作者 WANG Hui QIAN Cheng CHEN Xiao-diao 《Applied Mathematics(A Journal of Chinese Universities)》 2025年第4期833-852,共20页
This paper presents an explicit formula based on reparameterization technique for progressively computing a simple root of a smooth function,which may have wide applications in robotics,geomagnetic navigation,geometri... This paper presents an explicit formula based on reparameterization technique for progressively computing a simple root of a smooth function,which may have wide applications in robotics,geomagnetic navigation,geometric processing and computer graphics.Comparing with Newton-like method,it can achieve convergence rate 2 by adding one more functional evaluation,improve the computational stability and ensure the convergence,and also obtain higher convergence rate and higher efficiency index.Compared with clipping methods for polynomials,it doesn't need to bound the polynomials,directly bound the roots and can also work well for non-polynomial functions with much higher computational efficiency.Comparing with previous progressive methods,it achieves a much higher computational efficiency and is extended to solve bivariate equation system.Numerical examples show its much better performance on approximation error,computational efficiency and computational stability. 展开更多
关键词 root-nding re-parameterization-based method clipping method numerical iterative method convergence order non-linear equation system progressive explicit formulae
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部