arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1808.03950math.NAcs.NA
收藏

线性最小二乘法用于计算遍历马尔可夫链的平均首次通过时间

Linear least square method for the computation of the mean first passage times of ergodic markov chains

Nanjing University Press(南京大学出版社)

Yaming Chen

AI总结:

本文提出了一种高效准确的迭代方案,用于计算遍历马尔可夫链的平均首次通过时间,通过线性方程组转换问题,并证明其解构成平均首次通过时间,通过数值实验验证了该算法适用于大规模稀疏系统。

摘要:

本文提出了一种高效且准确的迭代方案,用于计算遍历马尔可夫链的平均首次通过时间(MFPTs)。首先,将MFPTs的计算问题转换为一组线性方程。证明了这些方程是相容的,其最小范数解构成MFPTs。还推导出MFPTs的新表达式。利用线性最小二乘算法,给出了与Hunter[18]的有限算法和J.Xu[25]的迭代算法的数值比较结果。这些结果表明,新算法适用于大规模稀疏系统。

英文摘要:

An efficient and accurate iterative scheme for the computation of the mean first passage times (MFPTs) of ergodic Markov chains has been presented. Firstly, the computation problem of MFPTs is transformed into a set of linear equations. It has been proven that each of these equations is compatible and their minimal norm solutions constitute MFPTs. A new presentation of the MFPTs is also derived. Using linear least square algorithms, some numerical examples compared with the finite algorithm of Hunter [LAA, 549(2018)100-122] and iterative algorithm of J.Xu [AMC, 250(2025)372-389] are given. These results show that the new algorithm is suitable for large sparse systems.

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

↑