Hostname: page-component-89b8bd64d-ksp62 Total loading time: 0 Render date: 2026-05-07T16:02:46.039Z Has data issue: false hasContentIssue false
  • English
  • Français

An Efficient Sampling Method for Regression-Based Polynomial Chaos Expansion

Published online by Cambridge University Press:  03 June 2015

Samih Zein ,
Benoît Colson  and
François Glineur
Samih Zein*
Affiliation:
Samtech H.Q., LMS International, 8 rue des chasseurs ardennais Angleur, Belgium
Benoît Colson*
Affiliation:
Samtech H.Q., LMS International, 8 rue des chasseurs ardennais Angleur, Belgium
François Glineur*
Affiliation:
Center for Operations Research and Econometrics & Information and Communication Technologies, Electronics and Applied Mathematics Institute, University catholique de Louvain, B-1348 Louvain-la-Neuve, Belgium
*
Corresponding author.Email:samih.zein@lmsintl.com
Email:benoit.colson@lmsintl.com
Email:Francois.Glineur@uclouvain.be
Get access

Abstract

The polynomial chaos expansion (PCE) is an efficient numerical method for performing a reliability analysis. It relates the output of a nonlinear system with the uncertainty in its input parameters using a multidimensional polynomial approximation (the so-called PCE). Numerically, such an approximation can be obtained by using a regression method with a suitable design of experiments. The cost of this approximation depends on the size of the design of experiments. If the design of experiments is large and the system is modeled with a computationally expensive FEA (Finite Element Analysis) model, the PCE approximation becomes unfeasible. The aim of this work is to propose an algorithm that generates efficiently a design of experiments of a size defined by the user, in order to make the PCE approximation computationally feasible. It is an optimization algorithm that seeks to find the best design of experiments in the D-optimal sense for the PCE. This algorithm is a coupling between genetic algorithms and the Fedorov exchange algorithm. The efficiency of our approach in terms of accuracy and computational time reduction is compared with other existing methods in the case of analytical functions and finite element based functions.

Keywords

60H1562K2062K05Polynomial chaos expansionregressionD-optimal designFedorov Algorithmgenetic algorithms

Information

Type
Research Article
Information
Communications in Computational Physics , Volume 13 , Issue 4 , April 2013 , pp. 1173 - 1188
Copyright
Copyright © Global Science Press Limited 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1]Sudret, B., Global sensitivity analysis using polynomial chaos expansions, Reliab. Eng. Syst. Safe., 93, pp. 964–979 (2008).CrossRefGoogle Scholar
[2]Poland, J., Mitterer, A., Knodler, K., and Zell, A., Genetic algorithms can improve the con-struction of D-optimal experimental designs, Advances in Fuzzy Systems and Evolutionary Computation, pages 227–231 (2001).Google Scholar
[3]Drain, D., Carlyle, W. Matthew, Montgomery, D. C., Borror, C. and Anderson-Cook, C., A Genetic Algorithm Hybrid for Constructing Optimal Response Surface Designs, Quality and Reliability Engineering International, 20, pp. 637–650 (2004).Google Scholar
[4]Nguyen, N. and Miller, A. J., A review of some exchange algorithms for constructing discrete D-optimal designs, Computational statistics and data analysis, pp. 489–498 (1992).Google Scholar
[5]Jung, J. S. and Yum, B. J., Construction of exact D-optimal designs by tabu search, Computational Statistics and Data Analysis, pp. 181–191 (1996).Google Scholar
[6]Lejeune, M. A., Heuristic optimization of experimental designs, European Journal of Operational Research, pp. 484–498 (2003).Google Scholar
[7]Björk, A., Numerical Methods for Least Squares Problems, ISBN 0-89871-360-9 (1996).Google Scholar
[8]Ghanem, R. and Spanos, P., Stochastic finite elements: A Spectral Approach, Springer-Verlag 1991. ISBN 0-387-97456-3 or 0-540-97456-3.Google Scholar
[9]Montepiedra, G., Application of genetic algorithms to the construction of exact D-optimal designs, Journal of Applied Statistics, pages 817–826 (1998).Google Scholar
[10]St. John, R. C. and Draper, N. R.D-optimality for regression designs: a review, Technometrics, pages 15–23 (1975).Google Scholar
[11]Goldberg, D.E., Genetic Algorithms in Search, Optimisation and Machine Learning, Cambridge MA: Addison-Wesley (1989).Google Scholar
[12]Haines, L. M., The application of the annealing algorithm to the construction of exact optimal designs for linear-regression models,Technometrics, Vol. 29, num. 4 (1987).Google Scholar
[13]Myers, R. H., Montgomery, D. C. and Vining, G. G., Generalized Linear Models with Applications in Engineering and the Sciences, New York: Wiley (2002).Google Scholar
[14]Cameron, R. and Martin, W., The orthogonal development of nonlinear functions in series of Fourier-Hermite functionals, Annals of Mathematics, pages 385:392 (1947).Google Scholar
[15]Davis, L. D. and Mitchell, M., Handbook of Genetic Algorithms, New York: Van Nostrand Reinhold (1991).Google Scholar
[16]Bungartz, H.-J. and Dirnstorfer, S., Multivariate Quadrature on Adaptive Sparse Grids, Computing, Volume 71, Number 1, 89–114 (2003).Google Scholar
[17]Liu, M., Gao, Z. and Hesthaven, J. S.Adaptive sparse grid algorithms with applications to electromagnetic scattering under uncertainty, Applied numerical mathematics, Vol. 61, no1, pp. 24–37 (2011).Google Scholar
[18]Bäck, J., Nobile, F., Tamellini, L., Tempone, R., Stochastic spectral Galerkin and collocation methods for PDEs with random coefficients: a numerical comparison, in Spectral and High Order Methods for Partial Differential Equations, Lecture Notes in Computational Science and Engineering, Volume 76, pp. 43–62 (2011).Google Scholar
[19]Nobile, F., Tempone, R. and Webster, C., An anisotropic sparse grid stochastic collocation method for partial differential equations with random input data, SIAM J. Numer. Anal., vol. 46/5 (2008).Google Scholar
[20]Blatman, G. and Sudret, B., An adaptive algorithm to build up sparse polynomial chaos expansions for stochastic finite element analysis,Probabilistic Engineering Mechanics; Volume 25, Issue 2, (2010).Google Scholar
[21]Blatman, G. and Sudret, B.Adaptive sparse polynomial chaos expansion based on least angle regression, Journal of Computational Physics, Volume 230, Issue 6 (2011).Google Scholar
[22]Eldred, M.S., Recent Advances in Non-Intrusive Polynomial Chaos and Stochastic Collocation Methods for Uncertainty Analysis and Design, 50th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference, Palm Springs, CA, (2009).Google Scholar
[23]Xiu, D., Fast Numerical Methods for Stochastic Computations: A Review, Communications in Computational Physics, Vol. 5, No. 2–4 (2009).Google Scholar