• Title/Summary/Keyword: 삼각 행렬

Search Result 41, Processing Time 0.021 seconds

A SIMPLE ALFORITHM FOR MAINTAINING ACJACENCY AND REMESHENG PROECSS IN DELAUNAY-VORONOII TRIANGULATION (들로네이-보로노이 삼각요소생성기법에 있어서 인접성유지와 요소재생성과정을 위한 단순알고리즘 연구)

  • 송영준
    • Computational Structural Engineering
    • /
    • v.6 no.3
    • /
    • pp.99-112
    • /
    • 1993
  • One of the characteristics of Delaunay-Voronoii methods of mesh generation is local remeshing ability in comparison with other methods, which is very useful in adaptive finite element applications. Main part of the process is to construct remeshing element group out of the whole elements and to remesh it. Adjacent element array, accompanied with an additional algorithm of several lines, is introduced to make the process simple so that implementation of the concept is possible at the level of general PC users.

  • PDF

DCT/DFT Hybrid Architecture Algorithm Via Recursive Factorization (순환 행렬 분해에 의한 DCT/DFT 하이브리드 구조 알고리듬)

  • Park, Dae-Chul
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.8 no.2
    • /
    • pp.106-112
    • /
    • 2007
  • This paper proposes a hybrid architecture algorithm for fast computation of DCT and DFT via recursive factorization. Recursive factorization of DCT-II and DFT transform matrix leads to a similar architectural structure so that common architectural base may be used by simply adding a switching device. Linking between two transforms was derived based on matrix recursion formula. Hybrid acrchitectural design for DCT and DFT matrix decomposition were derived using the generation matrix and the trigonometric identities and relations. Data flow diagram for high-speed architecture of Cooley-Tukey type was drawn to accommodate DCT/DFT hybrid architecture. From this data flow diagram computational complexity is comparable to that of the fast DCT algorithms for moderate size of N. Further investigation is needed for multi-mode operation use of FFT architecture in other orthogonal transform computation.

  • PDF

Local Observer Design for MIMO Nonlinear Systems (MIMO 비선형 시스템의 로컬 관측기 설계)

  • Lee, Sung-Ryul
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.45 no.1
    • /
    • pp.9-14
    • /
    • 2008
  • This paper presents an observer design methodology for a special class of multi input multi output(MIMO) nonlinear systems. First, we characterize the class of MIMO nonlinear systems with a triangular structure. Also, the observability matrices that plays an important role in proving the convergence of the proposed observer are generalized to MIMO systems. By using the generalized observability matrices, it is shown that under the boundedness conditions of system state and input, the proposed observer guarantees the local exponential convergence to zero of the estimation error.

SSDA를 이용한 임의의 마이크로스트립 공진기 해석

  • 정병태
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 1998.10a
    • /
    • pp.849-853
    • /
    • 1998
  • 라인 해석법(Method of Line), MOL과 파수 영역 해석법(Space Domain Approach), SDA를 결합한 공간-파수 영역 해석법(SSDA)를 이용하여 MIC/MMIC 회로에서 임의 입체 구조를 갖는 공진기를 해석한다. SSDA는 상대 수렴(relative convergence)특성을 갖지 않으며, 반 해석적 (semianalytical )특성으로 수치적 효율이 높다. 경계치 문제로부터 씨스팀 행렬방정식 형태로 유도된그린 함수에 갤러킨법을 적용한다. 삼각, 사각 및 불연속 구조를 갖는 스트립 패치의 폭, 위치와 기판의 두께 변화에 따른 공진 주파수를 계산하였다.

I.A New Family of Orthogonl Transforms: Derivation based on the Parametric Sinusoidal Matrix (I. 새로운 직교 변환군 : 매개변수형 삼각함수 행렬에 의한 유도)

  • Park, Tae-Young
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.24 no.1
    • /
    • pp.159-166
    • /
    • 1987
  • A new family of sinusoidal orthogoal trnasform is introduced. For a derivation, a parametric sinusoidal matrix whose transform might be implemented by a suitable FFT algorithm is modeled basically on the analogy of well-known sinusoidal transform such as DCT,SCT, etc., and its orthogonality condition is calculated. The parameters satisfying orthogonality condition are determined, in a sense, by particular solution after trial and error. However more than then transform matrices not yet known are obtained. It is also shown that these transforms can be computed by a DFT. of an image.

  • PDF

The Development of Tool for Evaluating Quantitative Independency between FRs in Axiomatic Design (공리적 설계에서 FRs의 상호 독립성을 정량적으로 측정하기 위한 도구의 개발)

  • Kang, Young-Ju;Hwang, Yun-Dong;Cha, Sung-Woon;Jung, Dae-Jin;Moon, Yong-Rak
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.18 no.3
    • /
    • pp.122-130
    • /
    • 2001
  • Axiomatic Design is the useful tool for making a good design. In Axiomatic design, the independency is an important property to determine whether the design is good. Until now many designers decide the independency between FRs by their own decision. The way depending on inspiration is simple and fast, but it can not be considered as precise conclusion. Also there are not exact rule that evaluate the quantitative independency between FRs. This thesis will show the way to evaluated the quantitative independency of FRs from the comparison between FRs of more lower levels, and develop more efficient and objective tool in Axiomatic Design.

  • PDF

Mosaics Image Generation based on Mellin Transform (멜린 변환을 이용한 모자이크 이미지 생성)

  • 이지현;양황규
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.8
    • /
    • pp.1785-1791
    • /
    • 2003
  • This paper presents the mosaic method that the video sequence with shift and rotation information after Mellin Transform. The results are used to compute the projection matrix for each image registration. So before registration, we process camera calibration in order to reduce the image warp by camera and then compute the global projection matrix for image registration for reducing errors from rut image to last image. This paper describes the mosaic method that compute duplication and movement information quickly and robust noise using projection matrix on Mellin Transform.

Pole Placement Method to Move a Equal Poles with Jordan Block to Two Real Poles Using LQ Control and Pole's Moving-Range (LQ 제어와 근의 이동범위를 이용한 조단 블록을 갖는 중근을 두 실근으로 이동시키는 극배치 방법)

  • Park, Minho
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.2
    • /
    • pp.608-616
    • /
    • 2018
  • If a general nonlinear system is linearized by the successive multiplication of the 1st and 2nd order systems, then there are four types of poles in this linearized system: the pole of the 1st order system and the equal poles, two distinct real poles, and complex conjugate pair of poles of the 2nd order system. Linear Quadratic (LQ) control is a method of designing a control law that minimizes the quadratic performance index. It has the advantage of ensuring the stability of the system and the pole placement of the root of the system by weighted matrix adjustment. LQ control by the weighted matrix can move the position of the pole of the system arbitrarily, but it is difficult to set the weighting matrix by the trial and error method. This problem can be solved using the characteristic equations of the Hamiltonian system, and if the control weighting matrix is a symmetric matrix of constants, it is possible to move several poles of the system to the desired closed loop poles by applying the control law repeatedly. The paper presents a method of calculating the state weighting matrix and the control law for moving the equal poles with Jordan blocks to two real poles using the characteristic equation of the Hamiltonian system. We express this characteristic equation with a state weighting matrix by means of a trigonometric function, and we derive the relation function (${\rho},\;{\theta}$) between the equal poles and the state weighting matrix under the condition that the two real poles are the roots of the characteristic equation. Then, we obtain the moving-range of the two real poles under the condition that the state weighting matrix becomes a positive semi-finite matrix. We calculate the state weighting matrix and the control law by substituting the two real roots selected in the moving-range into the relational function. As an example, we apply the proposed method to a simple example 3rd order system.

3D Reconstruction Using a Single Camera (단일 카메라를 이용한 3차원 공간 정보 생성)

  • Kwon, Oh-Young;Seo, Kyoung-Taek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.12
    • /
    • pp.2943-2948
    • /
    • 2015
  • Run 3D reconstruction using a single camera, based on the information, we are advancing research on driving assistance apparatus or can be informed how to pass the obstacle existing ahead the driver. As a result depth information falls but it is possible to provide information that can pass through an obstacle on the straight. For 3D reconstruction by measuring the internal parameters, it calculates the Fundamental matrix and matching to find the feature points obtained by executing the triangulation on the basis of this. When the through experiments try to confirm the results, the depth information is present error information in the X and Y axes which can determine whether or not to pass through an obstacle has reliability.

An Investigation on Densification by Modified Weighted Station Approach (가중측점망 조정법의 적용에 관한 연구)

  • Baick, Eun Kee;Lee, Young Jin
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.11 no.4
    • /
    • pp.133-141
    • /
    • 1991
  • The empirical method is used to integration adjustment for the coordinates revision of a national control point but the existing values are not to be changed or changed with small variation by suitable datum selection (for example, fixed points). This paper treats the modified weighted station parameter adjustment by quasi-observations, and the method used only variance elements of existing coordinates which is substituted for all covariance elements. The movement detection of unstable points and the junction adjustment of new networks are successfully executed by the method, in integration of new secondary networks to old-secondary-triangulation points which are in the absence of the original observations in Korea. The investigation results reveal that the accuracy of old-secondary-triangulation points is ${\pm}16^{{\prime}{\prime}}$(${\pm}0.08m$), which results from the densification of test network and the analyses of old survey specifications. and is ${\pm}2.3^{{\prime}{\prime}}$ in fixing of old-secondary-triangulation points.

  • PDF