Abstract
Polynomial Chaos Expansion (PCE) is a powerful and flexible metamodeling technique, but suffers from the fact that the number of required training samples grows exponentially with the dimensionality of the problem. Recently, proper generalized decomposition (PGD) has become a popular way to address this challenge since its complexity grows linearly with the dimension of the problem. In this work, we present a new technique called PGD–PCE, which combines the advantages of both methods. The algorithm is based on separate representations and constructed by orthonormal polynomial functions. We test the proposed approach on simple toy problems and engineering finite element problems. The results show that PGD–PCE performs well in terms of accuracy and computational efficiency when dealing with large problems. • We propagate uncertainties in mechanical problems. • We develop a simple to implement and non-intrusive method. • We show that accuracy is preserved while cost drastically decrease. • We illustrate the capabilities of the approach on various numerical tests.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have