• Journal of the Chungcheong Mathematical Society
• /
• v.33 no.4
• /
• pp.413-427
• /
• 2020

In this work we study 0-commuting matrix C(0) under relationships with the Pascal matrix C(1). Like kth power C(1)k is an arithmetic matrix of (kx+y)n with yx = xy (k ≥ 1), we express C(0)k as an arithmetic matrix of certain polynomial with yx = 0.

• East Asian mathematical journal
• /
• v.40 no.3
• /
• pp.329-339
• /
• 2024

In the work we generate arithmetic matrix P^(c,b,a) of (cx² + bx+a)ⁿ from a Pascal matrix P^(1,1). We extend an identity P^(1,1))O^(1,1) = P^(1,1,1) with an obtuse matrix O^(1,1) to k degree polynomials. For the purpose we study P^(1,1)kO^(1,1) and find generating polynomials of O^(1,1)k.

• Structural Engineering and Mechanics
• /
• v.37 no.6
• /
• pp.633-648
• /
• 2011

This paper investigates the aspect-ratio locking of the isoparametric 8-node quadrilateral (QUAD8) element. An important finding is that, if finite element solution is carried out with in exact arithmetic (i.e., with no truncation and round off errors), the locking tendency of the element is completely avoided even for aspect-ratios as high as 100000. The current finite element codes mostly use floating point arithmetic. Thus, they can only avoid this locking for aspect-ratios up to 100 or 1000. A novel method is proposed in the paper to avoid aspect-ratio locking in floating point computations. In this method, the offending terms of the strain-displacement matrix (i.e., $\mathbf{B}$-matrix) are multiplied by suitable scaling factors to avoid ill-conditioning of stiffness matrix. Numerical examples are presented to demonstrate the efficacy of the method. The examples reveal that aspect-ratio locking is avoided even for aspect-ratios as high as 100000.

• Proceedings of the Optical Society of Korea Conference
• /
• 1990.02a
• /
• pp.95-101
• /
• 1990

Parallel optical arithmetic techniques have been developed using the correlation property of optical phase conjugate wave generated by degenerated four wave-mixing. In this paper, conventional rectangular-type coded pattern used for optical logic system is replaced by circular one for effective beam coupling in a photorefractive $BaTiO_3$ material. By adequately adjusting the distance between circular-type pixels of the input pattern and grouping the correlated output, optical binary half addition/subtraction, binary multiplication and, matrix-matrix computation are demonstrated.

• Journal of Korean Ophthalmic Optics Society
• /
• v.15 no.3
• /
• pp.219-225
• /
• 2010

Purpose: Usefulness in predicting the power of spherical rigid gas-pearmeable (RGP) lenses prescription using dioptric power matrices and arithmetic calculations was evaluated in this study. Noncycloplegic refractive errors and over-refractions were performed on 110 eyes of 55 subjects (36 males and 19 females, aged $24.60{\pm}1.55$years) in twenties objectively with an auto-refractometer (with keratometer) and subjectively. Tear lenses were calculated from keratometric readings and base curves of RGP lenses, and the power of RGP lenses were computed by a dioptric power matrix and an arithmetic calculation from the manifest refraction and the tear lens, and were compared with those by over-refractions in terms of spherical (Sph), spherical quivalent (SE) and astigmatic power. Results: The mean difference (MD) and 95% limits of agreement (LOA=$MD{\pm}1.96SD$) were better for SE (0.26D, $0.26{\pm}0.70D$) than for Sph (0.61D, $0.61{\pm}0.86D$). The mean difference and agreement of the cylindrical power between matrix and arithmetic calculation (-0.13D, $-0.13{\pm}0.53D$) were better than between the others (-0.24D, $0.24{\pm}0.84D$ between matrix and over-refraction; -0.12D, $0.12{\pm}1.00D$ between arithmetic calculation and over-refraction). The fitness of spherical RGP lenses were 54.5% for matrix, 66.4% for arithmetic calculation and 91.8% for over-refraction. Arithmetic calculation was close to the over-refraction. Conclusions: In predicting indications and powers of spherical RGP lens fitting, although there are the differences of axis between total (spectacle) astigmatism and corneal astigmatism, Spherical equivalent using an arithmetic calculation provides a more useful application than using a dioptric power matrix.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.2A
• /
• pp.116-123
• /
• 2002

The jacket matrix is based on the Walsh-Hadamard matrix and an extension of it. While elements of the Walsh-Hadamard matrix are +1, or -1, those of the Jacket matrix are ${\pm}$1 and ${\pm}$$\omega$, which is $\omega$, which is ${\pm}$j and ${\pm}$2$\sub$n/. This matrix has weights in the center part of the matrix and its size is 1/4 of Hadamard matrix, and it has also two parts, sigh and weight. In this paper, instead of the conventional Jacket matrix where the weight is imposed by force, a simple Jacket sequence generation method is proposed. The Jacket sequence is generated by AND and Exclusive-OR operations between the binary indices bits of row and those of column. The weight is imposed on the element by when the product of each Exclusive-OR operations of significant upper two binary index bits of a row and column is 1. Each part of the Jacket matrix can be represented by jacket sequence using row and column binary index bits. Using Distributed Arithmetic (DA), we present a VLSI architecture of the Fast Jacket transform is presented. The Jacket matrix is able to be applied to cryptography, the information theory and complex spreading jacket QPSK modulation for WCDMA.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.4 no.1
• /
• pp.79-92
• /
• 2000

We investigate numerical properties of Newton's algorithm for improving an eigenpair of a real matrix A using only fixed precision arithmetic. We show that under natural assumptions it produces an eigenpair of a componentwise small relative perturbation of the data matrix A.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.769-772
• /
• 2001

Waish-Hadamard Transform은 압축, 필터링, 코드 디자인 등 다양한 이미지처리 분야에 응용되어왔다. 이러한 Hadamard Transform을 기본으로 확장한 Jacket Transform은 행렬의 원소에 가중치를 부여함으로써 Weighted Hadamard Matrix라고 한다. Jacket Matrix의 cocyclic한 특성은 암호화, 정보이론, TCM 등 더욱 다양한 응용분야를 가질 수 있고, Space Time Code에서 대역효율, 전력면에서도 효율적인 특성을 나타낸다 [6],[7]. 본 논문에서는 Distributed Arithmetic(DA) 구조를 이용하여 Fast Jacket Transform(FJT)을 구현한다. Distributed Arithmetic은 ROM과 어큐뮬레이터를 이용하고, Jacket Watrix의 행렬을 분할하고 간략화하여 구현함으로써 하드웨어의 복잡도를 줄이고 기존의 시스톨릭한 구조보다 면적의 이득을 얻을 수 있다. 이 방법은 수학적으로 간단할 뿐 만 아니라 행렬의 곱의 형태를 단지 덧셈과 뺄셈의 형태로 나타냄으로써 하드웨어로 쉽게 구현할 수 있다. 이 구조는 입력데이타의 워드길이가 n일 때, O(2n)의 계산 복잡도를 가지므로 기존의 시스톨릭한 구조와 비교하여 더 적은 면적을 필요로 하고 FPGA로의 구현에도 적절하다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.8 no.12
• /
• pp.127-138
• /
• 1985

There are several methods which have been presented up to now in solving the simultaneous linear equations by computer. They are Gaussian Elimination Method, Gauss-Jordan Method, Inverse matrix Method and Gauss-Seidel iterative Method. This paper is not only discussed in their mechanisms compared with their algorithms, depicted flow charts, but also calculated the numbers of arithmetic operations and comparisons in order to criticize their availability. Inverse Matrix Method among em is founded out the smallest in the number of arithmetic operation, but is not the shortest operation time. This paper also indicates the many problems in using these methods and propose the new method which is able to applicate to even small or middle size computers.

• Kyungpook Mathematical Journal
• /
• v.53 no.3
• /
• pp.479-495
• /
• 2013

Taking the weighted geometric mean [11] on the cone of positive definite matrix, we propose an iterative mean algorithm involving weighted arithmetic and geometric means of $n$-positive definite matrices which is a weighted version of Carlson mean presented by Lee and Lim [13]. We show that each sequence of the weigthed Carlson iterative mean algorithm has a common limit and the common limit of satisfies weighted multidimensional versions of all properties like permutation symmetry, concavity, monotonicity, homogeneity, congruence invariancy, duality, mean inequalities.