4
votes
3answers
196 views

Is this function well studied?

Let $A_1,\dots,A_L$ be $N\times N$ hermitian matrices. Define the simplex \begin{align} \mathcal{S}=\left\{[x_1,\dots,x_L]\mid x_i\geq 0,~\sum_{i=1}^{L}x_i=1 \right\} \end{align} and consider the ...
0
votes
1answer
161 views

Existence of a real eigenvalue

I have a matrix $M \in \mathbb{R}^{(n+1) \times (n+1)}$ that is tridiagonal. In numerical computations I found out that I always find a real eigenvalue. My question is: Is there a theorem that ...
6
votes
2answers
239 views

Does small Perron-Frobenius eigenvalue imply small entries for integral matrices?

Suppose that $M$ is an $n \times n$ matrix where each entry is a positive integer. Then $M$ is Perron-Frobenius and so has unique largest real eigenvalue $\lambda_{\textrm{PF}}$. Does an upper ...
1
vote
0answers
62 views

Dominant eigenvalue of sum of tridiagonal and diagonal matrices

Suppose I have a tridiagonal square matrix $A$ of some nice form, for which I know the eigenvalues $\lambda_1<\dots<\lambda_n$. $A$ is also essentially nonnegative (nonnegative everywhere except ...
0
votes
1answer
78 views

Any generic way to move a psd matrix to its neighbors?

Given a two positive matrices $A,B$. For simplicity, let's assume that $Tr A=Tr B=1$. Assume that $\|A-B\|_1\leq\varepsilon$, for some small $\varepsilon>0$, where $\|\cdot\|_1$ is the $l_1$-norm, ...
1
vote
0answers
57 views

Lanczos algorithm with thick restart on a dynamic matrix

currently, I'm working on a way to compute the 2 biggest eigenvalues of a real, symmetric, huge and sparse matrix that changes a few entries from time to time. The problem should be solved using an ...
0
votes
0answers
49 views

Eigenvalues of a “Half-Kronecker ” Product

The Problem: Given a 2 by 2 matrix $C$(the matrix elements of C are given), and two other 2 by 2 matrices $A$ and $B$(the matrix elements of A and B are given). Now we can construct a new matrix ...
3
votes
1answer
188 views

When is this matrix singular?

Consider matrix $A$ with $(j,k)$′th entry $A_{j,k}=\sin(\omega_j t_k+\phi_j),\,\forall j,k\in\{1,2,...,n\}$, where $\omega_j,t_k,\phi_j\in \mathbf R$. 1) For $t_k=k$, what is the condition on ...
2
votes
1answer
93 views

Dimension independent computational complexity of singular value decomposition

Suppose $X$ is a $m \times n$ real matrix, which has only $k$ number of nonzero elements ($k \ll mn$). Given a vector $y$, the sparsity of $X$ allows $X y$ to be computed in $O(k)$ time which is ...
2
votes
3answers
248 views

eigenvalue of Laplacian matrix

If we have a Laplacian matrix $\boldsymbol{A}$ such that \begin{align} &A_{ii} >0 \\ &A_{ii}=-\sum_{j\neq i}A_{ij} \end{align} with known eigenvalues $\lambda_i$. Define the matrix ...
0
votes
1answer
71 views

The influence of eigendecomposition on the periodicity of a (rank 2) Hermitian matrix (of functions)

Let $\boldsymbol{R}(u,v);~u,v\in\mathbb{R}$ be a Hermitian matrix (of Hermitian functions) with entries \begin{equation} r_{ij}(u,v) = 1 + Ae^{-2\pi i \phi_{ij}(ul_0 + vm_0)}; ...
3
votes
2answers
324 views

What is known about the spectrum of a Cauchy matrix?

Math people: A Cauchy matrix is an $m$-by-$n$ matrix $A$ whose elements have the form $a_{i,j} = \frac{1}{x_i-y_j}$, with $x_i \neq y_j$ for all $(i, j)$, and the $x_i$'s and $y_i$'s belong to a ...
8
votes
0answers
266 views

Eigenvalues of permutations of a real matrix: how complex can they be?

This is sort of complementary to this thread. I’ll repeat the definitions here: For a matrix $M\in GL(n,\mathbb R)$, consider the $n!$ matrices obtained by permutations of the rows (say) of $M$ and ...
20
votes
4answers
1k views

Eigenvalues of permutations of a real matrix: can they all be real?

For a matrix $M\in GL(n,\mathbb R)$, consider the $n!$ matrices obtained by permutations of the rows (say) of $M$ and define the total spectrum $TS(M)$ as the union of all their spectra (counting ...
1
vote
3answers
2k views

Eigenvalues of Symmetric Tridiagonal Matrices

Suppose I have the symmetric tridiagonal matrix: $ \begin{pmatrix} a & b_{1} & 0 & ... & 0 \\\ b_{1} & a & b_{2} & & ... \\\ 0 & b_{2} & a & ... & 0 ...
0
votes
2answers
220 views

Eigenvalues of an amplification matrix

Let $A$ and $B$ square real matrices. I know that the matrix $A+B$ has 1 as eigenvalue of multiplicity 1 and the others eigenvalues have their modulus <1. Can we say something about the eigenvalues ...
1
vote
0answers
74 views

Characterizing the singular values of a matrix with structure

Suppose we have a function from $\mathbb{R}^2\to\mathbb{C}$, $$f(x,y) = e^{\imath\pi x g(y)}$$ where $g(y)$ is periodic in $y\in[-T, T),\ T<\infty$ (e.g., a sinusoid) and $0\leq x < \infty$ ...
1
vote
0answers
63 views

Eigenvectors of contraction times projection

Suppose $A$ is a real $n\times n$ matrix with real eigenvalues: $$ 1=\lambda_1>|\lambda_2|\ge \ldots\ge |\lambda_n|>0. $$ Suppose $B$ is an involution, for simplicity let us assume that $B$ is ...
0
votes
1answer
108 views

Spectrum of a Laplacianized matrix

Suppose that $A$ is a positive matrix and that we let $R$ be the diagonal matrix of $A$'s row-sums. What can be said about the spectrum of $R-A$? I am particularly interested in the largest eigenvalue ...
0
votes
0answers
90 views

Ratio of Eigen values and Mutual Independence

Given a matrix $X$. Calculating the Eigen values of $XX^T$ and using the ratio of maximum and minimum eigen values normally gives the condition number of the matrix. If $X$ contains $M$ observations ...
3
votes
1answer
302 views

Condition for block symmetric real matrix eigenvalues to be real

I have a (2nx2n) block symmetric matrix that in the simplest case (n=2) looks like: $$ M_2 = \begin{bmatrix} a_1 & 0 & b_{1,2} & -b_{1,2}\\\ 0 & -a_1 & b_{1,2} & -b_{1,2}\\\ ...
0
votes
0answers
239 views

Checking whether this would be bounded

It may be better to post this question here. Assume that $M$ is an $m$ by $m$ ($m$ is an even number) symmetric positive-semi-definite matrix with exactly $m/2$ positive eigenvalues and every entry of ...
3
votes
2answers
344 views

Prove log of eigenvalues are dense in R?

Suppose you have the set of all possible $n$ x $n$ square adjacency matrices where $n$={1,2,3,4...}. For each matrix, compute the logarithm of the largest eigenvalue. Is it true that the set of ...
3
votes
0answers
145 views

Eigenvalues vs.matrix sparsity

For an n X n matrix whose entries are constrained to be in some [x,y], is the maximum absolute eigenvalue of the matrix a function of its sparsity? Is there a closed-form expression that states this ...
1
vote
1answer
128 views

Destroying the structure of a linear system while preserving its maximum eigenvalue

I have an asymmetric square matrix with non-negative real entries in the range [0,10], representing the edge-weights of a directed network. Assume that the network is a linear system. My general ...