arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1011.1233math.NAcs.NA
收藏

关于马尔可夫二叉树中二次向量方程的解

On the solution of a quadratic vector equation arising in Markovian Binary Trees

Università di Pisa(比萨大学);Scuola Normale Superiore(意大利高等师范学院)

Dario A. Bini, Beatrice Meini, Federico Poloni

AI总结:

本文从理论和计算角度研究马尔可夫二叉树中的二次向量方程,放松了不可约性假设,提出了基于Perron向量迭代的收敛条件,并引入牛顿方法以实现二次收敛。

摘要:

我们针对马尔可夫二叉树中出现的二次向量方程(QVE),从理论和计算角度提出了一些进展。在理论进展方面,放松了一些不可约性假设,并通过适当函数的雅可比矩阵性质表达了QVE解的最小性。在计算方面,我们详细阐述了文献[http://arxiv.org/abs/1006.0577]中提出的基于Perron向量的迭代方法。特别地,我们提供了一个条件,确保Perron迭代收敛到QVE的所求解。此外,我们引入了一种算法变体,即应用牛顿方法代替不动点迭代。该方法与Perron迭代具有相同的收敛行为,因为其收敛速度对于接近临界的问题会加快。而且,与Perron迭代不同,该方法具有二次收敛性。最后,我们展示了可以通过多种方式改变定义QVE的双线性形式而不改变解。这种修改对算法的收敛速度有影响。

英文摘要:

We present some advances, both from a theoretical and from a computational point of view, on a quadratic vector equation (QVE) arising in Markovian Binary Trees. Concerning the theoretical advances, some irreducibility assumptions are relaxed, and the minimality of the solution of the QVE is expressed in terms of properties of the Jacobian of a suitable function. From the computational point of view, we elaborate on the Perron vector-based iteration proposed in [http://arxiv.org/abs/1006.0577]. In particular we provide a condition which ensures that the Perron iteration converges to the sought solution of the QVE. Moreover we introduce a variant of the algorithm which consists in applying the Newton method instead of a fixed-point iteration. This method has the same convergence behaviour as the Perron iteration, since its convergence speed increases for close-to-critical problems. Moreover, unlike the Perron iteration, the method has a quadratic convergence. Finally, we show that it is possible to alter the bilinear form defining the QVE in several ways without changing the solution. This modification has an impact on convergence speed of the algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑