An efficient quasi-optimal space-time PGD. Application to frictional contact mechanics

Anthony Giacoma (1) , David Dureisseix (2, 3) , Anthony Gravouil (4, 5)

1 ANSYS France
2 SMC - Systèmes Mécaniques et Contacts
3 TMI - Tribologie et Mécanique des Interfaces
4 LaMCoS - Laboratoire de Mécanique des Contacts et des Structures [Villeurbanne]
5 IUF - Institut universitaire de France

The proper generalized decomposition (PGD) aims at finding the solution of a generic problems into a low rank approximation. On the contrary to the singular value decomposition (SVD), such a low rank approximation is generally not the optimal one leading to memory issues and loss of computational efficiency. Nonetheless, the computational cost of the SVD is generally prohibitive to be performed. In this paper, authors suggest an algorithm to address this issue. First, the algorithm is described and studied in details. It consists in a cheap iterative method compressing a low rank expansion. It will be shown that given a low rank approximation, the SVD of a provided low rank approximation can be reached at convergence. Behavior of the method is exhibited on a numerical application. Second, the algorithm is embedded into a general space-time PGD solver to compress the iterated separated form for the solution. An application to a quasi-static frictional contact problem is illustrated. Then, efficiency of such a compressing method will be demonstrated.

Domaines: Mécanique des structures [physics.class-ph]

Anthony Giacoma, David Dureisseix, Anthony Gravouil. An efficient quasi-optimal space-time PGD. Application to frictional contact mechanics. Advanced Modeling and Simulation in Engineering Sciences, 2016, 3 (1), pp.1-17. ⟨10.1186/s40323-016-0067-7⟩. ⟨hal-01309621⟩