Square nearly nonpositive sign pattern matrices
From MaRDI portal
Irreducible square nearly nonpositive (SNNP) matrices \(A\) are considered. The maximum (or minimum) number of negative entries that can occur in \(A^2\) \((A^2\) is a generalized sign pattern) when \(A\) is SNNP are found. The sign patterns that achieve this maximum (or minimum) number are characterized. Properties of eigenvalues of sign pattern which are composite or square nearly composite are discussed.
Recommendations
- The number of negative entries in the square of a sign pattern matrix with nonpositive square
- scientific article; zbMATH DE number 2185792
- Sign patterns for eigenmatrices of nonnegative matrices
- How many negative entries can A^ 2 have?
- Spectra and inverse sign patterns of nearly sign-nonsingular matrices
Cites work
- How many negative entries can A^ 2 have?
- scientific article; zbMATH DE number 825098 (Why is no real title available?)
- Matrix Analysis
- On Elements with Negative Squares
- Sign patterns that require real, nonreal or pure imaginary eigenvalues
- Sign patterns that require repeated eigenvalues
- Some sign patterns that allow a real inverse pair \(B\) and \(B^{-1}\)
- The graphs of the unambiguous entries in the product of two \((+,-)\) sign pattern matrices
Cited in
(6)- Spectra and inverse sign patterns of nearly sign-nonsingular matrices
- The number of negative entries in the square of a sign pattern matrix with nonpositive square
- scientific article; zbMATH DE number 2185792 (Why is no real title available?)
- Sign patterns for eigenmatrices of nonnegative matrices
- EXTREMAL CASES OF SN-MATRICES
- Squarable sign patterns
This page was built for publication: Square nearly nonpositive sign pattern matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5935359)
