Toward Optimality of Proper Generalised Decomposition Bases
| Autor: | Shadi Alameddin, Amélie Fau, David Néron, Pierre Ladevèze, Udo Nackenhorst |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2019 |
| Předmět: | |
| Zdroj: | Mathematical and Computational Applications, Vol 24, Iss 1, p 30 (2019) |
| Druh dokumentu: | article |
| ISSN: | 2297-8747 24010030 |
| DOI: | 10.3390/mca24010030 |
| Popis: | The solution of structural problems with nonlinear material behaviour in a model order reduction framework is investigated in this paper. In such a framework, greedy algorithms or adaptive strategies are interesting as they adjust the reduced order basis (ROB) to the problem of interest. However, these greedy strategies may lead to an excessive increase in the size of the ROB, i.e., the solution is no more represented in its optimal low-dimensional expansion. Here, an optimised strategy is proposed to maintain, at each step of the greedy algorithm, the lowest dimension of a Proper Generalized Decomposition (PGD) basis using a randomised Singular Value Decomposition (SVD) algorithm. Comparing to conventional approaches such as Gram–Schmidt orthonormalisation or deterministic SVD, it is shown to be very efficient both in terms of numerical cost and optimality of the ROB. Examples with different mesh densities are investigated to demonstrate the numerical efficiency of the presented method. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|