• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.987-992
• /
• 2010

H-matrix is a special class of matrices with wide applications in engineering and scientific computation, how to judge if a given matrix is an H-matrix is very important, especially for large scale matrices. In this paper, we obtain several new practical criteria for judging nonsingular H-matrices by using the partitioning technique and Schur complement of matrices. Their effectiveness is illustrated by numerical examples.

• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.839-850
• /
• 2008

In this paper, the symmetric accelerated overrelaxation (SAOR) method for solving $n{\times}n$ fuzzy linear system is discussed, then the convergence theorems in the special cases where matrix S in augmented system SX = Y is H-matrices or consistently ordered matrices and or symmetric positive definite matrices are also given out. Numerical examples are presented to illustrate the theory.

• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.361-364
• /
• 2001

Over an additive abelian group G of order g and for a given positive integer $\lambda$, a generalized Hadamard matrix GH(g, $\lambda$) is defined as a gλ$\times$gλ matrix[h(i, j)], where 1 $\leq i \leqg\lambda and 1 \leqj \leqg\lambda$, such that every element of G appears exactly $\lambd$atimes in the list h($i_1, 1) -h(i_2, 1), h(i_1, 2)-h(i_2, 2), …, h(i_1, g\lambda) -h(i_2, g\lambda), for any i_1\neqi_2$. In this paper, we propose a new method of expanding a GH(g^m, \lambda_1) = B = [B_{ij}] over G^m$ by replacing each of its m-tuple B_{ij} with B_{ij} + GH(g, $\lambda_2) where m = g\lambda_2. We may use g^m/\lambda_1 (not necessarily all distinct) GH(g, \lambda_2$)s for the substitution and the resulting matrix is defined over the group of order g.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.37-48
• /
• 2009

In the theory and the applications of Numerical Linear Algebra, the class of H-matrices is very important. In recent years, many appeared works have proposed iterative criterion for H-matrices. In this paper, we provide a new type of interleaved iterative algorithm, which is always convergent in finite steps for H-matrices and needs fewer iterations than those proposed in the related works, and a corresponding algorithm for general matrix, which eliminates the redundant computations when the given matrix is not an H-matrix. Finally, several numerical examples are presented to show the effectiveness of the proposed algorithms.

• Communications of the Korean Mathematical Society
• /
• v.12 no.4
• /
• pp.841-849
• /
• 1997

A square matrix A with $per A \neq 0$ is called convertible if there exists a {1, -1} matrix H such that $per A = det(H \circ A)$ where $H \circ A$ denote the Hadamard product of H and A. In this paper, ranks of convertible {0, 1} matrices are investigated and the existence of maximal convertible matrices with its rank r for each integer r with $\left\lceil \frac{n}{2} \right\rceil \leq r \leq n$ is proved.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.7 no.4
• /
• pp.247-253
• /
• 2007

In this paper, a high throughput multiple transform architecture for H.264 Fidelity Range Extensions (FRExt) is proposed. New techniques are adopted which (1) regularize the $8{\times}8$ integer forward and inverse DCT transform matrices, (2) divide them into four $4{\times}4$ sub-matrices so that simple fast butterfly algorithm can be used, (3) because of the similarity of the sub-matrices, mixed butterflies are proposed that all the sub-matrices of $8{\times}8$ and matrices of $4{\times}4$ forward DCT (FDCT), inverse DCT (IDCT) and Hadamard transform can be merged together. Based on these techniques, a hardware architecture is realized which can achieve throughput of 1.488Gpixel/s when processing either $4{\times}4\;or\;8{\times}8$ transform. With such high throughput, the design can satisfy the critical requirement of the real-time multi-transform processing of High Definition (HD) applications such as High Definition DVD (HD-DVD) ($1920{\times}1080@60Hz$) in H.264/AVC FRExt. This work has been synthesized using Rohm 0.18um library. The design can work on a frequency of 93MHz and throughput of 1.488Gpixel/s with a cost of 56440 gates.

• KSBB Journal
• /
• v.14 no.3
• /
• pp.297-302
• /
• 1999

The polymeric matrices coated with poly(DL-lactide) were prepared using chitosan derivatives such as chitosan, chitosan hydrochloride, and sulfonated chitosan for application of drug delivery systems. The drug release study using prednisolone as a model drug was performed in the hydrochloride solution at pH 1.2. The release rate of drug was decreased according to the increased content of matrices. The release rate of prednisolone according to the kinds of polymeric matrices coated were decreased in the order to chitosan, sulfonated chitosan, and chitosan hydrochloride. Drug release rate of polymeric matrices coated with poly(DL-lactide) was not only two times slower than noncoated one, but also the burst effect of initial period of drug release was decreased in comparison with noncoated one. From these results, it was expected that these formulations based on the chitosan derivative matrices coasted with poly(DL-lactide) were acceptable drug delivery devices for a sustained-release dosage form of drug.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.2
• /
• pp.1-5
• /
• 2008

Although we can make a sparse matrices for LDPC codes, the encoding complexity per a block increases quadratically by $n^2$. We propose modified PEG algorithm using PEG algorithm having a large girth by establishing edges or connections between symbol and check nodes in an edge-by-edge manner. M-PEG construct parity check matrices. So we propose parity check matrices H form a dual-diagonal matrices that can construct a more efficient decoder using a M-PEG(modified Progressive Edge Growth).

• Korean Journal of Mathematics
• /
• v.12 no.2
• /
• pp.201-209
• /
• 2004

We define the incidence matrices of oriented and nonoriented ${\kappa}$-hypergraphs, respectively. We discuss the ranks of some circulant matrices and show that the rank of the incidence matrices of oriented and nonoriented ${\kappa}$-hypergraphs H are $n$ under a certain condition on the ${\kappa}$-edge set or ${\kappa}$-arc set of H.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.2
• /
• pp.673-674
• /
• 2018

Corrections are made for some examples following Theorem 2.2 in Posinormal terraced matrices, Bull. Korean Math. Soc. 46 (2009), no. 1, 117-123.