Academia.eduAcademia.edu

M MATRIX

description154 papers
group3 followers
lightbulbAbout this topic
M MATRIX refers to a mathematical construct used in various fields, including linear algebra and statistics, representing a matrix characterized by specific properties or structures. It is often utilized in the analysis of systems, transformations, and data representations, facilitating operations such as addition, multiplication, and inversion.
lightbulbAbout this topic
M MATRIX refers to a mathematical construct used in various fields, including linear algebra and statistics, representing a matrix characterized by specific properties or structures. It is often utilized in the analysis of systems, transformations, and data representations, facilitating operations such as addition, multiplication, and inversion.
A new preconditioner for symmetric positive de nite systems is proposed, analyzed, and tested. The preconditioner, Compressed Incomplete Modi ed Gram Schmidt (CIMGS), is based on an incomplete orthogonal factorization. CIMGS is robust... more
We generalize in various directions a result of Friedland and Karlin on a lower bound for the spectral radius of a matrix that is positively diagonally equivalent to a
Several characterizations of the class of M-matrices as a subclass of the class of Z-matrices are given. These characterizations involve alternating sequences, decompositions, and splittings, and all are related to generalized nullspaces.
Two common properties of Z-matrices and Hermitian matrices are considered: (1) The eigenvalue interlacing property, i.e., the two smallest real eigenvalues of a matrix are interlaced by the smallest real eigenvalue of any principal... more
In this article the design of a new real-time differentiator featuring global convergence properties is considered. Such a problem is tackled by means of a second-order sliding mode differentiator (2-SMD) with adjustable gain and... more
A well-known property of an irreducible singular M -matrix is that it has a generalized inverse which is non-negative, but this is not always true for any generalized inverse. The authors have characterized when the Moore-Penrose inverse... more
Available free at mirror sites of http://www.math.nthu.edu.tw/∼amen/ ... Guang-Hui Cheng, Xiao-Yu Cheng, Ting-Zhu Huang†, Tin-Yau Tam‡ ... Abstract Some bounds for the spectral radius of the Hadamard product of two nonneg-ative matrices... more
In this paper we give an explicit solution to the rank constrained matrix approximation in Frobenius norm, which is a generalization of the classical approximation of an m × n matrix A by a matrix of rank k at most. 2000 Mathematics... more
Transport problems occurring in porous media and including convection, diffusion and chemical reactions, can be well represented by systems of Partial Differential Equations. In this paper, a numerical procedure is proposed for the fast... more
In this paper we study the concept of lacunary statistical co nvergent triple sequences in probabilistic normed spaces and prove some basic properties.
The idea of triple statistical convergence was introduced by Şahiner et.al A. Şahiner, M. Gürdal and F. K. Düden [Selçuk J. Appl. Math. 8, No. 2, 49–55 (2007; Zbl 1152.40306)] while the idea of double statistical sequences was introduced... more
The concept of PBBD is merely the combinatorial interest in block designs. Because with the help of PBBD many other incomplete block designs can be constructed. This study proposed a new method for constructing Optimal Pairwise Balanced... more
Two different methods are proposed for the construction of an efficiency balanced design. Method 1 discusses the construction of efficiency balanced design by deleting the control treatment and method 2 discusses the construction of... more
In this paper, we obtain the global asymptotic stability of the zero solution of a general n-dimensional delayed differential system, by imposing a condition of dominance of the nondelayed terms which cancels the delayed effect. We... more
In this work, we design a linear, two step implicit finite difference method to approximate the solutions of a biological system that describes the interaction between a microbial colony and a surrounding substrate. Three separate models... more
A matrix is called totally nonnegative (TN) if the determinant of every square submatrix is nonnegative and totally positive (TP) if the determinant of every square submatrix is positive. The TP (TN) completion problem asks which partial... more
In this paper we study the concept of lacunary statistical convergent triple sequences in probabilistic normed spaces and prove some basic properties.
In this paper, we define the notion of ∆ m −statistical convergence of order α of generalized difference sequences in the probabilistic normed spaces and present their characterization. We also define the notion of ∆ m −statistical Cauchy... more
A class of matrices that simultaneously generalizes the M-matrices and the inverse M-matrices is brought forward and its properties are reviewed. It is interesting to see how this class bridges the properties of the matrices it... more
Two different methods are proposed for the construction of an efficiency balanced design. Method 1 discusses the construction of efficiency balanced design by deleting the control treatment and method 2 discusses the construction of... more
To reduce the communication among processors and improve the computing time for solving linear complementarity problems, we present a two-step modulus-based synchronous multisplitting iteration method and the corresponding symmetric... more
In this paper we study the concept of statistical limit superior and statistical limit inferior in probabilistic normed spaces. Our results are analogous to the results of Fridy and Orhan [Proc. Amer. Math. Soc. 125(1997), 3625-3631] but... more
A real matrix A, of size m × n, is called totally nonnegative (totally positive) if all its minors are nonnegative (positive). A variant of the Neville elimination process is studied in relation to the existence of a totally nonnegative... more
A nonsingular real matrix A is said to be inverse-positive if all the elements of its inverse are nonnegative. This class of matrices contains the M-matrices, from which inherit some of their properties and applications, especially in... more
Let C ( A ) = A ∘ A − T {\mathcal{C}}\left(A)=A\circ {A}^{-T} be the combined matrix of an invertible matrix A A , where ∘ \circ means the Hadamard product of matrices. In this work, we study the combined matrix of a nonsingular matrix,... more
A nonsingular real matrix A is said to be inverse-positive if all the elements of its inverse are nonnegative. This class of matrices contains the M-matrices, from which inherit some of their properties and applications, especially in... more
A real matrix A, of size m × n, is called totally nonnegative (totally positive) if all its minors are nonnegative (positive). A variant of the Neville elimination process is studied in relation to the existence of a totally nonnegative... more
In this work we introduce some technical conditions to prove that a P-matrix has an inverse M-matrix. We study a class of totally positive P-matrices whose inverses are M-matrices.
A nonsingular real matrix A is said to be inverse-positive if all the elements of its inverse are nonnegative. This class of matrices contains the M-matrices, from which inherit some of their properties and applications, especially in... more
We aim here at characterizing those nonnegative matrices whose inverse is an irreducible Stieltjes matrix. Specifically, we prove that any irreducible Stieltjes matrix is a resistive inverse. To do this we consider the network defined by... more
A well-known property of an irreducible singular M-matrix is that it has a generalized inverse which is non-negative, but this is not always true for any generalized inverse. The authors have characterized when the Moore-Penrose inverse... more
Gallai-type Results for Multiple Boxes and Forests J. LEHEL Gallai-type statements considered here have the next general form: ifF is a finite family of subsets of some underlying space such that every k members (k ;;. 2) have a common... more
The concept of statistical convergence plays a very prominent role in the study of sequence spaces. In this treatise, we extend the research on different types of statistical convergence viz., statistical convergence in mean, in measure,... more
Multiplicative and additive D-stability, diagonal stability, Schur Dstability, H-stability are classical concepts which arise in studying linear dynamical systems. We unify these types of stability, as well as many others, in one concept... more
We establish the eigenvalue interlacing property (i.e. the smallest real eigenvalue of a matrix is less than the smallest real eigenvalue of any its principal submatrix) for the class of matrices, introduced by Kotelyansky (all principal... more
Let C ( A ) = A ∘ A − T {\mathcal{C}}\left(A)=A\circ {A}^{-T} be the combined matrix of an invertible matrix A A , where ∘ \circ means the Hadamard product of matrices. In this work, we study the combined matrix of a nonsingular matrix,... more
Two different methods are proposed for the construction of an efficiency balanced design. Method 1 discusses the construction of efficiency balanced design by deleting the control treatment and method 2 discusses the construction of... more
In this article we introduce the notion of lacunary statistically convergent and lacunary statistically Cauchy sequences in intuitionistic fuzzy n-normed linear spaces and give their characterization. We show that some properties of... more
An Euler tour in a hypergraph is a closed walk that traverses each edge of the hypergraph exactly once, while an Euler family, first defined by Bahmanian andŠajna, is a family of closed walks that jointly traverse each edge exactly once... more
An Euler tour in a hypergraph is a closed walk that traverses each edge of the hypergraph exactly once, while an Euler family is a family of closed walks that jointly traverse each edge exactly once and cannot be concatenated. In this... more
Download research papers for free!