Toward Optimality of Proper Generalised Decomposition Bases
AbstractThe 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. View Full-Text
Share & Cite This Article
Alameddin, S.; Fau, A.; Néron, D.; Ladevèze, P.; Nackenhorst, U. Toward Optimality of Proper Generalised Decomposition Bases. Math. Comput. Appl. 2019, 24, 30.
Alameddin S, Fau A, Néron D, Ladevèze P, Nackenhorst U. Toward Optimality of Proper Generalised Decomposition Bases. Mathematical and Computational Applications. 2019; 24(1):30.Chicago/Turabian Style
Alameddin, Shadi; Fau, Amélie; Néron, David; Ladevèze, Pierre; Nackenhorst, Udo. 2019. "Toward Optimality of Proper Generalised Decomposition Bases." Math. Comput. Appl. 24, no. 1: 30.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.