A polynomial dimensional decomposition for stochastic computing

被引:104
|
作者
Rahman, Sharif [1 ]
机构
[1] Univ Iowa, Coll Engn, Dept Mech & Ind Engn, Iowa City, IA 52242 USA
基金
美国国家科学基金会;
关键词
uncertainty analysis; probabilistic mechanics; reliability; orthogonal polynomials; Fourier-polynomial expansion; ANOVA; polynomial chaos; Monte Carlo simulation;
D O I
10.1002/nme.2394
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This article presents a new polynomial dimensional decomposition method for solving stochastic problems commonly encountered in engineering disciplines and applied sciences. The method involves a hierarchical decomposition of a multivariate response function in terms of variables with increasing dimensions, abroad range of orthonormal polynomial bases consistent with the probability measure for Fourier-polynomial expansion of component functions, and an innovative dimension-reduction integration for calculating the coefficients of the expansion. The new decomposition method does not require sample points as in the previous version; yet, it generates a convergent sequence of lower-variate estimates of the probabilistic characteristics of a generic stochastic response. The results of five numerical examples indicate that the proposed decomposition method provide accurate, convergent, and computationally efficient estimates of the tail probability of random mathematical functions or the reliability of mechanical system. Copyright (c) 2008 John Wiley & Sons, Ltd.
引用
收藏
页码:2091 / 2116
页数:26
相关论文
共 50 条
  • [1] Adaptive-sparse polynomial dimensional decomposition methods for high-dimensional stochastic computing
    Yadav, Vaibhav
    Rahman, Sharif
    [J]. COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2014, 274 : 56 - 83
  • [2] High-Dimensional Stochastic Design Optimization by Adaptive-Sparse Polynomial Dimensional Decomposition
    Rahman, Sharif
    Ren, Xuchun
    Yadav, Vaibhav
    [J]. SPARSE GRIDS AND APPLICATIONS - STUTTGART 2014, 2016, 109 : 247 - 264
  • [3] An algorithm for computing the QR decomposition of a polynomial matrix
    Foster, Joanne
    McWhirter, John
    Chambers, Jonathon
    [J]. PROCEEDINGS OF THE 2007 15TH INTERNATIONAL CONFERENCE ON DIGITAL SIGNAL PROCESSING, 2007, : 71 - +
  • [4] Algorithms for computing triangular decomposition of polynomial systems
    Chen, Changbo
    Maza, Marc Moreno
    [J]. JOURNAL OF SYMBOLIC COMPUTATION, 2012, 47 (06) : 610 - 642
  • [5] Mathematical Properties of Polynomial Dimensional Decomposition
    Rahman, Sharif
    [J]. SIAM-ASA JOURNAL ON UNCERTAINTY QUANTIFICATION, 2018, 6 (02): : 816 - 844
  • [6] Statistical Moments of Polynomial Dimensional Decomposition
    Rahman, Sharif
    [J]. JOURNAL OF ENGINEERING MECHANICS-ASCE, 2010, 136 (07): : 923 - 927
  • [7] OSCAR: An Optical Stochastic Computing AcceleRator for Polynomial Functions
    El-Derhalli, Hassnaa
    Le Beux, Sebastien
    Tahar, Sofiene
    [J]. PROCEEDINGS OF THE 2020 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE 2020), 2020, : 1450 - 1455
  • [8] New Algorithms for Computing Primary Decomposition of Polynomial Ideals
    Noro, Masayuki
    [J]. MATHEMATICAL SOFTWARE - ICMS 2010, 2010, 6327 : 233 - 244
  • [9] Stochastic-HD: Leveraging Stochastic Computing on Hyper-Dimensional Computing
    Hao, Yilun
    Gupta, Saransh
    Morris, Justin
    Khaleghi, Behnam
    Aksanli, Baris
    Rosing, Tajana
    [J]. 2021 IEEE 39TH INTERNATIONAL CONFERENCE ON COMPUTER DESIGN (ICCD 2021), 2021, : 321 - 325
  • [10] Robust design optimization by polynomial dimensional decomposition
    Ren, Xuchun
    Rahman, Sharif
    [J]. STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2013, 48 (01) : 127 - 148