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

计算具有临界点问题的改进Moore-Penrose延拓算法

Improved Moore-Penrose continuation algorithm for the computation of problems with critical points

S. Léger, P. Larocque, D. LeBlanc

摘要:

采用典型的求解策略来计算挑战性问题的解曲线,往往会导致算法的崩溃。为了改善求解过程,数值延拓方法已被证明是一个非常有效的工具。然而,这些方法仍然可能导致不期望的结果。特别是,在严重的极限点和尖点附近,求解过程经常会遇到以下情况之一:算法发散,方向的改变使得算法在已经获得的解曲线的一部分上回溯,并且通过收敛到比预期远得多的点而省略解曲线的重要区域。在解决实际问题时,检测这些情况并不是一件容易的事情,因为事先不知道解曲线的形状。因此,本文将提出一种改进的Moore-Penrose延拓方法,该方法包括两个关键方面来解决具有挑战性的问题:在求解过程中检测有问题的区域,以及处理这些问题的额外步骤。所提出的方法既可以用作基本的连续方法,也可以在出现困难时简单地激活。数值例子将显示新方法的效率。

英文摘要:

Using typical solution strategies to compute the solution curve of challenging problems often leads to the break down of the algorithm. To improve the solution process, numerical continuation methods have proved to be a very efficient tool. However, these methods can still lead to undesired results. In particular, near severe limit points and cusps, the solution process frequently encounters one of the following situations : divergence of the algorithm, a change in direction which makes the algorithm backtrack on a part of the solution curve that has already been obtained and omitting important regions of the solution curve by converging to a point that is much farther than the one anticipated. Detecting these situations is not an easy task when solving practical problems since the shape of the solution curve is not known in advance. This paper will therefore present a modified Moore-Penrose continuation method that will include two key aspects to solve challenging problems : detection of problematic regions during the solution process and additional steps to deal with them. The proposed approach can either be used as a basic continuation method or simply activated when difficulties occur. Numerical examples will be presented to show the efficiency of the new approach.

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

↑