Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
1 answer
559 views

Determinant of a Certain Positive-Definite Block Matrix

Is there a lower bound for the determinant or minimum eigenvalue of the following $d$ by $d$ matrix in terms of $d$? $$\Gamma=\left( {\begin{array}{cc} I & B \\ B^{*} & I \\ \end{array} ...
Jay's user avatar
  • 31
1 vote
0 answers
148 views

Perturbation of eigenvalues of some special matrices

In perturbation theory of linear operators, one major question is how the eigenvalues of a linear operator $A$ change under a small perturbation, $A(x) = A + xP$, with $x\in\mathbb{R}$. For instance, ...
shahulhameed's user avatar
7 votes
1 answer
6k views

Eigenvectors as continuous functions of matrix - diagonal perturbations

The general question has been treated here, and the response was negative. My question is about more particular perturbations. The counterexamples given in the previous question have variations not ...
Beni Bogosel's user avatar
  • 2,222
10 votes
5 answers
2k views

The maximal eigenvalue of a symmetric Toeplitz matrix

Let $0\le x\le 1$ be a real number. Denote by $A_n(x)=(a_{ij})$ the $n$ by $n$ matrix such that $a_{ij}=x^{|i-j|}$ and let $\lambda_n(x)$ be the maximal eigenvalue of $A_n(x)$. Is there any ...
Andrei Jaikin's user avatar
9 votes
1 answer
396 views

Bound on the ratio of top 2 eigenvalues

Let $P$ be a $n \times n$ stochastic matrix such that $P_{ij}=\tau$ if $i \neq j$ and $P_{ii} = 1 - (n-1)\tau$ where $0<\tau < \frac{1}{n}$. It is clear that the largest eigenvalue of $P$ is 1, ...
user avatar
4 votes
1 answer
1k views

Why are 1 and -1 eigenvalues of this matrix?

This is a subject I've been working on for a very long time now, but still did not manage to fully understand the interesting properties of this matrix $\mathbf{A}$. First, let's define two matrices: ...
anderstood's user avatar
2 votes
2 answers
645 views

Matrices with real spectrum

Assume you have a non-symmetric real square matrix all of whose eigenvalues are real. Can anything be said about it? Is it unitarily equivalent to a symmetric matrix? EDIT: Is it at least similar to ...
Delio Mugnolo's user avatar
1 vote
0 answers
270 views

Eigenvalue of product of self adjoint compact operators

Suppose A is a self adjoint $m \times m$ real matrix with eigenpairs $\{e_j, \lambda_j\}$ such that $\lambda_j > \lambda_{j + 1}$. Let $B$ be another self adjoint real $m \times m$ matrix such that ...
Madhuresh's user avatar
  • 157
1 vote
0 answers
109 views

An exact fraction of a matrix

Let $A$ be a $n \times m$ real matrix with $n<<m$ and of rank $r<n$. It is known that $A$ has exactly two distinct non-zero singular values: $\sigma_{\max}$ and $\sigma_{2}$, and also that $\...
Felix Goldberg's user avatar
1 vote
3 answers
1k views

Simple Spectrum of Jacobi matrices

I want to call a matrix a Jacobi matrix (cause there may be different notions of Jacobi matrices) if it is a tridiagonal matrix with positive off-diagonal entries. Now, I read that the spectrum of ...
Jiao Guo's user avatar
5 votes
0 answers
255 views

Existence of a matrix product from its eigenvalues

Let A and B be two positive definite, real, symmetric matrices. The eigenvalues of A, B and AB, denoted by $\lambda(X)$, obey the relation (from Bhatia): $$ \lambda^\downarrow(A) \cdot \lambda^\...
ScienceSnake's user avatar
4 votes
0 answers
342 views

Determinant of the sum of a psd (Kronecker) matrix and a diagonal matrix?

Let $K = K1 \otimes K2$ where $K1$ and $K2$ are positive semidefinite matrices. Let $W$ be a diagonal matrix with positive entries. (Everything is real-valued.) I want to calculate or bound $\det (...
stackoverflax's user avatar
5 votes
1 answer
1k views

Anti-bidiagonal matrix with main anti-diagonal {1,2,3,...} and first sub-anti-diagonal {-1,-2,-3,...} has eigenvalues lambda={1,-2,3,-4,...}

Consider the anti-bidiagonal matrix $B_6\in\mathbb{R}^{6\times 6}$, defined along its anti-diagonals as follows $$ B_6=\begin{bmatrix} & & & & & 6\\ & & & &...
Richard Zhang's user avatar
1 vote
0 answers
108 views

MInors related problem [closed]

A matrix $A$ has $m$ rows and $n$ colums, such that $m \leq n$. We know that each row of $A$ has the norm $1$ (the norm of an element $x=(x_1,x_2,...,x_n) \in \mathbb{R}^n$ is $||x||=\sqrt{x_1^2+x_2^2+...
user95553's user avatar
2 votes
0 answers
279 views

Eigenvalues of this matrix

I have a linear map that is defined by $$T:\text{lin}(1,...,x^m) \rightarrow \text{lin}(1,...,x^m) \text{ with}$$ $$x^k \mapsto 2w(k-m)x^{k+1}+(k^2-k-w^2)x^k-2kwx^{k-1}+(k-k^2)x^{k-2}$$ Let me give a ...
BaoLing's user avatar
  • 329
1 vote
1 answer
6k views

Largest eigenvalue of the sum of Hermitian matrices [closed]

Is there an expression for the largest eigenvalue of the sum of two Hermitian matrices in terms of the spectrum of the same matrices?
Benjamin's user avatar
  • 2,099
2 votes
1 answer
345 views

Alike looking matrices imply convergence of eigenvalues?

This is a question about convergence of eigenvalues which essentially came up in studying the spectrum of St.-Liouville operators. We want to look at matrices that agree in most of their entries and ...
user avatar
0 votes
1 answer
1k views

How do eigenvalues change if we duplicate a row and column of a symmetric matrix?

Let $\bf A$ be a $n \times n$ symmetric positive semidefinite matrix whose first column is denoted by ${\bf a}_1$. We define a new matrix, $$ {\bf B} = \begin{bmatrix} a_{11} & {\bf a}_1^T \\ {\bf ...
Jingxian Wu's user avatar
4 votes
3 answers
308 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 ...
dineshdileep's user avatar
  • 1,421
2 votes
1 answer
430 views

Comparison of the smallest eigenvalues of two tridiagonal matrices

Let $n\geq2$ be an integer and $E_{ii}$ for an integer $2\leq i\leq n$ be the $n\times n$-matrix with its $ii$-entry equal to 1 and remaining entries equal zero. Furthermore, let $H_n:=\mathrm{tridiag}...
Sandro's user avatar
  • 21
1 vote
1 answer
546 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 ...
user avatar
3 votes
1 answer
332 views

Maximising a Rayleigh quotient over a subspace

Let $M\in\mathbb{R}^{n\times n}$ be symmetric positive definite and consider a matrix $Q\in\mathbb{R}^{n\times m}$ ($m<n$) with orthonormal columns ($Q^TQ=I$). I'm interested in finding an exact ...
Algebraic Pavel's user avatar
8 votes
3 answers
1k 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 ...
Mark Bell's user avatar
  • 3,165
2 votes
0 answers
210 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 ...
Daniel's user avatar
  • 21
3 votes
1 answer
264 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 $\...
Hans's user avatar
  • 2,239
9 votes
1 answer
3k views

Frobenius-Perron eigenvalue and eigenvector of sum of two matrices

Suppose that I have two positive matrices, $A$, and $B$, and I know their Frobenius-Perron eigenvalues ($\lambda_A$, $\lambda_B$) and eigenvectors ($v_A$, $v_B$). I'm interested in what I can say ...
sasquires's user avatar
  • 403
2 votes
1 answer
359 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 ...
Janathan's user avatar
2 votes
1 answer
474 views

When is there a solution to these coupled eigenvalue equations?

I am trying to find the fixed point of a dynamical system, which requires solving two coupled eigenvalue-like equations. These equations are, in general, overconstrained. I'd like to have a simple ...
sasquires's user avatar
  • 403
6 votes
2 answers
2k 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 ...
Stefan's user avatar
  • 533
2 votes
2 answers
269 views

Is my use of the eigendecomposition correct here?

I'm exploring different techniques to efficiently solve some matrix equations. My situation is that I have a matrix $\textbf{H} = \textbf{J}^T \textbf{J}$, where $\textbf{J}$ is a matrix with no ...
sourtin's user avatar
  • 123
-1 votes
1 answer
492 views

Upper bound on iterations count for power iteration algorithm

I'm stuck trying to get upper bound on iterations count for power iteration algroithm for finding first eigenvalue of adjacency matrix $A$ given tolerance value. I've tried to figure something out ...
TotalNoob's user avatar
12 votes
0 answers
825 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 ...
Wolfgang's user avatar
  • 13.4k
22 votes
4 answers
5k 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 ...
Wolfgang's user avatar
  • 13.4k
20 votes
6 answers
42k 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} & \ddots & \vdots \\\ 0 & b_{2} & a & \...
FlamingWilderbeest's user avatar
2 votes
0 answers
132 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$ ...
jqka's user avatar
  • 21
0 votes
1 answer
139 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 ...
Felix Goldberg's user avatar
9 votes
1 answer
3k views

Connection between eigenvalues of matrix and its Laplacian.

Hello! There are two definitions of graph spectrum: 1) Eigenvalues of adjacency matrix $A$. 2) Eigenvalues of Laplacian of adjacency matrix ($L$). Different sources offer different properties based ...
TotalNoob's user avatar
10 votes
1 answer
1k views

Relationship between eigenvalues of $A-B$ and eigenvalues of $A^2-B^2$

Let us suppose that $A_{n}$ and $B_n$ are sequences of positive definite matrices satisfying $$c \leq \lambda_{\min}(A_n)\leq \lambda_{\max}(A_n)\leq C$$ and $$c \leq \lambda_{\min}(B_n)\leq \...
Jefflee's user avatar
  • 103
5 votes
1 answer
2k views

Condition for block symmetric real matrix eigenvalues to be real

I have a $2n \times 2n$ 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_{...
Giulia's user avatar
  • 151
8 votes
1 answer
7k views

Upper bound on largest eigenvalue of a real symmetric $n \times n$ matrix with all main diagonal entries positive, everywhere else nonpositive

Is there a good analytic upper bound on the largest eigenvalue of a real symmetric n*n matrix with all main diagonal entries strictly positive, all other entries <=0 with typically many of them ...
equest's user avatar
  • 83
2 votes
0 answers
1k views

Eigenvalue problem for symmetric block tridiagonal matrices?

Is there a procedure to find the eigenvalues of $\textbf{M}$? ‎ $$\begin{eqnarray} ‎\textbf{M}=\left[‎ ‎\begin {array}{ccccc}‎ ‎\textbf{A} & \textbf{B} & & &\\‎ ‎\...
Mojtaba's user avatar
  • 21
8 votes
2 answers
15k views

Upper bounds on eigenvalues of PSD matrix?

Suppose A is a symmetric positive semidefinite matrix. Is there a way to upper bound the largest eigenvalue using properties of its row sums or column sums? For instance, the Perron–Frobenius ...
Yisong Yue's user avatar
3 votes
0 answers
221 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 ...
Maniacka's user avatar
2 votes
1 answer
158 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 ...
Maniacka's user avatar
36 votes
2 answers
32k views

Eigenvalues of the product of two symmetric matrices

This is mostly a reference request, as this must be well-known! Let $A$ and $B$ be two real symmetric matrices, one of which is positive definite. Then it is easy to see that the product $AB$ (or $BA$...
kjetil b halvorsen's user avatar
2 votes
1 answer
8k views

Properties of eigenvalues of general nonnegative matrices

I am aware, that an answer to this question can be found via Perron-Frobenius theory or something very similar, but unfortunately I am far from being an expert in the field and I am unable to find the ...
042's user avatar
  • 83
11 votes
3 answers
1k views

Maximum singular value of a random $\pm 1$ matrix

Define a matrix $\mathbf{A} \in \mathbb{R}^{m \times n}$ such that each element is independently and randomly chosen with probability $\frac 12$ to be either $+1$, or $-1$. Do you know any result in ...
Kostas's user avatar
  • 199
6 votes
0 answers
465 views

Spaces of matrices with same eigenvalue/Great circles in O(n)-orbits

Let $Sym^2(V)$ be the set of symmetric matrices of a real $n$-dimensional vector space $V$. Given an element $\underline{\lambda}=[\lambda_1,\ldots \lambda_n]\in \mathbb{RP}^n$, where $\lambda_1\leq\...
CuriousUser's user avatar
  • 1,452
5 votes
2 answers
2k views

rank-one perturbation of a matrix corresponding to a specific spectrum

Let $A$ be a real symmetric matrix whose spectrum is $\lambda_1,\lambda_2,\ldots,\lambda_n$. Let $A'$ be the matrix obtained by adding a perturbation to $A$. The requirement is that only the second ...
Vedarun's user avatar
  • 111
19 votes
1 answer
2k views

Smallest eigenvalue of a tricky random matrix

While experimenting with positive-definite functions, I was led to the following: Let $n$ be a positive integer, and let $x_1,\ldots,x_n$ be sampled from a zero-mean, unit variance gaussian. Consider ...
Suvrit's user avatar
  • 28.6k