• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4645-4664
• /
• 2019

It is significant to construct deterministic measurement matrices with easy hardware implementation, good sensing performance and good cryptographic property for practical compressed sensing (CS) applications. In this paper, a deterministic construction method of bipolar chaotic measurement matrices is presented based on binary sequence family (BSF) and Chebyshev chaotic sequence. The column vectors of these matrices are the sequences of BSF, where 1 is substituted with -1 and 0 is with 1. The proposed matrices, which exploit the pseudo-randomness of Chebyshev sequence, are sensitive to the initial state. The performance of proposed matrices is analyzed from the perspective of coherence. Theoretical analysis and simulation experiments show that the proposed matrices have limited influence on the recovery accuracy in different initial states and they outperform their Gaussian and Bernoulli counterparts in recovery accuracy. The proposed matrices can make the hardware implement easy by means of linear feedback shift register (LFSR) structures and numeric converter, which is conducive to practical CS.

• Journal of Applied and Pure Mathematics
• /
• v.5 no.5_6
• /
• pp.303-313
• /
• 2023

Generalized strictly diagonally dominant matrices have a wide range of applications in matrix theory and practical applications, so it is of great theoretical and practical value to study their numerical determination methods. In this paper, we study the numerical determination of generalized strictly diagonally dominant matrices by using the properties of generalized strictly diagonally dominant matrices. We obtain a new criterion for subdivision iteration determination of the generalized strictly diagonally dominant matrices by subdividing the set of non-prevailing row indices and constructing new iteration factors for the set of predominant row indices, new elements of the positive diagonal factors are derived. Advantages are illustrated by numerical examples.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.169-181
• /
• 2007

Applying the properties of Hadamard core for totally nonnegative matrices, we give new lower bounds of the determinant for Hadamard product about matrices in Hadamard core and totally nonnegative matrices, the results improve Oppenheim inequality for tridiagonal oscillating matrices obtained by T. L. Markham.

• Bulletin of the Korean Mathematical Society
• /
• v.40 no.3
• /
• pp.425-435
• /
• 2003

In this paper, a new kind of matrices, i.e., $level-{\kappa}$ II-circulant matrices is considered. Algorithms for computing minimal polynomial of this kind of matrices are presented by means of the algorithm for the Grobner basis of the ideal in the polynomial ring. Two algorithms for finding the inverses of such matrices are also presented based on the Buchberger's algorithm.

• Journal of applied mathematics & informatics
• /
• v.38 no.1_2
• /
• pp.99-112
• /
• 2020

The study is about the bounds of the spectral norms of r-circulant and geometric circulant matrices with the sequences called biperiodic Jacobsthal numbers. Then we give bounds for the spectral norms of Kronecker and Hadamard products of these r-circulant matrices and geometric circulant matrices. The eigenvalues and determinant of r-circulant matrices with the bi-periodic Jacobsthal numbers are obtained.

• Journal of Ocean Engineering and Technology
• /
• v.6 no.2
• /
• pp.125-132
• /
• 1992

This paper presents an approach for the derivation of frequency-dependent element matrices for vibration analysis of piping systems containing a moving medium. The dynamic stiffness matrix is deduced from transfer matrix, and, in turn, the frequency-dependent element matrices are derived. Numerical examples show that method gives more accurate results than those obtained using the conventional static shape function based element matrices.

• Kyungpook Mathematical Journal
• /
• v.47 no.2
• /
• pp.277-281
• /
• 2007

There are many papers on linear operators that preserve commuting pairs of matrices over fields or semirings. From these research works, we have a motivation to the research on the linear operators that preserve commuting pairs of matrices over nonnegative integers. We characterize the surjective linear operators that preserve commuting pairs of matrices over nonnegative integers.

• Journal of applied mathematics & informatics
• /
• v.28 no.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.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.16 no.3
• /
• pp.181-187
• /
• 2016

In this paper, we examine idempotent intuitionistic fuzzy matrices and idempotent intuitionistic fuzzy matrices of T-type. We develop some properties on both idempotent intuitionistic fuzzy matrices and idempotent intuitionistic fuzzy matrices of T-type. Several theorems are provided and an numerical example is given to illustrate the theorems.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.4
• /
• pp.615-624
• /
• 2014

We study special types of matrices. The involutary fuzzy matrices are important in various applications and have many interesting properties. Using the graphical method, we have the zero patterns of involutary fuzzy matrix, that is, involutary Boolean matrices. And we give the construction of all involutary fuzzy matrices for some dimensions and suggest the canonical form of involutary fuzzy matrix.