【24h】

Convergence of Iterations

机译:迭代收敛

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

摘要

Convergence is a central problem in both computer science and in population biology. Will a program terminate? Will a population go to an equilibrium? In general these questions are quite difficult - even unsolvable. In this paper we will concentrate on very simple iterations of the form x_(t+1) = f(x_t) where each x_t is simply a real number and f(x) is a reasonable real function with a single fixed point. For such a system, we say that an iteration is "globally stable" if it approaches the fixed point for all starting points. We will show that there is a simple method which assures global stability. Our method uses bounding of f(x) by a self-inverse function. We call this bounding "enveloping" and we show that enveloping implies global stability. For a number of standard population models, we show that local stability implies enveloping by a self-inverse linear fractional function and hence global stability. We close with some remarks on extensions and limitations of our method.
机译:融合是计算机科学和人口生物学中的核心问题。程序会终止吗?人口会达到均衡吗?总的来说,这些问题很难解决,甚至无法解决。在本文中,我们将集中在x_(t + 1)= f(x_t)形式的非常简单的迭代中,其中每个x_t只是一个实数,而f(x)是一个具有单个固定点的合理实函数。对于这样的系统,我们说如果迭代对于所有起点都接近固定点,则它是“全局稳定的”。我们将展示一种确保全局稳定性的简单方法。我们的方法通过自反函数使用f(x)的边界。我们称这种包围为“包络”,并且表明包络意味着全球稳定。对于许多标准的人口模型,我们表明局部稳定性意味着被自反线性分数函数包围,因此具有整体稳定性。最后,我们对方法的扩展和局限性作了一些评论。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号