Nested matrices and inverse $M$-matrices

Jeffrey L. Stuart

Displaying similar documents to “Nested matrices and inverse $M$ -matrices”

Circulant matrices with orthogonal rows and off-diagonal entries of absolute value $1$

Daniel Uzcátegui Contreras, Dardo Goyeneche, Ondřej Turek, Zuzana Václavíková (2021)

Communications in Mathematics

Similarity:

It is known that a real symmetric circulant matrix with diagonal entries $d \geq 0$ , off-diagonal entries $\pm 1$ and orthogonal rows exists only of order $2 d + 2$ (and trivially of order $1$ ) [Turek and Goyeneche 2019]. In this paper we consider a complex Hermitian analogy of those matrices. That is, we study the existence and construction of Hermitian circulant matrices having orthogonal rows, diagonal entries $d \geq 0$ and any complex entries of absolute value $1$ off the diagonal. As a particular case, we consider...

G-matrices, $J$ -orthogonal matrices, and their sign patterns

Frank J. Hall, Miroslav Rozložník (2016)

Czechoslovak Mathematical Journal

Similarity:

A real matrix $A$ is a G-matrix if $A$ is nonsingular and there exist nonsingular diagonal matrices $D_{1}$ and $D_{2}$ such that $A^{- T} = D_{1} A D_{2}$ , where $A^{- T}$ denotes the transpose of the inverse of $A$ . Denote by $J = diag (\pm 1)$ a diagonal (signature) matrix, each of whose diagonal entries is $+ 1$ or $- 1$ . A nonsingular real matrix $Q$ is called $J$ -orthogonal if $Q^{T} J Q = J$ . Many connections are established between these matrices. In particular, a matrix $A$ is a G-matrix if and only if $A$ is diagonally (with positive diagonals) equivalent to a column permutation...

Linear preservers of rc-majorization on matrices

Mohammad Soleymani (2024)

Czechoslovak Mathematical Journal

Similarity:

Let $A$ , $B$ be $n \times m$ matrices. The concept of matrix majorization means the $j$ th column of $A$ is majorized by the $j$ th column of $B$ and this is done for all $j$ by a doubly stochastic matrix $D$ . We define rc-majorization that extended matrix majorization to columns and rows of matrices. Also, the linear preservers of rc-majorization will be characterized.

On the matrix negative Pell equation

Aleksander Grytczuk, Izabela Kurzydło (2009)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

Let N be a set of natural numbers and Z be a set of integers. Let M₂(Z) denotes the set of all 2x2 matrices with integer entries. We give necessary and suficient conditions for solvability of the matrix negative Pell equation (P) X² - dY² = -I with d ∈ N for nonsingular X,Y belonging to M₂(Z) and his generalization (Pn) $\sum_{i = 1}^{n} X ₂_{i} - d \sum_{i = 1}^{n} Y ²_{i} = - I$ with d ∈ N for nonsingular $X_{i}, Y_{i} \in M ₂ (Z)$ , i=1,...,n.

Controllable and tolerable generalized eigenvectors of interval max-plus matrices

Matej Gazda, Ján Plavka (2021)

Kybernetika

Similarity:

By max-plus algebra we mean the set of reals $ℝ$ equipped with the operations $a \oplus b = max {a, b}$ and $a \otimes b = a + b$ for $a, b \in ℝ .$ A vector $x$ is said to be a generalized eigenvector of max-plus matrices $A, B \in ℝ (m, n)$ if $A \otimes x = λ \otimes B \otimes x$ for some $λ \in ℝ$ . The investigation of properties of generalized eigenvectors is important for the applications. The values of vector or matrix inputs in practice are usually not exact numbers and they can be rather considered as values in some intervals. In this paper the properties of matrices and vectors with inexact (interval)...

Linear preservers of row-dense matrices

Sara M. Motlaghian, Ali Armandnejad, Frank J. Hall (2016)

Czechoslovak Mathematical Journal

Similarity:

Let $𝐌_{m, n}$ be the set of all $m \times n$ real matrices. A matrix $A \in 𝐌_{m, n}$ is said to be row-dense if there are no zeros between two nonzero entries for every row of this matrix. We find the structure of linear functions $T : 𝐌_{m, n} \to 𝐌_{m, n}$ that preserve or strongly preserve row-dense matrices, i.e., $T (A)$ is row-dense whenever $A$ is row-dense or $T (A)$ is row-dense if and only if $A$ is row-dense, respectively. Similarly, a matrix $A \in 𝐌_{n, m}$ is called a column-dense matrix if every column of $A$ is a column-dense vector. At the end, the structure...

Analytic aspects of the circulant Hadamard conjecture

Teodor Banica, Ion Nechita, Jean-Marc Schlenker (2014)

Annales mathématiques Blaise Pascal

Similarity:

We investigate the problem of counting the real or complex Hadamard matrices which are circulant, by using analytic methods. Our main observation is the fact that for $| q_{0} | = ... = | q_{N - 1} | = 1$ the quantity $Φ = \sum_{i + k = j + l} \frac{q_{i} q_{k}}{q_{j} q_{l}}$ satisfies $Φ \geq N^{2}$ , with equality if and only if $q = (q_{i})$ is the eigenvalue vector of a rescaled circulant complex Hadamard matrix. This suggests three analytic problems, namely: (1) the brute-force minimization of $Φ$ , (2) the study of the critical points of $Φ$ , and (3) the computation of the moments of $Φ$ . We explore here...

-simplicity of interval max-min matrices

Ján Plavka, Štefan Berežný (2018)

Kybernetika

Similarity:

A matrix $A$ is said to have $𝐗$ -simple image eigenspace if any eigenvector $x$ belonging to the interval $𝐗 = {x : \underset{̲}{x} \leq x \leq \bar{x}}$ containing a constant vector is the unique solution of the system $A \otimes y = x$ in $𝐗$ . The main result of this paper is an extension of $𝐗$ -simplicity to interval max-min matrix $𝐀 = {A : \underset{̲}{A} \leq A \leq \bar{A}}$ distinguishing two possibilities, that at least one matrix or all matrices from a given interval have $𝐗$ -simple image eigenspace. $𝐗$ -simplicity of interval matrices in max-min algebra are studied and equivalent conditions for...

Inverse eigenvalue problem for constructing a kind of acyclic matrices with two eigenpairs

Maryam Babaei Zarch, Seyed Abolfazl Shahzadeh Fazeli, Seyed Mehdi Karbassi (2020)

Applications of Mathematics

Similarity:

We investigate an inverse eigenvalue problem for constructing a special kind of acyclic matrices. The problem involves the reconstruction of the matrices whose graph is an $m$ -centipede. This is done by using the $(2 m - 1)$ st and $(2 m)$ th eigenpairs of their leading principal submatrices. To solve this problem, the recurrence relations between leading principal submatrices are used.

Localization of dominant eigenpairs and planted communities by means of Frobenius inner products

Dario Fasino, Francesco Tudisco (2016)

Czechoslovak Mathematical Journal

Similarity:

We propose a new localization result for the leading eigenvalue and eigenvector of a symmetric matrix $A$ . The result exploits the Frobenius inner product between $A$ and a given rank-one landmark matrix $X$ . Different choices for $X$ may be used, depending on the problem under investigation. In particular, we show that the choice where $X$ is the all-ones matrix allows to estimate the signature of the leading eigenvector of $A$ , generalizing previous results on Perron-Frobenius properties of matrices...

A computation of positive one-peak posets that are Tits-sincere

Marcin Gąsiorek, Daniel Simson (2012)

Colloquium Mathematicae

Similarity:

A complete list of positive Tits-sincere one-peak posets is provided by applying combinatorial algorithms and computer calculations using Maple and Python. The problem whether any square integer matrix $A \in ₙ (ℤ)$ is ℤ-congruent to its transpose $A^{t r}$ is also discussed. An affirmative answer is given for the incidence matrices $C_{I}$ and the Tits matrices $C ̂_{I}$ of positive one-peak posets I.

Factorization of matrices associated with classes of arithmetical functions

Shaofang Hong (2003)

Colloquium Mathematicae

Similarity:

Let f be an arithmetical function. A set S = x₁,..., xₙ of n distinct positive integers is called multiple closed if y ∈ S whenever x|y|lcm(S) for any x ∈ S, where lcm(S) is the least common multiple of all elements in S. We show that for any multiple closed set S and for any divisor chain S (i.e. x₁|...|xₙ), if f is a completely multiplicative function such that (f*μ)(d) is a nonzero integer whenever d|lcm(S), then the matrix $(f (x_{i}, x_{i}))$ having f evaluated at the greatest common divisor $(x_{i}, x_{i})$ of...

Displaying similar documents to “Nested matrices and inverse M -matrices”

Displaying similar documents to “Nested matrices and inverse $M$ -matrices”