• Title/Summary/Keyword: invariant subspace

Search Result 65, Processing Time 0.021 seconds

ON STAR MOMENT SEQUENCE OF OPERATORS

  • Park, Sun-Hyun
    • Honam Mathematical Journal
    • /
    • v.29 no.4
    • /
    • pp.569-576
    • /
    • 2007
  • Let $\cal{H}$ be a separable, infinite dimensional, complex Hilbert space. We call "an operator $\cal{T}$ acting on $\cal{H}$ has a star moment sequence supported on a set K" when there exist nonzero vectors u and v in $\cal{H}$ and a positive Borel measure ${\mu}$ such that <$T^{*j}T^ku$, v> = ${^\int\limits_{K}}\;{{\bar{z}}^j}\;{{\bar{z}}^k}\;d\mu$ for all j, $k\;\geq\;0$. We obtain a characterization to find a representing star moment measure and discuss some related properties.

Development of a simplified pole-placement design using swtching dynamics (스위칭 다이나믹을 이용한 단순화된 극점 배치 기법의 개발)

  • 박귀태;김동식;서삼준;서호준
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10a
    • /
    • pp.947-952
    • /
    • 1993
  • A simplified pole-placement design method is developed by analysing dynamic characteristics of the switching dynamics. Unlike the design procedure of conventional pole-placement, in the proposed method, overall state-space is directly decomposed into two invariant subspaces by the projection operator which is defined in the equivalent system, and then the closed-loop poles are assigned to each subspace independently. Hence, computations for state-feedback gain matrix are easy and simple.

  • PDF

LOCAL SPECTRAL THEORY

  • YOO, JONG-KWANG
    • Journal of applied mathematics & informatics
    • /
    • v.38 no.3_4
    • /
    • pp.261-269
    • /
    • 2020
  • For any Banach spaces X and Y, let L(X, Y) denote the set of all bounded linear operators from X to Y. Let A ∈ L(X, Y) and B, C ∈ L(Y, X) satisfying operator equation ABA = ACA. In this paper, we prove that AC and BA share the local spectral properties such as a finite ascent, a finite descent, property (K), localizable spectrum and invariant subspace.

FRAMES AND SAMPLING THEOREMS IN MULTIWAVELET SUBSPACES

  • Liu, Zhanwei;Wu, Guochang;Yang, Xiaohui
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.3_4
    • /
    • pp.723-737
    • /
    • 2010
  • In this paper, we investigate the sampling theorem for frame in multiwavelet subspaces. By the frame satisfying some special conditions, we obtain its dual frame with explicit expression. Then, we give an equivalent condition for the sampling theorem to hold in multiwavelet subspaces. Finally, a sufficient condition under which the sampling theorem holds is established. Some typical examples illustrate our results.

DILATION THEOREM OF OPERATORS WHICH HAVE COMMON NONCYCLIC VECTORS

  • Kim, Han Soo;Kim, Hae Gyu
    • Korean Journal of Mathematics
    • /
    • v.5 no.1
    • /
    • pp.9-16
    • /
    • 1997
  • In this paper, we construct new classes from the idea of [6, Theorem 2.1] and show that the property of operators belonging to the classes is inherited by certain dilations. And we also prove that the existence of common noncyclic vectors for certain families is equivalent to the existence of infinite dimensional common semi-invariant subspace of operators.

  • PDF

ON SOME CR-SUBMANIFOLDS OF (n-1) CR-DIMENSION IN A COMPLEX PROJECTIVE SAPCE

  • Kwon, Jung-Hwan
    • Communications of the Korean Mathematical Society
    • /
    • v.13 no.1
    • /
    • pp.85-94
    • /
    • 1998
  • The purpose of this paper is to give sample characterizations of n-dimensional CR-submanifolds of (n-1) CR-semifolds of (n-1) CR-dimension immersed in a complex projective space $CP^{(n+p)/2}$ with Fubini-Study metric and we study an n-dimensional compact, orientable, minimal CR-submanifold of (n-1) CR-dimension in $CP^{(n+p)/2}$.

  • PDF

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.

On Resistance of Bit Permutation Based Block Cipher against Nonlinear Invariant Attack (비트 순열 기반 블록암호의 비선형 불변 공격 저항성 연구)

  • Jeong, Keonsang;Kim, Seonggyeom;Hong, Deukjo;Sung, Jaechul;Hong, Seokhie
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.30 no.3
    • /
    • pp.325-336
    • /
    • 2020
  • Nonlinear Invariant Attack is an attack that should be considered when constructing lightweight block ciphers with relatively simple key schedule. A shortcut to prove a block cipher's resistance against nonlinear invariant attack is checking the smallest dimension of linear layer-invariant linear subspace which contains all known differences between round keys is equal to the block size. In this paper, we presents the following results. We identify the structure and number of optimal bit-permutations which require only one known difference between round keys for a designer to show that the corresponding block cipher is resistant against nonlinear invariant attack. Moreover, we show that PRESENT-like block ciphers need at least two known differences between round keys by checking all PRESENT-like bit-permutations. Additionally, we verify that the variants of PRESENT-like bit-permutations requiring the only two known differences between round keys do not conflict with the resistance against differential attack by comparing the best differential trails. Finally, through the distribution of the invariant factors of all bit-permutations that maintain BOGI logic with GIFT S-box, GIFT-variant block ciphers require at least 8 known differences between round keys for the resistance.

ON k-QUASI-CLASS A CONTRACTIONS

  • Jeon, In Ho;Kim, In Hyoun
    • Korean Journal of Mathematics
    • /
    • v.22 no.1
    • /
    • pp.85-89
    • /
    • 2014
  • A bounded linear Hilbert space operator T is said to be k-quasi-class A operator if it satisfy the operator inequality $T^{*k}{\mid}T^2{\mid}T^k{\geq}T^{*k}{\mid}T{\mid}^2T^k$ for a non-negative integer k. It is proved that if T is a k-quasi-class A contraction, then either T has a nontrivial invariant subspace or T is a proper contraction and the nonnegative operator $D=T^{*k}({\mid}T^2{\mid}-{\mid}T{\mid}^2)T^k$ is strongly stable.