• 제목/요약/키워드: $2{\times}2$ Matrix

검색결과 902건 처리시간 0.028초

CONSTRUCTIONS FOR THE SPARSEST ORTHOGONAL MATRICES

  • Cheon, Gi-Sang;Shader, Bryan L.
    • 대한수학회보
    • /
    • 제36권1호
    • /
    • pp.119-129
    • /
    • 1999
  • In [1], it was shown that for $n\geq 2$ the least number of nonzero entries in an $n\times n$ orthogonal matrix is not direct summable is 4n-4, and zero patterns of the $n\times n$ orthogonal matrices with exactly 4n-4 nonzero entries were determined. In this paper, we construct $n\times n$ orthogonal matrices with exactly 4n-r nonzero entries. furthermore, we determine m${\times}$n sparse row-orthogonal matrices.

  • PDF

$TE^z_{mn}$ 모드정합법을 이용한 다중포트($2{\times}2$포트, 1포트) 직사각형 도파관의 일반화 산란행렬 추출 (Generalized Scattering Matrix of Multi-port($2{\times}2$port, 1port) Rectangular Waveguide Using $TE^z_{mn}$ Mode Matching Method)

  • 이준광;문상윤;박기언;허유강;조영기
    • 한국전자파학회:학술대회논문집
    • /
    • 한국전자파학회 2003년도 종합학술발표회 논문집 Vol.13 No.1
    • /
    • pp.79-83
    • /
    • 2003
  • Multi-port($2{\times}2$port, 1port) rectangular waveguide discontinuity problem has been analyzed by use of $TE^x_{mn}$ (mono)mode matching method. Matrix size can be reduced significantly in comparison with $TE_{mn}&TM_{mn}$(full-wave)mode matching method. the present results is compared with those by CST MicroWave Studio to validate the presint method.

  • PDF

비휘방성 EEPROM을 위한 SNOSFET 단위 셀의 어레이 (Array of SNOSFET Unit Cells for the Nonvolatile EEPROM)

  • 강창수;이형옥;이상배;서광열
    • 한국전기전자재료학회:학술대회논문집
    • /
    • 한국전기전자재료학회 1991년도 추계학술대회 논문집
    • /
    • pp.48-51
    • /
    • 1991
  • Short channel Nonvolatile EEPROM memory devices were fabricated to CMOS 1M bit design rule, and reviews the characteristics and applications of SNOSFET. Application of SNOS field effect transistors have been proposed for both logic circuits and nonvolatile memory arrays, and operating characteristics with write and erase were investigated. As a results, memory window size of four terminal devices and two terminal devices was established low conductance stage and high conductance state, which was operated in “1” state and “0”state with write and erase respectively. And the operating characteristics of unit cell in matrix array were investigated with implementing the composition method of four and two terminal nonvolatile memory cells. It was shown that four terminal 2${\times}$2 matrix array was operated bipolar, and two termineal 2${\times}$2 matrix array was operated unipolar.

AN EXPLICIT FORM OF POWERS OF A $2{\times}2$ MATRIX USING A RECURSIVE SEQUENCE

  • Kim, Daniel;Ryoo, Sangwoo;Kim, Taesoo;SunWoo, Hasik
    • 충청수학회지
    • /
    • 제25권1호
    • /
    • pp.19-25
    • /
    • 2012
  • The purpose of this paper is to derive powers $A^{n}$ using a system of recursive sequences for a given $2{\times}2$ matrix A. Introducing a recursive sequence we have a quadratic equation. Solutions to this quadratic equation are related with eigenvalues of A. By solving this quadratic equation we can easily obtain an explicit form of $A^{n}$. Our method holds when A is defined not only on the real field but also on the complex field.

On spanning column rank of matrices over semirings

  • Song, Seok-Zun
    • 대한수학회보
    • /
    • 제32권2호
    • /
    • pp.337-342
    • /
    • 1995
  • A semiring is a binary system $(S, +, \times)$ such that (S, +) is an Abelian monoid (identity 0), (S,x) is a monoid (identity 1), $\times$ distributes over +, 0 $\times s s \times 0 = 0$ for all s in S, and $1 \neq 0$. Usually S denotes the system and $\times$ is denoted by juxtaposition. If $(S,\times)$ is Abelian, then S is commutative. Thus all rings are semirings. Some examples of semirings which occur in combinatorics are Boolean algebra of subsets of a finite set (with addition being union and multiplication being intersection) and the nonnegative integers (with usual arithmetic). The concepts of matrix theory are defined over a semiring as over a field. Recently a number of authors have studied various problems of semiring matrix theory. In particular, Minc [4] has written an encyclopedic work on nonnegative matrices.

  • PDF

ITERATIVE METHODS FOR LARGE-SCALE CONVEX QUADRATIC AND CONCAVE PROGRAMS

  • Oh, Se-Young
    • 대한수학회논문집
    • /
    • 제9권3호
    • /
    • pp.753-765
    • /
    • 1994
  • The linearly constrained quadratic programming(QP) considered is : $$ min f(x) = c^T x + \frac{1}{2}x^T Hx $$ $$ (1) subject to A^T x \geq b,$$ where $c,x \in R^n, b \in R^m, H \in R^{n \times n)}$, symmetric, and $A \in R^{n \times n}$. If there are bounds on x, these are included in the matrix $A^T$. The Hessian matrix H may be positive definite or negative semi-difinite. For large problems H and the constraint matrix A are assumed to be sparse.

  • PDF

MINIMUM PERMANENTS OF DOUBLY STOCHASTIC MATRICES WITH k DIAGONAL p×p BLOCK SUBMATRICES

  • Lee, Eun-Young
    • 대한수학회보
    • /
    • 제41권2호
    • /
    • pp.199-211
    • /
    • 2004
  • For positive integers $\kappa$ and p$\geq$3, let(equation omitted) where $J_{p}$ is the p${\times}$p matrix whose entries are all 1. Then, we determine the minimum permanents and minimizing matrices over (1) the face of $\Omega$(D) and (2) the face of $\Omega$($D^{*}$), where (equation omitted).

SKEW-SYMMETRIC SOLVENT FOR SOLVING A POLYNOMIAL EIGENVALUE PROBLEM

  • Han, Yin-Huan;Kim, Hyun-Min
    • 충청수학회지
    • /
    • 제26권2호
    • /
    • pp.275-285
    • /
    • 2013
  • In this paper a nonlinear matrix equation is considered which has the form $$P(X)=A_0X^m+A_1X^{m-1}+{\cdots}+A_{m-1}X+A_m=0$$ where X is an $n{\times}n$ unknown real matrix and $A_m$, $A_{m-1}$, ${\cdots}$, $A_0$ are $n{\times}n$ matrices with real elements. Newtons method is applied to find the skew-symmetric solvent of the matrix polynomial P(X). We also suggest an algorithm which converges the skew-symmetric solvent even if the Fr$\acute{e}$echet derivative of P(X) is singular.

Inverse-Orthogonal Jacket-Haar, DCT 변환 (Inverse-Orthogonal Jacket-Haar and DCT Transform)

  • 박주용;엠디 하심 알리 칸;김정수;이문호
    • 전자공학회논문지
    • /
    • 제51권9호
    • /
    • pp.30-40
    • /
    • 2014
  • 본 논문에서는 Hadamard 변환이 Jacket 변환으로 일반화 될 수 있는 것처럼 Haar 변환을 Jacket-Haar 변환으로 일반화 한다. Jacket-Haar 변환의 원소는 0 과 ${\pm}2^k$ 이다. original Haar 변환과 비교해서 Jacket-Haar 변환의 베이시스(basis)는 신호처리에 보다 적합하다. 응용으로 $2{\times}2$ Hadamard 행렬을 기반으로 한 DCT-II(discrete cosine transform-II)와 $2{\times}2$ Haar 행렬을 기반으로 한 HWT(Haar Wavelete transform)를 제시하고 이들의 성능을 분석하며 Lenna 이미지의 시뮬레이션을 통해 성능을 평가하였다.

고주파 여기식 매트릭스형 도파관 이산화탄소 레이저 (The radio-frequency excited matrix waveguide CO2 laser)

  • 최종운;안명수;이영우
    • 한국광학회지
    • /
    • 제15권4호
    • /
    • pp.343-348
    • /
    • 2004
  • 고주파로 여기 되는 매트릭스형 도파관 이산화탄소 레이저를 개발하였다. 단위길이당 레이저 출력을 증가시키기 위하여 4개의 고주파 방전관을 2 ${\times}$ 2 형태의 매트릭스 구조로 제작하여 한개의 공진기 속에 배치하였다. 레이저 출력은 출력경으로부터 가까운 거리에서는 4개의 독립된 형태로 출력되었고, 출력경으로부터 거리가 멀어질수록 4개의 빔이 하나로 합쳐짐으로서 가우시안 모드에 가까워지는 것을 확인하였다. 레이저에 주입되는 혼합 가스압력이 45 mbar, 가스 혼합비율이 $CO_2$ : $N_2$ : He : Xe = 1 : 1 : 3 : 0.2, 고주파입력 파워가 200 W일 때 약 12 W의 광출력을 얻었다.