Issue |
ESAIM: ProcS
Volume 63, 2018
CEMRACS 2016 - Numerical challenges in parallel scientific computing
|
|
---|---|---|
Page(s) | 248 - 257 | |
DOI | https://doi.org/10.1051/proc/201863248 | |
Published online | 19 October 2018 |
Parallel in Time Algorithms for Nonlinear Iterative Methods
1
Max Planck Institute for Plasma Physics
2
Technische Universitt Mnchen
3
Laboratoire de mathématiques de Besançon, University of Franche-Comté
In this paper we investigate the feasibility of applying the Parareal algorithm [5, 6] for quasi-static nonlinear structural analysis problems. We describe how this proposal has been realized and present some preliminary numerical results of applying this algorithm to a beam undergoing nonlinear deflection with a contact boundary condition. Further numerical experiments are needed to provide an evidence for the effciency of the method.
Résumé
Dans cet article on cherche à determiner si l’algorithme de Parareel [5, 6] est applicable pour des structures quasi-statiques non linéaires. On décrit comment cette approche a été réalisée puis on présente quelques résultats numériques préliminaires de notre algorithme pour un problème poutre non linéaire dont une condition au limite modélise un contact. D’autres expériences numériques sont nécessaires affn de prouver l’effcacité de la méthode.
© EDP Sciences, SMAI 2018
This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.