• Title/Summary/Keyword: Diagonal

Search Result 1,425, Processing Time 0.032 seconds

DIAGONAL LIFTS OF TENSOR FIELDS OF TYPE (1,1) ON CROSS-SECTIONS IN TENSOR BUNDLES AND ITS APPLICATIONS

  • Gezer, Aydin;Salimov, Arif
    • Journal of the Korean Mathematical Society
    • /
    • v.45 no.2
    • /
    • pp.367-376
    • /
    • 2008
  • The main purpose of this paper is to investigate diagonal lift of tensor fields of type (1,1) from manifold to its tensor bundle of type (p, q) and to prove that when a manifold $M_n$ admits a $K\ddot{a}hlerian$ structure ($\varphi$,g), its tensor bundle of type (p,q) admits an complex structure.

The Four Points Diagonal Positioning Algorithm for Iris Position Tracking Improvement

  • Chai Duck-Hyun;Ryu Kwang-Ryol
    • Journal of information and communication convergence engineering
    • /
    • v.2 no.3
    • /
    • pp.202-204
    • /
    • 2004
  • An improvement of tracking capacity to find a position of the Iris images is presented in this paper. The propose algorithm is used the Four Points Diagonal Positioning algorithm that the image is positioned with arbitrary 4 points on the edge of iris and the selective 4 points are drawn by a diagonal line on the cross. The experiment result shows that the algorithm is efficient to track on the eyelid.

q-COEFFICIENT TABLE OF NEGATIVE EXPONENT POLYNOMIAL WITH q-COMMUTING VARIABLES

  • Choi, Eunmi
    • Korean Journal of Mathematics
    • /
    • v.30 no.3
    • /
    • pp.433-442
    • /
    • 2022
  • Let N(q) be an arithmetic table of a negative exponent polynomial with q-commuting variables. We study sequential properties of diagonal sums of N(q). We first device a q-coefficient table $\hat{N}$ of N(q), find sequences of diagonal sums over $\hat{N}$, and then retrieve the findings of $\hat{N}$ to N(q). We also explore recurrence rules of s-slope diagonal sums of N(q) with various s and q.

COUNTING FORMULA FOR SOLUTIONS OF DIAGONAL EQUATIONS

  • Moon, Young-Gu;Lee, June-Bok;Park, Young-Ho
    • Bulletin of the Korean Mathematical Society
    • /
    • v.37 no.4
    • /
    • pp.803-810
    • /
    • 2000
  • Let N($d_1,...,{\;}d_n;c_1,...,{\;}c_n$) be the number of solutions $(x_1,...,{\;}x_n){\in}F^{n}_p$ of the diagonal equation $c_lx_1^{d_1}+c_2x_2^{d_2}+{\cdots}+c_nx_n^{d_n}{\;}={\;}0{\;}n{\geq},{\;}c_j{\;}{\in}{\;}F^{*}_q,{\;}j=1,2,...,{\;}n$ where $d_j{\;}>{\;}1{\;}and{\;}d_j{\;}$\mid${\;}q{\;}-{\;}1$ for all j = 1,2,..., n. In this paper, we find all n-tuples ($d_1,...,{\;}d_n$) such that the reduced form of ($d_1,...,{\;}d_n$) and N($d_1,...,{\;}d_n;c_1,...,{\;}c_n$) are the same as in the theorem obtained by Sun Qi [3]. Improving this, we also get an explicit formula for the number of solutions of the diagonal equation, unver a certain natural restriction on the exponents.

  • PDF

Designing observer-based robust compensators for parametric uncertain systems by block-diagonal approach (분리 최적화 기법을 이용한 구조적 불확실계의 강인 제어기 설계)

  • 김경수;박영진
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.109-112
    • /
    • 1997
  • In this note, we investigate a noniterative design method of an observer-based robust H$\_$2/ controller in the presence of structured real parameter uncertainty by applying Riccati approach based on the guaranteed cost function. Motivated by the numerical difficulty of the problem, we try to develop a simple design method named as block-diagonal approach, which can be solved by the LMIs method. By assuming the block-diagonal structure of Riccati solution, the original problem can be derived into two sequentially decoupled optimization problems as LQG control problem. The proposed method seems to be numerically efficient in obtaining a feasible compensator.

  • PDF

Measurement of the Power of a Cylindrical Lens with the Magnification Ellipse Fitting Method (배율 타원 근사법을 실린더 렌즈의 굴절력 측정)

  • Ko, Woo-Seok;Ye, Sang-Heon;Kwak, Yoon-Keun;Kim, Soo-Hyun
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.25 no.2
    • /
    • pp.43-48
    • /
    • 2008
  • This paper proposes a new method for measuring the power of spherical and cylindrical lens with 6 points light source, which is composed of a LED and six holes, and magnification ellipse fitting algorithm. Each measured diagonal length of 6 points light source is determined by the target lens power. After finding the center position of each light point with threshold method, 3 axis-diagonal lengths were calculated. The long axis and short axis power of cylindrical lens can be calculated by using magnification ellipse fitting algorithm with the magnification relationships between the initial diagonal lengths and the measured diagonal lengths changed by lens power.

Seismic performance of retrofitted URM walls with diagonal and vertical steel strips

  • Darbhanzi, Abbas;Marefat, Mohammad S.;Khanmohammadi, Mohammad;Moradimanesh, Amin;Zare, Hamid
    • Earthquakes and Structures
    • /
    • v.14 no.5
    • /
    • pp.449-458
    • /
    • 2018
  • Earthquakes have shown the vulnerability of unreinforced masonry (URM) structures. The aim of this research is to study a technique for in-plane seismic retrofitting of URM walls in which both diagonal and vertical steel strips are added to a single side of a URM wall. Specimens have been tested under quasi-static cyclic lateral load in combination with constant vertical load. The tests show that vertical and diagonal strips cause a significant increase in seismic capacity in terms of both strength (about 200%) and displacement at maximum (about 20%). Furthermore, this technique caused the failure modes of URM walls were influenced.

HYBRID REORDERING STRATEGIES FOR ILU PRECONDITIONING OF INDEFINITE SPARSE MATRICES

  • Lee Eun-Joo;Zgang Jun
    • Journal of applied mathematics & informatics
    • /
    • v.22 no.1_2
    • /
    • pp.307-316
    • /
    • 2006
  • Incomplete LU factorization preconditioning techniques often have difficulty on indefinite sparse matrices. We present hybrid reordering strategies to deal with such matrices, which include new diagonal reorderings that are in conjunction with a symmetric nondecreasing degree algorithm. We first use the diagonal reorderings to efficiently search for entries of single element rows and columns and/or the maximum absolute value to be placed on the diagonal for computing a nonsymmetric permutation. To augment the effectiveness of the diagonal reorderings, a nondecreasing degree algorithm is applied to reduce the amount of fill-in during the ILU factorization. With the reordered matrices, we achieve a noticeable improvement in enhancing the stability of incomplete LU factorizations. Consequently, we reduce the convergence cost of the preconditioned Krylov subspace methods on solving the reordered indefinite matrices.

Optimization of Channel Capacity in MIMO Systems

  • Pham Van-Su;Le Minh Tuan;Yoon Giwan
    • Journal of information and communication convergence engineering
    • /
    • v.3 no.4
    • /
    • pp.172-175
    • /
    • 2005
  • In this paper, a new method to get the optimum channel capacity of a Multiple-Input Multiple­Output (MIMO) system is presented. The proposed method exploits the diagonal structure of channel matrix to maximize the channel capacity. The diagonal format of the channel matrix is formed by multiplying the transmitted signal with the pre-compensated channel PCC) matrix. Numerical simulations show that the proposed method exploiting the diagonal structure of channel matrix could significantly increase the system capacity compared with the system without applying the diagonal structure of channel matrix.

A New Approach to Get the Optimum Channel Capacity in MIMO Systems

  • Su, Pham-Van;Tuan, Le-Minh;Giwan Yoon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.11a
    • /
    • pp.317-319
    • /
    • 2002
  • In this paper, a new method to get the optimum channel capacity of a Multiple-Input Multiple-Output (MIMO) system is presented. The proposed method exploits the diagonal structure o f channel matrix in order to maximize the channel capacity. The diagonal format of the channel matrix is formed by multiplying the transmitted signal with the precompensated channel (PCC) matrix. Numerical simulations show that the proposed method exploiting the diagonal structure of channel matrix could significantly increase the system capacity compared with the system without applying the diagonal structure of channel matrix.

  • PDF