...
首页> 外文期刊>Numerische Mathematik >Acceleration of convergence of general linear sequences by the Shanks transformation
【24h】

Acceleration of convergence of general linear sequences by the Shanks transformation

机译:通过Shanks变换加速一般线性序列的收敛

获取原文
获取原文并翻译 | 示例

摘要

The Shanks transformation is a powerful nonlinear extrapolation method that is used to accelerate the convergence of slowly converging, and even diverging, sequences {A_n}. It generates a two-dimensional array of approximations A_n~((j)) to the limit or anti-limit of {A_n} defined as solutions of the linear systems Where β? are additional unknowns. In this work, we study the convergence and stability properties of A_n~((j)), as j → ∞ with n fixed, derived from general linear sequences {A_n}, where as n → ∞, where ζ_k ≠ 1 are distinct and {pipe}ζ_1{pipe}=... ={pipe}ζ_m{pipe}= θ, and γ_k ≠ 0, 1, 2,.... Here A is the limit or the anti-limit of {A_n}. Such sequences arise, for example, as partial sums of Fourier series of functions that have finite jump discontinuities and/or algebraic branch singularities. We show that definitive results are obtained with those values of n for which the integer programming problems have unique (integer) solutions for s_1,..., s_m. A special case of our convergence result concerns the situation in which and n = mν with ν = 1, 2,..., for which the integer programming problems above have unique solutions, and it reads A_n~((j)) - A = O(θ~j j~(α-2v)) as j → ∞. When compared with A_j - A = O(θ~j j~α) as j → ∞, this result shows that the Shanks transformation is a true convergence acceleration method for the sequences considered. In addition, we show that it is stable for the case being studied, and we also quantify its stability properties. The results of this work are the first ones pertaining to the Shanks transformation on general linear sequences with m > 1.
机译:Shanks变换是一种强大的非线性外推方法,用于加速缓慢收敛甚至发散的序列{A_n}的收敛。它会生成一个二维数组,近似于A_n〜((j))到{A_n}的极限或反极限,该极限被定义为线性系统的解,其中β?是其他未知数。在这项工作中,我们研究A_n〜((j))的收敛性和稳定性,当j→∞且n为固定时,从一般线性序列{A_n}导出,其中n→∞,其中ζ_k≠1是不同的且{pipe}ζ_1{pipe} = ... = {pipe}ζ_m{pipe} =θ,并且γ_k≠0、1、2...。这里A是{A_n}的极限或反极限。这样的序列例如作为具有有限跳跃不连续性和/或代数分支奇异性的傅里叶级数函数的部分和而产生。我们表明,使用整数值编程问题对于s_1,...,s_m具有唯一(整数)解的n值获得了确定的结果。我们的收敛结果的一个特殊情况涉及其中n =mν和ν= 1,2,...的情况,对于上述情况,上面的整数编程问题具有唯一的解决方案,并且它读取为A_n〜((j))-A = O(θ〜jj〜(α-2v))为j→∞。当与A_j-A = O(θ〜j j​​〜α)作j→∞比较时,此结果表明,对于所考虑的序列,Shanks变换是一种真正的收敛加速方法。此外,我们表明它对于所研究的情况是稳定的,并且还量化了其稳定性。这项工作的结果是第一个有关m> 1的一般线性序列上的Shanks变换的结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号