非奇异H矩阵的充分条件

1 引言 设A=(a_(ij))∈C~(n,n),R_i(A)=sum from j≠i to(|a_(ij)|,i,j∈N={1,2,…,n}。若|a_(ij)|≥R_i(A),i∈N,则称A为对角占优矩阵,记为A∈D_0;若不等式中每个不等号都是严格的,则称A为严格对角占优矩阵,记为A∈D。若存在正对角矩阵X,使得AX∈D,则称A为广义严格对角占优矩阵,记为A∈D。     

局部双对角占优矩阵的注记

1引言非奇异H矩阵是计算数学、数学物理、控制论等领域中具有广泛应用的重要矩阵类,研究其充分条件自然引起人们的兴趣．文[1]中定义了一类局部双对角占优矩阵,并由此得到了非奇异H矩阵的判别方法．我们指出,文[1]所获充分条件中所给出的四个不等式条件,其中第四个不等式条件可蕴涵其余三个,进而定义了另一类局部双对角占优矩阵,并由此获得了非奇异H矩阵新的判别方法．设A=(a_(ij))∈C~(n×n),R_i(A)=sum from j≠i|a_(ij)|,i∈N={1,2,…,n}．若|a_(ii)|≥R_i(A),(?)i∈N,则称A为对角占优矩阵,记为A∈D_o;若不等式中每个不等号都是严格的,则称A为     

也谈广义对角占优阵的特征值的分布

设A=(a_(ij))_(n×n)为n阶复矩阵,记 σ_i=sum from j=1,j≠i to n(|a_(ij)|,i=l,2,…,n)。若|a_(ij)|>σ_i(i=1,2,…n),则称A为(按行)严格对角占优阵,记为A∈D,若|a_(ii)|·|a_(jj)|>σ_iσ_j(i≠j,i,j=1,2,…,n)则称A为严格对角乘积占优阵,记为A∈D_p(在〔1〕中此类矩阵称为广义对角占优阵,并记为GD)。若存在非奇对角阵Q=diag(q_l,…,q_n)使Q~(-1)AQ∈D,则称A为准严格对角占优阵,记为A∈D′(见〔2〕)。若存在非奇对角阵Q=diag(q_1,…,q_n)使Q~(-1)AQ∈D_p,则称A为准严格对角乘积占优阵。记为A∈D′_p。     

广义对角占优矩阵与M—矩阵的判定准则

广义对角占优矩阵与M—矩阵是计算数学中应用极其广泛的矩阵类。作者在文[1]中证明若A=(α_(ij))∈C~(n×n)为具有非零元素链对角占优阵或A满足:|α_(ii)‖α_(kk)|>Λ_iΛ_k,i,k∈N={1,…,n},则A为广义对角占优矩阵,detA≠0,揭示了文[3],[4]中detA≠0的共同本     

广义严格对角占优阵的判定程序

1 引言和符号 在本文中,均采用下列符号而不再重申.恒用N表示前n个自然数的集合;而用Mn(C)和Mn(R)分别表示所有n阶复矩阵和所有n阶实矩阵的集合. Z_N={A|A=(a_(ij))_(n×n)∈Mn(R),a_(ij)≤0,i,j∈N,i≠j},I恒表示单位矩阵. 如果A∈Mn(R)且A的所有元素都为非负实数,则称A为非负方阵,并记为A≥0;若A的所有元素都为正数,则称A为正矩阵,并记为A>0. 对A=(a_(ij))(n×n)∈Mn(C),令A_i(A)=sum from j=1 j≠i to n (|a_(ij)|(i=1、2…… n)) ;若把A的非零元用1代替 而得到—个n阶(0,1)矩阵。称为A的导出矩阵。记为;而把A的比较矩阵记为 u(A)=(b_(ij))_(n×n))其中b_(ij)=|a_(ij)|,b_(ij)=-|a_(ij)|(i,j∈N i≠j)     

非奇异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-矩阵,其中     

矩阵对角占优性的推广及应用

§1.引言设 A=(a_(ij))_(n×n)为一复矩阵,若有一正向量 d=(d_1,d_2,…,d_n)~T 使得d_i|a_(ij)|≥sum from j≠1 d_j|a_(ij)|,(1)对每一 i∈N={1,2,…,n}都成立,则称 A 为广义对角占优矩阵,记为 A∈D_0~*;如若(1)式中每一不等号都是严格的,则称 A 为广义严格对角占优矩阵,记为 A∈D~*.特别地,当 d=(1,1,…,1)~T 时,A∈D_0~*及 A∈D~*即是通常的对角占优与严格对角占优,分别记作 A∈D_0及 A∈D.利用矩阵的对角占优性质讨论其特征值分布是矩阵论中的重要课题,文献[5]—[10]给出了这方面的重要结果.n 阶实方阵 A 称为 M-矩阵,如果 A具有形式:A=sI-B,s>ρ(B),其中 B 为 n 阶非负方阵,ρ(B)表 B 之谱半径,利用广义严格对角占优的概念,文[1]给出了 M-矩阵的等价表征:若 n 阶实方阵     

广义严格对角占优矩阵的迭代判别方法

正1引言设A=(a_(ij))∈C~(n×n),N={1,2,…,n}.记R_i(A)= sum |a_(ij)| from j≠i (i∈N),又记N_1=N_1(A)={i∈N:0|a_(ii)|≤R_i(A)},N_2=N_2(A)={i∈N:|a_(ii)R_i(A)}.定义1设A=(a_(ij))∈C~(n×n),如果|a_(ii)|R_i(A)(i∈N),则称A为严格对角占优矩阵.严格对角占优矩阵的集合记为D.如果存在n阶正对角矩阵D使得AD∈D,则称A为广义严格对角占优矩阵.广义严格对角占优矩阵的集合记为D.     

非奇异H-矩阵的新判据

1引言与记号设A=(a_(ij))∈C~(n×n),记N={1,2,…,n},∧_i(?)∧_i(A)=sum from j≠i|a_(ij)|,S_i(?)S_i(A)=sum from j≠i|a_(ij)|,(?)i,j∈N。若|a_(ij)>∧_i(A),(?)i∈N,则称A为严格对角占优矩阵。     

共轭对角占优矩阵的特征值分布

<正> 设 A=(a_(rs)_(n×n)为 n 阶复矩阵.记μ_r=sum from s≠r |a_(rs)|,N={1,2,…,n},J(A)={r∈N||a_(rr)>μ_r}.我们引入下述定义:定义1 若对r=1,2,…,n 皆有|a_(rr)|>μ_r,则称 A 为按行严格对角占优矩阵,记为 A∈D.若对 r=1,2,…,n 皆有|a_(rr)|≥μ_r,J(A)非空集,且对任一 k(?)J(A),有a_(ks_1)a_(s_1s_2)…a_(s_m)l≠0,l∈J(A),则称 A 为按行准严格对角占优矩阵,记为 A∈SC.若 A为此二类矩阵之一,则记为 A∈D∪SC.     

实规范矩阵的特征值问题

实对称矩阵的特征值问题,无论是低阶稠密矩阵的全部特征值问题,或高阶稀疏矩阵的部分特征值问题,都已有许多有效的计算方法,迄今最重要的一些成果已总结在[5]中。本文利用规范矩阵的一些重要性质将对于Hermite矩阵(特别是对弥矩阵)特征值问题的一些有效算法推广到规范矩阵的特征值问题,由于对复规范阵的推广是简单的,而且实际上常遇到的是实矩阵(这时常要求只用实运算),因此我们着重讨论实规范矩阵的特征值问题。     

STABLE DOUBLE LR ALGORITHM AND ITS ERROR ANALYSIS

In this paper, the normative matrices and their double LR transformation with origin shifts are defined, and the essential relationship between the double LR transformation of a normative matrix and the QR transformation of the related symmetric tridiagonal matrix is proved. We obtain a stable double LR algorithm for double LR transformation of normative matrices and give the error analysis of our algorithm. The operation number of the stable double LR algorithm for normative matrices is only four sevenths of the rational QR algorithm for reed symmetric tridiagonal matrices.     

Backward Stability Analysis of Weighted Linear Least-Squares Problems

A provably backward stable algorithm for the solution of weighted linear least-squares problems with indefinite diagonal weighted matrices is presented. However, a similar algorithm is not necessarily backward stable, when the weighted matrices are generalized saddle-point matrices. Thus, conditions are derived under which the algorithm is provably backward stable.     

Accurate computations with Said-Ball-Vandermonde matrices

A generalization of the Vandermonde matrices which arise when the power basis is replaced by the Said-Ball basis is considered. When the nodes are inside the interval (0,1), then those matrices are strictly totally positive. An algorithm for computing the bidiagonal decomposition of those Said-Ball-Vandermonde matrices is presented, which allows us to use known algorithms for totally positive matrices represented by their bidiagonal decomposition. The algorithm is shown to be fast and to guarantee high relative accuracy. Some numerical experiments which illustrate the good behaviour of the algorithm are included.     

A modified algorithm for the Perron root of a nonnegative matrix

An algorithm of diagonal transformation for the Perron root of nonnegative matrices is proposed by Duan and Zhang [F. Duan, K. Zhang, An algorithm of diagonal transformation for Perron root of nonnegative irreducible matrices, Appl. Math. Comput. 175 (2006) 762-772]. This method can be used for all nonnegative irreducible matrices. In this paper, an improved algorithm which is based on this method is proposed. The new algorithm inherits all the above-mentioned advantages of the original algorithm and has higher efficiency. It is testified by numerical testing that the efficiency of the new algorithm is improved greatly.     

A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs

In this paper, a viable bandwidth reduction algorithm based on graphs for reducing the bandwidth of sparse symmetric matrices, arising from standard L-structured and Z-structured graphs, is presented. Bandwidth results for these matrices are obtained using this algorithm and compared with that of existing algorithms. This algorithm can easily be applied to these matrices while the bandwidths obtained are as good as those obtained with the existing algorithms.     

Rounding Errors in Solving Block Hessenberg Systems

A rounding error analysis is presented for a divide-and-conquer algorithm to solve linear systems with block Hessenberg matrices. Conditions are derived under which the algorithm computes a stable solution. The algorithm is shown to be stable for block diagonally dominant matrices and for M-matrices.

     

The block conjugate gradient algorithm and related methods

The development of the Lanczos algorithm for finding eigenvalues of large sparse symmetric matrices was followed by that of block forms of the algorithm. In this paper, similar extensions are carried out for a relative of the Lanczos method, the conjugate gradient algorithm. The resulting block algorithms are useful for simultaneously solving multiple linear systems or for solving a single linear system in which the matrix has several separated eigenvalues or is not easily accessed on a computer. We develop a block biconjugate gradient algorithm for general matrices, and develop block conjugate gradient, minimum residual, and minimum error algorithms for symmetric semidefinite matrices. Bounds on the rate of convergence of the block conjugate gradient algorithm are presented, and issues related to computational implementation are discussed. Variants of the block conjugate gradient algorithm applicable to symmetric indefinite matrices are also developed.     

On inverse eigenvalue problems for block Toeplitz matrices with Toeplitz blocks

We propose an algorithm for solving the inverse eigenvalue problem for real symmetric block Toeplitz matrices with symmetric Toeplitz blocks. It is based upon an algorithm which has been used before by others to solve the inverse eigenvalue problem for general real symmetric matrices and also for Toeplitz matrices. First we expose the structure of the eigenvectors of the so-called generalized centrosymmetric matrices. Then we explore the properties of the eigenvectors to derive an efficient algorithm that is able to deliver a matrix with the required structure and spectrum. We have implemented our ideas in a Matlab code. Numerical results produced with this code are included.