• Journal of applied mathematics & informatics
• /
• 제28권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
• /
• 제26권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
• /
• 제3권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
• /
• 제27권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.

• 대한수학회논문집
• /
• 제12권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
• /
• 제7권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
• /
• 제14권3호
• /
• pp.297-302
• /
• 1999

Poly(DL-lactide)로 피막된 고분자 매트릭스를 약물전달시스템에 이용하기 위해 키토산, 키토산 염산염 및 술폰화 키토산으로 제조되었다. 모델 약물로 프레드니솔론을 사용하는 본 약물방출에 관한 연구는 pH 1.2 염산 용액에서 실험을 하였다. 약물 방출 속도는 고분자 매트릭스의 함유량이 증가할 수록 감소하였다. 피막된 고분자 매트릭스의 종류에 따라 지연된 약물의 방출시간은 키토산의 경우가 가장 길었으며, 술폰화 키토산, 키토산 염산염의 순서였다. DL-PLA로 피막된 고분자 매트릭스가 피막되지 않는 고분자 매트릭스 보다 약물 방출시간이 2배 정도의 지연되었을 뿐만 아니라 초기에 약물 과잉방출 현상도 작아 피막된 경우가 방출 조절형 제재로서 더 바람직한 결과를 보였다. 따라서 DL-PLA로 피막된 고분자 매트릭스는 장시간의 약물 방출을 위한 약물전달체로써의 응용이 기대된다.

• 대한전자공학회논문지TC
• /
• 제45권2호
• /
• pp.1-5
• /
• 2008

LDPC 구조는 1개의 개수가 적은 구조의 패리티 체크 행렬을 구성하여도, H행렬의 역행렬을 구하는 과정 중에 가우시안 소거법으로 인하여 H 행렬은 1의 개수가 적은 성질이 없어지고 계산량도 블록 크기 당 $n^2$의 계산량이 요구되어지고 있다. 그러므로 LDPC 패리티 체크 행려인 H는 좀 더 효율적인 부호화에 초점을 두고 개발되고 있다. 본 논문에서는 edge-by-edge 방법으로 체크 노드와 심볼 노드사이를 연결하거나 연결선을 정하는 것으로 큰 girth를 가지는 Tanner 그래프를 구성할 수 있는 PEG 알고리즘을 변형 시킨 M-PEG를 패리티 체크 행렬인 H를 구성하고 좀 더 효율적으로 부호화기를 구성할 수 있도록 dual-diagonal 형태를 지니는 H를 구성한다.

• Korean Journal of Mathematics
• /
• 제12권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.

• 대한수학회보
• /
• 제55권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.