On Some Properties of Convex Matrix Sets Characterized by P -Matrices and Block P -Matrices

In this paper, we consider convex sets of real matrices and establish criteria characterizing these sets with respect to certain matrix properties of their elements. In particular, we deal with convex sets of P-matrices, block P-matrices and M-matrices, nonsingular and full rank matrices, as well as stable and Schur stable matrices. Our results are essentially based on the notion of a block P-matrix and extend and generalize some recently published results on this topic.     

Rounding Error Analysis in Solving M-Matrix Linear Systems of Block Hessenberg Form

The problem of solving large M-matrix linear systems with sparse coefficient matrix in block Hessenberg form is here addressed. In previous work of the authors a divide-and-conquer strategy was proposed and a backward error analysis of the resulting algorithm was presented showing its effectiveness for the solution of computational problems of queueing theory and Markov chains. In particular, it was shown that for block Hessenberg M-matrices the algorithm is weakly backward stable in the sense that the computed solution is the exact solution of a nearby linear system, where the norm of the perturbation is proportional to the condition number of the coefficient matrix. In this note a better error estimate is given by showing that for block Hessenberg M-matrices the algorithm is even backward stable.     

Ratios of affine functions

Aratio of affine functions is a function which can be expressed as the ratio of a vector valued affine function and a scalar affine functional. The purpose of this note is to examine properties of sets which are preserved under images and inverse images of such functions. Specifically, we show that images and inverse images of convex sets under such functions are convex sets. Also, images of bounded, convex polytopes under such functions are bounded, convex polytopes. In addition, we provide sufficient conditions under which the extreme points of images of convex sets are images of extreme points of the underlying domains. Of course, this result is useful when one wishes to maximize a convex function over a corresponding set. The above assertions are well known for affine functions. Applications of the results include a problem that concerns the control of stochastic eigenvectors of stochastic matrices.     

A note on sufficient conditions forQ 0 andQ 0 ⋂P 0 matrices

In this note we settle an open problem posed by Al-Khayyal on a condition being sufficient for a matrix to belong to the class ofQ ₀-matrices. The answer is in the affirmative and we further relax the condition and obtain a sufficient condition forQ ₀-matrices. The results yield a class of matrices for which the linear complementarity problems can be solved as simple linear programs.     

逆N_0-矩阵Perron余的相关结果

1989年Meyer为计算马尔可夫链的平稳分布向量构造了一个算法,首次提出非负不可约矩阵Perron余的概念.将非负不可约矩阵Perron余的概念推广到逆N_0-矩阵的Perron余,并给出关于N_0-矩阵和逆N_0-矩阵的相关不等式.     

The α-scalar diagonal stability of block matrices

We generalize two results: Kraaijevanger’s 1991 characterization of diagonal stability via Hadamard products and the block matrix version of the closure of the positive definite matrices under Hadamard multiplication. We restate our generalizations in terms of P^α-matrices and α-scalar diagonally stable matrices.     

Convex sets of nonsingular and P:-Matrices

We show that the set r(A,B) (resp. c(A,B) of square matrices whose rows (resp. columns) are the independent convex combinations of the rows (resp.columns) of real matrices A and B consists entirely of nonsingular matrices if and only if BA^-1(resp. B^-1A) is a P-matrix. This imrpoves a theorem on P-Matrices proven in [2] and [3], in the context of interval nonsingularity. We also show that every real P-matrix admits a representation BA^-1 with the above property. These reseults are only partially true for complex P-matrices. Based on them we obtain a characterizaiton of complex P-matrices in terms of block partitions.     

Practical criteria for H-matrices

In this paper, a set of criteria of nonsingular H-matrices are discussed. The paper introduces the concept of α-bidiagonally dominant matrices and gives an equivalent condition of strictly α-bidiagonally dominant matrices. According to the given condition, some new practical criteria of nonsingular H-matrices are obtained. Finally, some numerical examples are given.     

Some rationally looking faces of Ω n having irrational minimum permanents

Let Ω _n denote the convex polytope consisting of all n × n doubly stochasiic matrices. We determine the minimum permanents which may or may not be rational and the permanent-minimizing matrices over some rationally looking faces of Ω _n We also discuss the barycentricity of the (0, l)-matrices with which we consider the permanent-minimization problem.     

New subclasses of block H-matrices with applications to parallel decomposition-type relaxation methods

The parallel decomposition-type relaxation methods for solving large sparse systems of linear equations on SIMD multiprocessor systems have been proposed in [3] and [2]. In case when the coefficient matrix of the linear system is a block -matrix, sufficient conditions for the convergence of methods given in [2], [3] have been further improved in [5] and [4]. From the practical point of view, the convergence area obtained there is not always suitable for computation, so we propose new, easily computable ones, for some special subclasses of block -matrices. Furthermore, this approach improves the already known convergence area for the class of block strictly diagonally dominant (SDD) matrices.     

Characterizations of inverse M-matrices with special zero patterns

In this paper, we provide some characterizations of inverse M-matrices with special zero patterns. In particular, we give necessary and sufficient conditions for k-diagonal matrices and symmetric k-diagonal matrices to be inverse M-matrices. In addition, results for triadic matrices, tridiagonal matrices and symmetric 5-diagonal matrices are presented as corollaries.     

Diagonally compensated reduction and related preconditioning methods

When solving linear algebraic equations with large and sparse coefficient matrices, arising, for instance, from the discretization of partial differential equations, it is quite common to use preconditioning to accelerate the convergence of a basic iterative scheme. Incomplete factorizations and sparse approximate inverses can provide efficient preconditioning methods but their existence and convergence theory is based mostly on M-matrices (H-matrices). In some application areas, however, the arising coefficient matrices are not H-matrices. This is the case, for instance, when higher-order finite element approximations are used, which is typical for structural mechanics problems. We show that modification of a symmetric, positive definite matrix by reduction of positive offdiagonal entries and diagonal compensation of them leads to an M-matrix. This diagonally compensated reduction can take place in the whole matrix or only at the current pivot block in a recursive incomplete factorization method. Applications for constructing preconditioning matrices for finite element matrices are described.     

Existence and uniqueness of solutions for the generalized linear complementarity problem

Cottle and Dantzig (Ref. 1) showed that the generalized linear complementarity problem has a solution for anyqR ^m ifM is a vertical blockP-matrix of type (m ₁,...,m _n ). They also extended known characterizations of squareP-matrices to vertical blockP-matrices.Here we show, using a technique similar to Murty's (Ref. 2), that there exists a unique solution for anyqR ^m if and only ifM is a vertical blockP-matrix of type (m ₁,...,m _n ). To obtain this characterization, we employ a generalization of Tucker's theorem (Ref. 3) and a generalization of a theorem initially introduced by Gale and Nikaido (Ref. 4).     

A note onQ-matrices

This paper concerns three classes of matrices that are relevant to the linear complementarity problem. We prove that within the class ofP ₀-matrices, theQ-matrices are precisely the regular matrices.Research supported by Department of Energy, Contract EY-76-S-03-0326 PA # 18.     

Q-matrices and boundedness of solutions to linear complementarity problems

This paper is concerned with the existence and boundedness of the solutions to the linear complementarity problemw=Mz+q,w0,z0,w ^T z=0, for eachq ⁿ . It has been previously established that, ifM is copositive plus, then the solution set is nonempty and bounded for eachq ⁿ iffM is aQ-matrix. This result is shown to be valid also forL ₂-matrices,P ₀-matrices, nonnegative matrices, andZ-matrices.     

Monotone positive stable matrices

The class of real matrices which are both monotone (inverse positive) and positive stable is investigated. Such matrices, called N-matrices, have the well-known class of nonsingular M-matrices as a proper subset. Relationships between the classes of N-matrices, M-matrices, nonsingular totally nonnegative matrices, and oscillatory matrices are developed. Conditions are given for some classes of matrices, including tridiagonal and some Toeplitz matrices, to be N-matrices.     

A topological approach to divisibility of arithmetical functions and GCD matrices

Considering lower closed sets as closed sets on a preposet (P, ≤), we obtain an Alexandroff topology on P. Then order preserving functions are continuous functions. In this article we investigate order preserving properties (and thus continuity properties) of integer-valued arithmetical functions under the usual divisibility relation of integers and power GCD matrices under the divisibility relation of integer matrices.     

On the Separation and Order Law of Cancellation for Bounded Sets

In this paper we introduce the separation law for convex sets. Moreover, we prove that for a locally convex topological vector space the order cancellation law and separation law are equivalent.     

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

本文研究了非奇异H-矩阵的数值判定问题.利用不等式的放缩方法,获得了一类判别非奇异H-矩阵的新判据,推广了相关已有结果,并通过数值实例说明了本文结果判断范围的更广泛性.     

Incomplete blockwise factorizations of (block) H-matrices

The use of incomplete blockwise factorizations as preconditioners in conjugate gradient like methods has become more and more popular in recent years. Most of the theory concerning existence and applicability of these factorizations has been limited to M-matrices so far. Here we introduce a more general definition of block H-matrices (Robert [8]) and we extend the theory to this class of matrices.