Skip to main content

All Questions

Filter by
Sorted by
Tagged with
18 votes
1 answer
1k views

A curious eigenvalue inequality

Suppose $A, B$ are positive definite Hermitian matrices, $U$ is a unitary matrix such that $AUB$ is Hermitian. The spectral radius of a square matrix $X$ is denoted by $\rho(X)$. In my study, I ...
M. Lin's user avatar
  • 1,748
1 vote
3 answers
684 views

Norm of an operator formed using a unitary operator

Suppose, $ A $ is a unitary matrix in $ M_n(\mathbb{C}) $ given by $ (a_{i,j})_{1\le i,j\le n} $ which has the property that, for all the basis elements $ e_i $, $ Ae_i\ne |\lambda| e_j $ for all $i,j ...
DLN's user avatar
  • 817
3 votes
1 answer
428 views

Inverse Hadamard determinant inequality

As far as I remembered there is an inverse Hadamard inequality for the determinant of the form $$ |D|>\prod_j \sqrt{(a_{jj}^2-\sum_{i\neq j}a_{ij}^2)} $$ providing all values in $(\cdot)>0$. ...
Sergei's user avatar
  • 1,550
3 votes
1 answer
493 views

Two minimization problems using singular value decomposition

Posted here too: https://math.stackexchange.com/questions/1711026/two-minimization-problems-using-singular-value-decomposition Let $q_0, q_1:[0,1]\to \mathbb{R}^n$ be two maps whose components are $L^...
Learning math's user avatar
11 votes
1 answer
981 views

Exact eigenvalues of a specific tridiagonal matrix

I'm studying the following tri-diagonal matrix $$ X = \begin{pmatrix} 0 & x_0 & 0 & 0 &\cdots & 0 & 0 & 0 \\\ x_0 & 0 & x_1 & 0 &\cdots & 0 & ...
Kasper's user avatar
  • 161
3 votes
0 answers
108 views

How to construct large sets of $m$-dimensional vectors over a finite field such that any $m$ of them are independent?

Let $m\ge 2$ be an integer and $\mathbb{F}$ be a finite field of order $p^k$. I want to construct as many as possible $m$-dimensional vectors $v_1,v_2,\ldots,v_n$ in field $\mathbb{F}$ such that any $...
W. Wang's user avatar
  • 103
4 votes
1 answer
506 views

Eigenvalues of large tridiagonal matrix

Consider large tridiagonal matrix (where $a$ and $b$ are real numbers): $$M = \begin{pmatrix} a^2 & b & 0 & 0 & \cdots \\ b & (a+1)^2 & b & 0 & \cdots & \\ ...
Nigel1's user avatar
  • 285
0 votes
1 answer
246 views

$P(Z)$ is matrix polynomials. Why is $s_n$ smooth in a neighbourhood of $Z$?

Let $A_j \in \mathbb{C}^{n \times n}$, ($j = 0,1,2,\ldots,m$) and $P(Z) = A_m Z^m + \cdots + A_1 Z + A_0$ is a matrix polynomial, and $Z $ is a complex variable. $Z$ is eigenvalue of $P(Z )$ if $\...
R.T MAN's user avatar
  • 151
13 votes
2 answers
1k views

A matrix norm inequality

Suppose that $A, B$ are Hermitian positive definite matrices of the same order and $0\le p\le 1$. Using a standard approach in matrix analysis, one can show that $\|A^{1-p}B^p\|\ge \|A\sharp_p B\|$, ...
M. Lin's user avatar
  • 1,748
1 vote
0 answers
517 views

Complex conjugate and unitary complex conjugate

Definition: Let V be complex finite dimensional inner product space Complex Conjugate: $J$ is called complex conjugate on V iff $(i) J$ is antilinear $(ii) J^2 =I$ Definition: Anti-unitary Complex ...
Sushil's user avatar
  • 121
3 votes
2 answers
2k views

A question on determinant of a matrix polynomial

Let ${A_j} \in {\mathbb{C}^{n \times n}},0<{w_j}\in \mathbb{R} (j = 0,1,2....m)$ and $\lambda $ is a complex variable such that $\lambda=x+iy$ and $x,y\in \mathbb{R}$. ${\rm{P(}}\lambda {\rm{) = }...
R.T MAN's user avatar
  • 151
26 votes
1 answer
1k views

Real square roots of symmetric matrices

In joint work with Andreas Fischle (TU Dresden, Germany) and Patrizio Neff (U Essen, Germany) we needed to use the following statement: If $S$ is a real $n\times n$ matrix with $S^2$ symmetric, then ...
Lev Borisov's user avatar
  • 5,186
3 votes
0 answers
560 views

On a matrix algorithm involving rank-one projections

Let $\{v_i\}_{i=1}^N$ be a set of $n$-dimensional real vectors spanning $\mathbb{R}^n$. Let $p\in [0,1]$ be a rational number and consider the iteration \begin{equation} X_{k+1}=\frac{1}{N}\sum_{i=1}^...
Ludwig's user avatar
  • 2,712
4 votes
0 answers
432 views

Spectral radius of the product of a right stochastic matrix and a block diagonal matrix

Let us define the following matrix: $C=AB$ where $B$ is a block diagonal matrix with $N$ blocks, $B_1$, $B_2$ … $B_N$, each of dimensions $M \times M$. I know that $B_k = I_M - \mu R_k$ with $R_k$ ...
user87933's user avatar
9 votes
3 answers
390 views

Is there a standard name for the following type of linear operator?

Is there a standard name for a linear operator $T$ on a finite dimensional vector space satisfying $T^n=T^{n+1}$ for some $n\geq 1$ or, equivalently, $T$ is a similar to a direct sum of a nilpotent ...
Benjamin Steinberg's user avatar
10 votes
2 answers
439 views

Growth of an integer vector under the action of a matrix in $GL_n(\mathbb{Z})$

I have some questions regarding the dynamics of elements of $GL_n(\mathbb{Z})$ acting on $\mathbb{Z}^n$. In particular, given an invertible integer matrix $M \in GL_n(\mathbb{Z})$, and given an ...
Lee Mosher's user avatar
  • 15.4k
6 votes
0 answers
587 views

Lower bound on the sum of singular values for a sum of Hermitian matrices

Denote the eigenvalues of an $n\times n$ matrix $\mathbf{X}$ by $\lambda_i(\mathbf{X})$ and its singular values by $\sigma_i(\mathbf{X})$, $i=1,\ldots,n$. When $\mathbf{X}$ is Hermitian, we know that $...
Bullmoose's user avatar
  • 907
1 vote
0 answers
137 views

Boundary of pseudospectra

Suppose: $B_i \in \mathbb{C}^{n \times n}$, $0<w_i\in \mathbb{R}$ $(i = 0,1,2,\ldots,m)$ ${\rm P}(x) ={\rm{B}_m} x ^m + \cdots + B_1 x + B_0$ is a matrix polynomial, and $x $ is a complex ...
R.T MAN's user avatar
  • 151
4 votes
0 answers
676 views

Weyl-type inequality for non-Hermitian matrices?

What is the weakest known condition under which a Weyl-type eigenvalue perturbation inequality holds? Does some analogue hold for normal matrices, for example?
Aryeh Kontorovich's user avatar
1 vote
1 answer
940 views

Uniqueness and invariance of the LDLT decomposition

A real symmetric positive semi-definite matrix $A$ can be decomposed in the form $A = P^TLDL^TP$, where $P$ is a permutation matrix, $L$ is a lower unit triangular matrix and $D$ is a diagonal ...
user3749105's user avatar
3 votes
1 answer
371 views

Eigenvectors of a perturbed reducible stochastic matrix

Let $Q$ be a $n\times n$ reducible stochastic matrix. Let $J$ be such that $[J]_{ij}={1 \over n}$. Now for a small positive constant $\alpha\in [0,1]$, consider the matrix $$\tilde{Q}\,=\,(1-\alpha)...
dineshdileep's user avatar
  • 1,421
8 votes
2 answers
12k views

Relation between eigenvalues of $A$ and $A^TA$?

For an $n\times n$ diagonizable matrix $A$, is there a relation between the eigenvalues of $A$ and the eigenvalues of $A^TA$? I ask this because I am looking into the relation between $A$ and $A+cI$, ...
Eric S.'s user avatar
  • 181
11 votes
2 answers
964 views

How to prove this determinant is positive-II?

Question: Given an arbitrary number of real matrices of the form $ A_i= \biggl(\begin{matrix} C_i+E_i & B_i \\ B_i^T & D_i-F_i \end{matrix} \biggr) $, where $B_i$ is an arbitrary $n\times n$ ...
Lei Wang's user avatar
  • 845
2 votes
1 answer
449 views

Extracting a full rank matrix from a 0-1 matrix

If $A$ is a $n\!\times\!n$ $0$-$1$ matrix of rank $k<n$. If ever possible, what would be an efficient way of extracting a full rank $k\!\times\!k$ sub-matrix of $A$ by removing columns and rows of ...
Nado's user avatar
  • 23
4 votes
1 answer
388 views

Existence of $SO(n)$-isotropic inner products which are not $O(n)$-isotropic

$\newcommand{\al}{\alpha}$ Let $M_n$ be the space of $n \times n$ real matrices. Question: For which $n$, is there an inner product on $M_n$ which satisfies: $$(*) \, \, \langle Q^TXQ,Q^TYQ \...
Asaf Shachar's user avatar
  • 6,741
7 votes
1 answer
357 views

Kolmogorov complexity for matrices

In applications one often encounters very large matrices that barely fit in computer memory, if at all. Naturally one wishes to represent those matrices as compactly as possible. Sometimes one even ...
Michael's user avatar
  • 2,205
13 votes
1 answer
1k views

An inequality for the spectral radius of matrices used by J. Bochi

I am interested in the history of an inequality for the spectral radius of a $d\times d$ real or complex matrix, which occurs in Jairo Bochi's 2002 article Inequalities for numerical invariants of ...
Ian Morris's user avatar
  • 6,206
1 vote
0 answers
96 views

Let $M = \frac{1}{2}(A + {A^T})$ be real symmetric nonnegative matrix. Why does $\rho (A) \le {\lambda _{\max }}(M)$?

Let $A \in M_n$ be nonnegative, and consider the real symmetric nonnegative matrix $M = \frac{1}{2}(A + {A^T})$. Why does $\rho (A) \le {\lambda _{\max }}(M)$?
1_1's user avatar
  • 11
1 vote
1 answer
103 views

Multiplicatively closed subsets of $\mathbb{C}^{n \times n}$

While dealing with another problem I saw that I need to classify subspaces $V$ of $\mathbb{C}^{n \times n}$ that are multiplicatively closed. So to get an idea of the nature of the subspaces I ...
Thikon's user avatar
  • 11
0 votes
1 answer
294 views

Standard rational functions from matrices

In linear algebra we get introduced to standard polynomials that are associated to matrices such as characteristic polynomials and determinants. What are some of the standard rational functions that ...
Turbo's user avatar
  • 13.9k
1 vote
0 answers
114 views

A question on Perron–Frobenius theorem [closed]

Let $A \in M_n$ is nonnegative(all $a_{ij}\ge0$). Suppose $A$ has a nonnegative eigenvector(all entries$\ge0$ ) with $r ≥ 1$ positive entries and $n − r$ zero entries. Why is there a permutation ...
user85008's user avatar
2 votes
1 answer
191 views

Heuristics for counting degrees of freedom

I have recently learned about the representation theorem for isotropic, linear operators, which says the following: Defintion: Let $M_n$ be the vector space of $n \times n$ real matrices. We say a ...
Asaf Shachar's user avatar
  • 6,741
2 votes
0 answers
715 views

When does this matrix have full rank?

Suppose $\mathbf{B}\in\left[0,1\right]^{T\times M}$ is a binary matrix, $\mathbf{B}_{i}$ is a column of $\mathbf{B}$, and $\mathbf{X}\in\mathbb{R}^{N\times T}$ is a matrix where the columns are ...
Daniel Soudry's user avatar
0 votes
2 answers
149 views

Simultaneous special orthogonal similarity problem

Given matrices $A,B,C,D\in\Bbb K^{n\times n}$ where $\Bbb K$ is a ring is there an efficient technique to compute set $O$ with $OO'=I$ where $'$ is transpose and $\mathsf{Det}(O)=\pm1$ such that $$A=...
user avatar
0 votes
0 answers
114 views

A linear combination problem

Given $0/1$ $n\times n$ matrix $M$. Suppose we have $2$ vectors $\lambda,\mu\in\Bbb R^{1\times n}$ such that both $$\lambda M\in\{0,1\}^{1\times n}$$ $$M\mu'\in\{0,1\}^{n\times 1}$$ holds with $'$ ...
user avatar
2 votes
1 answer
351 views

Eigenvalues of product of symplectic matrices

I have 2 symplectic matrices $X_{1},X_{2} \in \mathbb{R}^{2n\times2n}$. The matrix $X=X_{1} \cdot X_{2}$ is also symplectic. Question: Are there any theorems which allow me to express eigenvalues of ...
Maksim Surov's user avatar
5 votes
2 answers
629 views

Is it always possible to "separate" the eigenvalues of an integer matrix?

Call a square matrix Galois-irreducible if all its eigenvalues are Galois conjugates of each other. Let $M$ be an integer $n\times n$ matrix which is not Galois-irreducible. Is it always possible ...
Wolfgang's user avatar
  • 13.4k
9 votes
3 answers
4k views

Fast Upper Triangular Matrix Exponentiation

Let $Q_n$ be a $n\times n$ matrix with $Q_n=\begin{pmatrix} -\lambda_1-\mu_1 & \lambda_1 & 0 & \cdots\\ 0 & -\lambda_2-\mu_2 & \lambda_2 & \cdots\\ \vdots & \vdots & \...
Alex R.'s user avatar
  • 4,952
1 vote
1 answer
1k views

Approximate $\mathbf{G}=(a\mathbf{H}+\mathbf{M})^+$ by Taylor expansion [closed]

Suppose we have a complex matrix $\mathbf{M}$. Let $\mathbf{M}^+=(\mathbf{M}^*\mathbf{M})^{-1}\mathbf{M}^*$ be the pseudo-inverse of $\mathbf{M}$, where $^*$ denotes the conjugate transpose. Let $\...
tam's user avatar
  • 233
21 votes
2 answers
18k views

Complexity of linear solvers vs matrix inversion

Solving linear equations can be reduced to a matrix-inversion problem, implying that the time complexity of the former problem is not greater than the time complexity of the latter. Conversely, given ...
Alm's user avatar
  • 1,207
5 votes
0 answers
216 views

Existence or construction of a sequence of orthogonal matrices with three properties

This is a problem that I encountered during my research, and I have spent a good amount of time on it without success. So I am reaching out for help .... Any pointers or suggestions are appreicated! ...
Chee's user avatar
  • 984
7 votes
1 answer
412 views

Sum of the absolute eigenvalues of A>=B

Kindly help me to prove/disprove the following statement. Let $A$ be a symmetric matrix of order $n \times n$ with all the diagonal entry equal to $0$, and other non-diagonal entry equal to $k$ (...
L S B. user255259's user avatar
3 votes
3 answers
357 views

Can a block matrix with at least 3 zero blocks of different size on the diagonal and 1's everywhere else have only integer eigenvalues?

Let $M=\begin{pmatrix} \begin{array}{cccccccc} 0 & 0 & 1 & 1 & 1 & 1 & 1 &1\\ 0 & 0 & 1 & 1 & 1 & 1 & 1 &1\\ 1 & 1 & 0 & 0 & ...
L S B. user255259's user avatar
13 votes
2 answers
6k views

Parametrization of positive semidefinite matrices

We know that a real, symmetric, positive definite matrix $A$ of size $n\times n$ can be parametrized by a vector $\theta$ of $\frac{n(n+1)}{2}$ parameters thanks to the Cholesky decomposition: $$ A = ...
epsilone's user avatar
  • 313
3 votes
1 answer
3k views

Uniqueness of the reduced rank QR decomposition

Let $A$ be a $n\times n$ matrix that is a real, symmetric, positive semidefinite and has rank $r$. I read about the rank reduced $QR$ decomposition (here for example) as the QR variant where $A=QR$ ...
epsilone's user avatar
  • 313
12 votes
2 answers
2k views

Factorization of a matrix as a product of a symmetric and a skew-symmetric matrix

When can an $n\times n$ matrix $M$ be written as a product $M=AB$, where $A^T=A$ and $B^T=-B$? For example, a necessary condition is that the trace of $M$ vanishes. In this case, it is easy to check ...
Cristi Stoica's user avatar
3 votes
0 answers
87 views

When is $\left[\begin{smallmatrix} D_1 & B \\\\ -B^T & D_2 \end{smallmatrix} \right]$ $\mathbb{R}$-diagonalizable?

Is there some block-wise characterization of $\mathbb{R}$-diagonalizability (by similarities) of $$\begin{bmatrix} D_1 & B \\\\ -B^T & D_2 \end{bmatrix},$$ where $D_1$ and $D_2$ are real ...
Vedran Šego's user avatar
12 votes
0 answers
218 views

Which ordering of factors is needed to obtain this kind of determinantal inequalities?

Let $A$ and $B$ be $n\times n$ Hermitian positive definite matrices. The curious determinantal inequality given here, which can be stated as $$\det (A^{4}+ ABBA+BAAB+B^{4})\ge\det(A^{4}+ AABB+BBAA+B^{...
Wolfgang's user avatar
  • 13.4k
8 votes
2 answers
795 views

generalizations of Vandermonde matrix to high dimensions

Let $x_1,x_2,\cdots,x_n\in\mathbb{R} $ or $\mathbb{C}$. By the non-degeneracy of Vandermonde matrix the maps $$ f: \mathbb{R}\longrightarrow\mathbb{R}^n,$$ $$ x\longmapsto (1,x,x^2,\cdots,x^{n-1})...
Quan's user avatar
  • 519
21 votes
1 answer
2k views

Almost commuting unitary matrices

Suppose that $A_1,\dots, A_k$ are unitary matrices such that any two of them can be approximated by commuting unitary matrices. i.e. for any $i$ and $j$, there are unitary matrices $A_i'$ and $A_j'$ ...
Omid Hatami's user avatar

1
19 20
21
22 23
34