• 충청수학회지
• /
• 제13권1호
• /
• pp.139-144
• /
• 2000

The generalized noncommutative torus $T_{\rho}^d$ of rank m was defined in [2]. Assume that for the completely irrational noncommutative subtorus $A_{\rho}$ of rank m of $T_{\rho}^d$ there is no integer q > 1 such that $tr(K_0(A_{\rho}))=\frac{1}{q}{\cdot}tr(K_0(A_{\rho^{\prime}}))$ for $A_{\rho^{\prime}}$ a completely irrational noncommutative torus of rank m. All $C^*$-algebras ${\Gamma}({\eta})$ of sections of locally trivial $C^*$-algebra bundles ${\eta}$ over $M=\prod_{i=1}^{e}S^{2k_i}{\times}\prod_{i=1}^{s}S^{2n_i+1}$, $\prod_{i=1}^{s}\mathbb{PR}_{2n_i}$, or $\prod_{i=1}^{s}L_{k_i}(n_i)$ with fibres $T_{\rho}^d{\otimes}M_c(\mathbb{C})$ were constructed in [6, 7, 8]. We prove that ${\Gamma}({\eta}){\otimes}M_{p^{\infty}}$ is isomorphic to $C(M){\otimes}A_{\rho}{\otimes}M_{cd}(\mathbb{C}){\otimes}M_{p^{\infty}}$ if and only if the set of prime factors of cd is a subset of the set of prime factors of p, that $\mathcal{O}_{2u}{\otimes}{\Gamma}({\eta})$ is isomorphic to $\mathcal{O}_{2u}{\otimes}C(M){\otimes}A_{\rho}{\otimes}M_{cd}(\mathbb{C})$ if and only if cd and 2u - 1 are relatively prime, and that $\mathcal{O}_{\infty}{\otimes}{\Gamma}({\eta})$ is not isomorphic to $\mathcal{O}_{\infty}{\otimes}C(M){\otimes}A_{\rho}{\otimes}M_{cd}(\mathbb{C})$ if cd > 1 when no non-trivial matrix algebra can be ${\Gamma}({\eta})$.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2006년도 한국컴퓨터종합학술대회 논문집 Vol.33 No.1 (A)
• /
• pp.400-402
• /
• 2006

Matrix multiplication is an important problem in linear algebra. its main significance for combinatorial algorithms is its equivalence to a variety of other problems, such as transitive closure and reduction, solving linear systems, and matrix inversion. Thus the development of high-performance matrix multiplication implies faster algorithms for all of these problems. In this paper. we present a quantitative comparison of the theoretical and empirical performance of key matrix multiplication algorithms and use our analysis to develop a faster algorithm. We propose a Hybrid approach on Winograd's and Strassen's algorithms that improves the performance and discuss the performance of the hybrid Winograd-Strassen algorithm. Since Strassen's algorithm is based on a $2{\times}2$ matrix multiplication it makes the implementation very slow for larger matrix because of its recursive nature. Though we cannot get the theoretical threshold value of Strassen's algorithm, so we determine the threshold to optimize the use of Strassen's algorithm in nodes through various experiments and provided a summary shown in a table and graphs.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제21권4호
• /
• pp.597-612
• /
• 2007

For finding the optimal strategy in Blackout game which was introduced in the homepage of popular movie "Beautiful mind", we have developed and generalized a mathematical proof and an algorithm with a couple of softwares. It did require only the concept of basis and knowledge of basic linear algebra. Mathematical modeling and analysis were given for the square matrix case in(Lee,2004) and we now generalize it to a generalized $m{\times}n$ Blackout game. New proof and algorithm will be given with a visualization.

• ETRI Journal
• /
• 제18권3호
• /
• pp.127-145
• /
• 1996

A new analytic framework based on a linear algebra approach is proposed for examining the performance of a direct sequence spread spectrum (DS/SS) slotted ALOHA wireless communication network systems with delay capture. The discrete-time Markov chain model has been introduced to account for the effect of randomized time of arrival (TOA) at the central receiver and determine the evolution of the finite population network performance in a single-hop environment. The proposed linear algebra approach applied to the given Markov problem requires only computing the eigenvector ${\prod}$ of the state transition matrix and then normalizing it to have the sum of its entries equal to 1. MATLAB computation results show that systems employing discrete TOA randomization and delay capture significantly improves throughput-delay performance and the employed analysis approach is quite easily and staightforwardly applicable to the current analysis problem.

• Steel and Composite Structures
• /
• 제12권4호
• /
• pp.303-324
• /
• 2012

This paper presents the mode-shape analysis of the cross-ply laminated composite cylindrical shallow shells. First, the kinematic relations of strains and deformation are given. Then, using Hamilton's principle, governing differential equations are developed for a general curved shell. Finally, the stress-strain relation for the laminated, cross-ply composite shells are obtained. By using some simplifications and assuming Fourier series as a displacement field, the governed differential equations are solved by the matrix algebra for shallow shells. Employing the computer algebra system called MATHEMATICA; a computer program has been prepared for the solution. The results obtained by this solution are compared with the results obtained by (ANSYS and SAP2000) programs, in order to verify the accuracy and reliability of the solution presented.

• Kyungpook Mathematical Journal
• /
• 제63권3호
• /
• pp.345-353
• /
• 2023

Reduced solutions of size 2 and degree n of the Tarry-Escott problem over M₂(ℚ) are determined. As an application, the diophantine equation αAⁿ + βBⁿ = αCⁿ + βDⁿ, where α, β are rational numbers satisfying α + β ≠ 0 and n ∈ {1, 2}, is completely solved for A, B, C, D ∈ M₂(ℚ).

• 한국산업정보학회논문지
• /
• 제16권5호
• /
• pp.9-19
• /
• 2011

In many instances a concise form of logic is often required for building today's complex systems. The method described in this paper can be used for a wide range of industrial applications that requires Boolean type of logic minimization. Unlike some of the previous logic minimization methods, the proposed method can be used to better gain insights into the logic minimization process. Based on the decimal valued matrix, the method described here can be used to find an exact minimized solution for a given Boolean function. It is a visual based method that primarily relies on grouping the cell values within the matrix. At the same time, the method is systematic to the extent that it can also be computerized. Constructing the matrix to visualize a logic minimization problem should be relatively easy for the most part, particularly if the computer-generated graphs are accompanied.

• 대한수학회보
• /
• 제32권2호
• /
• pp.337-342
• /
• 1995

A semiring is a binary system $(S, +, \times)$ such that (S, +) is an Abelian monoid (identity 0), (S,x) is a monoid (identity 1), $\times$ distributes over +, 0 $\times s s \times 0 = 0$ for all s in S, and $1 \neq 0$. Usually S denotes the system and $\times$ is denoted by juxtaposition. If $(S,\times)$ is Abelian, then S is commutative. Thus all rings are semirings. Some examples of semirings which occur in combinatorics are Boolean algebra of subsets of a finite set (with addition being union and multiplication being intersection) and the nonnegative integers (with usual arithmetic). The concepts of matrix theory are defined over a semiring as over a field. Recently a number of authors have studied various problems of semiring matrix theory. In particular, Minc [4] has written an encyclopedic work on nonnegative matrices.

• 대한수학회논문집
• /
• 제35권2호
• /
• pp.533-546
• /
• 2020

Since Sheffer introduced the so-called Sheffer polynomials in 1939, the polynomials have been extensively investigated, applied and classified. In this paper, by using matrix algebra, specifically, some properties of Pascal and Wronskian matrices, we aim to present certain interesting identities involving the 2-variable truncated exponential based Sheffer polynomial sequences. Also, we use the main results to give some interesting identities involving so-called 2-variable truncated exponential based Miller-Lee type polynomials. Further, we remark that a number of different identities involving the above polynomial sequences can be derived by applying the method here to other combined generating functions.

• 대한수학회보
• /
• 제44권4호
• /
• pp.721-729
• /
• 2007

In this paper, we have characterizations of idempotent matrices over general Boolean algebras and chain semirings. As a consequence, we obtain that a fuzzy matrix $A=[a_{i,j}]$ is idempotent if and only if all $a_{i,j}$-patterns of A are idempotent matrices over the binary Boolean algebra $\mathbb{B}_1={0,1}$. Furthermore, it turns out that a binary Boolean matrix is idempotent if and only if it can be represented as a sum of line parts and rectangle parts of the matrix.