Skip to main content

All Questions

63 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
13 votes
0 answers
809 views

Can one Gershgorin circle (only) contain all eigenvalues, when the other circles are not contained in it

In short, following a question from my students, I am trying to find a special case where all the eigenvalues of a matrix lie within only one circle, but not in the others, and the other circles are ...
Itay's user avatar
  • 673
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
10 votes
0 answers
237 views

Generalized eigen property of a matrix

Given a $n \times n$ invertible matrix $A$, I am interested in the set $$ \mathcal{S}(A) = \{ D \textrm{ diagonal matrix } \mid \det(D - A) = 0 \}. $$ Thus, for all eigenvalues $\lambda_i$, we have $...
Jiro's user avatar
  • 909
9 votes
0 answers
624 views

Eigenvalues of leading principal submatrix of the Clement-Kac-Sylvester tridiagonal matrix

It's well-known that the eigenvalues of the Clement-Kac-Sylvester tridiagonal matrix $$\begin{pmatrix} 0 & n-1 & 0 & \dots & 0 \\\ 1 & 0 & n-2 & \dots & 0\\\ 0 & ...
Sihuang Hu's user avatar
7 votes
0 answers
195 views

Hölder continuity of spectrum of matrices

Endow $\mathbb{C}^{d \times d}$ with the norm induced by the Euclidean norm on $\mathbb{C}^d$. It is well-known (to those who know it well, I guess) that the spectrum $\sigma(A)$ of a matrix $A \in \...
Jochen Glueck's user avatar
7 votes
0 answers
906 views

The Möbius function as eigenvalues

Let the $N$ by $N$ matrix $A$ be defined by the tetration: $$\Large \text{If } \gcd(n, k)=1 \text{ then } A(n,k)= \underbrace{e^{e^{\cdot^{\cdot^{e^{\Re\left(\frac{1}{n^s}\right)}}}}}}_m \text{ else }...
Mats Granvik's user avatar
  • 1,183
7 votes
0 answers
264 views

Bound on gap between least eigenvalues of $n \times n$ correlation matrix and of its $(n -1) \times (n-1)$ submatrices

The following problem is motivated by one of my research problems. Let $\Sigma$ be an $n \times n$ correlation matrix whose least eigenvalue is denoted by $\lambda$. $\Sigma_i'$ be an ...
Saurabh Agrawal's user avatar
6 votes
0 answers
96 views

Finding the maximal component of a vector in sublinear time

Given a vector $u \in \Bbb R^n$, finding the value of the largest component of $u$ needs linear time in $n$. However, what if we additionally know that $u$ lies in some linear subspace $U \subset \Bbb ...
M. Winter's user avatar
  • 13.6k
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
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
989 views

Lower bound minimum eigenvalue of a positive semi-definite Hermitian matrix with bounded entries

Let $M \in \mathbb{C}^{n \times n}$ be a matrix with the following properties: $M$ is Hermitian and positive semi-definite (all the eigenvalues are real and nonnegative). The diagonal entries of $M$ ...
getraparth's user avatar
4 votes
0 answers
447 views

How to find eigenvalues of following block matrices?

Is there a procedure to find the eigenvalues of A? ‎ $$A=\begin{bmatrix}X & I &&&&&&&&& 0\\I & 0 & P &&&&&&&&\\& P^t ...
Maryam Hak's user avatar
4 votes
0 answers
284 views

Maximizing a certain eigenvalue ratio

Let $A\in\mathbb{R}^{n\times n}$ be an Hurwitz stable matrix (i.e., the spectrum of $A$ lies on the left-half complex plane) and let $P$ be the unique positive definite solution of the following ...
Ludwig's user avatar
  • 2,712
4 votes
0 answers
2k views

What is the time complexity of the largest singular value and its vectors?

Full zero-error SVD on an $m \times n$ matrix $A$ would cost $O(\min(m^2n,mn^2))$. What is the time complexity if we need only the largest singular value and its corresponding vectors? I think it is $...
B. Arsic's user avatar
  • 123
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
3 votes
0 answers
374 views

Eigenvalues of block matrix

Given scalars $\alpha, \beta \in \mathbb{R}$, a symmetric positive definite matrix $A \in \mathbb{R}^{n\times n}$ and a flat matrix $B \in \mathbb{R}^{m\times n}$, where $m < n$, can I say ...
Trb2's user avatar
  • 125
3 votes
0 answers
1k views

Eigenvalues of block-hermitian matrices with zero diagonal blocks

I have a matrix of the form $$D = \left( \begin{array}{cc} 0 & C \\ C^{\dagger} & 0 \end{array} \right)$$ where $C$ is not necessarily hermitian. In general, can we say anything about the ...
Unwieldy Bob's user avatar
3 votes
0 answers
220 views

Eigenvalues and eigenvectors of nonsymmetric complex tridiagonal matrix

I wonder if it is possible to find analytically all eigenvalues and eigenvectors of the following $2n \times 2n$ non-symmetric complex tridiagonal matrix $$M = i \begin{pmatrix} 0 & a & 0 &...
V. M. Martinez Alvarez'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
0 answers
69 views

Unimodular eigenvalue of a H-self-adjoint matrix (indefinite innerproduct)

Let $A,H \in \mathbb{C}^{n \times n}$ be such that $H$ is Hermitian and invertible and $A = H^{-1} A^* H$. In this case, $A$ is said to be $H$-self-adjoint. This is due to the fact that if $\langle \...
Leo's user avatar
  • 175
2 votes
0 answers
121 views

Eigenvalues of two positive-definite Toeplitz matrices

Consider two positive-definite Toeplitz matrices $M_1$ and $M_2$ both with dimension $2^j \times 2^j$. Their matrix elements are: $$M_1[x,y] = \frac{\text{sin}(\pi(x-y)/2^j)}{\pi(x-y)} \qquad M_2[x,y] ...
Chriscrosser's user avatar
2 votes
0 answers
345 views

Extension of the Gershgorin circle theorem for symmetric matrices and localization of positive eigenvalues

In mathematics, the Gershgorin circle theorem can be used to localize eigenvalues of a matrix (including symmetric). Let $A$ be a real symmetry $n × n$ matrix, with entries $a_{ij}$. For $i∈{1,…,n}$ ...
ayr's user avatar
  • 145
2 votes
0 answers
81 views

Perturbed Gram matrix

Let $x_t \in \mathbb{S}^{d-1}$, $\forall t\in \mathbb{N}$ and let $e_1$ be the first canonical basis vector of $\mathbb{R}^d$, ie, $e_1 = (1,0,\cdots,0)$. Let us form a Gram Matrix $$\sum_{t=1}^T(x_t ...
rostader's user avatar
  • 215
2 votes
1 answer
401 views

Eigenvalue perturbation under sparse perturbations

Let $A \in \{0,1\}^{n \times n}$ be an irreducible matrix whose entries are in $\{0,1\}$, and let $\lambda_1(A)$ be the eigenvalue with the largest magnitude. By Perron–Frobenius theorem, we know that ...
R. Davis's user avatar
2 votes
0 answers
106 views

Connections between eigenvalues of $B$ and $A+iB$

Consider two symmetric and real matrices $A,B\in\mathbb{R}^n$ and definie $A+iB$. Note that $A+iB$ is not hermitian in this case. There are many results based on Brendixson and Courant-Fischer, saying,...
Stephan's user avatar
  • 21
2 votes
0 answers
146 views

Upper bound on some eigenvalue problem

Let $A_1,\ldots,A_m \in R^{n\times n}$ be symmetric and positive semidefinite, and suppose that their sum $A$ is positive definite. For some nonzero vector $u\in R^n$ with $u^TA_ju>0$ for all $j$, ...
Arnold Neumaier's user avatar
2 votes
0 answers
52 views

Large-scale projected minimum-eigenvalue computations

I am interested in efficient numerical procedures for solving large-scale instances of the following projected minimum-eigenvalue problem: $$\mu := \min_{v \in \mbox{ker}(A)} \frac{v^T H v}{\lVert v \...
David Rosen's user avatar
2 votes
0 answers
330 views

Eigenvalues of special sum of Hermitian matrices

In my research on linear algebra and its applications, I have come across the following problem which has stumped me: Let $ A $ be a positive definite matrix and let $ D $ be a positive diagonal ...
groupoid's user avatar
  • 620
2 votes
0 answers
550 views

Eigenvalues of a specific Hankel matrix

I have an $\frac{N}{2} \times \frac{N}{2}$ matrix $G$ with entries given by \begin{equation} G_{ij} = \frac{1}{\sin(\frac{\pi}{N}(i+j-\frac{3}{2}))}, \;\;\;\;\;\;\;\; 1 \le i,j \le \frac{N}{2}, \end{...
Marc's user avatar
  • 101
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
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
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
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
1 vote
0 answers
64 views

Reference request for non-banded Toeplitz matrix

I want to know references that treat the property of eigenvalues and eigenstates of the non-banded Toeplitz matrix. I mean for example, the Toeplitz matrix $A$ whose matrix element is given by $A_{ij}=...
hos's user avatar
  • 11
1 vote
0 answers
223 views

Fastest algorithm for finding the closest semi-definite matrix?

Given a real-valued, symmetric matrix $A \in \mathbb{R}^{n \times n}$, I'm interested in finding the closest positive semi-definite matrix $X^*\in \mathbb{R}^{n \times n}$: $$ X^* = \mathop{\text{...
Alec Jacobson's user avatar
1 vote
0 answers
179 views

QR algorithm for eigenvalues and eigenvectors of large symmetric matrices

I am trying to write a QR algorithm in Python for eigenvectors and eigenvalues finding for large symmetric matrices, My initial thought was to use Householder transformation with a Wilkinson shift ...
Daniel Belaish's user avatar
1 vote
0 answers
114 views

Higher dimensional Cauchy interlacing theorem

If $A$ is a Hermitian matrix and $A_j$ the principal minor with the $j$ row and column deleted and $\phi_A(x)$ the characteristic polynomial. The Cauchy interlacing iheorem states that the roots of $\...
CHUAKS's user avatar
  • 1,362
1 vote
0 answers
49 views

Bounds on Eigenvalues After Skew-Symmetric Perturbation

Consider two matrices $\mathbf{J} \in \mathbb{R}^{n \times n}$ and $\mathbf{L} = -\mathbf{L}^T \in \mathbb{R}^{n \times n}$. I am trying to upper bound the eigenvalues of their sum: $$\mathbf{A} = \...
Leo's user avatar
  • 11
1 vote
0 answers
163 views

An estimation of the largest eigenvalue of a submatrix of $\left(\cos(\frac{kl\pi}{4n})\right)_{k,l=1}^n$

Let us consider the following matrix $A=(a_{k,l})$ where $$A=\left(\cos(\frac{kl\pi}{4n})\right)_{k,l=1}^n$$ Let us consider the submatrix $A_0$ of $A$ whose entries are those $a_{k,l}$ where $k\...
ABB's user avatar
  • 4,058
1 vote
0 answers
331 views

Eigenvalues of an (almost) pentadiagonal symmetric Toeplitz matrix

I am looking for analytic expressions for the eigenvalues of matrices of the form $$A = \begin{bmatrix} 6 & -4 & 1 & 0 & 0 & 0 & 0 \\ -4 & 6 & -4 & 1 & 0 &...
E_Wijler's user avatar
1 vote
0 answers
373 views

Upper bound on the sum of the smallest non-zero eigenvalues

Let $\mathcal A := \{ A_1, A_2, \dots, A_n \} \subset \Bbb R^{d \times d}$ be a set of symmetric and positive semidefinite matrices. For a matrix $A_k \in \mathcal A$, denote its (real) eigenvalues by ...
Apprentice's user avatar
1 vote
0 answers
39 views

Characterisation of Coxeter matrices with all non-real eigenvalues having absolute value 1

Let $C$ be an invertible integer matrix. Then a matrix $M$ is called Coxeter matrix (following Sato in https://www.sciencedirect.com/science/article/pii/S0024379505001709?via%3Dihub ) when $M=-C^{-1} ...
Mare's user avatar
  • 26.5k
1 vote
0 answers
126 views

Fastest way to calculate the eigenvalues of a product of two Toeplitz matrices

I have the following problem: I need to find the fastest way to calculate the eigenvalues of a matrix that is the product of two Toeplitz matrices. $B = A U$. The first is a regular Toeplitz matrix $A$...
Enea Olati's user avatar
1 vote
0 answers
132 views

Transformations preserving the number of distinct eigenvalues

Let $A\in\mathbb{R}^{n\times n}$ be an $n\times n$ symmetric, invertible matrix with nonnegative real entries, $\mathbf{1}$ be the all one $n$-dimensional vector, and $\mathrm{diag}(v)$, $v=[v_1,v_2,\...
Ludwig's user avatar
  • 2,712
1 vote
0 answers
152 views

Bound for Expectation of Singular Value

In my case, $X_{\boldsymbol{\delta}}\in\mathbb{R}^{d\times M}$ is a function of Rademacher variables $\boldsymbol{\delta}\in\{1,-1\}^M$ with $\delta_i$ independent uniform random variables taking ...
lee's user avatar
  • 53
1 vote
0 answers
86 views

Solution of a manipulated equation vs the maximum eigenvalue and eigenvector of a non-negative matrix

Lets assume we have the following equation: $AU=\lambda U \Rightarrow\left[ \begin{array}{c|c|c} 0 &A_{12}&A_{13}\\ \hline A_{21}& 0& A_{23}\\ \hline A_{31}&A_{32}&0 \end{...
afra's user avatar
  • 21
1 vote
0 answers
171 views

Eigenvalues of non-negative block matrices

$B$ is a non-negative irreducible block matrix as follows: $$B= \left[ \begin{array}{c|c|c} 0 &B_{12}&B_{13}\\ \hline B_{21}& 0& B_{23}\\ \hline B_{31}& B_{32}&0 \end{array} \...
afra's user avatar
  • 21
1 vote
0 answers
359 views

Sufficient conditions for all eigenvalues simple in stochastic matrix

The "largest" eigenvalue $1$ of a stochastic matrix is well-characterized by the classical Perron-Frobenius theorem. In particular, it gives sufficient conditions for the eigenvalue $1$ to be simple. ...
Randomguy's user avatar
1 vote
0 answers
19 views

Empirical approaches to validate observational bounds on minimum gap between least eigenvalues of $n \times n$ correlation matrix and its submatrices

Let $\Sigma$ be an $n \times n$ correlation matrix whose least eigenvalue is denoted by $\lambda$. $\Sigma_i'$ be an $(n-1) \times (n-1)$ submatrix of $\Sigma$ obtained by eliminating the $i$-th row ...
Saurabh Agrawal's user avatar
1 vote
0 answers
398 views

Center of matrices

I encountered a neat problem in a problem in particle physics So given $n$ skew symmetric matrices $A_1,...,A_n$ in $\mathbb{C}^{d \times d}.$ I would like to call this the commutator property: $...
Theophile1987's user avatar