• Title/Summary/Keyword: subspace decomposition

Search Result 68, Processing Time 0.028 seconds

Modal tracking of seismically-excited buildings using stochastic system identification

  • Chang, Chia-Ming;Chou, Jau-Yu
    • Smart Structures and Systems
    • /
    • v.26 no.4
    • /
    • pp.419-433
    • /
    • 2020
  • Investigation of structural integrity has been a critical issue in the field of civil engineering for years. Visual inspection is one of the most available methods to explore deteriorative components in structures. Still, this method is not applicable to invisible damage of structures. Alternatively, system identification methods are capable of tracking modal properties of structures over time. The deviation of these dynamic properties can serve as indicators to access structural integrity. In this study, a modal tracking technique using frequency-domain system identification from seismic responses of structures is proposed. The method first segments the measured signals into overlapped sequential portions and then establishes multiple Hankel matrices. Each Hankel matrix is then converted to the frequency domain, and a temporal-average frequency-domain Hankel matrix can be calculated. This study also proposes the frequency band selection that can divide the frequency-domain Hankel matrix into several portions in accordance with referenced natural frequencies. Once these referenced natural frequencies are unavailable, the first few right singular vectors by the singular value decomposition can offer these references. Finally, the frequency-domain stochastic subspace identification tracks the natural frequencies and mode shapes of structures through quick stabilization diagrams. To evaluate performance of the proposed method, a numerical study is carried out. Moreover, the long-term monitoring strong motion records at a specific site are exploited to assess the tracking performance. As seen in results, the proposed method is capable of tracking modal properties through seismic responses of structures.

Time-varying modal parameters identification of large flexible spacecraft using a recursive algorithm

  • Ni, Zhiyu;Wu, Zhigang;Wu, Shunan
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.17 no.2
    • /
    • pp.184-194
    • /
    • 2016
  • In existing identification methods for on-orbit spacecraft, such as eigensystem realization algorithm (ERA) and subspace method identification (SMI), singular value decomposition (SVD) is used frequently to estimate the modal parameters. However, these identification methods are often used to process the linear time-invariant system, and there is a lower computation efficiency using the SVD when the system order of spacecraft is high. In this study, to improve the computational efficiency in identifying time-varying modal parameters of large spacecraft, a faster recursive algorithm called fast approximated power iteration (FAPI) is employed. This approach avoids the SVD and can be provided as an alternative spacecraft identification method, and the latest modal parameters obtained can be applied for updating the controller parameters timely (e.g. the self-adaptive control problem). In numerical simulations, two large flexible spacecraft models, the Engineering Test Satellite-VIII (ETS-VIII) and Soil Moisture Active/Passive (SMAP) satellite, are established. The identification results show that this recursive algorithm can obtain the time-varying modal parameters, and the computation time is reduced significantly.

Feedback control design for intelligent structures with closely-spaced eigenvalues

  • Cao, Zongjie;Lei, Zhongxiang
    • Structural Engineering and Mechanics
    • /
    • v.52 no.5
    • /
    • pp.903-918
    • /
    • 2014
  • Large space structures may have resonant low eigenvalues and often these appear with closely-spaced natural frequencies. Owing to the coupling among modes with closely-spaced natural frequencies, each eigenvector corresponding to closely-spaced eigenvalues is ill-conditioned that may cause structural instability. The subspace to an invariant subspace corresponding to closely-spaced eigenvalues is well-conditioned, so a method is presented to design the feedback control law of intelligent structures with closely-spaced eigenvalues in this paper. The main steps are as follows: firstly, the system with closely-spaced eigenvalues is transformed into that with repeated eigenvalues by the spectral decomposition method; secondly, the computation for the linear combination of eigenvectors corresponding to repeated eigenvalues is obtained; thirdly, the feedback control law is designed on the basis of the system with repeated eigenvalues; fourthly, the system with closely-spaced eigenvalues is regarded as perturbed system on the basis of the system with repeated eigenvalues; finally, the feedback control law is applied to the original system, the first order perturbations of eigenvalues are discussed when the parameter modifications of the system are introduced. Numerical examples are given to demonstrate the application of the present method.

Analysis for the difficulty of the vector decomposition problem (벡터 분해 문제의 어려움에 대한 분석)

  • Kwon, Sae-Ran;Lee, Hyang-Sook
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.17 no.3
    • /
    • pp.27-33
    • /
    • 2007
  • Recently, a new hard problem on a two dimensional vector space called vector decomposition problem (VDP) was proposed by M. Yoshida et al. and proved that it is at least as hard as the computational Diffe-Hellman problem (CDHP) on a one dimensional subspace under certain conditions. However, in this paper we present the VDP relative to a specific basis can be solved in polynomial time although the conditions proposed by M. Yoshida on the vector space are satisfied. We also suggest strong instances based on a certain type basis which make the VDP difficult for any random vector relative to the basis. Therefore, we need to choose the basis carefully so that the VDP can serve as the underlying intractable problem in the cryptographic protocols.

The Application of SVD for Feature Extraction (특징추출을 위한 특이값 분할법의 응용)

  • Lee Hyun-Seung
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.2 s.308
    • /
    • pp.82-86
    • /
    • 2006
  • The design of a pattern recognition system generally involves the three aspects: preprocessing, feature extraction, and decision making. Among them, a feature extraction method determines an appropriate subspace of dimensionality in the original feature space of dimensionality so that it can reduce the complexity of the system and help to improve successful recognition rates. Linear transforms, such as principal component analysis, factor analysis, and linear discriminant analysis have been widely used in pattern recognition for feature extraction. This paper shows that singular value decomposition (SVD) can be applied usefully in feature extraction stage of pattern recognition. As an application, a remote sensing problem is applied to verify the usefulness of SVD. The experimental result indicates that the feature extraction using SVD can improve the recognition rate about 25% compared with that of PCA.

CO-CLUSTER HOMOTOPY QUEUING MODEL IN NONLINEAR ALGEBRAIC TOPOLOGICAL STRUCTURE FOR IMPROVING POISON DISTRIBUTION NETWORK COMMUNICATION

  • V. RAJESWARI;T. NITHIYA
    • Journal of applied mathematics & informatics
    • /
    • v.41 no.4
    • /
    • pp.861-868
    • /
    • 2023
  • Nonlinear network creates complex homotopy structural communication in wireless network medium because of complex distribution approach. Due to this multicast topological connection structure, the queuing probability was non regular principles to create routing structures. To resolve this problem, we propose a Co-cluster homotopy queuing model (Co-CHQT) for Nonlinear Algebraic Topological Structure (NLTS-) for improving poison distribution network communication. Initially this collects the routing propagation based on Nonlinear Distance Theory (NLDT) to estimate the nearest neighbor network nodes undernon linear at x(a,b)→ax2+bx2 = c. Then Quillen Network Decomposition Theorem (QNDT) was applied to sustain the non-regular routing propagation to create cluster path. Each cluster be form with co variance structure based on Two unicast 2(n+1)-Z2(n+1)-Z network. Based on the poison distribution theory X(a,b) ≠ µ(C), at number of distribution routing strategies weights are estimated based on node response rate. Deriving shorte;'l/st path from behavioral of the node response, Hilbert -Krylov subspace clustering estimates the Cluster Head (CH) to the routing head. This solves the approximation routing strategy from the nonlinear communication depending on Max- equivalence theory (Max-T). This proposed system improves communication to construction topological cluster based on optimized level to produce better performance in distance theory, throughput latency in non-variation delay tolerant.

Antenna array for estimation of direction of arrival utilizing modified minimum eigenvalue searching (개선된 MES 방법을 이용한 신호의 도래각(DOA) 추정을 위한 배열안테나)

  • 이현배;최승원
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.4
    • /
    • pp.164-173
    • /
    • 1996
  • This paper presents an alternative technique for DOA (direction-of-arrival) estimation. For generating a weight vector orthogonal to the signal subspace, a modified version of MES (minimum eigenvalue searching ) method is introduced. The performance of the proposed technique is compared to that of the conventional ED (eigen decomposition) method in terms of angle resolution for a number of snapshots during agiven observation period as well as various SNR's. In addition, the superiority of the suggested technique is shown, by analyzing the required computational load of the proposed MES and conventional ED method. A novel procedure of simplifying the MES proposed in [1] is presented on that purpose. Another advnatage of the proposed technique is that it is performed independently of the detection of the number of signal components, which makes it possible to estimate the DOA's of clusters consisting of infinite number of inseparable signal components.

  • PDF

EXPLICIT BOUNDS FOR THE TWO-LEVEL PRECONDITIONER OF THE P1 DISCONTINUOUS GALERKIN METHOD ON RECTANGULAR MESHES

  • Kim, Kwang-Yeon
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.13 no.4
    • /
    • pp.267-280
    • /
    • 2009
  • In this paper we investigate a simple two-level additive Schwarz preconditioner for the P1 symmetric interior penalty Galerkin method of the Poisson equation on rectangular meshes. The construction is based on the decomposition of the global space of piecewise linear polynomials into the sum of local subspaces, each of which corresponds to an element of the underlying mesh, and the global coarse subspace consisting of piecewise constants. This preconditioner is a direct combination of the block Jacobi iteration and the cell-centered finite difference method, and thus very easy to implement. Explicit upper and lower bounds for the maximum and minimum eigenvalues of the preconditioned matrix system are derived and confirmed by some numerical experiments.

  • PDF

Finite element model updating of Canton Tower using regularization technique

  • Truong, Thanh Chung;Cho, Soojin;Yun, Chung Bang;Sohn, Hoon
    • Smart Structures and Systems
    • /
    • v.10 no.4_5
    • /
    • pp.459-470
    • /
    • 2012
  • This paper summarizes a study for the modal analysis and model updating conducted using the monitoring data obtained from the Canton Tower of 610 m tall, which was established as an international benchmark problem by the Hong Kong Polytechnic University. Modal properties of the tower were successfully identified using frequency domain decomposition and stochastic subspace identification methods. Finite element model updating using the measurement data was further performed to reduce the modal property differences between the measurements and those of the finite element model. Over-fitting during the model updating was avoided by using an optimization scheme with a regularization term.

Operational modal analysis for Canton Tower

  • Niu, Yan;Kraemer, Peter;Fritzen, Claus-Peter
    • Smart Structures and Systems
    • /
    • v.10 no.4_5
    • /
    • pp.393-410
    • /
    • 2012
  • The 610 m high Canton Tower (formerly named Guangzhou New Television Tower) is currently considered as a benchmark problem for structural health monitoring (SHM) of high-rise slender structures. In the benchmark study task I, a set of 24-hour ambient vibration measurement data has been available for the output-only system identification study. In this paper, the vector autoregressive models (ARV) method is adopted in the operational modal analysis (OMA) for this TV tower. The identified natural frequencies, damping ratios and mode shapes are presented and compared with the available results from some other research groups which used different methods, e.g., the data-driven stochastic subspace identification (SSI-DATA) method, the enhanced frequency domain decomposition (EFDD) algorithm, and an improved modal identification method based on NExT-ERA technique. Furthermore, the environmental effects on the estimated modal parameters are also discussed.