• Title/Summary/Keyword: Identity Matrix

Search Result 108, Processing Time 0.024 seconds

ON SIGNLESS LAPLACIAN SPECTRUM OF THE ZERO DIVISOR GRAPHS OF THE RING ℤn

  • Pirzada, S.;Rather, Bilal A.;Shaban, Rezwan Ul;Merajuddin, Merajuddin
    • Korean Journal of Mathematics
    • /
    • v.29 no.1
    • /
    • pp.13-24
    • /
    • 2021
  • For a finite commutative ring R with identity 1 ≠ 0, the zero divisor graph ��(R) is a simple connected graph having vertex set as the set of nonzero zero divisors of R, where two vertices x and y are adjacent if and only if xy = 0. We find the signless Laplacian spectrum of the zero divisor graphs ��(ℤn) for various values of n. Also, we find signless Laplacian spectrum of ��(ℤn) for n = pz, z ≥ 2, in terms of signless Laplacian spectrum of its components and zeros of the characteristic polynomial of an auxiliary matrix. Further, we characterise n for which zero divisor graph ��(ℤn) are signless Laplacian integral.

Highly Efficient and Precise DOA Estimation Algorithm

  • Yang, Xiaobo
    • Journal of Information Processing Systems
    • /
    • v.18 no.3
    • /
    • pp.293-301
    • /
    • 2022
  • Direction of arrival (DOA) estimation of space signals is a basic problem in array signal processing. DOA estimation based on the multiple signal classification (MUSIC) algorithm can theoretically overcome the Rayleigh limit and achieve super resolution. However, owing to its inadequate real-time performance and accuracy in practical engineering applications, its applications are limited. To address this problem, in this study, a DOA estimation algorithm with high parallelism and precision based on an analysis of the characteristics of complex matrix eigenvalue decomposition and the coordinate rotation digital computer (CORDIC) algorithm is proposed. For parallel and single precision, floating-point numbers are used to construct an orthogonal identity matrix. Thus, the efficiency and accuracy of the algorithm are guaranteed. Furthermore, the accuracy and computation of the fixed-point algorithm, double-precision floating-point algorithm, and proposed algorithm are compared. Without increasing complexity, the proposed algorithm can achieve remarkably higher accuracy and efficiency than the fixed-point algorithm and double-precision floating-point calculations, respectively.

Mashhad University, Department of Mathematics;

  • Yassi, M.
    • Bulletin of the Korean Mathematical Society
    • /
    • v.38 no.4
    • /
    • pp.727-733
    • /
    • 2001
  • Let A be a commutative ring with nonzero identity and let M be an A-module. In this note we show that if $x = x_1, ..., x_n\; and\; y = y_1, ..., y_n$ both M-cosequence such that $Hx^T = y^T\; for\; some\; n\times n$ lower triangular matrix H over A, then the map $\beta_H : \;Ann_M(y_1,..., y_n)\;\rightarrow Ann_M(x_1,..., x_n)$ induced by multiplication by |H| is surjective.

  • PDF

ORTHONORMAL BASIS FOR THE BERGMAN SPACE

  • Chung, Young-Bok;Na, Heui-Geong
    • Honam Mathematical Journal
    • /
    • v.36 no.4
    • /
    • pp.777-786
    • /
    • 2014
  • We construct an orthonormal basis for the Bergman space associated to a simply connected domain. We use the or-thonormal basis for the Hardy space consisting of the Szegő kernel and the Riemann mapping function and rewrite their area integrals in terms of arc length integrals using the complex Green's identity. And we make a note about the matrix of a Toeplitz operator with respect to the orthonormal basis constructed in the paper.

A PROOF ON POWER-ARMENDARIZ RINGS

  • Kim, Dong Hwa;Ryu, Sung Ju;Seo, Yeonsook
    • Korean Journal of Mathematics
    • /
    • v.21 no.1
    • /
    • pp.29-34
    • /
    • 2013
  • Power-Armendariz is a unifying concept of Armendariz and commutative. Let R be a ring and I be a proper ideal of R such that R/I is a power-Armendariz ring. Han et al. proved that if I is a reduced ring without identity then R is power-Armendariz. We find another direct proof of this result to see the concrete forms of various kinds of subsets appearing in the process.

PRIME IDEALS OF SUBRINGS OF MATRIX RINGS

  • Chun, Jang-Ho;Park, Jung-Won
    • Communications of the Korean Mathematical Society
    • /
    • v.19 no.2
    • /
    • pp.211-217
    • /
    • 2004
  • In a ring $R_n(K,\;J)$ where K is a commutative ring with identity and J is an ideal of K, all prime ideals of $R_n(K,\;J)$ are of the form either $M_n(P)\;o;R_n(P,\;P\;{\cap}\;J)$. Therefore there is a one to one correspondence between prime ideals of K not containing J and prime ideals of $R_n(K,\;J)$.

STRONG P-CLEANNESS OF TRIVIAL MORITA CONTEXTS

  • Calci, Mete B.;Halicioglu, Sait;Harmanci, Abdullah
    • Communications of the Korean Mathematical Society
    • /
    • v.34 no.4
    • /
    • pp.1069-1078
    • /
    • 2019
  • Let R be a ring with identity and P(R) denote the prime radical of R. An element r of a ring R is called strongly P-clean, if there exists an idempotent e such that $r-e=p{\in}P$(R) with ep = pe. In this paper, we determine necessary and sufficient conditions for an element of a trivial Morita context to be strongly P-clean.

An Approach for a Substitution Matrix Based on Protein Blocks and Physicochemical Properties of Amino Acids through PCA

  • You, Youngki;Jang, Inhwan;Lee, Kyungro;Kim, Heonjoo;Lee, Kwanhee
    • Interdisciplinary Bio Central
    • /
    • v.6 no.4
    • /
    • pp.3.1-3.10
    • /
    • 2014
  • Amino acid substitution matrices are essential tools for protein sequence analysis, homology sequence search in protein databases and multiple sequence alignment. The PAM matrix was the first widely used amino acid substitution matrix. The BLOSUM series then succeeded the PAM matrix. Most substitution matrixes were developed by using the statistical frequency of substitution between each amino acid at blocks representing groups of protein families or related proteins. However, substitution of amino acids is based on the similarity of physiochemical properties of each amino acid. In this study, a new approach was used to obtain major physiochemical properties in multiple sequence alignment. Frequency of amino acid substitution in multiple sequence alignment database and selected attributes of amino acids in physiochemical properties database were merged. This merged data showed the major physiochemical properties through principle components analysis. Using factor analysis, these four principle components were interpreted as flexibility of electronic movement, polarity, negative charge and structural flexibility. Applying these four components, BAPS was constructed and validated for accuracy. When comparing receiver operated characteristic ($ROC_{50}$) values, BAPS scored slightly lower than BLOSUM and PAM. However, when evaluating for accuracy by comparing results from multiple sequence alignment with the structural alignment results of two test data sets with known three-dimensional structure in the homologous structure alignment database, the result of the test for BAPS was comparatively equivalent or better than results for prior matrices including PAM, Gonnet, Identity and Genetic code matrix.

Inversion of Resistivity Tomography Data Using EACB Approach (EACB법에 의한 전기비저항 토모그래피 자료의 역산)

  • Cho In-Ky;Kim Ki-Ju
    • Geophysics and Geophysical Exploration
    • /
    • v.8 no.2
    • /
    • pp.129-136
    • /
    • 2005
  • The damped least-squares inversion has become a most popular method in finding the solution in geophysical problems. Generally, the least-squares inversion is to minimize the object function which consists of data misfits and model constraints. Although both the data misfit and the model constraint take an important part in the least-squares inversion, most of the studies are concentrated on what kind of model constraint is imposed and how to select an optimum regularization parameter. Despite that each datum is recommended to be weighted according to its uncertainty or error in the data acquisition, the uncertainty is usually not available. Thus, the data weighting matrix is inevitably regarded as the identity matrix in the inversion. We present a new inversion scheme, in which the data weighting matrix is automatically obtained from the analysis of the data resolution matrix and its spread function. This approach, named 'extended active constraint balancing (EACB)', assigns a great weighting on the datum having a high resolution and vice versa. We demonstrate that by applying EACB to a two-dimensional resistivity tomography problem, the EACB approach helps to enhance both the resolution and the stability of the inversion process.