Strategy for finding a near-optimal measurement set for parameter estimation from modal response

被引:0
|
作者
Pothisiri, T [1 ]
Hjelmstad, KD [1 ]
机构
[1] Univ Illinois, Dept Civil & Environm Engn, Urbana, IL 61801 USA
关键词
D O I
10.1006/jsvi.2002.5030
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
Algorithms that estimate structural parameters from modal response using least-squares minimization of force or displacement residuals generally do not have unique solutions when the data are spatially sparse. The number and character of the multiple solutions depend upon the physical features of the structure and the locations of the response measurements. It has been observed that both the number of solutions and the sensitivity of the parameter estimates to measurement noise is greatly influenced by the choice of measurement locations. In this paper, we present a heuristic method to select a near-optimal subset of measurement locations starting from a particular set of measurements, by minimizing the sensitivity of the parameter estimates with respect to observed response. The statistical properties of solution clusters generated from a Monte Carlo samples of noisy data are used to determine the best candidate measurement to be dropped from the current set. The process is repeated until solution sensitivity cannot be significantly reduced. We also show that the laborious Monte Carlo computations can be avoided in certain cases by using a direct computation of sensitivity estimates. A numerical example is provided to illustrate the method and to examine the performance of the proposed algorithm. (C) 2002 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:89 / 106
页数:18
相关论文
共 50 条
  • [31] Near-optimal distributed dominating set in bounded arboricity graphs
    Dory, Michal
    Ghaffari, Mohsen
    Ilchi, Saeed
    DISTRIBUTED COMPUTING, 2024, 37 (04) : 387 - 398
  • [32] Near-Optimal Mean Estimation with Unknown, Heteroskedastic Variances
    Compton, Spencer
    Valiant, Gregory
    PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 194 - 200
  • [33] Near-Optimal Quantum Algorithms for Multivariate Mean Estimation
    Cornelissen, Arjan
    Hamoudi, Yassine
    Jerbi, Sofiene
    PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22), 2022, : 33 - 43
  • [34] Near-optimal estimation of radar pulse modulation waveform
    Ru, Xiao-Hu
    Liu, Zheng
    Huang, Zhi-Tao
    Jiang, Wen-Li
    IET SIGNAL PROCESSING, 2016, 10 (06) : 651 - 658
  • [35] Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs
    Dory, Michal
    Ghaffari, Mohsen
    Ilchi, Saeed
    PROCEEDINGS OF THE 2022 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, PODC 2022, 2022, : 292 - 300
  • [36] SubmodBoxes: Near-Optimal Search for a Set of Diverse Object Proposals
    Sun, Qing
    Batra, Dhruv
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 28 (NIPS 2015), 2015, 28
  • [37] Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs
    Dory, Michal
    Ghaffari, Mohsen
    Ilchi, Saeed
    Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, 2022, : 292 - 300
  • [38] NEAR-OPTIMAL CONTROL OF PARAMETER-DEPENDENT LINEAR PLANTS
    VETTER, WJ
    BALCHEN, JG
    POHNER, F
    INTERNATIONAL JOURNAL OF CONTROL, 1972, 15 (04) : 683 - &
  • [39] DETERMINISTIC NEAR-OPTIMAL APPROXIMATION ALGORITHMS FOR DYNAMIC SET COVER
    Bhattacharya, Sayan
    Henzinger, Monika
    Nanongkai, Danupon
    Wu, Xiaowei
    SIAM JOURNAL ON COMPUTING, 2023, 52 (05) : 1132 - 1192
  • [40] A new class of near-optimal partial Fourier codebooks from an almost difference set
    Nam Yul Yu
    Keqin Feng
    Aixian Zhang
    Designs, Codes and Cryptography, 2014, 71 : 493 - 501