This website requires JavaScript.
DOI: 10.1016/j.compstruc.2023.107009

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

S. L\'egerP. LarocqueD. LeBlanc
Mar 2023
摘要
Using typical solution strategies to compute the solution curve ofchallenging problems often leads to the break down of the algorithm. To improvethe solution process, numerical continuation methods have proved to be a veryefficient tool. However, these methods can still lead to undesired results. Inparticular, near severe limit points and cusps, the solution process frequentlyencounters one of the following situations : divergence of the algorithm, achange in direction which makes the algorithm backtrack on a part of thesolution curve that has already been obtained and omitting important regions ofthe solution curve by converging to a point that is much farther than the oneanticipated. Detecting these situations is not an easy task when solvingpractical problems since the shape of the solution curve is not known inadvance. This paper will therefore present a modified Moore-Penrosecontinuation method that will include two key aspects to solve challengingproblems : detection of problematic regions during the solution process andadditional steps to deal with them. The proposed approach can either be used asa basic continuation method or simply activated when difficulties occur.Numerical examples will be presented to show the efficiency of the newapproach.
展开全部
图表提取

暂无人提供速读十问回答

论文十问由沈向洋博士提出,鼓励大家带着这十个问题去阅读论文,用有用的信息构建认知模型。写出自己的十问回答,还有机会在当前页面展示哦。

Q1论文试图解决什么问题?
Q2这是否是一个新的问题?
Q3这篇文章要验证一个什么科学假设?
0
被引用
笔记
问答