We consider a hierarchy of four classes of interval digraphs, or equivalently four classes of 0,1-matrics. We provide forbidden submatrix characterizations separating the successive classes. The largest class is the set of (adjacency matrices of) interval digraphs; the smallest is the set of (adjacency matrices of) unit interval digraphs.

Interval Newton/Generalized Bisection methods reliably find all numerical solutions within a given domain. Both computational complexity analysis and numerical experiment s have shown that solving the corresponding interval linear system generated by interval Newton's methods can be computationally expensive (especially when the nonlinear system is large). In applications, many large-scale nonl...

In this paper, we present the notion of complex interval matrix. Further, discuss algebraic structure set all $(m\times n)$ matrices by using tools quasilinear functional analysis. Finally, put a norm on space and calculate matrices.

In reliable engineering computing, manipulations of interval matrices are often in-volved. A computational environment that provides basic linear algebra subroutines(BLAS) for interval matrices is very much needed as a software tool. In this paper, webriefly review the interval BLAS standard proposed in [1] and [2] and then report anobject-oriented implementation of the interval...

In this paper we have raised, discussed, and solved the problems relating the Vargas's verification of consistency test for 3 x 3 comparison matrices in the Analytic Hierarchy Process (AHP). In the AHP community, assessing attribute weights by using a consistency ratio of 0.1 or less has been widely practiced. Though Vargas did study the problem, the method he adopted might lead to certain ques...

Title of thesis: TWO APPLICATIONS INVOLVING THE ANALYTIC HIERARCHY PROCESS Brian David Alford, Master of Science, 2004 Thesis directed by: Professor Bruce Golden Department of Decision and Information Technologies The analytic hierarchy process (AHP) is a popular tool used in decision making for ranking alternatives based on quantitative and qualitative criteria. In this thesis, we investigate ...

We present an interval approach for pattern recognition of numerical matrices. We construct systems of interval linear equations that are associated with given numerical pattern matrices. Considering a system of interval linear equations as a family of systems of real linear equations, we use a measure of variation of these systems solutions as a measure of distance between matrices. As an appl...