• Title/Summary/Keyword: s-matrix

Search Result 4,766, Processing Time 0.032 seconds

Geometrical Construction of the S Matrix and Multichannel Quantum Defect Theory for the two Open and One Closed Channel System

  • Lee, Chun-Woo
    • Bulletin of the Korean Chemical Society
    • /
    • v.23 no.7
    • /
    • pp.971-984
    • /
    • 2002
  • The multichannel quantum defect theory (MQDT) is reformulated into the form of the configuration mixing (CM) method using the geometrical construction of the S matrix developed for the system involving two open and one closed channels. The reformulation is done by the phase renormalization method of Giusti-Suzor and Fano. The rather unconventional short-range reactance matrix K whose diagonal elements are not zero is obtained though the Lu-Fano plot becomes symmetrical. The reformulation of MQDT yields the partial cross section formulas analogous to Fano's resonance formula, which has not easily been available in other's work.

ON GENERALIZED TRIANGULAR MATRIX RINGS

  • Chun, Jang Ho;Park, June Won
    • East Asian mathematical journal
    • /
    • v.30 no.3
    • /
    • pp.259-270
    • /
    • 2014
  • For a generalized triangular matrix ring $$T=\[\array{R\;M\\0\;S}]$$, over rings R and S having only the idempotents 0 and 1 and over an (R, S)-bimodule M, we characterize all homomorphisms ${\alpha}$'s and all ${\alpha}$-derivations of T. Some of the homomorphisms are compositions of an inner homomorphism and an extended or a twisted homomorphism.

FERMAT'S EQUATION OVER 2-BY-2 MATRICES

  • Chien, Mao-Ting;Meng, Jie
    • Bulletin of the Korean Mathematical Society
    • /
    • v.58 no.3
    • /
    • pp.609-616
    • /
    • 2021
  • We study the solvability of the Fermat's matrix equation in some classes of 2-by-2 matrices. We prove the Fermat's matrix equation has infinitely many solutions in a set of 2-by-2 positive semidefinite integral matrices, and has no nontrivial solutions in some classes including 2-by-2 symmetric rational matrices and stochastic quadratic field matrices.

NEWTON'S METHOD FOR SOLVING A QUADRATIC MATRIX EQUATION WITH SPECIAL COEFFICIENT MATRICES

  • Seo, Sang-Hyup;Seo, Jong-Hyun;Kim, Hyun-Min
    • Honam Mathematical Journal
    • /
    • v.35 no.3
    • /
    • pp.417-433
    • /
    • 2013
  • We consider the iterative solution of a quadratic matrix equation with special coefficient matrices which arises in the quasibirth and death problem. In this paper, we show that the elementwise minimal positive solvent of the quadratic matrix equations can be obtained using Newton's method if there exists a positive solvent and the convergence rate of the Newton iteration is quadratic if the Fr$\acute{e}$chet derivative at the elementwise minimal positive solvent is nonsingular. Although the Fr$\acute{e}$chet derivative is singular, the convergence rate is at least linear. Numerical experiments of the convergence rate are given.

Matrix Development in Cast Iron by Addition of Mischmetal Hydrides (주철(鑄鐵)의 기지조직(基地組織)에 미치는 Mischmetal Hydride의 첨가효과(添加效果))

  • Choi, Dap-Chun;Jin, Young-Chul
    • Journal of Korea Foundry Society
    • /
    • v.8 no.4
    • /
    • pp.422-428
    • /
    • 1988
  • In this study we have investigated the effects of Mm, MmH and $MmH_2$ on the matrix development in cast iron, The conclusive summary is as follows: The spheroidal graphite was observed when 0.5wt.% or more of mischmetal was added and the matrix was of ledeburite structure, but bull's eye structure was not observed. On the other hand, the bull's eye structure was observed when 0.25wt.% of MmH, or 0.25wt.% to 0.5wt.% of $MmH_2$ was added. Above limit of the additives, the matrix changed into ledeburite structure. As the hydrogen content of mischmetal compound increased from MmH, the range of additives to obtain bull's eye structure expanded. This reveals the significant effect of mischmetal hydride on matrix development in cast iron and the possibility of practical use of the additives.

  • PDF

Estimation of Trifocal Tensor with Corresponding Mesh of Two Frontal Images

  • Tran Duy Dung;Jun Byung Hwan
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.133-136
    • /
    • 2004
  • We are going to procedure various view from two frontal image using trifocal tensor. We found that warping is effective to produce synthesized poses of a face with the small number of mesh point of a given image in previous research[1]. For this research, fundamental matrix is important to calculate trifocal tensor. So, in this paper, we investigate two existing algorithms: Hartley's[2] and Kanatani's[3]. As an experimental result, Kenichi Kantani's algorithm has better performance of fundamental matrix than Harley's algorithm. Then we use the fundamental matrix of Kenichi Kantani's algorithm to calculate trifocal tensor. From trifocal tensor we calculate new trifocal tensor with rotation input and translation input and we use warping to produce new virtual views.

  • PDF

Transfer matrix method for solution of FGMs thick-walled cylinder with arbitrary inhomogeneous elastic response

  • Chen, Y.Z.
    • Smart Structures and Systems
    • /
    • v.21 no.4
    • /
    • pp.469-477
    • /
    • 2018
  • This paper presents a numerical solution for the thick cylinders made of functionally graded materials (FGMs) with a constant Poisson's ratio and an arbitrary Young's modulus. We define two fundamental solutions which are derived from an ordinary differential equation under two particular initial boundary conditions. In addition, for the single layer case, we can define the transfer matrix N. The matrix gives a relation between the values of stress and displacement at the interior and exterior points. By using the assumed boundary condition and the transfer matrix, we can obtain the final solution. The transfer matrix method also provides an effective way for the solution of multiply layered cylinder. Finally, a lot of numerical examples are present.

An Accurate Method to Estimate Traffic Matrices from Link Loads for QoS Provision

  • Wang, Xingwei;Jiang, Dingde;Xu, Zhengzheng;Chen, Zhenhua
    • Journal of Communications and Networks
    • /
    • v.12 no.6
    • /
    • pp.624-631
    • /
    • 2010
  • Effective traffic matrix estimation is the basis of efficient traffic engineering, and therefore, quality of service provision support in IP networks. In this study, traffic matrix estimation is investigated in IP networks and an Elman neural network-based traffic matrix inference (ENNTMI) method is proposed. In ENNTMI, the conventional Elman neural network is modified to capture the spatio-temporal correlations and the time-varying property, and certain side information is introduced to help estimate traffic matrix in a network accurately. The regular parameter is further introduced into the optimal equation. Thus, the highly ill-posed nature of traffic matrix estimation is overcome effectively and efficiently.

Eigenvalue Perturbation of Augmented Matrix for Control Parameter (제어기 정수에 대한 확대행렬의 고유치 perturbation)

  • Shim, K.S.;Song, S.G.;Nam, H.K.;Kim, Y.G.;Moon, C.J.
    • Proceedings of the KIEE Conference
    • /
    • 2001.05a
    • /
    • pp.17-19
    • /
    • 2001
  • In this paper, eigenvalue perturbation theory and its applications for the augmented system matrix are described. This theory is quite useful in the cases where any change in a system parameter results in signifiant changes to most of the elements of the augmented matrix or where the forming of sensitivity matrix so complicate. And AMEP(augmented matrix eigenvalue perturbation) for the excitation system parameters are computed for analysis of small signal stability of KEPCO 215-machine 791-bus system.

  • PDF

A Polynomial-Time Algorithm for Breaking the McEliece's Public-Key Cryptosystem (McEliece 공개키 암호체계의 암호해독을 위한 Polynomial-Time 알고리즘)

  • Park, Chang-Seop-
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 1991.11a
    • /
    • pp.40-48
    • /
    • 1991
  • McEliece 공개키 암호체계에 대한 새로운 암호해독적 공격이 제시되어진다. 기존의 암호해독 algorithm이 exponential-time의 complexity를 가지는 반면, 본고에서 제시되어지는 algorithm은 polynomial-time의 complexity를 가진다. 모든 linear codes에는 systematic generator matrix가 존재한다는 사실이 본 연구의 동기가 된다. Public generator matrix로부터, 암호해독에 사용되어질 수 있는 새로운 trapdoor generator matrix가 Gauss-Jordan Elimination의 역할을 하는 일련의 transformation matrix multiplication을 통해 도출되어진다. 제시되어지는 algorithm의 계산상의 complexity는 주로 systematic trapdoor generator matrix를 도출하기 위해 사용되는 binary matrix multiplication에 기인한다. Systematic generator matrix로부터 쉽게 도출되어지는 parity-check matrix를 통해서 인위적 오류의 수정을 위한 Decoding이 이루어진다.

  • PDF