The tag has no wiki summary.

learn more… | top users | synonyms (1)

2
votes
1answer
321 views

Gaussian kernel eigenfunctions

I'm a newbie and may be this question is bit simple for you but pardon me if it's too simple and provide me some references. What is the eigenfunction of a multivariate Gaussian kernel: ...
3
votes
0answers
78 views

Classes for which the Spectrum determines a Convex Shape

Given a planar domain $\Omega \subset \Bbb{R}^2$ bounded and open we can associate to it the spectrum of the Laplace operator with Dirichlet boundary condition. It is known that there are planar ...
2
votes
0answers
141 views

Distributions of eigenvalues for matrix normal distribution: related references

I am interested in the distribution of the eigenvalues of matrices that are sampled from the matrix normal distribution. I am sampling from $p(X \mid M,U,V)$ and let's assume that I know the ...
1
vote
2answers
107 views

Is Rellich's function valued theorem valid for a rank defficient function valued matrix?

Theorem (Rellich). Let $\boldsymbol{A}(t) : \mathbb{R}\rightarrow\mathbb{C}^{n \times n}$ be a Hermitian matrix function that depends on $t$ analytically. (i) The $n$ roots of the characteristic ...
8
votes
1answer
901 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 ...
1
vote
1answer
123 views

derivative of the dominant eigenvalue

In my reaseach, recently, I came across of this problem where I have to compute, analytically, the derivative of the dominant eigenvalue of the following matrix. Let $D$ be a diagonal real $n ...
2
votes
1answer
99 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 ...
0
votes
1answer
84 views

Independence of Eigenvalues of Wishart

This question regards a previous post, but it is not immediately obvious the two are related, so I ask it anyways: are the eigenvalues of a Wishart matrix $\mathbf{S}$ $=$ ...
1
vote
2answers
212 views

Eigenvalue computation using inverse iteration

I have a positive definite matrix $A$. I need to compute the max eigen value of $A$ using inverse iteration. The problem is that there are duplicate maximum eigen values and so inverse iteration ...
5
votes
1answer
210 views

Separating the spectrum of a Hermitian matrix

Given Hermitian matrix $A$, I would like to perturbate it so that its eigenvalues become well-separated. Specifically, let $A$ be some Hermitian matrix, and let $G$ be a Gaussian matrix, with each ...
2
votes
1answer
189 views

quadratic programming on hypercube

I want to maximize a quadratic form $\mathbf x^T\mathbf Q\mathbf x$ and also want to find out which vector $\mathbf x$ maximizes the quadratic form when $\mathbf Q$ is an $n\times n$ positive ...
2
votes
3answers
383 views

Analytic perturbation of the eigenvalues/eigenvectors of non-Hermitian matrix

Consider a matrix function $A(x)$, analytically depending on single parameter $x$. Consider the eigenvalue/eigenvector pair of $A(0)$, namely $\lambda(0)$ and $w(0)$. The question is whether we can ...
2
votes
0answers
140 views

What would be a better method for numerical diagonalization of a certain Vandermonde-like matrix?

For the fractional iteration of the $\exp()$-function Hellmuth Kneser had 1942 proposed an analytic solution valid on the real numbers; there is a technical implementation for Pari/GP of this method ...
3
votes
2answers
275 views

Eigenvectors and eigenvalues of Tridiagonal matrix with varying diagonal elements

is it possible to analytically evaluate the eigenvectors and the eigenvalues of a tridiagonal $n\times n$ matrix of the form : \begin{pmatrix} 1 & b & 0 & ... & 0 \\\ b & 2 ...
2
votes
1answer
171 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 ...
2
votes
3answers
275 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 ...
2
votes
0answers
394 views

eigenvalues of a symmetric tridiagonal matrix with zero diagonals

I was investigating a problem and came up with the following symmetric tridiagonal matrix (with zero diagonal elements): $$ \left(\begin{array}{cccccc} 0 & a & 0 & \ldots & 0 \\ a ...
0
votes
1answer
75 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)}; ...
4
votes
1answer
227 views

A complex sequence with positive values

Let $\lambda_1,\dots,\lambda_d$ be complex numbers that constitute the spectrum of a nonnegative integer matrix, and $P_1,\dots, P_d$ be complex polynoms, such that the sequence $$u_n=\Sigma_{i=1}^d ...
3
votes
2answers
392 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 ...
-2
votes
3answers
327 views

relationship between eigenvalues/eigenvectors of A, B and AB [closed]

What is the eigenvalue/eigenvector relationship between matrix A,B and AB?
2
votes
2answers
152 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 ...
4
votes
1answer
198 views

Lower bounds on matrix eigenvalues

Let $A$ be a real $n\times n$ matrix and let $\mu_1, \dots, \mu_n$ the (generalized, complex) eigenvalues of $A$. Assume that $$ 0 < \alpha < \mathrm{Re}(\mu_1) < \dots < ...
1
vote
0answers
68 views

Effect of removing a Hamiltonian cycle on the Laplacian spectrum

Notation: $\lambda_{\max}(G)$ is the largest eigenvalue of the Laplacian matrix of the graph $G$ (aka the Laplacian index of $G$). Now suppose $G$ is a Hamiltonian graph with Hamiltonian cycle $C$. ...
1
vote
0answers
100 views

positiveness of the inverse solution to Sylvester equation

I need to construct a non-negative matrix with desired eigenvalues. To that end, I came up with a block matrix of the following form: $$ \mathbf{M} = \begin{vmatrix} \mathbf{A} & \mathbf{b} \\\ ...
-1
votes
1answer
224 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 ...
8
votes
0answers
307 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
4answers
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 ...
3
votes
1answer
240 views

Matrix norms / eigenvalues / singular values / another thing

OK, here is what is probably a stupid question. Let $M$ be a non-symmetric real matrix: for example, the shear matrix $\left( \begin{array}{cc} 1 & 1 \\\ 0 & 1 \end{array} \right)$. There ...
0
votes
2answers
251 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 ...
0
votes
1answer
191 views

Can an accumulation point be an eigenvalue?

For an discrete (separable) infinite-dimensional Hilbert Space with a compact operator, 0 is always an accumulation point (https://www.math.ucdavis.edu/~hunter/book/ch9.pdf). Does this mean its part ...
1
vote
0answers
60 views

Which matrix/operator in a cone has the largest negative spectral part?

Background: Let $\mathcal{K}$ be set (convex cone, if you like) of symmetric matrices of order $n$. Each matrix $A \in \mathcal{K}$ can be decomposed in a unique way as $A=A_{+}-A_{-}$, where ...
1
vote
0answers
74 views

On generalization of Wigner semi circle

I want to analyse noise model for a matrix M whose entries are not real numbers. The matrix is a collection of N permutation matrices of size nxn i.e, M is NnxNn. Because its a collection of ...
4
votes
2answers
188 views

No Exceptional Eigenvalues of Weight 1/2 Maass Forms on $\Gamma_0(4)$?

Some colleagues and I were wondering if there is a citation out there which shows there are no exceptional eigenvalues, $\lambda$, of classical weight 1/2 Maass forms on $\Gamma_0(4)$, which is to say ...
1
vote
0answers
111 views

nodal lines in the dirichlet problem

In the Dirichlet problem if nodal lines do not touch $\partial\Omega$ (unit disk), what happens to the eigenvalues? Thanks for help.
0
votes
1answer
164 views

eigenvalues of two nonnegative matrices

Let $A$ and $B$ be symmetric non-negative matrices. If $A\geq B$ (i.e., $A-B$ is a nonnegative matrix), can we say that $\lambda_i(A) \geq \lambda_i(B)$ for all $i$, where $\lambda_i$ denotes the ...
2
votes
1answer
776 views

Non symmetric matrices with real eigenvalues

Consider the following block matrix $A=\pmatrix{A_1 & A_2\cr kA_2^\top & A_3}$ where $A_1$ is a symmetric matrix, $A_3$ is diagonal matrix and all entries of $A$ are real and non-negative. ...
2
votes
1answer
571 views

Eigenvalues of directed Laplacian matrix $L$ and $DL$, where $D$ is a diagonal matrix with positive entries

I have a weighted Laplacian matrix $L$ of a strongly connected directed graph and a diagonal matrix $D$ with positive entries. Since the graph is directed, $L$ is non-symmetric real. Further, since ...
1
vote
0answers
77 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$ ...
2
votes
1answer
188 views

Multiple eigenvalues over imperfect fields

Let $K$ be a field. For a matrix $A\in GL_n(K)$ we can find the Jordan normal form $A'$ in $GL_n(\overline{K})$, where $\overline{K}$ is the algebraic closure of $K$. We write $j_\alpha(A)$ for the ...
0
votes
0answers
155 views

Summation of eigenvalues of tri-diagonal matrix smaller than specific value

Is there any analytic expression for summation of eigen-values of a tri-diagonal matrix which are smaller than a constant value? Or even a rough approximation for it. How about case of a general ...
1
vote
0answers
65 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
109 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
67 views

Laplacian using SDP

Is there any suggestion about how could one construct a model that uses semidefinite programming that minimizes sum of k smallest eigenvalues of Laplacian matrix? I found two papers that have done ...
0
votes
1answer
1k views

Can the first non-zero eigenvalue of a Laplacian matrix with more than 1 zero valued eigenvalue be used to reorder an adjacency matrix?

I have a graph with multiple connected components, and its adjacency matrix. I form the Laplacian matrix (wiki Laplacian matrix), and from the 1K nodes there around ...
0
votes
0answers
244 views

Calculating entropy of adjacency matrix using eigenvalue decomposition?

How to calculate entropy using the eigenvalues when the eigenvalues are negative? Is there a simple relation between the entropy of a matrix and its characteristic polynomial?
0
votes
1answer
429 views

eigenvalues of a diagonal matrix times a matrix

Suppose we are multiplying matrix $A$ with a diagonal matrix $D$ from left, i.e., $X=D A$ where $D$ is a diagonal matrix with elements $$d_{ii}=\frac{1}{2} \text{ for } i=1,n$$ ...
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
646 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 ...