• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.77-90
• /
• 2004

In this paper, we study the convergence of both relaxed multisplitting method and nonstationary two-stage multisplitting method associated with a multisplitting which is obtained from the ILU factorizations for solving a linear system whose coefficient matrix is an H-matrix. Also, parallel performance results of nonstaionary two-stage multisplitting method using ILU factorizations as inner splittings on the IBM p690 supercomputer are provided to analyze theoretical results.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.5
• /
• pp.1803-1825
• /
• 2017

Let X be a smooth scheme with an action of an algebraic group G. We establish an equivalence of two categories related to the corresponding moment map ${\mu}:T^{\ast}X{\rightarrow}g^{\ast}$ - the derived category of G-equivariant coherent sheaves on the derived fiber ${\mu}^{-1}(0)$ and the derived category of G-equivariant matrix factorizations on $T^{\ast}X{\times}g$ with potential given by ${\mu}$.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.5.1-5
• /
• 2003

In this paper, we study the convergence of relaxed multisplitting and relaxed nonstationary two-stage multisplitting methods associated with a multisplitting which is obtained from the ILU factorizations for solving a linear system whose coefficient matrix is an H-matrix. Also, parallel performance results of relaxed nonstaionary two-stage multisplitting method using ILU factorizations as inner splittings on the IBM p690 supercomputer are provided to analyze theoretical results.

• Journal of the Korean Mathematical Society
• /
• v.45 no.2
• /
• pp.479-491
• /
• 2008

In [4], the authors studied the Pascal matrix and the Stirling matrices of the first kind and the second kind via the Fibonacci matrix. In this paper, we consider generalizations of Pascal matrix, Fibonacci matrix and Pell matrix. And, by using Riordan method, we have factorizations of them. We, also, consider some combinatorial identities.

• Honam Mathematical Journal
• /
• v.24 no.1
• /
• pp.103-108
• /
• 2002

Applications of a column-reduced orthogonal rational matrix function to McMillan degrees and Wiener-Hopf factorizations are considered.

• Journal of the Korean Mathematical Society
• /
• v.57 no.5
• /
• pp.1135-1165
• /
• 2020

Polishchuk-Zaslow explained the homological mirror symmetry between Fukaya category of symplectic torus and the derived category of coherent sheaves of elliptic curves via Lagrangian torus fibration. Recently, Cho-Hong-Lau found another proof of homological mirror symmetry using localized mirror functor, whose target category is given by graded matrix factorizations. We find an explicit relation between these two approaches.

• Kyungpook Mathematical Journal
• /
• v.63 no.2
• /
• pp.175-186
• /
• 2023

In this article we look at the property of a 2 by 2 full matrix ring over the ring of integers, of being weakly right IQNN. This generalisation of the property of being right IQNN arises from products of idempotents and nilpotents. We shown that it is, indeed, a proper generalization of right IQNN. We consider the property of beign weakly right IQNN in relation to several kinds of factorizations of a free algebra in two indeterminates over the ring of integers modulo 2.

• 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.