• Home
  • Search
  • Discretization of a Random Field – a Multiobjective Algorithm Approach
  • https://doi.org/10.5772/14820Copy DOI Icon

Discretization of a Random Field – a Multiobjective Algorithm Approach

  • Apr 26, 2011
  • Guang-Yih Sheu
Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

Discretization of a random field by the generalized polynomial chaos (GPC) begins with selecting a specific type of orthogonal polynomial (e.g. Legendre and Hermite polynomials) (e.g. Ghanem and Spanos, 1991). This selection of a type of orthogonal polynomial can be performed based on the reported experiences (e.g. Xiu and Karniadakis, 2003) or data revealing the distribution of a random field to be discretized. If such data or reported experiences are unavailable, a third way may be generating some pilot tests to study the performance of a specific type of orthogonal polynomial in discretizing this random field. This study tries to develop an evolutionary algorithm-based auxiliary tool for the implementation of such pilot tests. A similar tool (Allaix and Carbone, 2009), which is based on the singleobjective evolutionary algorithm, had been developed for constructing the Karhunen-Loeve (KL) representation of a random field. Both KL and GPC expansions are two of the popular random field discretization methods (Ghanem and Spanos, 1991). But, the KL expansion should be applied under a prerequisite of knowing the covariance matrix of a random field to be discretized (e.g. Ghanem and Spanos, 1991); while, the GPC expansions can be applied without similar prerequisites (e.g. Xiu and Karniadakis, 2003). Therefore, the development of an auxiliary tool for constructing a GPC representation of a random field would be necessary. The succeeding research considers the derivation of an GPC representation of a random field as a multi-objective (MO) problem having two goals: (a) limiting the computational efforts spent in applying the resulting GPC representation; and (b) keeping the resulting GPC representation satisfying all accuracy standards (e.g. getting the sufficiently accurate prediction of statistical parameters of a random field). The former goal will be attained by limiting the highest order of polynomial term and total number of uncorrelated random variables used to construct a GPC representation; while the latter goal will be attained by minimizing multiple error estimators. Since there are multiple goals to be attained, a multiple objective evolutionary algorithm (MOEA) is required. Among all available MOEAs, the strength Pareto evolutionary algorithm II (SPEA 2) (Zitzler, et al., 2001) is chosen. The highest order of polynomial term and total number of uncorrelated random variables used to construct an GPC representation are considered as two parameters to be identified. The remainder of this study is organized into four sections. In Sec. 2, the theoretical backgrounds of GPC expansions (e.g. Xiu and Karniadakis, 2003) are briefly reviewed. In Sec. 3, the SPEA 2 (Zitzler, et al., 2001) is used to construct a parameter identification procedure to identify the aforementioned highest order of orthogonal polynomial and total

Similar Papers
  • Conference Article
  • Citations8

Karhunen-Loeve Expansion of Non-Gaussian Random Process

  • Apr 23, 2007
  • Sameer B Mulani +2
  • Research Article
  • Citations38

Dimension reduction of decision variables for multireservoir operation: A spectral optimization model

  • Jan 01, 2016
  • Water Resources Research
  • Duan Chen +3
  • Conference Article
  • Citations1

Generalized polynomial chaos paradigms to model uncertainty in wireless links

  • Mar 01, 2017
  • Marco Rossi +2
  • Research Article
  • Citations4

A Distributed Active Subspace Method for Scalable Surrogate Modeling of Function Valued Outputs

  • Oct 24, 2020
  • Journal of Scientific Computing
  • Hayley Guy +2
  • Research Article
  • Citations13

Robustness of stochastic expansions for the stability of uncertain nonlinear dynamical systems – Application to brake squeal

  • Apr 06, 2018
  • Mechanical Systems and Signal Processing
  • L Nechak +2
  • Research Article
  • Citations1

Generalized polynomial chaos based surrogate models for acoustics and vibrations

  • Oct 01, 2022
  • The Journal of the Acoustical Society of America
  • Andrew S Wixom
  • Research Article
  • Citations38

Generalised polynomial chaos expansion approaches to approximate stochastic model predictive control†

  • Aug 01, 2013
  • International Journal of Control
  • Kwang-Ki K Kim +1
  • Research Article
  • Citations3

A Distributed Non-Intrusive Load Monitoring Method Using Karhunen–Loeve Feature Extraction and an Improved Deep Dictionary

  • Oct 09, 2024
  • Electronics
  • Siqi Liu +2
  • PDF
  • Research Article
  • Citations18

Shape and topology optimization of a permanent-magnet machine under uncertainties

  • Nov 08, 2016
  • Journal of Mathematics in Industry
  • Piotr Putek +5
  • Conference Article

Real-time non-intrusive appliance load monitoring under supply voltage fluctuations

  • Sep 01, 2017
  • Yasitha S Liyanage +5
  • Research Article
  • Citations22

Parametric uncertainty assessment in hydrological modeling using the generalized polynomial chaos expansion

  • Sep 18, 2019
  • Journal of Hydrology
  • Junjun Hu +3
  • Research Article
  • Citations25

Two Classes of Generalized Polynomials

  • Jan 01, 1933
  • Proceedings of the London Mathematical Society
  • L. M. Milne-Thomson
  • Research Article
  • Citations11

Uncertainty quantification models for micro‐scale squeeze‐film damping

  • Nov 11, 2010
  • International Journal for Numerical Methods in Engineering
  • Xiaohui Guo +3
  • Research Article
  • Citations54

A polynomial chaos expansion in dependent random variables

  • Apr 13, 2018
  • Journal of Mathematical Analysis and Applications
  • Sharif Rahman
  • Research Article

A New Multiple Objective Evolutionary Algorithm for Reliability Optimization of Series-Parallel Systems

  • Apr 01, 2012
  • International Journal of Applied Evolutionary Computation
  • A Taboadaheidi +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.