用于求根问题的一个基于Thiele连分式的四阶收敛的迭代方法

利用截断的Thiele连分式,本文给出了一个求解非线性单变量方程的单步迭代方法,并证明了所提出的迭代方法具有四阶收敛性.最后,本文通过一些数值例子说明了所提出的方法的有效性和表现.     

正向量连分式收敛的充分必要条件

我们讨论了如下形式的向量值连分式这里b_n=(b_n¹,b_n²,…,b_n^d)满足Samelson逆,而且a_n,b_n¹,b_n²,…,b_n^d均为正.给出了形如(#)的向量值连分式收敛的充分和必要条件,同时给出了收敛时的截断误差估计.     

参数化连分式拟合方法研究及应用

通过倒差商-连分式算法,提出了一种保端点非线性有理参数化拟合算法,通过选取中间点的参数化,利用连分式插值法,得到的拟合函数具有保端点性,规律性和灵活性.实例表明,算法减少了连分式插值迭代次数,避免插值连分式的不存在性,所得到拟合值具有更好的精度,大大提高了计算效率,拟合的误差更具有平稳性,逼近效果更好,并具有较好的预测等方面的应用.     

一类极限循环连分式的加速收敛因子

本文获得了一类极限循环连分式的加速收敛因子,证明了它们具有良好的加速收敛性质.     

关于差商和Newton插值公式教学的一些体会

针对讲授Newton插值多项式之前,如何自然地引入差商概念,介绍了一些心得体会;同时对Newton插值公式给出了一种简便、学生易于理解的证明方法.     

二元Thiele型向量连分式逼近的余项公式

文[1]利用向量的Samelson逆变换V~(-1)=V/|V|~2得到了向量函数V(x,y)的第(n,m)阶连分式逼近的表达式     

基于Thiele型连分式的数值积分

基于Thiele型连分式构造求积公式,这类求积公式能再生由Thiele型连分式前三项渐近式的线性组合所表示的任意有理函数,接着算出求积余项,并推导出分母在给定区间上无零点的充分条件.更进一步,通过等分给定区间,构造相应的复化求积公式,并算出求积余项.研究表明,在若干条件满足的前提下,复化求积公式序列能一致收敛于积分真值,一些数值算例说明了这一点.     

矩阵连分式序列的收敛性

本文研究了矩阵连分式的性质，获得了关于矩阵连分式序列收敛性的一些结果．     

基于Samelson逆的向量值连分式的收敛准则

The aim of this work is to give some criteria on the convergence of vector valued continued fractions defined by Samelson inverse. We give a new approach to prove the convergence theory of continued fractions. First, by means of the modified classical backward recurrence relation, we obtain a formula between the m-th and n-th convergence of vector valued continued fractions. Second, using this formula, we give necessary and sufficient conditions for the convergence of vector valued continued fractions.     

基于连分式与Newton-Padé逼近的数值积分

首先利用Newton-Pade表中部分序列推导出连分式,提出逆差商算法,算出关于高阶导数与高阶差商的连分式插值余项.接着,构造基于此类连分式的有理求积公式与相应的复化求积公式,算出相应的求积余项,研究表明,在一定条件下,求积公式序列一致收敛于积分真值.然后,为保证连分式计算顺利进行,研究连分式分母非0的充分条件.最后,若干数值算例表明,对某些函数采用新提出的复化有理求积公式计算数值积分,所得结果优于采用Simpson公式.     

On a Continued Fraction Formula of Wall

We study the combinatorics of a continued fraction formula due to Wall. We also derive the orthogonality of little q-Jacobi polynomials from this formula, as Wall did for little q-Laguerre polynomials.     

Engel连分数展式与Huasdorff维数

本文研究了Engel连分数中部分商以某种速度增长的集合,以及Engel连分数展式收敛速度较快的点组成的集合,利用质量分布原理,证明了这些集合的Haus-dorff维数为1.     

修正的三次收敛的牛顿迭代法

给出了牛顿迭代法的两种修正形式,证明了它们都是三阶收敛的,给出的相互比较的数值例子有力地说明了这一点.     

修正的三阶收敛的牛顿迭代法

给出了牛顿迭代法的两种修正形式,证明了它们是三阶收敛的,数值实验表明,与其它已知的三阶收敛的牛顿迭代法相比,修正的牛顿迭代法具有一定的优势.     

Rate of convergence of a generalization of Newton's method

The Newton's method for finding the root of the equation (t)=0 can be easily generalized to the case where is monotone, convex, but not differentiable. Then, the convergence is superlinear. The purpose of this note is to show that the convergence is only superlinear. Indeed, for all (1, 2), we exhibit an example where the convergence of the iterates is exactly .     

Sphere of Convergence of Newton's Method on Two Equivalent Systems from Nonlinear Programming

We study a local feature of two interior-point methods: a logarithmic barrier function method and a primal-dual method. In particular, we provide an asymptotic analysis on the radius of the sphere of convergence of Newton's method on two equivalent systems associated with the two aforementioned interior-point methods for nondegenerate nonlinear programs. We show that the radii of the spheres of convergence have different asymptotic behavior, as the two methods attempt to follow a solution trajectory {x } that, under suitable conditions, converges to a solution as 0. We show that, in the case of the barrier function method, the radius of the sphere of convergence of Newton's method is (), while for the primal-dual method the radius is bounded away from zero as 0. This work is an extension of the authors earlier work (Ref. 1) on linear programs.     

The cubic semilocal convergence on two variants of Newton's method

In this paper, we discuss two variants of Newton's method without using any second derivative for solving nonlinear equations. By using the majorant function and confirming the majorant sequences, we obtain the cubic semilocal convergence and the error estimation in the Kantorovich-type theorems. The numerical examples are presented to support the usefulness and significance.     

A Family of Fifth-Order Iterative Methods for Solving Nonlinear Equations

In this paper, we present and analyze a family of fifth-order iterative methods free from second derivative for solving nonlinear equations. It is established that the family of iterative methods has convergence order five. Numerical examples show that the new methods are comparable with the well known existing methods and give better results in many aspects.