Skip to main content

All Questions

Filter by
Sorted by
Tagged with
5 votes
2 answers
2k views

Finding roots of a recursively given polynomial sequence / eigenvalues of an almost Toeplitz matix

I would like to find the roots of the polynomial sequence given by a recurrence relation as follows: $V_0(x) = 1-a^2$ $V_1(x) = 1-a^2 - x$ $V_{k \geq 2}(x) = (1+a^2 - x)V_{k-1}(x) - a^2V_{k-2}(x)$ ...
kolixx's user avatar
  • 145
1 vote
2 answers
2k views

Bound on smallest entry of inverse matrix

For a symmetric, invertible matrix $A=(a_{ij})\in \mathbb{R}^{n\times n}$ with (at least two) nonzero off-diagonal elements, is it possible to bound in absolute value the smallest entry of its inverse ...
user47575's user avatar
5 votes
1 answer
286 views

Are there any known results on numerical ranges of rank-one positive semi-definite matrices?

In my problem, I came across numerical ranges of rank-one positive semidefinite matrices. Through Toeplitz-Hausdorff theorem and some other extensions, I know if there are at most three matrices, then ...
dineshdileep's user avatar
  • 1,421
3 votes
1 answer
264 views

When is this matrix singular?

Consider matrix $A$ with $(j,k)$′th entry $A_{j,k}=\sin(\omega_j t_k+\phi_j),\,\forall j,k\in\{1,2,...,n\}$, where $\omega_j,t_k,\phi_j\in \mathbf R$. 1) For $t_k=k$, what is the condition on $\...
Hans's user avatar
  • 2,239
2 votes
0 answers
1k views

Incoherence of the row/column span

Due to V.Chandrasekaran., et al‎ (p.11) : In general for any $k$-dimensional subspace of $A_{n×n}$ we have that: $$\sqrt{(k/n)} \leq incoherence(A)\leq 1$$ where the lower bound is achieved (for ...
hoom's user avatar
  • 21
0 votes
1 answer
268 views

Nonnegative Matrix

Let $A=E+\sqrt{-1}B$, where $E=diag\{0,1,\cdots,1\}$, $B$ is a real symmetric matrix. Let $A^*$ denote the adjoint matrix of $A$, i.e. $AA^*=\det A\cdot I$. I hope the real part of adjoint matrix ${\...
Yiyan's user avatar
  • 303
11 votes
4 answers
5k views

The derivative of the Cholesky factor

Let $A$ be a symmetric, positive definite $p\times p$ matrix, and let $f(A)$ be its Cholesky factor. That is, $f(A)$ is a lower triangular $p\times p$ matrix such that $A = f(A) f(A)^{\top}$. I am ...
Steven Pav's user avatar
5 votes
2 answers
480 views

Decomposition of a semi-definite matrix into sums of sparse semi-definite matrices

I'll first provide the background. Let $x\in\mathbb{R}^N$ be decomposed into $n$ non-overlapping blocks of variables $x^{(1)},\ldots,x^{(n)}$. We say that $f:\mathbb{R}^N\rightarrow\mathbb{R}$ is ...
neil's user avatar
  • 51
8 votes
1 answer
911 views

A Problem on Linear Algebra

I'm trying to calculate an integral over the generalized Poincare upper half plane, then I find that I need to show the following identity: Let $X=(X_{i,j})\in\mathrm{GL}(n,\mathbb R)(n\geq 3)$ ...
Enlin Yang's user avatar
2 votes
0 answers
130 views

A - B is semidefinite, what the relationship about their eigenvalues? [closed]

$A, B$ are two symmetric matrices, if $ A-B $ is semidefinite (i.e.$ A - B \geq 0$), if we rearrange the eigenvalues of two matrices, $\lambda_1 (A) \geq \lambda_2 (A) \geq ... \geq \lambda_n (A)$, ...
Weeson Dorne's user avatar
7 votes
3 answers
2k views

Optimization problem on trace of rotated positive definite matrices

Given two $n \times n$ symmetric positive definite matrices $A$ and $B$, I am interested in solving the following optimization problem over $n \times n$ unitary matrices $R$: $$ \mathrm{arg}\max_R \,\...
Norouzi's user avatar
  • 362
2 votes
1 answer
359 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 ...
Janathan's user avatar
1 vote
1 answer
1k views

Bounding the positive semi-definite matrix with its block diagonal matrix [closed]

Can we bound $\mathbf{A}$ with $\mathbf{A^*}$ as ${\bf{A}} \preceq {{\bf{A}}^*}$ where \begin{equation} {\bf{A}} = \left[ {\begin{array}{*{20}{c}} {{{\bf{A}}_{11}}}&{...}&{{{\bf{A}}_{1N}}}\\ ...
behrad mahboobi's user avatar
3 votes
2 answers
643 views

On a determinant inequality of positive definite matrices

Assume that $B$ and $A$ are two positive definite matrices. Take $B^*$ a block diagonal matrix with block $B_{11}$ and $B_{22}$ of $B$. This means the following: $$ B=\left[\begin{array}{ll} B_{11}&...
Arash's user avatar
  • 752
1 vote
0 answers
269 views

M-matrix with nonconstant entries properties

I have a matrix $J(x)$ with $J_{ij}(x)=f_{ij}(x)$ where vector $x$ is $x=x_1, x_2, ..., x_m$. I have shown that $J(x)$ is an M-matrix for all $x$. There is known review paper by Plemmons (1977) of 40 ...
Alex Ivanov's user avatar
3 votes
0 answers
706 views

Row subset selection of matrix to optimize condition number

Given a matrix $\mathbf{A} \in \mathbb{C}^{N\times M}$ with $N \gg M$. This matrix results from a linear equation system and has a certain structure (however, I do not think that details provide any ...
divB's user avatar
  • 167
3 votes
0 answers
125 views

Copositivity in matrix pencils

Given two square symmetric matrices $A,B$ of the same order, the matrix pencil $P(A,B)$ is the set of linear combinations of $A$ and $B$. Finsler's theorem gives an elegant criterion for $P(A,B)$ to ...
Felix Goldberg's user avatar
8 votes
1 answer
603 views

Inequalities for Hadamard products of complex symmetric matrices

Consider a complex symmetric matrix $$ C= C_R + i C_I $$ with $C_R,C_I \in \text{Mat}_{n\times n}(\mathbb R)$ symmetric, and assume that the eigenvalues of $C_R$ are all strictly positive. Then, $C$ ...
martin's user avatar
  • 123
0 votes
0 answers
957 views

Diagonal of the inverse of a 6x6 symmetric partitioned matrix

Let $$M = \begin{bmatrix} A & B \\ B & C \end{bmatrix}$$ in which $A$, $B$ and $C$ are $3 \times 3$ matrices being also symmetric. In fact, they are quite similar, just differing on a single ...
Martin's user avatar
  • 1
5 votes
2 answers
706 views

Maximal norm-1 projection

Suppose I have a real unitary matrix $U$ and a unit vector $\mathbf{x}, \|\mathbf{x}\|_2 = 1$. What is the solution to the following problem? $$ \widehat{\mathbf{x}} = \arg\max_{\mathbf{x}, ~\|\...
Taha's user avatar
  • 137
0 votes
2 answers
737 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 ...
Nicolas's user avatar
9 votes
1 answer
1k views

M-matrix plus S-matrix is P-matrix?

I am trying to prove that a mapping has a unique fixed-point by showing that its Jacobian is a P-matrix. In this particular case the Jacobian can be decomposed as the sum of two matrices and I would ...
Santiago's user avatar
  • 197
13 votes
2 answers
946 views

Computing a large permanent

Is there a practical way to compute the permanent of a large ($91 \times 91$) $(0,1)$ matrix? I have tried to use the matlab function written by Luke Winslow which works great for smaller matrices ...
Felix Goldberg's user avatar
1 vote
0 answers
132 views

Matrices with a common Fischer basis

Let $A$ be a real symmetric $n\times n$ matrix, normalized such that $Tr[A]=1$. Define a 'Fischer basis' as the basis in which all diagonal elements are equal to $\frac{1}{n}$. The motivation for ...
Bharath H M's user avatar
4 votes
1 answer
543 views

Rank of a matrix with missing entries

Let $M$ be a $2^n \times 2^n$ matrix over real number field, where the rows and columns are indexed by subsets of $[n] := \{1,2,\ldots,n\}$, and defined as follows, $ M_{A, B} = 1 $ if $A \subseteq B$;...
jsliyuan's user avatar
  • 651
17 votes
1 answer
3k views

2x2 subdeterminants of a matrix

If N>2, it is well known that if two invertible NxN matrices A and B have the same determinants of any 2x2 corresponding submatrices, then A=B or A=-B. Given then all these 2x2 determinants of an ...
Carlo Mantegazza's user avatar
12 votes
2 answers
3k views

On the positive definiteness of a linear combination of matrices

In my work in PDE, the following problem in linear algebra came up. Any help in this direction is appreciated. QUESTION: Let $m,n\in\mathbb{N}$ and let $A_1,\ldots, A_m\in M_n(\mathbb{R})$ be real, ...
Tatin's user avatar
  • 895
3 votes
1 answer
451 views

Singular values of the sum of A and A^T

As a part of my research, I need to achieve a lower bound to the smallest singular value, $\sigma_{n}(A+A^{T})$ for a stochastic $A$ (as a function of the singular values of $A$), which is generally ...
Daniel86's user avatar
  • 225
1 vote
0 answers
358 views

Kernel of modified Kronecker sum

The Kronecker sum of two matrices $A \in M(n \times n, \mathbb{R})$ and $B \in M(m \times m,\mathbb{R})$ is defined by the matrix $$A \oplus B = A \otimes I_m + I_n \otimes B \in M(nm \times nm, \...
tobias's user avatar
  • 397
3 votes
2 answers
186 views

Triangularizing a function matrix with smooth eigenvlaues

Given a matrix with function entries, which are smooth and homogeneous, and having smooth eigenvalues, can we find a conjugating matrix with smooth and homogeneous entries that triangularize the given ...
Uday's user avatar
  • 2,239
2 votes
1 answer
2k views

power of a block triangular matrix

I have a matrix in the form : $$M = \begin{pmatrix} A & 0 & 0 \\\ B & A & 0 \\\ C & D & A \end{pmatrix} $$ where $A,B,C,D$ are diagonalizable square matrices and I want to ...
Christophe's user avatar
5 votes
2 answers
429 views

Simultaneous maximization of two Generalized Rayleigh Ritz Ratios

Consider hermitian positive semi-definite matrices $A_1$ and $A_2$. Consider also positive definite matrices $B_1$ and $B_2$. I want to maximize the minimum of the two Generalized Rayleigh Ritz ratios ...
dineshdileep's user avatar
  • 1,421
2 votes
1 answer
1k views

Trace inequality for matrices with determinant 1

Let $A$ and $B$ be two matrices with $\det(A)=\det(B)=1$. Does it follow that $\sqrt{\mathrm{tr}(A^TB^TBA-I)}\le\sqrt{\mathrm{tr}(A^TA-I)}+\sqrt{\mathrm{tr}(B^TB-I)}$ I suspect that this can be ...
Martijn's user avatar
  • 320
0 votes
1 answer
1k views

Simultaneous Jordanization

Hello everyone I would like to have a detailed reference to the statement bellow: Let $A,B\in \mathbb{R}^{n\times n}$ such that $AB=BA$. Suppose $A$ has real eigenvalues only and $B$ is ...
driss-alamilouati's user avatar
4 votes
2 answers
2k views

Probability of a submatrix to be full rank in a N x N Random Matrix of rank m.

Consider a random matrix $\mathbf{A} \in \mathbb{C}^{N \times N}$ of rank $m$ with $m < N$ that follows the Wishart distribution ( http://en.wikipedia.org/wiki/Wishart_distribution ). I have a ...
George's user avatar
  • 43
0 votes
2 answers
818 views

a question about the Jordan form [closed]

Some reference say that if rank($A$)=rank($A^2$),then the geometric and algebraic multiplicities of the eigenvalues $\lambda=0$ are equal;that is,all the Jordan blocks correspondint to $\lambda=0$ (if ...
Hinn's user avatar
  • 139
1 vote
3 answers
5k views

Number of parameters needed to specify a Hermitian matrix of rank r.

Hi, i have two questions that seem to bother me lately. Maybe you could help me and/or point me in any related literature. 1) Assume hermitian matrix $H \in \mathcal{C}^{n \times n}$ that has rank $...
Kostas's user avatar
  • 199
0 votes
3 answers
1k views

Convex Combination of 2 hermitian matrices

Assume all the matrices I discuss about are $N \times N$. Consider any two hermitian matrices $A_1$ and $A_2$ which are indefinite. The question is, In general, for any $A_1$ and $A_2$ (both matrices ...
dineshdileep's user avatar
  • 1,421
5 votes
2 answers
495 views

Hadamard product and inertia

One of Schur's famous results says that if $A,B$ are positive semidefinite matrices, then the Hadamard (i.e. entrywise) product $A \circ B$ is also positive semidefinite. It's also true if "semi" is ...
Felix Goldberg's user avatar
17 votes
2 answers
4k views

Optimizing the condition number

Suppose I have a set $S$ of $N$ vectors in $W=\mathbb{R}^m,$ with $N \gg m.$ 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 $...
Igor Rivin's user avatar
  • 96.4k
7 votes
0 answers
355 views

An $L^{\infty}$ version of principal component analysis?

I have a $k$ by $n$ matrix $A$, with $k \ll n$. In case it helps, the $k$ rows are orthonormal. I'm interested in finding a $k$ by $k$ orthogonal matrix $M$ so as to maximize the $L^{\infty}$ norms ...
floc's user avatar
  • 193
2 votes
0 answers
372 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 ...
Felix Goldberg's user avatar
4 votes
2 answers
2k views

Woodbury formula

I wonder - do you know of any example where the Woodbury formula (cf. http://en.wikipedia.org/wiki/Woodbury_matrix_identity) was crucially used to prove anything? It might be a useful computational ...
Felix Goldberg's user avatar
1 vote
0 answers
443 views

Diagonalizing matrix with a special conjugate transpose property

Hi all, I'm looking for the minimum criterion on $A\in M_{3x3}(\mathbb{C})$ (a $3x3$ complex matrix) such that: 1) $A$ is diagonalizable by a matrix $T\in M_{3x3}(\mathbb{C})$ 2) $T$ is such that $...
twain's user avatar
  • 111
0 votes
0 answers
161 views

vector equation

Suppose you have an equation of the form $Hx=Ky$, where $x,y$ are vectors of length $n,m$ respectively ($m>n$) and $H,K$ are matrices of orders $n \times n,n \times m$ respectively. Is there some ...
Felix Goldberg's user avatar
2 votes
2 answers
902 views

A sum of eigenvalues

Let $X$ be an $n\times n$ symmetric matrix. Suppose $\lambda_1(X)\geq \lambda_2(X) \geq \cdots \geq \lambda_n(X)$ are eigenvalues of $X$. Let $r$ be any integer with $1\leq r\leq n$. It is well-known ...
user11870's user avatar
  • 227
2 votes
1 answer
304 views

Simultaneous decomposition of three projectors

A projector $P$ is a Hermitian matrix satisfying $P^2=P$. For any two projectors, it is easy to show that there exists a unitary matrix $U$ such that both $U^*PU$ and $U^*QU$ are block-diagonal ...
Penghui Yao's user avatar
1 vote
1 answer
896 views

sign-flipping inverse

Consider this matrix: $Z=\begin{bmatrix}23.9 & -7 & -17 \\\\ -7 & 23.9 & -17 \\\\ -17 & -17 & 33.9 \end{bmatrix}$ Its inverse is entrywise negative (you can check...) and ...
Felix Goldberg's user avatar
4 votes
3 answers
4k views

upper bounds on a certain matrix norm

Is there some simple upper bound on $||(B^{-1}+A^{-1})^{-1}||$, where $A,B$ are $n \times n$ symmetric matrices?
Felix Goldberg's user avatar
6 votes
2 answers
421 views

Triangularizing a matrix with function entries

Hi Everybody! Given a matrix, with smooth functions as arguments is there any result which say about its triangularization? I know that, the question is in affirmative for diagonalizing a matrix ...
Uday's user avatar
  • 2,239

1
4 5 6
7
8