EUVIMEDEUVIMED entdecken
Crossref

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

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

Computers & Structures · 2023-06 · 281 · 107009

DOI: 10.1016/j.compstruc.2023.107009 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computers & Structures, 2023-06. Verfasst von S. Léger und 2 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 32 Literaturangaben. Gefördert von: Natural Sciences and Engineering Research Council of Canada, Université de Moncton.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Förderung

  • Natural Sciences and Engineering Research Council of Canada
  • Université de Moncton

Zitieren

APA

Léger, S., Larocque, P., & LeBlanc, D. (2023). Improved Moore-Penrose continuation algorithm for the computation of problems with critical points. Computers & Structures, 281, 107009. https://doi.org/10.1016/j.compstruc.2023.107009

Vancouver

Léger S, Larocque P, LeBlanc D. Improved Moore-Penrose continuation algorithm for the computation of problems with critical points. Computers & Structures. 2023;281:107009. doi:10.1016/j.compstruc.2023.107009

BibTeX
@article{Lger2023,
  author = {Léger, S. and Larocque, P. and LeBlanc, D.},
  title = {Improved Moore-Penrose continuation algorithm for the computation of problems with critical points},
  journal = {Computers & Structures},
  year = {2023},
  volume = {281},
  pages = {107009},
  doi = {10.1016/j.compstruc.2023.107009}
}
Kostenlos starten →