The study of real and complex matrices and their algebraic and analytical properties, including: eigenvalues and eigenvectors, positive definite matrices, matrix inequalities, invariant subspaces, perturbation analysis, matrix functions.

learn more… | top users | synonyms

4
votes
4answers
1k views

The multiplicity of the max eigenvalue in matrix multiplication

Suppose that eigenvalues of two real square matrix $A$ and $B$ are $1 = \lambda^A_1 > \lambda^A_2 \geq \ldots \geq \lambda^A_n > 0 $ and $1 = \lambda^B_1 > \lambda^B_2 \geq \ldots \geq ...
12
votes
2answers
490 views

Optimizing the condition number

Suppose I have a set $S$ of $N$ vectors in $W=\mathbb{R}^m,$ with $N \gg n.$ I want to choose a subset $\{v_1, \dots, v_m\}$ of $S$ in such a way that the condition number of the matrix with columns ...
6
votes
1answer
373 views

The singular values of the Hilbert matrix

The $n\times n$ Hilbert matrix $H$ is defined as $H_{ij} = \frac{1}{i+j-1}, \qquad 1\leq i,j\leq n$ What is known about the singular values $\sigma_1\geq\ldots\geq \sigma_n$ of $H$? For example, ...
5
votes
3answers
159 views

Norm of triangular truncation operator on rank deficient matrices

Let $T_{n\times n}$ be a triangular truncation matrix, i.e. $$T_{i,j}=\begin{cases}1 & i\ge j\\ 0 & i<j \end{cases}$$ It is known that for arbitrary $A_{n\times n}$ $$\|T\circ ...
5
votes
1answer
271 views

Is the p-norm of a matrix strictly log-convex?

Let $A$ be a $n\times n$-matrix. We let $\|A\|_p$ denote the norm of $A$ when considered as a linear operator on $\ell^p(\{1,2,\ldots,n\})$, that is, $$ \|A\|_p = \sup_{x\neq ...
3
votes
2answers
234 views

How to solve a non-homogeneous quadratic matrix equation?

I am looking to solve the following matrix equation for $G$ $$GHG + M = 0$$ where $G$, $H$, and $M$ are square, symmetric, real matrices. $H$ is negative-definite and $M$ is positive-definite. $G$ ...
3
votes
1answer
168 views

SDP formulation of noisy low rank matrix completion

Exact low rank matrix completion using nuclear norm minimization can be formulated as a semidefinite program (SDP). Following the notation in the paper, a convex problem for noisy matrix completion ...
1
vote
0answers
149 views

What is the Birkhoff norm of a Perron vector?

Let $A$ be a positive matrix. What is known about the Birkhoff norm of its Perron vector? By the Birkhoff norm of a vector $x$ I refer to the quantity $\frac{\max{x}}{\min{x}}$. P.S. This is ...
-2
votes
0answers
53 views

An analytic characterization of eigenvalues of a Hermitian matrix [closed]

[..the following is trying to understand a certain argument of Terence Tao in a lecture notes of his..] If $A$ is a Hermitian matrix with eigenvalues, eigenvectors $\{ \lambda_i , e_i \}_{i=1}^n$. ...