In
mathematics, the class of ''Z''-matrices are those
matrices
Matrix most commonly refers to:
* ''The Matrix'' (franchise), an American media franchise
** ''The Matrix'', a 1999 science-fiction action film
** "The Matrix", a fictional setting, a virtual reality environment, within ''The Matrix'' (franchis ...
whose off-diagonal entries are less than or equal to zero; that is, the matrices of the form:
:
Note that this definition coincides precisely with that of a negated
Metzler matrix In mathematics, a Metzler matrix is a matrix in which all the off-diagonal components are nonnegative (equal to or greater than zero):
: \forall_\, x_ \geq 0.
It is named after the American economist Lloyd Metzler.
Metzler matrices appear in st ...
or
quasipositive matrix, thus the term ''quasinegative'' matrix appears from time to time in the literature, though this is rare and usually only in contexts where references to quasipositive matrices are made.
The
Jacobian of a competitive dynamical system is a ''Z''-matrix by definition. Likewise, if the Jacobian of a cooperative dynamical system is ''J'', then (−''J'') is a ''Z''-matrix.
Related classes are
''L''-matrices,
''M''-matrices,
''P''-matrices,
''Hurwitz'' matrices and
''Metzler'' matrices. ''L''-matrices have the additional property that all diagonal entries are greater than zero. M-matrices have several equivalent definitions, one of which is as follows: a ''Z''-matrix is an ''M''-matrix if it is
nonsingular
In linear algebra, an -by- square matrix is called invertible (also nonsingular or nondegenerate), if there exists an -by- square matrix such that
:\mathbf = \mathbf = \mathbf_n \
where denotes the -by- identity matrix and the multiplicati ...
and its inverse is nonnegative. All matrices that are both ''Z''-matrices and
''P''-matrices are nonsingular ''M''-matrices.
In the context of
quantum complexity theory
Quantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational model based on quantum mechanics. It studies the hardness of computational problems i ...
, these are referred to as ''stoquastic operators''.
See also
*
Hurwitz matrix In mathematics, a Hurwitz matrix, or Routh–Hurwitz matrix, in engineering stability matrix, is a structured real square matrix constructed with coefficients of a real polynomial.
Hurwitz matrix and the Hurwitz stability criterion
Namely, given a ...
*
M-matrix In mathematics, especially linear algebra, an ''M''-matrix is a ''Z''-matrix with eigenvalues whose real parts are nonnegative. The set of non-singular ''M''-matrices are a subset of the class of ''P''-matrices, and also of the class of inverse ...
*
Metzler matrix In mathematics, a Metzler matrix is a matrix in which all the off-diagonal components are nonnegative (equal to or greater than zero):
: \forall_\, x_ \geq 0.
It is named after the American economist Lloyd Metzler.
Metzler matrices appear in st ...
*
P-matrix In mathematics, a -matrix is a complex square matrix with every principal minor is positive. A closely related class is that of P_0-matrices, which are the closure of the class of -matrices, with every principal minor \geq 0.
Spectra of -matric ...
References
*
*
*
Matrices
{{Linear-algebra-stub