Padé逼近引出的[1/n]阶加权迭代算法
An Weighted Iterative Formula Based on[1/n]Padé Approximants
郭巧 1杨兵 1吴昌广2
作者信息
- 1. 安徽职业技术学院,安徽 合肥 230611
- 2. 南京理工大学,江苏 南京 210094
- 折叠
摘要
在有理函数逼近领域,Padé逼近是比较经典的求解非线性方程及方程组根的算法.本文以[1/0]、[1/1]、[1/2]阶Padé逼近所构造的迭代算法为基础,通过增加指数权重,进行泰勒级数展开,得到三类带参数的迭代算法,并进行收敛性分析,通过数值实例验证,在参数值特定情况下得到的迭代公式收敛速度优于Padé逼近,并且能够有效控制重根附近发散的情况,该算法在工程计算中的实用价值更突出.
Abstract
In the field of rational function approximation,Padé approximation is a classical algorithm for finding the roots of nonlinear e-quations or systems of equations.In this paper,based on the iterative algorithms constructed by Padé approximation of[1/0],[1/1]and[1/2]order,three types of iterative algorithms with parameters are obtained and convergence analysis is performed by increasing the exponential weights and applying Taylor series expansion.It is verified by numerical examples that the iterative formulas obtained for spe-cific values of parameters converge is faster than the Padé approximation and can effectively control the divergence around the repeated roots.The algorithm is more valuable in engineering calculations.
关键词
Padé逼近/加权/收敛性分析/迭代算法Key words
Padé approximation/weight/convergence analysis/iterative algorithm引用本文复制引用
出版年
2024
NETL
NSTL
万方数据