The tag has no wiki summary.

learn more… | top users | synonyms

3
votes
1answer
300 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}\\\ ...
2
votes
2answers
674 views

Singular Value Decomposition of Noisy Matrices

I am an engineer who makes measurements of a variable over a grid of, say, $m\times n$. Since these are actual measurements, the true values are always corrupted by noise, and what I measure is a ...
4
votes
2answers
718 views

Eigenvalues of a Symmetric Positive Semi-Definite (PSD) matrix after rank one update

I have a Symmetric Positive Semi-Definite matrix $A$ which i know its eigenvalue and eigenvectors. let $v$ and $u$ be a random column vector. i want to know if it is possible to have eigenvalues of ...
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 ...
1
vote
2answers
452 views

can eigenvector be found without computing the eigenvalue [closed]

Is there any ways to compute the eigen vector without computing explicitly the associated eigenvalue? Actually, I'd like to compute the largest eigenvalue of a positive matrix from its eigen vector, ...
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 ...
1
vote
2answers
702 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 ...
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 ...
2
votes
0answers
216 views

Common eigenvector

I have little experience with functional analysis beyond an undergraduate basic course, and I'm dealing with the following problem: let $V$ be an infinite-dimensional locally convex (but not normed!) ...