Skip to main content

All Questions

Filter by
Sorted by
Tagged with
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
4 votes
2 answers
477 views

Non-asympototic version of Gelfand's formula

Let $A$ be a $n\times n$ matrix. Let $\|A\|$ be the spectral norm of $A$, and $\rho(A)$ be the spectral radius. I am wondering whether the following statement is true. There exists universal ...
Alex Wenxin Xu's user avatar
4 votes
1 answer
1k views

complexity of computing the singular vector corresponding to the smallest singular value

It is known that the singular value decomposition of an $m \times n$ matrix $A$ is in general of complexity of the order $m n^2$, assuming that $m \ge n$. But what if we only want to compute say the ...
Manos's user avatar
  • 398
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,251
3 votes
0 answers
115 views

Recovering the matrix when the Schur decomposition of its blocks are known

Let E be a real symmetric matrix in $M_n(\mathbb{R})$ where $ n=2m$ and $$E=\left(\begin{array}{cc} G & X \\ X^t & H \end{array}\right)$$ where $G,H,X$ are $m\times m$ matrices. Suppose that $...
ABB's user avatar
  • 4,058
2 votes
1 answer
112 views

The eigenvectors of adding a particular rank one matrix to the circulant matrix

Suppose that $e_1, \cdots, e_n$ are the standard vectors of the Euclidean space $\mathbb{R}^n$. Let us consider the backward shift operator $T:\mathbb{R}^n\to \mathbb{R}^n$ given by $Te_k=e_{k-1}$ ...
ABB's user avatar
  • 4,058
2 votes
1 answer
141 views

On the eigen vectors of a diagonalizable matrix

Let us consider the space $M_n(\mathbb{C})$. By a unitary matrix $U=(u_{ij})$ we mean that $U^{-1}=(\overline{u_{ji}})$. Q. Let $U$ be a unitary matrix. I am looking for the pairs of matrices $(D,A)$ ...
ABB's user avatar
  • 4,058
2 votes
0 answers
86 views

Smallest eigenvalue of certain PD matrix decreases under sparse perturbation

Let $\omega_1<\dots<\omega_n\in\mathbb{R}$. Then, define $G\in\mathbb{C}^{n\times n}$ such that $G_{k\ell}=\frac{1}{1-i(\omega_\ell-\omega_k)}$. For example, if $n=3$ we obtain $$ G=\begin{...
PIII's user avatar
  • 83
2 votes
0 answers
251 views

Infinite positive matrices with probability eigenvector

Let $A$ be an infinite non-negative matrix with integer entries ($a_{ij} \geq 0, \forall i,j \in \mathbb N$). Suppose that $A$ is irreducible, aperiodic, and recurrent. So that it satisfies the ...
SIB's user avatar
  • 351
2 votes
0 answers
301 views

Eigenvector of Hadamard matrix functions

Let $X\in\mathbb{R}^{n\times n}$ with SVD $X=UDV^T$. Are there known results regarding the eigenvectors of $Y=X^{\odot g}$? I am mainly interested in simple functions such as $g(z)=z^2$, i.e. $Y_{ij}=...
JZRedw's user avatar
  • 21
1 vote
1 answer
2k views

Eigenvalues of adjacency matrix of a k-regular graph

If $A_G$ is the adjacency matrix of a k-regular graph, let $B = J+xA_G$, where J is the matrix whose elements are all 1s and $x\in R$ is a scalar. If $\lambda_1\geq\lambda_2\geq \dots \geq \lambda_n$ ...
RayyyyySun's user avatar
1 vote
1 answer
437 views

Eigenvector of a nonnegative matrix in closed form

Consider $n\times 1$ vector $\alpha = (\alpha_{1}, ..., \alpha_{n})$, where $0<\alpha_{i}<1$, and $\sum_{i=1}^{n}\alpha_i = 1$. Construct the $n\times n$ zero-diagonal matrix $A$ with $(i,j)$-th ...
Abhishek Halder's user avatar
1 vote
1 answer
468 views

Trace minimization for generalized eigenvalue problem

In [1], it is shown in theorem 1.2 that for symmetric $n \times n$ matrices $A$, $B$, we have $$ \min_{Y \in Y^*} \text{tr}(Y^TAY) = \text{tr}(X^TAX) = \sum_{i=1}^p \lambda_i, $$ with $$ \text{ $X^...
drommedaris's user avatar
1 vote
1 answer
77 views

Efficient way to compute eigenvalue decomposition for following problem

I have an optimization problem $$\begin{array}{ll} \text{minimize} & Tr(X^TAX) \\ \text{subject to} & X^TX=I \end{array}$$ where $A\in R^{n \times n}$ and it is symmetric positive definite, ...
jason's user avatar
  • 111
1 vote
1 answer
136 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, ...
Penghui Yao's user avatar
0 votes
2 answers
737 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 ...
Nicolas's user avatar
0 votes
1 answer
75 views

The spectrum of the product $JA$ where $J=I_n\oplus (-I_n)$

Let $A$ be a real symmetric matrix in $M_{2n}(\mathbb{R})$with $A^2=I_{2n}$. Suppose that the Schur decomposition of $A$ is given by $A=\Lambda^t D \Lambda$. Let us consider the following matrix. $$...
ABB's user avatar
  • 4,058
0 votes
1 answer
343 views

Norm bound on eigen-vector change caused by rank-one update

Suppose $A$ is a positive semi-definite, Hermitian matrix with a unit-norm eigen vector $\textbf{v}$ corresponding to its largest eigen value $\lambda$. Let $B = A + \alpha \textbf{z}\textbf{z}^H$, ...
Arun's user avatar
  • 1
0 votes
0 answers
108 views

The eigenstructure of the symmetric tridiagonal matrix whose entries are $a_{kk}=\cos\frac{k\pi}{n+1}$ and $$a_{1,2}=\cdots=a_{n-1,n}=1$$

Suppose that $A=(a_{kl})_{k,l=1}^n$ is a symmetric tri-diagonal matix in $M_n(\mathbb{R})$ whose diagonal entries are $a_{kk}=\cos\frac{k\pi}{n+1}$ and $$a_{1,2}=\cdots=a_{n-1,n}=1$$ Any approach to ...
ABB's user avatar
  • 4,058
0 votes
0 answers
125 views

Eigenvectors of the symmetric tridiagonal matrices whose entries above the diagonal are all the same

Let us consider the real symmetric tridiagonal matrix $T=(t_{kl})$ in $M_n(\mathbb{R})$ with $$t_{1,2}=t_{2,3}=\cdots=t_{n-1,n}=1$$ How can we compute the eigenvectors of $T$?
ABB's user avatar
  • 4,058