A CONJECTURE CONCERNING THE HADAMARD PRODUCT OF INVERSE M-MATRICES

1 IntroductionFor an n×n matrix A which is an inverse M-matrix,M.Neumann in [1]conjecturedthat the Hadamard product A·A is an inverse of an M-matrix.They have checked hisconjecture without failure on Ultrametric matrices and inverse of MMA-matrices,Uni-pathicmatrices and the Willongby inverse M-matrices.Bo-Ying Wang et al.in[2]haveinvestigated Triangular inverse M-matrices which are closed under the Hadamard multipli-cation.Lu Linzheng,Sun Weiwei and Li Wen in[3]presented a more general conjecture     

STRUCTURES OF CIRCULANT INVERSE M-MATRICES

In this paper, we present a useful result on the structures of circulant inverse Mmatrices. It is shown that if the n × n nonnegative circulant matrix A = Circ[c0, c1,… , c（n- 1）] is not a positive matrix and not equal to c0I, then A is an inverse M-matrix if and only if there exists a positive integer k, which is a proper factor of n, such that cjk 〉 0 for j=0,1…, [n-k/k], the other ci are zero and Circ[co, ck,… , c（n-k）] is an inverse M-matrix. The result is then extended to the so-called generalized circulant inverse M-matrices.     

NEWTON-REGULARIZED METHOD BASED ON A BASIC FUNCTION FOR SOLVING THE INVERSE PROBLEM OF CONVECTION-DIFFUSION EQUATIONS

In this paper, a new iteration algorithm to solve the coefficient inverse problem is described by using a "basic function" which is specially defined and the idea of regularization. The method is simple and clear.The main advantage of the algorithm is that its computing cost is less than other current algorithms, such as PST and Purlerbalion Methods. Since it has uniform scheme, on the other hand, the method can be easily exleded to other kinds of inverse problems of different leal equations, multidimensional inverse problem and multiparameler inverse problems, etc.     

Finding the Maximal Eigenpair for a Large,Dense,Symmetric Matrix based on Mufa Chen's Algorithm

A hybrid method is presented for determining maximal eigenvalue and its eigenvector(called eigenpair)of a large,dense,symmetric matrix.Many problems require finding only a small part of the eigenpairs,and some require only the maximal one.In a series of papers,efficient algorithms have been developed by Mufa Chen for computing the maximal eigenpairs of tridiagonal matrices with positive off-diagonal elements.The key idea is to explicitly construet effective initial guess of the maximal eigenpair and then to employ a self-closed iterative algorithm.In this paper we will extend Mufa Chen's algorithm to find maximal eigenpair for a large scale,dense,symmetric matrix.Our strategy is to first convert the underlying matrix into the tridiagonal form by using similarity transformations.We then handle the cases that prevent us from applying Chen's algorithm directly,e.g.,the cases with zero or negative super-or sub-diagonal elements.Serval numerical experiments are carried out to demonstrate the efficiency of the proposed hybrid method.     

INVERSE COEFFICIENT PROBLEMS FOR PARABOLIC HEMIVARIATIONAL INEQUALITIES

This paper is devoted to the class of inverse problems for a nonlinear parabolic hemivariational inequality. The unknown coefficient of the operator depends on the gradient of the solution and belongs to a set of admissible coefficients. It is proved that the convergence of solutions for the corresponding direct problems continuously depends on the coefficient convergence. Based on this result the existence of a quasisolution of the inverse problem is obtained.     

A NEW ALGORITHM FOR COMPUTING THE INVERSE AND GENERALIZED INVERSE OF THE SCALED FACTOR CIRCULANT MATRIX

A new algorithm for finding the inverse of a nonsingular scaled factor circulant matrix is presented by the Euclid＇s algorithm. Extension is made to compute the group inverse and the Moore-Penrose inverse of the singular scaled factor circulant matrix. Numerical examples are presented to demonstrate the implementation of the proposed algorithm.     

Inverse coefficient problems for nonlinear parabolic differential equations

This paper is devoted to a class of inverse problems for a nonlinear parabolic differential equation. The unknown coefficient of the equation depends on the gradient of the solution and belongs to a set of admissible coefficients. It is proved that the convergence of solutions for the corresponding direct problems continuously depends on the coefficient convergence. Based on this result the existence of a quasisolution of the inverse problem is obtained in the appropriate class of admissible coefficients.     

关于Drazin逆的刻划

Let ■ be a pre-additive category. Assume that ψ:X→X is a morphism of (?). In this paper, we give the necessary and sufficient conditions for ψ to have the Drazin inverse by using the von Neumann regular inverse for the ψk, and extend a result by Puystjens and Hartwig from the group inverse to Drazin inverse.     

ANALYSIS OF TWO-DIMENSIONAL ELECTROMAGNETIC SCATTERING BY A PERFECTLY CONDUCTING OBSTACLE IN A HOMOGENEOUS CHIRAL ENVIRONMENT

The time-harmonic electromagnetic plane waves incident on a perfectly conducting obstacle in a homogeneous chiral environment are considered.A two-dimensional direct scat- tering model is established and the existence and uniqueness of solutions to the problem are discussed by an integral equation approach.The inverse scattering problem to find the shape of scatterer with the given far-field data is formulated.Result on the uniqueness of the inverse problem is proved.     

Application of Moore-Penrose inverse in deciding the minimal martingale measure

The Moore-Penrose inverse is an important tool in algebra.This paper shows that the MoorePenrose inverse is also an effcient technique in determining the minimal martingale measure if a security price follows a semi-martingale which satisfies some structure condition.We extend a result of Dzhaparidze and Spreij concerning the Moore-Penrose inverse to the case that the Moore-Penrose inverse of any matrix-valued predictable process is still predictable.Furthermore,we obtain an explicit formula of the minimal martingale measure by employing the Moore-Penrose inverse.Specifically,the minimal martingale measure in a generalized Black-Scholes model is found.     

三对角逆M矩阵的判定

1、引言 三对角逆M矩阵是指同时为三对角矩阵和逆M矩阵的一类特殊矩阵．文用图论方法探讨三对角逆M矩阵结构,给出了三对角矩阵为逆M矩阵的充分必要条件．此条件提供了判定三对角矩阵是逆M矩阵的方法,但较复杂．文讨论了这类矩阵在Hadamard积下的封闭性．由于三对角逆M矩阵在理论和应用上都有一定价值,所以,寻求一种简单而实用的判定方法是必要的．本文通过对这类矩阵结构特点的研究找到了这样一种方法．同时,由此证明了这类矩阵在Hadamard积下的封闭性．     

On functions that preserve M-matrices and inverse M-matrices

In earlier works, authors such as Varga, Micchelli and Willoughby, Ando, and Fiedler and Schneider have studied and characterized functions which preserve the M-matrices or some subclasses of the M-matrices, such as the Stieltjes matrices. Here we characterize functions which either preserve the inverse M-matrices or map the inverse M-matrices to the M-matrices. In one of our results we employ the theory of Pick functions to show that if A and B are inverse M-matrices such that B ^?1 ≤ A ^?1, then (B+tI)?1 ≤ (A+tI)?1, for all t?≥?0.     

ON OPPENHEIM'S INEQUALITY

We prove several inequalies for symmetric postive sermidefinite, general M-matrices and inverse M-matrices which are generalization of the classical Oppenheim's Inequality for symmetric positive semidefinite matrices.     

周期三对角矩阵逆的一种新算法

给出了一类周期三对角矩阵逆的新的递归算法.新方法充分利用周期三对角矩阵的结构特点,采用递归方法将高阶周期三对角矩阵求逆转化为低阶周期三对角矩阵的求逆.并同时得到简化的计算方法,方法可以有效地减少运算量和存储量,计算精度也有明显的优势.数值实验表明此算法是有效的.     

Estimates for the inverse elements of tridiagonal matrices

In this work, new upper and lower bounds for the inverse entries of the tridiagonal matrices are presented. The bounds improve the bounds in D. Kershaw [Inequalities on the elements of the inverse of a certain tridiagonal matrix, Math. Comput. 24 (1970) 155–158], P.N. Shivakumar, C.X. Ji [Upper and lower bounds for inverse elements of finite and infinite tridiagonal matrices, Linear Algebr. Appl. 247 (1996) 297–316], R. Nabben [Two-sided bounds on the inverse of diagonally dominant tridiagonal matrices, Linear Algebr. Appl. 287 (1999) 289–305] and R. Peluso, T. Politi [Some improvements for two-sided bounds on the inverse of diagonally dominant tridiagonal matrices, Linear. Algebr. Appl. 330 (2001) 1–14].     

On the powers and the inverse of a tridiagonal matrix

In this paper, we present an eigendecomposition of a tridiagonal matrix. Tridiagonal matrix powers and inverse are derived. As consequence, we get some relations verified by the coefficients of the inverse and the powers of a tridiagonal matrix.     

几种矩阵逆的连续性

非奇异矩阵的逆是矩阵元素的连续函数．学者们也对矩阵广义逆的连续性有所研究．本文应用矩阵分裂和两个矩阵之和的逆的展开式,给出了一般非奇异矩阵,M-矩阵和H-矩阵的逆的连续性．当一些合理的条件满足时,这几种矩阵的逆是连续的．     

Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations

New methods for computing eigenvectors of symmetric block tridiagonal matrices based on twisted block factorizations are explored. The relation of the block where two twisted factorizations meet to an eigenvector of the block tridiagonal matrix is reviewed. Based on this, several new algorithmic strategies for computing the eigenvector efficiently are motivated and designed. The underlying idea is to determine a good starting vector for an inverse iteration process from the twisted block factorizations such that a good eigenvector approximation can be computed with a single step of inverse iteration.     

The Hadamard Product of Circulant Matrices on Three Symbols that are Inverses of M-Matrices

It is shown that the class of all n × n inverse M-matrices A for which both A and A -1 are circulant matrices on three symbols is closed under Hadamard products.     

On computing of block ILU preconditioner for block tridiagonal systems

We present the recurrence formulas for computing the approximate inverse factors of tridiagonal and pentadiagonal matrices using bordering technique. Resulting algorithms are used to approximate the inverse of pivot blocks needed for constructing block ILU preconditioners for solving the block tridiagonal linear systems, arising from discretization of partial differential equations. Resulting preconditioners are suitable for parallel implementation. Comparison with other methods are also included.