• Kyungpook Mathematical Journal
• /
• v.57 no.3
• /
• pp.441-455
• /
• 2017

In this article we have determined the spectrum and fine spectrum of the lower triangular matrix B(r, s) on the Hahn sequence space h. We have also determined the approximate point spectrum, the defect spectrum and the compression spectrum of the operator B(r, s) on the sequence space h.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.4
• /
• pp.1017-1031
• /
• 2016

Let R be a commutative ring with the non-zero identity and n be a natural number. ${\Gamma}^n_R$ is a simple graph with $R^n{\setminus}\{0\}$ as the vertex set and two distinct vertices X and Y in $R^n$ are adjacent if and only if there exists an $n{\times}n$ lower triangular matrix A over R whose entries on the main diagonal are non-zero such that $AX^t=Y^t$ or $AY^t=X^t$, where, for a matrix B, $B^t$ is the matrix transpose of B. ${\Gamma}^n_R$ is a generalization of Cayley graph. Let $T_n(R)$ denote the $n{\times}n$ upper triangular matrix ring over R. In this paper, for an arbitrary ring R, we investigate the properties of the graph ${\Gamma}^n_{T_n(R)}$.

• Journal of the Korean Mathematical Society
• /
• v.47 no.6
• /
• pp.1269-1282
• /
• 2010

We in this note consider a new concept, so called $\pi$-McCoy, which unifies McCoy rings and IFP rings. The classes of McCoy rings and IFP rings do not contain full matrix rings and upper (lower) triangular matrix rings, but the class of $\pi$-McCoy rings contain upper (lower) triangular matrix rings and many kinds of full matrix rings. We first study the basic structure of $\pi$-McCoy rings, observing the relations among $\pi$-McCoy rings, Abelian rings, 2-primal rings, directly finite rings, and ($\pi-$)regular rings. It is proved that the n by n full matrix rings ($n\geq2$) over reduced rings are not $\pi$-McCoy, finding $\pi$-McCoy matrix rings over non-reduced rings. It is shown that the $\pi$-McCoyness is preserved by polynomial rings (when they are of bounded index of nilpotency) and classical quotient rings. Several kinds of extensions of $\pi$-McCoy rings are also examined.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.2
• /
• pp.317-325
• /
• 2012

In this paper, we consider the encoding scheme of Low Density Parity Check codes. In particular, using the Jacket Pattern and circulant permutation matrices, we propose the simple encoding scheme of Richardson's lower triangular matrix. These encoding scheme can be extended to a flexible code rate. Based on the simple matrix process, also we can design low complex and simple encoders for the flexible code rates.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.7
• /
• pp.739-748
• /
• 1992

A CGM iterative systolic algorithm to solve large sparse linear systems of equations is presented. For implementation of the algorithm, a systolic array using the stripe structure is proposed. The matrix A is decomposed into a strictly lower triangular matrix, a diagonal matrix, and a strictly up-per triangular matrix, and the two formers and the tatter· are concurrently computed by different linear arrays. Hence, the execution time of this approach Is reduced to half of the execution time of the that a linear array is used. computation of the Irregularly distributed sparse matrix can be executed effectively by using the stripe structure.

• Wind and Structures
• /
• v.9 no.3
• /
• pp.231-243
• /
• 2006

An improvement to the spectral representation algorithm for the simulation of wind velocity fields on large scale structures is proposed in this paper. The method proposed by Deodatis (1996) serves as the basis of the improved algorithm. Firstly, an interpolation approximation is introduced to simplify the computation of the lower triangular matrix with the Cholesky decomposition of the cross-spectral density (CSD) matrix, since each element of the triangular matrix varies continuously with the wind spectra frequency. Fast Fourier Transform (FFT) technique is used to further enhance the efficiency of computation. Secondly, as an alternative spectral representation, the vectors of the triangular matrix in the Deodatis formula are replaced using an appropriate number of eigenvectors with the spectral decomposition of the CSD matrix. Lastly, a turbulent wind velocity field through a vertical plane on a long-span bridge (span-wise) is simulated to illustrate the proposed schemes. It is noted that the proposed schemes require less computer memory and are more efficiently simulated than that obtained using the existing traditional method. Furthermore, the reliability of the interpolation approximation in the simulation of wind velocity field is confirmed.

• Journal of Advanced Marine Engineering and Technology
• /
• v.27 no.5
• /
• pp.600-608
• /
• 2003

This Paper describes a detailed experimental investigation of heat transfer in a reciprocating smooth rectangular duct having only the bottom wall heated with reference to the design of a piston for a marine propulsive diesel engine The Parametric test matrix involves Reynolds number and reciprocating radius, respectively, in the range of 1.280∼4.100, and 7∼15 cm with five different reciprocating frequency tested. namely. 1.7, 2.2, and 2.6 Hz. The effects of three different hemi-triangular wavy type tapers on the heat transfer in the reciprocating rectangular channel using the air as a working fluid were check out. The present work confirms that the Nusselt number in the channel with the triangular wavy type taper is lower than without the triangular wavy type taper.

• Communications of the Korean Mathematical Society
• /
• v.14 no.2
• /
• pp.311-318
• /
• 1999

Let A be an n$\times$n (0,1) matrix. Let f(A) denote the smallest nonnegative integer k such that per A[$\alpha$｜$\beta$]>0 and A($\alpha$｜$\beta$) is permutation equivalent to a lower triangular matrix for some $\alpha$, $\beta$$\in$Q\ulcorner,\ulcorner. In this case f(A) is called the feedback number of A. In this paper, feedback numbers of some maximal convertible (0,1) matrices are studied.

• International Journal of Precision Engineering and Manufacturing
• /
• v.3 no.2
• /
• pp.52-60
• /
• 2002

Axiomatic Design is the one of many useful methods for making a good design. In this method, the independency of Functional Requirements (FRs) is an important property to determine whether the design is good or not. Until now so many designers have decided the independency between FRs by their own decisions. The way depending on inspiration is simple and fast, but it can not be considered as a precise conclusion. Also there are not exact rule that evaluate the quantitative independence between FRs. This paper will show the way to evaluate the quantitative independence of FRs from the comparison between FRs of lower levels, and develop more efficient and objective tool in Axiomatic Design.

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