关于"十进位制算法案例"的商榷

1 商榷背景与分析 普通高中课程标准实验教科书数学③(人民教育出版社A版)第一章1.3节"算法案例",这一节依次介绍了以下几个算法案例:辗转相除法与更相减损法、秦九韶算法、排序法和进位制.这一节内容的学习的目的是:使学生进一步体会算法的思想,以有利于培养学生的思维能力、理性精神和实践能力.另外,中国古代数学蕴涵着丰富的算法思想,以算法为主要特征,让学生了解、体会中国古代数学优秀的算法思想.     

中国南宋大数学家秦九韶——纪念“数书九章”成书740周年

秦九韶,南宋数学家,与李冶、杨辉、朱世杰齐名,同为我国数学黄金时代宋元时期的四大数学家之一。 秦九韶,字道古。他在《数书九章》自序题说自已是鲁郡人,有“鲁郡秦九韶叙”几个字。《四库全书总目提要》(卷一○四)说他所写的是秦氏先世所居,不是他的籍贯。实际上,秦九韶1202年生于四川,其父名季槱字宏父,晋州安岳(今四川安岳)人,1219年任巴州     

中国剩余问题的探究

<正>剩余问题是一类有趣的数论问题.宋代数学家秦九韶总结了中国古代数学家的经验,完整而系统的提出了"大衍求一术",并用"大衍求一术"完满地解决了一次同余方程组求解的问题,被世界数学界誉为中国剩余定理(即孙子定理).中国剩余定理在世界数学史上有着广泛的影响.但并不容易被中小学生理解.     

黄同学的一把斧头——恒等变换

黄家升是我的同班同学,物理课代表,他思维敏捷、机智过人.在我心目中,他是智者的化身. 一个星期天,我去他家串门.我们便海阔天空地聊起来. “阿林,前一阵子你写的那一篇文章《海伦公式拾贝》我看过了,很好.”“过奖.这只不过是我写的读书心得而已.”“阿林,为什么你不在上面提一提秦九韶公式呢?”“秦九韶公式我是知道的.它的内容是:‘在△ABC中,     

例谈“左右平衡放缩法”证明不等式

<正>笔者最近在研究三元全对称不等式的证明过程中,发现一种巧妙的证明方法,起名为"左右平衡放缩法"(又名为"正负同向放缩法")效果很好,现举例说明,供同学们参考.例1设正数a、b、c满足a+b+c=1,求证     

交错级数敛散性判别法

给出了交错级数的一个判别法,应用此判别法可直接判别交错级数是否收敛,以及收敛时是绝对收敛还是条件收敛.     

交错级数敛散性的微分形式判别法

给出交错级数敛散性微分形式的判别法,应用此判别法可直接判别交错级数是否收敛,以及收敛时是绝对收敛还是条件收敛.     

一阶导数满足L-平均Lipschitz条件下Newton-Steffensen法的三阶收敛性

研究了用Newton-Steffensen法求解非线性算子方程.当非线性算子F的一阶导数满足L-平均Lipschitz条件时,建立了Newton-Steffensen法的三阶收敛判据,同时也给出了收敛球半径的估计.作为应用,当F的一阶导数满足经典的Lipschitz条件时或F满足γ-条件时,建立了Newton-Steffensen法的三阶收敛判据及给出了收敛球半径的估计.从而推广了[Journal of Nonlinear and Convex Analysis,2018,19:433-460]中的相应结果.     

别证一个不等式

<正>贵刊2013年7月(下)课外练习题初三年级第3题是:设a、b、c为△ABC的三边长,S为面积,则a2+b2+c2≥43～1/2S(1)此题是安徽的王秉春老师提供的,其答案给出的证法很是巧妙,但学生不易想到.笔者再给出另一种学生较易想到的证法.证明设p=1/2(a+b+c),由秦九韶—海     

随机梯度下降法的收敛速度(英文)

本文研究了正则化格式下随机梯度下降法的收敛速度.利用线性迭代的方法,并通过参数选择,得到了随机梯度下降法的收敛速度.     

弦割法与Muller法收敛阶的新证明方法

弦割法、Muller法与牛顿法一样,都是求解非线性方程的著名算法之一.然而在目前众多优秀的数值分析教材或论著中.关于弦割法和Muller法收敛阶的证明过程都是比较复杂的,无一例外的都是借助于差分方程的求解.本文对这两个算法的收敛阶给出了一种新的简单、直接的证明方法,达到了与牛顿法收敛阶证明方法的统一,同时还能够方便地求...     

一个三阶牛顿变形方法

基于反函数建立的积分方程,结合Simpson公式,给出了一个非线性方程求根的新方法,即为牛顿变形方法.证明了它至少三次收敛到单根,与牛顿法相比,提高了收敛阶和效率指数.文末给出数值试验,且与牛顿法和同类型牛顿变形法做了比较.结果表明方法具有较好的优越性,它丰富了非线性方程求根的方法.     

一个四阶收敛的牛顿类方法

A fourth-order convergence method of solving roots for nonlinear equation,which is a variant of Newton's method given.Its convergence properties is proved.It is at least fourth-order convergence near simple roots and one order convergence near multiple roots. In the end,numerical tests are given and compared with other known Newton and Newtontype methods.The results show that the proposed method has some more advantages than others.It enriches the methods to find the roots of non-linear equations and it ...     

Variants of Steffensen-secant method and applications

In this paper, a parametric variant of Steffensen-secant method and three fast variants of Steffensen-secant method for solving nonlinear equations are suggested. They achieve cubic convergence or super cubic convergence for finding simple roots by only using three evaluations of the function per step. Their error equations and asymptotic convergence constants are deduced. Modified Steffensen’s method and modified parametric variant of Steffensen-secant method for finding multiple roots are also discussed. In the numerical examples, the suggested methods are supported by the solution of nonlinear equations and systems of nonlinear equations, and the application in the multiple shooting method.     

A note on the convergence of the secant method for simple and multiple roots

The secant method is one of the most popular methods for root finding. Standard text books in numerical analysis state that the secant method is superlinear: the rate of convergence is set by the gold number. Nevertheless, this property holds only for simple roots. If the multiplicity of the root is larger than one, the convergence of the secant method becomes linear. This communication includes a detailed analysis of the secant method when it is used to approximate multiple roots. Thus, a proof of the linear convergence is shown. Moreover, the values of the corresponding asymptotic convergence factors are determined and are found to be also related with the golden ratio.     

牛顿方法的两个新格式

给出牛顿迭代方法的两个新格式,S im pson牛顿方法和几何平均牛顿方法,证明了它们至少三次收敛到单根,线性收敛到重根.文末给出数值试验,且与其它已知牛顿法做了比较.结果表明收敛性方法具有较好的优越性,它们丰富了非线性方程求根的方法,在理论上和应用上都有一定的价值.     

一类四阶牛顿变形方法

给出非线性方程求根的一类四阶方法,也是牛顿法的变形方法.证明了方法收敛性,它们至少四次收敛到单根,线性收敛到重根.文末给出数值试验,且与牛顿法及其它牛顿变形法做了比较.结果表明方法具有很好的优越性,它丰富了非线性方程求根的方法,在理论上和应用上都有一定的价值.     

A new family of Schröder's method and its variants based on power means for multiple roots of nonlinear equations

In this article, we derive one-parameter family of Schröder's method based on Gupta et al.'s (K.C. Gupta, V. Kanwar, and S. Kumar, A family of ellipse methods for solving non-linear equations, Int. J. Math. Educ. Sci. Technol. 40 (2009), pp. 571–575) family of ellipse methods for the solution of nonlinear equations. Further, we introduce new families of Schröder-type methods for multiple roots with cubic convergence. Proposed families are derived from modified Newton's method for multiple roots and one-parameter family of Schröder's method. Numerical examples are also provided to show that these new methods are competitive to other known methods for multiple roots.     

几类改进的新的两步六阶Chebyshev-Halley方法

利用权函数法,给出非线性方程求根的Chebyshev-Halley方法的几类改进方法,证明方法六阶收敛到单根.Chebyshev-Halley方法的效率指数为1.442,改进后的两步方法的效率指数为1.565.最后给出数值试验,且与牛顿法,Chebyshev-Halley 方法及其它已知的方程求根方法做了比较.结果表明方法具有一定的优越性.     

Two new families of sixth-order methods for solving non-linear equations

In this paper, we developed two new families of sixth-order methods for solving simple roots of non-linear equations. Per iteration these methods require two evaluations of the function and two evaluations of the first-order derivatives, which implies that the efficiency indexes of our methods are 1.565. These methods have more advantages than Newton’s method and other methods with the same convergence order, as shown in the illustration examples. Finally, using the developing methodology described in this paper, two new families of improvements of Jarratt method with sixth-order convergence are derived in a straightforward manner. Notice that Kou’s method in [Jisheng Kou, Yitian Li, An improvement of the Jarratt method, Appl. Math. Comput. 189 (2007) 1816-1821] and Wang’s method in [Xiuhua Wang, Jisheng Kou, Yitian Li, A variant of Jarratt method with sixth-order convergence, Appl. Math. Comput. 204 (2008) 14-19] are the special cases of the new improvements.