• Title/Summary/Keyword: M-matrix

Search Result 2,898, Processing Time 0.032 seconds

THE BINOMIAL METHOD FOR A MATRIX SQUARE ROOT

  • Kim, Yeon-Ji;Seo, Jong-Hyeon;Kim, Hyun-Min
    • East Asian mathematical journal
    • /
    • v.29 no.5
    • /
    • pp.511-519
    • /
    • 2013
  • There are various methods for evaluating a matrix square root, which is a solvent of the quadratic matrix equation $X^2-A=0$. We consider new iterative methods for solving matrix square roots of M-matrices. Particulary we show that the relaxed binomial iteration is more efficient than Newton-Schulz iteration in some cases. And we construct a formula to find relaxation coefficients through statistical experiments.

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

CONVERGENCE OF RELAXED TWO-STAGE MULTISPLITTING METHOD USING M-SPLITTINGS OR SOR MULTISPLITTING

  • Oh, Se-Young;Yun, Jae-Heon
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.3_4
    • /
    • pp.489-500
    • /
    • 2009
  • In this paper, we study the convergence of relaxed two-stage multisplitting method using M-splittings or SOR multi splitting as inner splittings and an outer splitting for solving a linear system whose coefficient matrix is an M-matrix. We also provide numerical experiments for the convergence of the relaxed two-stage multisplitting method.

  • PDF

POSINORMAL TERRACED MATRICES

  • Rhaly, H. Crawford, Jr.
    • Bulletin of the Korean Mathematical Society
    • /
    • v.46 no.1
    • /
    • pp.117-123
    • /
    • 2009
  • This paper is a study of some properties of a collection of bounded linear operators resulting from terraced matrices M acting through multiplication on ${\ell}^2$; the term terraced matrix refers to a lower triangular infinite matrix with constant row segments. Sufficient conditions are found for M to be posinormal, meaning that $MM^*=M^*PM$ for some positive operator P on ${\ell}^2$; these conditions lead to new sufficient conditions for the hyponormality of M. Sufficient conditions are also found for the adjoint $M^*$ to be posinormal, and it is observed that, unless M is essentially trivial, $M^*$ cannot be hyponormal. A few examples are considered that exhibit special behavior.

CONVERGENCE OF NEWTON'S METHOD FOR SOLVING A CLASS OF QUADRATIC MATRIX EQUATIONS

  • Kim, Hyun-Min
    • Honam Mathematical Journal
    • /
    • v.30 no.2
    • /
    • pp.399-409
    • /
    • 2008
  • We consider the most generalized quadratic matrix equation, Q(X) = $A_7XA_6XA_5+A_4XA_3+A_2XA_1+A_0=0$, where X is m ${\times}$ n, $A_7$, $A_4$ and $A_2$ are p ${\times}$ m, $A_6$ is n ${\times}$ m, $A_5$, $A_3$ and $A_l$ are n ${\times}$ q and $A_0$ is p ${\times}$ q matrices with complex elements. The convergence of Newton's method for solving some different types of quadratic matrix equations are considered and we show that the elementwise minimal positive solvents can be found by Newton's method with the zero starting matrices. We finally give numerical results.

SOLVING MATRIX POLYNOMIALS BY NEWTON'S METHOD WITH EXACT LINE SEARCHES

  • Seo, Jong-Hyeon;Kim, Hyun-Min
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.12 no.2
    • /
    • pp.55-68
    • /
    • 2008
  • One of well known and much studied nonlinear matrix equations is the matrix polynomial which has the form $P(X)=A_0X^m+A_1X^{m-1}+{\cdots}+A_m$, where $A_0$, $A_1$, ${\cdots}$, $A_m$ and X are $n{\times}n$ complex matrices. Newton's method was introduced a useful tool for solving the equation P(X)=0. Here, we suggest an improved approach to solve each Newton step and consider how to incorporate line searches into Newton's method for solving the matrix polynomial. Finally, we give some numerical experiment to show that line searches reduce the number of iterations for convergence.

  • PDF

Solving a Matrix Polynomial by Conjugate Gradient Methods

  • Ko, Hyun-Ji;Kim, Hyun-Min
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.11 no.4
    • /
    • pp.39-46
    • /
    • 2007
  • One of well known and much studied nonlinear matrix equations is the matrix polynomial which has the form G(X)=$A_0X^m+A_1X^{m-1}+{\cdots}+A_m$ where $A_0$, $A_1$, ${\cdots}$, $A_m$ and X are $n{\times}n$ real matrices. We show how the minimization methods can be used to solve the matrix polynomial G(X) and give some numerical experiments. We also compare Polak and Ribi$\acute{e}$re version and Fletcher and Reeves version of conjugate gradient method.

  • PDF

ON NEWTON'S METHOD FOR SOLVING A SYSTEM OF NONLINEAR MATRIX EQUATIONS

  • Kim, Taehyeong;Seo, Sang-Hyup;Kim, Hyun-Min
    • East Asian mathematical journal
    • /
    • v.35 no.3
    • /
    • pp.341-349
    • /
    • 2019
  • In this paper, we are concerned with the minimal positive solution to system of the nonlinear matrix equations $A_1X^2+B_1Y +C_1=0$ and $A_2Y^2+B_2X+C_2=0$, where $A_i$ is a positive matrix or a nonnegative irreducible matrix, $C_i$ is a nonnegative matrix and $-B_i$ is a nonsingular M-matrix for i = 1, 2. We apply Newton's method to system and present a modified Newton's iteration which is validated to be efficient in the numerical experiments. We prove that the sequences generated by the modified Newton's iteration converge to the minimal positive solution to system of nonlinear matrix equations.

SKEW-SYMMETRIC SOLVENT FOR SOLVING A POLYNOMIAL EIGENVALUE PROBLEM

  • Han, Yin-Huan;Kim, Hyun-Min
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.26 no.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.

EXPRESSION OF MATRIX METALLOPROTEINASE-1 AND -2 MRNA IN RETRODISCAL TISSUE OF THE TEMPOROMANDIBULAR JOINT (측두하악 관절원판 후조직의 MMP(matrix metalloproteinase)-1과 MMP-2 mRNA의 발현)

  • Huh, Jong-Ki;Park, Kwang-Kyun;Choi, Min-Ah;Kim, Hyung-Gon
    • Journal of the Korean Association of Oral and Maxillofacial Surgeons
    • /
    • v.29 no.4
    • /
    • pp.212-218
    • /
    • 2003
  • Matrix metalloproteinases (MMPs) play an important role in the normal morphogenesis, maintenance, and repair of matrix and also have important functions in pathologic conditions characterized by excessive degradation of extracellular matrix, such as rheumatoid arthritis, osteoarthritis, periodontitis and in tumor invasion and metastasis. In this study, expression of MMP-1 and -2 mRNA in retrodiscal tissue of the temporomandibular joint (TMJ) was examined and compared with magnetic resonance imaging (MRI) and surgical findings. MMP mRNAs in the retrodiscal tissue samples were detected by reverse transcription - polymerase chain reaction. TMJ internal derangement (ID) was categorized as normal disc position, disc displacement with reduction, early stage of disc displacement without reduction (DDsR) and late stage of DDsR. TMJ osteoarthrosis (OA) was classified with normal, mild and advanced OA. The amount of synovial fluid collection was divided into not detected, small, large and extremely large amount on MR T2-weighted imaging. Perforation and adhesion were examined during open surgery of the TMJ. Six out of 37 samples were excluded because of little amount of extracted total mRNA. MMP-2 mRNA was detected whole joints, and so the MMP-2 mRNA seems to be expressed normally in retrodiscal tissue. However, MMP-1 mRNA was expressed in 8 of 31 joints. Frequencies of MMP-1 mRNA expression according to the TMJ IDs, amount of synovial fluid and surgical findings made no significant difference. MMP-1 mRNA was detected more frequently in OA groups (7/16 joints, 43.8%) than in normal bony structure group (1/15 joints, 6.7%). Expression of MMP-1 mRNA in retrodiscal tissue might be related with OA of the TMJ.