非奇H-矩阵的实用判别准则

非奇H-矩阵在科学和工程实际中有着广泛地应用,但在实际中判定一个矩阵是否为非奇H-矩阵是比较困难的.通过构造不同的正对角阵,结合不等式的放缩技巧,给出了一些比较实用的新条件,改进和推广了现有的一些结论,并给出相应的一些数值算例来说明结果的有效性.     

非奇异H-矩阵一类新的实用性判据

1引言在计算数学、数学物理、控制论与矩阵论中,非奇异H-矩阵是有着重要应用的一类特殊矩阵,有关其数值判定也一直是矩阵计算的重要课题,不少学者对此进行了研究,得到了许多结果,如文[1]-[10]都给出一些比较实用的判别方法．本文另提出了一些新的实用性判别,进一步改进了文[1]的主要结果．用Cn×n表示n阶复矩阵集,设A=(aij)∈Cn×n,记,若|aii|≥Λi(i=1,2,…,n)(本文用Λi表示Λi(A)),则称A为对角占优矩阵;如果每个不等号都为严格成立,则称A为严格对角占优矩阵,记A∈D;若存在正对角阵X,使得AX为严格对角占优矩阵,则称A为广义严格对角占优阵,记A∈D．设A∈Zn×n={(aij)∈Cn×n|aij≤0,i≠j;i,j∈N},若A=sI-B,s>ρ(B),其中B为非负方阵,ρ(B)表示B的谱半径,则称A为非奇异M-矩阵．若A∈Cn×n的比较矩阵M(A)=(mij)为非奇异M-矩阵,则称A为非奇异H-矩阵,其中     

非奇H-矩阵的实用性新判定

给出了非奇H矩阵几个新的实用性判据,改进了近期的一些结果,并给出相应数值例子来说明结果的有效性.     

New criteria for identifying H-matrices

In the recent paper of Gan and Huang (Linear Algebra Appl. 374 (2003) 317), several simple criteria, as well as a necessary condition for nonsingular H-matrices, have been obtained. Inspired by this work, we will define several new subclasses of nonsingular H-matrices and give necessary conditions for a matrix to be an H-matrix. Finally, as a result of numerical experiments, we establish relations between defined and some already known subclasses.     

一类非奇异H-矩阵判定的新条件

非奇异H-矩阵是在许多领域具有广泛应用的重要矩阵类,但实际判定一个非奇异H-矩阵是十分困难的.在本文中,我们给出了一类关于非奇异H-矩阵新的判定条件,改进了近期的相关结果,并用数值例子说明了文中结果判定范围的更广泛性.     

基于严格α-双链对角占优矩阵的非奇H-矩阵的判定准则

研究了非奇H-矩阵的判定问题.先给出了几个判定严格α-双链对角占优矩阵的充要条件,进一步利用矩阵对角占优理论得到了判定非奇H-矩阵的一些充分条件,推广和改进了已有的相关结果,并用数值算例说明了这些判定方法的有效性.     

非奇H矩阵的充分条件

文章通过引进一类具有非零元素链的矩阵,利用α对角占优矩阵性质,给出了一个新的非奇H矩阵的充分条件,扩大了非奇H矩阵的判定范围．     

广义H-矩阵的一组充分条件

利用矩阵的连续过渡、子矩阵的谱半径估计等方法,研究了正定条件下的广义H-矩阵的判别法．给出了判定正定条件下广义H-矩阵的几个充分条件,当块矩阵退化为点矩阵时,这些条件即为非奇异H-矩阵的充分条件．     

On the stability of the incomplete LU-factorizations and characterizations of H-matrices

Summary. Meijerink and van der Vorst [8] have shown that the incomplete LU-factorizations are numerically stable for M-matrices. Varga, Saff and Mehrmann [16] gave some characterizations of the H-matrices by using the incomplete LU-factorizations of them. The purpose of this paper is to show that the incomplete LU-factorizations of an H-matrix are at least as stable as the complete LU-factorizations of its comparison matrix. We give also some new characterizations of the H-matrices in connection with their incomplete LU-factorizations. Received November 12, 1993 / Revised version received May 27, 1994     

Estimating the spectral radius of a real matrix by discrete Lyapunov equation

For any real matrix A, this paper is concerned with the estimation of the spectral radius of A. The relationship between the weighted norm and the discrete Lyapunov equation of the matrix A is obtained. On the basis of the relationship, an iterative algorithm is presented to obtain the spectral radius of A and to estimate the solution of the corresponding linear discrete system. Several numerical examples are given to show that the iterative algorithm is effective.     

Construction of full H-matrices with the given eigenvalues based on the Givens matrices

The inverse eigenvalue problem is about how to construct a desired matrix whose spectrum is the given number set. In this paper, in view of the Givens matrices, we prove that there exist three classes of full H-matrices which include strictly diagonally dominant full matrix, $\alpha$-strictly diagonally dominant full matrix and $\alpha$-double strictly diagonally dominant full matrix, and their spectrum are all the given number set. In addition, we design some numerical algorithms to explain how to construct the above-mentioned full H-matrices.     

线性互补问题的并行多分裂松弛迭代算法

运用矩阵多重分裂理论,同时考虑并行计算与松弛迭代法,得到一类求解线性互补问题的高效数值算法．当问题的系数矩阵为对角元为正的H-矩阵或对称半正定矩阵时,证明了算法的全局收敛性；该算法与已有算法相比,具有计算量小、计算速度快等特点,因而特别适于求解大规模问题．数值试验的结果说明了算法的有效性．     

非奇H-矩阵的充要条件

推广了"非奇H-矩阵的条件"一文中的主要结果,得到一类特殊矩阵为非奇H-矩阵的充分必要条件.     

非奇H-矩阵的充分条件

非奇H矩阵是具有广泛实际背景的重要矩阵类,但实际判断一个矩阵是否为非奇H矩阵却是困难的.该文给出非奇H矩阵的两个实用且适用范围较广的充分条件. 数值例子说明了结果的优越性.     

Pivoting strategy for rank-one modification ofLDM t-like factorization

The rank-one modification algorithm of theLDM ^t factorization was given by Bennett [1]. His method, however, could break down even when the matrix is nonsingular and well-conditioned. We introduce a pivoting strategy for avoiding possible break-down as well as for suppressing error growth in the modification process. The method is based on a symbolic formula of the rank-one modification of the factorization of a possibly singular nonsymmetric matrix. A new symbolic formula is also obtained for the inverses of the factor matrices. Repeated application of our method produces theLDM ^t-like product form factorization of a matrix. A numerical example is given to illustrate our pivoting method. An incomplete factorization algorithm is also introduced for updating positive definite matrix useful in quasi-Newton methods, in which the Fletcher and Powell algorithm [2] and the Gill, Murray and Saunders algorithm [4] are usually used.This paper is presented at the Japan SIAM Annual Meeting held at University of Tokyo, Japan, October 7–9, 1991.     

A DIRECT ALGORITHM FOR DISTINGUISHING NONSINGULAR M-MATRIX AND H-MATRIX

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.     

关于H-矩阵的实用判定的注记

本文指出《H-矩阵的实用判定》一文的主要结果中的许多条件是多余的,我们用比较简捷的方法改进了该文的结果,并给出了一些新的H-矩阵的判定方法．     

On a class of matrices which arise in the numerical solution of Euler equations

Summary We study block matricesA=[A_ij], where every blockA _ij ^k,k is Hermitian andA _ii is positive definite. We call such a matrix a generalized H-matrix if its block comparison matrix is a generalized M-matrix. These matrices arise in the numerical solution of Euler equations in fluid flow computations and in the study of invariant tori of dynamical systems. We discuss properties of these matrices and we give some equivalent conditions for a matrix to be a generalized H-matrix.Research supported by the Graduiertenkolleg mathematik der Universität Bielefeld     

H-矩阵的实用判定

H-矩阵在许多领域中都发挥着重要作用，但在实用中要判别H-矩阵却是很困难的．本文中，我们获得了H-矩阵判别的新的实用充分条件，所得结果包含了[1]的一个主要结果，并用例子说明了文中结果的有效性.     

Convergence analysis of the parallel multisplitting TOR method

In this paper, we propose the parallel multisplitting TOR method, for solving a large nonsingular systems of linear equations Ax = b. These new methods are a generalization and an improvement of the relaxed parallel multisplitting method (Formmer and Mager, 1989) and parallel multisplitting AOR Algorithm (Wang Deren, 1991). The convergence theorem of this new algorithm is established under the condition that the coefficient matrix A of linear systems is an H-matrix. Some results also yield new convergence theorem for TOR method.