the matrix functions appear in several applications in engineering and sciences. the computation of these functions almost involved complicated theory. thus, improving the concept theoretically seems unavoidable to obtain some new relations and algorithms for evaluating these functions. the aim of this paper is proposing some new reciprocal for the function of block anti diagonal matrices. more...

The problem of the optimal assignment of facilities to locaticns has been solved by J. W. Gavett and Normann V. PlyterD• In their paper the branch and bound technique2) is used and for this purpose the distance matrix is transformed into the matrix whose diagonal compoents are zero. The purpose of this paper is to avoid such a transformation and the store of the distance matrix into the computer.

This paper surveys several common models which can be used to represent and study design procedures. A matrix representation of design is discussed in detail and both new and existing analysis tools are presented. Enhanced models are proposed to incorporate more information into the matrix representation and to allow more sophisticated analysis to be performed. The paper describes a testbed for...

given four complex matrices a, b, c and d where a 2 cnn and d 2 cmm andlet the matrix(a bc d)be a normal matrix and assume that  is a given complex number that is not eigenvalue of matrix a. we present a method to calculate the distance norm (with respect to 2-norm) from d to the set of matrices x 2 cmm such that,  be a multiple eigenvalue of matrix(a bc x). we also nd the nearest matrix ...

The conjugacy classes of the involutive automorphisms of the affine Kac-Moody algebras C (1) ℓ for ℓ ≥ 2 are determined using the matrix formulation of automorphisms of an affine Kac-Moody

We show that a certain representation of the matrix-product can be computed with n multiplications. We also show, that siumilar representations of matrices can be compressed enormously.

We present decay bounds for a broad class of Hermitian matrix functions where the matrix argument is banded or a Kronecker sum of banded matrices. Besides being significantly tighter than previous estimates, the new bounds closely capture the actual (non-monotonic) decay behavior of the entries of functions of matrices with Kronecker sum structure. We also discuss extensions to more general spa...

We consider two-dimensional partitioning of general sparse matrices for parallel sparse matrix-vector multiply operation. We present three hypergraph-partitioning based methods, each having unique advantages. The first one treats the nonzeros of the matrix individually and hence produces fine-grain partitions. The other two produce coarser partitions, where one of them imposes a limit on the nu...

Sparse storage formats are techniques for storing and processing the sparse matrix data efficiently. The performance of these storage formats depend upon the distribution of non-zeros, within the matrix in different dimensions. In order to have better results we need a technique that suits best the organization of data in a particular matrix. So the decision of selecting a better technique is t...

We present decay bounds for a broad class of Hermitian matrix functions where the matrix argument is banded or a Kronecker sum of banded matrices. Besides being significantly tighter than previous estimates, the new bounds closely capture the actual (non-monotonic) decay behavior of the entries of functions of matrices with Kronecker sum structure. We also discuss extensions to more general spa...