• Title/Summary/Keyword: factorization

Search Result 587, Processing Time 0.028 seconds

A Fault Detection System Design for Uncertain Fuzzy Systems

  • Yoo, Seog-Hwan
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • pp.107-112
    • /
    • 2005
  • This paper deals with a fault detection system design for uncertain nonlinear systems modelled as T-S fuzzy systems with the integral quadratic constraints. In order to generate a residual signal, we used a left coprime factorization of the T-S fuzzy system. From the filtered signal of the residual generator, the fault occurence can be detected effectively. A simulation study with nuclear steam generator level control system shows that the suggested method can be applied to detect the fault in actual applications.

  • PDF

THE COMPUTATION OF POSITIVE SOLUTIONS FOR A BOUNDARY VALUE PROBLEM OF THE LINEAR BEAM EQUATION

  • Ji, Jun;Yang, Bo
    • Communications of the Korean Mathematical Society
    • /
    • v.32 no.1
    • /
    • pp.215-224
    • /
    • 2017
  • In this paper, we propose a method of order two for the computation of positive solutions to a boundary value problem of the linear beam equation. The method is based on the Power method for the eigenvector associated with the dominant eigenvalue and the Crout-like factorization algorithm for the banded system of linear equations. It is extremely fast due to the linear complexity of the linear system solver. Numerical result of a test problem is included.

On dence column splitting in interial point methods of linear programming (내부점 선형계획법의 밀집열 분할에 대하여)

  • 설동렬;박순달;정호원
    • Korean Management Science Review
    • /
    • v.14 no.2
    • /
    • pp.69-79
    • /
    • 1997
  • The computational speed of interior point method of linear programming depends on the speed of Cholesky factorization. If the coefficient matrix A has dense columns then the matrix A.THETA. $A^{T}$ becomes a dense matrix. This causes Cholesky factorization to be slow. We study an efficient implementation method of the dense column splitting among dense column resolving technique and analyze the relation between dense column splitting and order methods to improve the sparsity of Cholesky factoror.

  • PDF

COMPLEX FACTORIZATIONS OF THE GENERALIZED FIBONACCI SEQUENCES {qn}

  • JUN, SANG PYO
    • Korean Journal of Mathematics
    • /
    • v.23 no.3
    • /
    • pp.371-377
    • /
    • 2015
  • In this note, we consider a generalized Fibonacci sequence {$q_n$}. Then give a connection between the sequence {$q_n$} and the Chebyshev polynomials of the second kind $U_n(x)$. With the aid of factorization of Chebyshev polynomials of the second kind $U_n(x)$, we derive the complex factorizations of the sequence {$q_n$}.

A Study on the Relationship between Properties of the Elliptic Curves and Performance of Elliptic Curve Method (ECM)

  • Jizhe Cui;Shin, Seung-won;Park, Jong-Uk
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2000.04a
    • /
    • pp.475-478
    • /
    • 2000
  • Recently encryption algorithms based on difficulties of factorization have been used with popularization. Prime number factorizations are progressed rapidly. In this paper, characteristics of elliptic curve are analyzed and generation of elliptic curves suitable for prime number factorization is discussed.

  • PDF

PARALLEL BLOCK ILU PRECONDITIONERS FOR A BLOCK-TRIDIAGONAL M-MATRIX

  • Yun, Jae-Heon;Kim, Sang-Wook
    • Journal of the Korean Mathematical Society
    • /
    • v.36 no.1
    • /
    • pp.209-227
    • /
    • 1999
  • We propose new parallel block ILU (Incomplete LU) factorization preconditioners for a nonsymmetric block-tridiagonal M-matrix. Theoretial properties of these block preconditioners are studied to see the convergence rate of the preconditioned iterative methods, Lastly, numerical results of the right preconditioned GMRES and BiCGSTAB methods using the block ILU preconditioners are compared with those of these two iterative methods using a standard ILU preconditioner to see the effectiveness of the block ILU preconditioners.

  • PDF

ON CHAOTIC OPERATOR ORDER $A\;{\gg}\;C\;{\gg}\;B$ IN HILBERT SPACES

  • Lin, C.S.
    • East Asian mathematical journal
    • /
    • v.24 no.1
    • /
    • pp.67-79
    • /
    • 2008
  • In this paper, we characterize the chaotic operator order $A\;{\gg}\;C\;{\gg}\;B$. Consequently all other possible characterizations follow easily. Some satellite theorems of the Furuta inequality are naturally given. And finally, using results of characterizing $A\;{\gg}\;C\;{\gg}\;B$, and by the Douglas's majorization and factorization theorem we are able to characterize the chaotic operator order $A\;{\gg}\;B$ in terms of operator equalities.

  • PDF

Mixed $H_2/H_{\infty}$ Controller Realization with Entropy Integral

  • Lee, Sang-Hyuk;Kim, Ju-Sik
    • International Journal of Control, Automation, and Systems
    • /
    • v.1 no.2
    • /
    • pp.206-209
    • /
    • 2003
  • An $H_2$/$H_{\infty}$ -controller realization is carried out by considering an entropy integral. Using J-spectral factorization, the parametrizations of all $H_{\infty}$ stabilizing controllers are derived. By the relation of a mixed $H_2$/$H_{\infty}$ control problem and a minimum entropy/$H_{\infty}$ control problem, the mixed $H_2$/$H_{\infty}$-controller state-space realization is presented.

A Study on Projective Reconstruction based on Factorization Method (분해법기반 프로젝티브 재구성에 관한 연구)

  • 정윤용;조청운;홍현기
    • Proceedings of the IEEK Conference
    • /
    • 2003.11a
    • /
    • pp.191-194
    • /
    • 2003
  • The recovery of 3D scene structure from multiple views has been long one of the central problems in computer vision. This paper presents a new projective reconstruction method based on factorization for un-calibrated image sequences. The proposed algorithm provides an effective measure to construct frame groups by using various information between frames. The experimental results show that the proposed method can reconstruct a more precise 3D structure than the precious methods such as the merging method.

  • PDF

On dual transformation in the interior point method of linear programming (내부점 선형계획법의 쌍대문제 전환에 대하여)

  • 설동렬;박순달;정호원
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.10a
    • /
    • pp.289-292
    • /
    • 1996
  • In Cholesky factorization of the interior point method, dense columns of A matrix make dense Cholesky factor L regardless of sparsity of A matrix. We introduce a method to transform a primal problem to a dual problem in order to preserve the sparsity.

  • PDF