• Title/Summary/Keyword: singular subspace

Search Result 23, Processing Time 0.022 seconds

Identification of Linear Model of Tandem Cold Mill Using N4SID Algorithm (N4SID 알고리즘을 이용한 연속 냉간 압연기의 선형모델 규명)

  • 엄상오;황이철;김윤식;김종윤;박영산
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.3 no.4
    • /
    • pp.895-905
    • /
    • 1999
  • This paper identifies a linear time-invariant mathematical model of each stand of a five-stand tandem cold mill to design a robust $H_\infty$ thickness controller by applying input and output data sets to N4SID (Numerical algorithms for Subspace State Space System Identification) method. The input-output data sets describe interstand interference in the process of tandem cold rolling and are obtained from a nonlinear simulator of the tandem cold mill. In result, it is shown that the identified model well approximates the nonlinear model than a Taylor linearized model. Furthermore, uncertainties including roll eccentricity and incoming strip variation are quantitatively analyzed from the plot of maximum singular values.

  • PDF

System Realization by Using Inverse Discrete Fourier Transformation for Structural Dynamic Models

  • Kim, Hyeung Y.;W. B. Hwang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1998.10a
    • /
    • pp.289-294
    • /
    • 1998
  • The distributed-parameter structures expressed with the partial differential equations are considered as the infinite-dimensional dynamic system. For implementation of a controller in multivariate systems, it is necessary to derive the state-space reduced order model. By the eigensystem realization algorithm, we can yield tile subspace system with the Markov parameters derived from the measured frequency response function by the inverse discrete Fourier transformation. We also review the necessary conditions for the convergence of the approximation system and the error bounds in terms of the singular values of Markov-parameter matrices. To determine the natural frequencies and modal damping ratios, the modal coordinate transformation is applied to the realization system. The vibration test for a smart structure is performed to provide the records of frequency response functions used in the subspace system realization.

  • PDF

Mode identifiability of a multi-span cable-stayed bridge utilizing stabilization diagram and singular values

  • Goi, Y.;Kim, C.W.
    • Smart Structures and Systems
    • /
    • v.17 no.3
    • /
    • pp.391-411
    • /
    • 2016
  • This study investigates the mode identifiability of a multi-span cable-stayed bridge in terms of a benchmark study using stabilization diagrams of a system model identified using stochastic subspace identification (SSI). Cumulative contribution ratios (CCRs) estimated from singular values of system models under different wind conditions were also considered. Observations revealed that wind speed might influence the mode identifiability of a specific mode of a cable-stayed bridge. Moreover the cumulative contribution ratio showed that the time histories monitored during strong winds, such as those of a typhoon, can be modeled with less system order than under weak winds. The blind data Acc 1 and Acc 2 were categorized as data obtained under a typhoon. Blind data Acc 3 and Acc 4 were categorized as data obtained under wind conditions of critical wind speeds around 7.5 m/s. Finally, blind data Acc 5 and Acc 6 were categorized as data measured under weak wind conditions.

Mode-SVD-Based Maximum Likelihood Source Localization Using Subspace Approach

  • Park, Chee-Hyun;Hong, Kwang-Seok
    • ETRI Journal
    • /
    • v.34 no.5
    • /
    • pp.684-689
    • /
    • 2012
  • A mode-singular-value-decomposition (SVD) maximum likelihood (ML) estimation procedure is proposed for the source localization problem under an additive measurement error model. In a practical situation, the noise variance is usually unknown. In this paper, we propose an algorithm that does not require the noise covariance matrix as a priori knowledge. In the proposed method, the weight is derived by the inverse of the noise magnitude square in the ML criterion. The performance of the proposed method outperforms that of the existing methods and approximates the Taylor-series ML and Cram$\acute{e}$r-Rao lower bound.

Fractionally Spaced Blind Equalization Using Singular Value Decomposition (특이값 분해를 이용한 블라인드 부분 간격 등화기)

  • Kim, Geumbee;Lee, Jeongwon;Nam, Haewoon;Park, Daeyoung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.9
    • /
    • pp.1041-1043
    • /
    • 2016
  • This letter proposes a new blind fractionally spaced equalization (FSE). The conventional linear program (LP) FSE reduces the degree of freedom (DOF) by abandoning many equalization filter taps, which causes severe performance degradations. We use singular value decomposition (SVD) to obtain the signal subspace and to fully utilize all samples for performance improvement. The proposed scheme has similar performance with the nuclear norm minimization and has as low complexity as the LP equalizer.

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.

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.

An Improved method of Two Stage Linear Discriminant Analysis

  • Chen, Yarui;Tao, Xin;Xiong, Congcong;Yang, Jucheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.3
    • /
    • pp.1243-1263
    • /
    • 2018
  • The two-stage linear discrimination analysis (TSLDA) is a feature extraction technique to solve the small size sample problem in the field of image recognition. The TSLDA has retained all subspace information of the between-class scatter and within-class scatter. However, the feature information in the four subspaces may not be entirely beneficial for classification, and the regularization procedure for eliminating singular metrics in TSLDA has higher time complexity. In order to address these drawbacks, this paper proposes an improved two-stage linear discriminant analysis (Improved TSLDA). The Improved TSLDA proposes a selection and compression method to extract superior feature information from the four subspaces to constitute optimal projection space, where it defines a single Fisher criterion to measure the importance of single feature vector. Meanwhile, Improved TSLDA also applies an approximation matrix method to eliminate the singular matrices and reduce its time complexity. This paper presents comparative experiments on five face databases and one handwritten digit database to validate the effectiveness of the Improved TSLDA.

Joint optimization of beamforming and power allocation for DAJ-based untrusted relay networks

  • Yao, Rugui;Lu, Yanan;Mekkawy, Tamer;Xu, Fei;Zuo, Xiaoya
    • ETRI Journal
    • /
    • v.40 no.6
    • /
    • pp.714-725
    • /
    • 2018
  • Destination-assisted jamming (DAJ) is usually used to protect confidential information against untrusted relays and eavesdroppers in wireless networks. In this paper, a DAJ-based untrusted relay network with multiple antennas installed is presented. To increase the secrecy, a joint optimization of beamforming and power allocation at the source and destination is studied. A matched-filter precoder is introduced to maximize the cooperative jamming signal by directing cooperative jamming signals toward untrusted relays. Then, based on generalized singular-value decomposition (GSVD), a novel transmitted precoder for confidential signals is devised to align the signal into the subspace corresponding to the confidential transmission channel. To decouple the precoder design and optimal power allocation, an iterative algorithm is proposed to jointly optimize the above parameters. Numerical results validate the effectiveness of the proposed scheme. Compared with other schemes, the proposed scheme shows significant improvement in terms of security performance.

PROJECTIONS OF ALGEBRAIC VARIETIES WITH ALMOST LINEAR PRESENTATION II

  • Ahn, Jeaman
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.34 no.2
    • /
    • pp.181-188
    • /
    • 2021
  • Let X be a nondegenerate reduced closed subscheme in ℙn. Assume that πq : X → Y = πq(X) ⊂ ℙn-1 is a generic projection from the center q ∈ Sec(X) \ X where Sec(X) = ℙn. Let Z be the singular locus of the projection πq(X) ⊂ ℙn-1. Suppose that IX has the almost minimal presentation, which is of the form R(-3)β2,1 ⊕ R(-4) → R(-2)β1,1 → IX → 0. In this paper, we prove the followings: (a) Z is either a linear space or a quadric hypersurface in a linear subspace; (b) $H^1({\mathcal{I}_X(k)})=H^1({\mathcal{I}_Y(k)})$ for all k ∈ ℤ; (c) reg(Y) ≤ max{reg(X), 4}; (d) Y is cut out by at most quartic hypersurfaces.