Sparse Bayesian learning for complex-valued rational approximations

被引:1
|
作者
Schneider, Felix [1 ]
Papaioannou, Iason [2 ]
Mueller, Gerhard [1 ]
机构
[1] Tech Univ Munich, Chair Struct Mech, Munich, Germany
[2] Tech Univ Munich, Engn Risk Anal Grp, Munich, Germany
关键词
frequency response function; rational approximation; sparse Bayesian learning; sparse models; structural dynamics; surrogate model; STOCHASTIC FINITE-ELEMENT; DENSITY EVOLUTION METHOD; POLYNOMIAL CHAOS; ADAPTATION; EXPANSION; REAL;
D O I
10.1002/nme.7182
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Surrogate models are used to alleviate the computational burden in engineering tasks, which require the repeated evaluation of computationally demanding models of physical systems, such as the efficient propagation of uncertainties. For models that show a strongly non-linear dependence on their input parameters, standard surrogate techniques, such as polynomial chaos expansion, are not sufficient to obtain an accurate representation of the original model response. It has been shown that for models with discontinuities or rational dependencies, for example, frequency response functions of dynamic systems, the use of a rational (Pade) approximation can significantly improve the approximation accuracy. In order to avoid overfitting issues in previously proposed standard least squares approaches, we introduce a sparse Bayesian learning approach to estimate the coefficients of the rational approximation. Therein the linearity in the numerator polynomial coefficients is exploited and the denominator polynomial coefficients as well as the problem hyperparameters are determined through type-II-maximum likelihood estimation. We apply a quasi-Newton gradient-descent algorithm to find the optimal denominator coefficients and derive the required gradients through application of DOUBLE-STRUCK CAPITAL CDouble-struck capital R$$ \mathit{\mathbb{CR}} $$-calculus. The method is applied to the frequency response functions of an algebraic frame structure model as well as that of an orthotropic plate finite element model.
引用
收藏
页码:1721 / 1747
页数:27
相关论文
共 50 条
  • [1] Is a Complex-Valued Stepsize Advantageous in Complex-Valued Gradient Learning Algorithms?
    Zhang, Huisheng
    Mandic, Danilo P.
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2016, 27 (12) : 2730 - 2735
  • [2] Unsupervised Complex-Valued Sparse Feature Learning for PolSAR Image Classification
    Jiang, Yinyin
    Li, Ming
    Zhang, Peng
    Tan, Xiaofeng
    Song, Wanying
    IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, 2022, 60
  • [3] Complex-Valued Neural Network and Complex-Valued Backpropagation Learning Algorithm
    Nitta, Tohru
    ADVANCES IN IMAGING AND ELECTRON PHYSICS, VOL 152, 2008, 152 : 153 - 220
  • [4] Complex-valued reinforcement learning
    Hamagami, Tornoki
    Shibuya, Takashi
    Shimada, Shingo
    2006 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-6, PROCEEDINGS, 2006, : 4175 - +
  • [5] SPARSE SIGNAL REPRESENTATION FOR COMPLEX-VALUED IMAGING
    Samadi, Sadegh
    Cetin, Muejdat
    Masnadi-Shirazi, Mohammad Ali
    2009 IEEE 13TH DIGITAL SIGNAL PROCESSING WORKSHOP & 5TH IEEE PROCESSING EDUCATION WORKSHOP, VOLS 1 AND 2, PROCEEDINGS, 2009, : 365 - +
  • [6] Adaptive complex-valued stepsize based fast learning of complex-valued neural networks
    Zhang, Yongliang
    Huang, He
    NEURAL NETWORKS, 2020, 124 : 233 - 242
  • [7] A Lorentzian IHT for Complex-Valued Sparse Signal Recovery
    Rui Hu
    Yuli Fu
    Zhen Chen
    Youjun Xiang
    Jie Tang
    Circuits, Systems, and Signal Processing, 2018, 37 : 862 - 872
  • [8] A Lorentzian IHT for Complex-Valued Sparse Signal Recovery
    Hu, Rui
    Fu, Yuli
    Chen, Zhen
    Xiang, Youjun
    Tang, Jie
    CIRCUITS SYSTEMS AND SIGNAL PROCESSING, 2018, 37 (02) : 862 - 872
  • [9] Complex-valued sparse reconstruction via arctangent regularization
    Xiang, Gao
    Zhang, Xiaoling
    Shi, Jun
    SIGNAL PROCESSING, 2014, 104 : 450 - 463
  • [10] CONTINUOUS COMPLEX-VALUED BACKPROPAGATION LEARNING
    HIROSE, A
    ELECTRONICS LETTERS, 1992, 28 (20) : 1854 - 1855