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 条
  • [21] Modal parameter estimation from ambient response data
    Schwarz, B
    Richardson, M
    PROCEEDINGS OF IMAC-XIX: A CONFERENCE ON STRUCTURAL DYNAMICS, VOLS 1 AND 2, 2001, 4359 : 1017 - 1022
  • [22] Construction of a Near-Optimal Quasi-Complementary Sequence Set from Almost Difference Set
    Li, Yu
    Yan, Tongjiang
    Lv, Chuan
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2019, 11 (04): : 815 - 824
  • [23] Construction of a Near-Optimal Quasi-Complementary Sequence Set from Almost Difference Set
    Yu Li
    Tongjiang Yan
    Chuan Lv
    Cryptography and Communications, 2019, 11 : 815 - 824
  • [24] Finding Near-optimal Configurations in Colossal Spaces with Statistical Guarantees
    Oh, Jeho
    Batory, Don
    Heradio, Ruben
    ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY, 2024, 33 (01)
  • [25] Finding Near-Optimal Configurations in Product Lines by Random Sampling
    Oh, Jeho
    Batory, Don
    Myers, Margaret
    Siegmund, Norbert
    ESEC/FSE 2017: PROCEEDINGS OF THE 2017 11TH JOINT MEETING ON FOUNDATIONS OF SOFTWARE ENGINEERING, 2017, : 61 - 71
  • [26] Study on near-optimal path finding strategies in a road network
    Shi Jun
    Li Jian-yuan
    Cao Han
    Wang Xi-li
    JOURNAL OF ALGORITHMS & COMPUTATIONAL TECHNOLOGY, 2008, 2 (03) : 319 - 333
  • [27] Finding Near-Optimal Groups of Epidemic Spreaders in a Complex Network
    Moores, Geoffrey
    Shakarian, Paulo
    Macdonald, Brian
    Howard, Nicholas
    PLOS ONE, 2014, 9 (04):
  • [28] On the hardness of finding near-optimal multicuts in directed acyclic graphs
    Bentz, Cedric
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (39) : 5325 - 5332
  • [29] Finding near-optimal build orientations for shape deposition manufacturing
    Gupta, SK
    Tian, Q
    Weiss, L
    MACHINING IMPOSSIBLE SHAPES, 1999, 18 : 208 - 216
  • [30] Near-optimal Relaying Strategy for Cooperative Broadcast Channels
    Ning, Haishi
    Ling, Cong
    Leung, Kin K.
    2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-8, 2009, : 1553 - 1557