A direct algorithm is proposed by which one can distinguish whether a matrix is an M-matrix (or H-matrix) or not quickly and effectively. Numerical examples show that it is effective and convincible to distinguish M-m...A direct algorithm is proposed by which one can distinguish whether a matrix is an M-matrix (or H-matrix) or not quickly and effectively. Numerical examples show that it is effective and convincible to distinguish M-matrix (or H-matrix) by using the algorithm.展开更多
Computing the eigenvalue of smallest modulus and its corresponding eigneveclor of an irreducible nonsingular M-matrix A is considered, It is shown that if the entries of A are known with high relative accuracy, its ei...Computing the eigenvalue of smallest modulus and its corresponding eigneveclor of an irreducible nonsingular M-matrix A is considered, It is shown that if the entries of A are known with high relative accuracy, its eigenvalue of smallest modulus and each component of the corresponding eigenvector will be determined to much higher accuracy than the standard perturbation theory suggests. An algorithm is presented to compute them with a small componentwise backward error, which is consistent with the perturbation results.展开更多
An effective numerical algorithm for computing the determinant of a pentadiagonal Toeplitz matrix has been proposed by Xiao-Guang Lv and others [1]. The complexity of the algorithm is (9n + 3). In this paper, a new al...An effective numerical algorithm for computing the determinant of a pentadiagonal Toeplitz matrix has been proposed by Xiao-Guang Lv and others [1]. The complexity of the algorithm is (9n + 3). In this paper, a new algorithm with the cost of (4n + 6) is presented to compute the determinant of a pentadiagonal Toeplitz matrix. The inverse of a pentadiagonal Toeplitz matrix is also considered.展开更多
From the concept of α diagonally dominant matrix, two sufficient conditions of nonsingular H-matrices were obtained in this paper. An example was given to show that these results improve the known results.
We construct one multi-sender authentication code by algebraic combination method from eigenvalues and eigenvectors of the matrix over nite elds. Some parameters and the probabilities of three kinds of successful atta...We construct one multi-sender authentication code by algebraic combination method from eigenvalues and eigenvectors of the matrix over nite elds. Some parameters and the probabilities of three kinds of successful attack of this code are also computed. For multi-sender authentication code,it allows a group of senders to construct an authenticated message for a receiver such that the receiver can verify authenticity of the received message.展开更多
非奇 H 矩阵在计算数学和矩阵理论的研究中非常重要,本文对该类矩阵给出了一个简捷判别条 件,根据这一判别条件,在一定条件下非奇 H 矩阵某些行的非对角元的模和可以任意大。另外 非奇 H 矩阵的较为实用的必要条件较少,本文...非奇 H 矩阵在计算数学和矩阵理论的研究中非常重要,本文对该类矩阵给出了一个简捷判别条 件,根据这一判别条件,在一定条件下非奇 H 矩阵某些行的非对角元的模和可以任意大。另外 非奇 H 矩阵的较为实用的必要条件较少,本文给出了一个非奇 H 矩阵的较为实用的必要条件。展开更多
基金Foundation item: This work is supported by the Science Foundations of the Education Department of Yunnan Province (03Z169A)the Science Foundatons of Yunnan University (2003Z013B).
文摘A direct algorithm is proposed by which one can distinguish whether a matrix is an M-matrix (or H-matrix) or not quickly and effectively. Numerical examples show that it is effective and convincible to distinguish M-matrix (or H-matrix) by using the algorithm.
文摘Computing the eigenvalue of smallest modulus and its corresponding eigneveclor of an irreducible nonsingular M-matrix A is considered, It is shown that if the entries of A are known with high relative accuracy, its eigenvalue of smallest modulus and each component of the corresponding eigenvector will be determined to much higher accuracy than the standard perturbation theory suggests. An algorithm is presented to compute them with a small componentwise backward error, which is consistent with the perturbation results.
文摘An effective numerical algorithm for computing the determinant of a pentadiagonal Toeplitz matrix has been proposed by Xiao-Guang Lv and others [1]. The complexity of the algorithm is (9n + 3). In this paper, a new algorithm with the cost of (4n + 6) is presented to compute the determinant of a pentadiagonal Toeplitz matrix. The inverse of a pentadiagonal Toeplitz matrix is also considered.
文摘From the concept of α diagonally dominant matrix, two sufficient conditions of nonsingular H-matrices were obtained in this paper. An example was given to show that these results improve the known results.
基金Sponsored by the National Natural Science Foundation of China(Grant No.61179026)the Fundamental Research of the Central Universities of China Civil Aviation University of Science Special(Grant No.3122016L005)
文摘We construct one multi-sender authentication code by algebraic combination method from eigenvalues and eigenvectors of the matrix over nite elds. Some parameters and the probabilities of three kinds of successful attack of this code are also computed. For multi-sender authentication code,it allows a group of senders to construct an authenticated message for a receiver such that the receiver can verify authenticity of the received message.
