In this paper, we compute H?-norm of a transfer matrix, via bisection algorithm. The algorithm is given and applied some problems. problems are choosen from various areas control theory such as aircraft models decentralized interconnected systems.

In this article, some new results on $M$-matrices, $H$-matrices and their inverse classes are proved. Specifically, we study when a singular $Z$-matrix is an $M$-matrix, convex combinations of $H$-matrices, almost monotone Cholesky factorizations $H$-matrices.

We define a matrix concept we call factor width. This gives a hierarchy of matrix classes for symmetric positive semidefinite matrices, or a set of nested cones. We prove that the set of symmetric matrices with factor width at most two is exactly the class of (possibly singular) symmetric H-matrices (also known as generalized diagonally dominant matrices) with positive diagonals, H+. We prove b...

2 Sparse Matrices ……………………………………………………………………………… 4 2.1 The direct solution of sparse unsymmetric linear sets of equations (I.S. Duff and J.K. Reid) …………………………………………………………………………… 4 2.2 The design and use of algorithms for permuting large entries to the diagonal 2.6 Element resequencing for use with a multiple front solver (J. A. Scott) ………… 10 2.7 Exploiting zeros on the diagonal in the direct s...

In many applications, e.g. digital signal processing, discrete inverse scattering, linear prediction etc., Toeplitz-plus-Hankel (T + H) matrices need to be inverted. (For further applications see [1] and references therein). Firstly the T +H matrix inversion problem has been solved in [2] where it was reduced to the inversion problem of the block Toeplitz matrix (the so-called mosaic matrix). T...

   To fabricate a defect free and high performance mixed matrix membrane (MMM), one approach is the functionalization of inorganic nanofillers (as dispersed phase) in the organic polymer matrix (as continuous phase) to modify the interactions between two phases.  For this purpose,, raw multi-walled carbon nanotubes (rMWCNTs) were purified by acid mixture (HNO3/H2SO<sub...

We study the computation of the diameter and radius under the rectilinear link distance within a rectilinear polygonal domain of n vertices and h holes. We introduce a graph of oriented distances to encode the distance between pairs of points of the domain. This helps us transform the problem so that we can search through the candidates more efficiently. Our algorithm computes both the diameter...