首页> 外文期刊>SIAM Journal on Scientific Computing >THE SIMPLIFIED TOPOLOGICAL epsilon-ALGORITHMS FOR ACCELERATING SEQUENCES IN A VECTOR SPACE
【24h】

THE SIMPLIFIED TOPOLOGICAL epsilon-ALGORITHMS FOR ACCELERATING SEQUENCES IN A VECTOR SPACE

机译:向量空间中加速序列的简化拓扑ε算法

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

When a sequence of numbers is slowly converging, it can be transformed into a new sequence which, under some assumptions, converges faster to the same limit. One of the best-known sequence transformations is the Shanks transformation, which can be recursively implemented by the epsilon-algorithm of Wynn. This transformation and this algorithm have been extended (in two different ways) to a sequence of elements of a topological vector space E. In this paper, we present new algorithms for implementing these topological Shanks transformations. They no longer require the manipulation of elements of the algebraic dual space E* of E, nor do they use the duality product inside the rules of the algorithms; they need the storage of fewer elements of E, and the stability is improved. They also allow us to prove convergence and acceleration results for some types of sequences. Various applications involving sequences of vectors or matrices show the interest of the new algorithms.
机译:当数字序列缓慢收敛时,可以将其转换为新序列,在某些假设下,该序列可以更快收敛到相同的极限。 Shanks变换是最著名的序列变换之一,可以通过Wynn的epsilon算法递归实现。此转换和此算法已扩展(以两种不同方式)到拓扑向量空间E的元素序列。在本文中,我们提出了用于实现这些拓扑Shanks转换的新算法。它们不再需要操纵E的代数对偶空间E *的元素,也不再在算法规则内使用对偶乘积。他们需要存储更少的E元素,并提高了稳定性。它们还使我们能够证明某些类型序列的收敛性和加速结果。涉及向量或矩阵序列的各种应用显示了新算法的兴趣。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号