Questions tagged [matrix-theory]
Matrix theory is the study of matrices as concrete objects, rather than as abstract linear operators between vector spaces (whose study belongs to linear algebra). For instance, this involves matrix factorizations and decompositions, nonnegative matrices and Perron-Frobenius theory, Schur complements, structured and special matrices, matrix functions and equations.
466 questions
1
vote
0
answers
947
views
max min of ratio of quadratic forms
Consider the optimization over two vectors $x$ and $y$
$$\max_{x,y} \min\left(\frac{x^TAx}{y^TAy},\frac{y^TBy}{x^TBx}\right)$$
for two positive definite matrices $A$ and $B$.
This problem can be ...
1
vote
0
answers
52
views
Matrix transformation [closed]
I want to show that
$(I-H^T(-s)H(s))^{-1}$ has no poles on the imaginary axis
with $H(s)=C(sI-A)^{-1}B$ and $H^T(-s)=-B^T(sI+A)^{-T}C^T$
is equivalent to $M_\gamma$ has no purely imaginary ...
1
vote
0
answers
119
views
inverse of asymptotic Toeplitz matrix with band limited associated function
I am reviewing a controversial paper, and the main result, a revolution within my field, comes down to whether or not the following is true. I strongly believe it is not, but would need confirmation.
...
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 ...
1
vote
0
answers
121
views
Limits on a parameter $\alpha$ to get positive definite matrix
Given positive semi-definite $n\times n$ matrices $B_k$, how would I go about getting the limits on $\alpha_k$ such that the expression
\begin{equation}
\mathbb{I}-\sum_{k=1}^{m-1}\alpha_kB_k
\end{...
1
vote
0
answers
164
views
Eigenvalues of a partitioned self-adjoint matrix
This is a repost of the same question on MSE (with no reply/comment):
https://math.stackexchange.com/questions/1454314/eigenvalues-of-a-partitioned-self-adjoint-matrix
I would be grateful just for a ...
1
vote
0
answers
113
views
Is my particular finite dimension Toeplitz matrix always strictly positive?
Let $H(\omega), \; -\pi \leq \omega \leq \pi$ be a real-valued function with a continuous band of zeros, that is (for simplicity) $H(\omega)=0, \; |\omega|\geq \beta \pi$.
Define a sequence of banded ...
1
vote
0
answers
631
views
Bounding the largest Singular value
D is a $n \times n$ diagonal matrix whose diagonal entries lies in $(0,1]$.
B is any $n \times n$ n.n.d. matrix.
What will be the sharpest upper bound on the largest eigenvalue of:
$(D+B)^{-1}D^2(...
1
vote
0
answers
52
views
Constructing pointwise-or independent binary matrices
Let $M$ be an $m \times n$ matrix such that every $M_{ij} \in \{0,1\}$.
We say that $M$ is `$\lor$-irreducible' if (i) no row is a pointwise-or of other rows, and (ii) no column is a pointwise-or of ...
1
vote
0
answers
359
views
Asymptotic expansion square root matrix
I am looking for an asymptotic expansion for $\underline\gamma$ which is the "square root" matrix of a symmetric $p\times p$ matrix $\gamma$. Here $\underline\gamma$ is assumed to be symmetric, e.g. ...
1
vote
0
answers
127
views
Unitary transformation of a Hermitian indefinite pencil to a real non-symmetric pencil
Given a Hermitian indefinite pencil $(A-\lambda B)$ where both $A=A^H$ and $B=B^H \in \mathbb{C}^{n\times n}$ are possibly indefinite, it is straightforward to show that the eigenvalues are either ...
1
vote
0
answers
305
views
how to find all the solutions to $I+A+\cdots+A^n=0.$ [closed]
Let $GL_3(\mathbb{Z}[i])$ be the group of invertible $3\times 3$ matrices whose coefficients are Gaussian integers.I want to find all the pair $(A\in GL_3(\mathbb{Z}[i]),n\in\mathbb{Z})$ satisfying
$$...
1
vote
0
answers
87
views
Possible diagonal values of a product of matrices with some specific characteristics
Hello all,
This is a question that might or might not be related to my previous one.
Imagine you have two matrices:
Matrix $\mathbf{\Phi}=[\Phi_1,\ldots,\Phi_M]\in\mathbb{R}^{L\times M}$ where $M\...
1
vote
0
answers
168
views
Ring-theoretic version of a matrix problem
Problem #17 in Zhan's survey of open problems in matrix theory is the Li-Poon problem on writing a square real matrix as the linear combination of $k$ orthogonal matrices. They proved that it is ...
1
vote
0
answers
200
views
bounds on the entries of an inverse circulant matrix
Suppose that $C$ is a (real) circulant invertible matrix defined by a vector $d$. Then $C^{-1}$ is also a circulant defined by some vector $f$. There exists a standard formula that expresses the ...
1
vote
0
answers
72
views
sharper interlacing
The usual interlacing inequalities say that if $M$ is a Hermitian $n \times n$ matrix and $\hat{M}$ is a principal submatrix of order $n-1$, then $\lambda_{\min}(M) \leq \lambda_{\min}(\hat{M})$. I ...
0
votes
1
answer
460
views
A question on orthogonal matrix [closed]
Let $P\in R^{n\times n}$ be an orthogonal matrix. I want to ask whether or not there exists some vector $x\in R^n$ containing no zero entries such that $Px$ also contains no zero entries.
0
votes
1
answer
2k
views
How to determine the distance between two matrices under the meaning of a matrix function? [closed]
Suppose a nonlinear infinitely continous differentiable function $f:\mathbb{D}\mapsto \mathbb{R^+}$, where $\mathbb{D}\subset\left\{X|\text{rank}{X}=2,X\in\mathbb{R}^{3\times 3}\right\}$ is a ...
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 $\...
0
votes
1
answer
232
views
Local differentiability of eigenvalues and eigenvectors of a real symmetric matrix
Let $A(x)\in\mathbb{R}^{n\times n}$ be a real symmetric matrix depending on the point $x\in\mathbb{R}^n$, where the eigenvalues are not necessarily simple. Can we say that for all $x$ there exists an ...
0
votes
1
answer
360
views
Are there zero entries in the eigenvector corresponding to a simple eigenvalue?
For a real symmetric matrix $M$ and a simple eigenvalue $\lambda$, under which conditions the corresponding eigenvector has no zero entries? Perhaps, this is unconditional and one can provide a proof?
0
votes
1
answer
105
views
Can this fixed point theorem generalize to infinite structures?
Suppose that $n$ is a natural number, $X$ is a set, and $S\subseteq X^{2}$ is a subset such that if $x,y\in X$, then there is a unique tuple $(x_{0},\dots,x_{n})$ where $x_{0}=x,x_{n}=y$ and $(x_{i},...
0
votes
1
answer
91
views
Choosing the best submatrix
Let $\mathbf{A}_{m\times n}$ be a matrix with non-negative elements. Assume that a submatrix $\mathbf{B}$ from $\mathbf{A}$ is defined as
\begin{align}
B_{i,j} =
\begin{cases}
A_{i,j}, & i\in\...
0
votes
1
answer
66
views
Checking a matrix for distinct rows
I am computing some combinatorial parameter associated with the complex simple Lie algebras of type $A_n$ using sage and the output will be a rectangular integer matrix.
All I need to prove to solve ...
0
votes
2
answers
556
views
Sparse dense matrix versus non-sparse dense matrix in eigenvalue computation
I have a matrix in the form of $2n\times 2n$ block matrix
$$
A = \begin{pmatrix}O& W\\
J& D\end{pmatrix}
$$
where, $O$ is an $n\times n$ zero-matrix; $W$ is a n-by-n diagonal matrix, $W = ...
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 ...
0
votes
1
answer
69
views
Inequality for extremal values of product of Hermitian matrices
I am looking for a reference to verify the following inequality, where $X$ and $Y$ are Hermitian positive semidefinite matrices:
$$
\lambda_n(X^{1/2}YX^{1/2}) = \lambda_n(XY) \leq \lambda_n(X)\...
0
votes
1
answer
225
views
Faulty algorithm for simultaneous diagonalization?
I found a simple algorithm for simultaneous diagonalization of two commuting matrices (Nordgren - Simultaneous Diagonalization and SVD of Commuting Matrices), which seemed to be well-founded. For ...
0
votes
1
answer
125
views
Special type of normal form of matrix in principal ideal domain
$\DeclareMathOperator\GL{GL}\DeclareMathOperator\PSL{PSL}$I want to ask the following, Given $X \in n \times n$ matrix that all the elements are integers and $X=X^{T}$ is symmetric.
Can one always ...
0
votes
1
answer
77
views
$A_{n \times m} D_{m \times m} A^T_{m \times n} + \alpha I_{n \times n}$
Assume that we have a matrix product of form $B=A_{n \times m} D_{m \times m} A^T_{m \times n} + \alpha I_{n \times n}$. $D$ is a positive diagonal matrix, $I$ is identity matrix, $\alpha>0$ and $m ...
0
votes
1
answer
138
views
On sum of matrices
Suppose we have a matrix $M\in\Bbb Q^{n\times n}$ with no $0$ elements and we write as sum of two matrices $M_1$ and $M_2$ on following constraint.
$M_{1,ij}=M_{ij}$ and $M_{2,ij}=0$ or $M_{1,ij}=0$ ...
0
votes
1
answer
111
views
A conjugation matrix $X\in \mathbb{C}^{ n\times p}$ where $p< n$
Given a Hermitian positive definite matrix $A\in \mathbb{C}^{n \times n}$ and a Hermitian matrix $B\in\mathbb{C}^{ p\times p},$ find the matrix $X$ so that $X^HAX=B$ holds where $X^H$ denotes ...
0
votes
1
answer
572
views
Recurrence Equation and Matrix Convergence
To begin with, let us give the conceptual background needed to expose the problem. First of all, we shall consider the set $\mathbb{L}^{n} = \mathbb{R}^{n}_{\geq0} = \{\overrightarrow{x}\in\mathbb{R}^{...
0
votes
1
answer
170
views
Non-strict column diagonally dominant matrix inner product
Let $A \in \mathbb{R}^{n \times n}$ be a normalized non-strict column diagonally dominant matrix, that is:
$$a_{j,j} = \sum_{i \ne j} \left|a_{i,j}\right|$$
where $0 \le a_{j,j} \le 1$ and $-1 \le ...
0
votes
1
answer
546
views
Solution of infinite dimension linear system
Suppose that ${a_n}$ and $b_n$ is decreasing sequence such that $a_0=A$, $lim_{n->\infty}a_n=0$ and $b_0=B$, $lim_{n->\infty}b_n=0$.
For fix n,
we can construct n dimension linear equation ...
0
votes
1
answer
666
views
Kernel of a projection
Given $m<n$. Suppose that $H$ and $K$ be $m \times n$ and $n\times (n-m)$ matrices such that rank$(H)=m$, rank$(K)=n-m$, and $HK=0$. For fixed non singular symmetric matrix $A$ define
\begin{...
0
votes
1
answer
720
views
Perturbation of Cholesky decomposition for matrix inversion
I am looking for a computationally cheap way to compute $x$ such that $$(L L^T + \mu^2 I)x = y$$
where $L \in \mathbb{R}^{n \times n}$ is a lower triangular definite positive matrix (with some very ...
0
votes
0
answers
32
views
Eliminating nullity for enhanced non-singularity
If we have an
$n\times n$ matrix $A$ with entries either $0$ or $1$, where all diagonal entries are $0$ and the rank is $k<n$, can we reach full rank by changing exactly $n-k$ zero off-diagonal ...
0
votes
0
answers
131
views
On a matrix equation with Kronecker product
Is there any work on the matrix equation in unknowns $X, Y \in {\Bbb C}^{n \times n}$ $$(X \otimes Y + Y \otimes X) \operatorname{vec}(A)=0$$ where $\otimes$ is the Kronecker product? Or, in general, ...
0
votes
0
answers
99
views
Efficient method to determine minimum eigenvalue of $2 \times 2$ block diagonal matrix
Suppose $H$ is a $2 \times 2$ block-diagonal symmetric matrix in $\mathbb{R}^{2^N \times 2^N} $. That is
$$ H = \begin{pmatrix} A_1 & 0 & \cdots & 0\\ 0 & A_2 & \cdots & 0 \\
...
0
votes
0
answers
108
views
On the exponentiation of a stochastic matrix where the exponent is a function of matrix size
In this question, I asked about any arbitrary stochastic matrix $A(n)$ of the particular form
$$A(n) = \begin{pmatrix} 1 & 0 & \cdots & 0\\ x_{21} & x_{22} & \cdots & 0\\ \...
0
votes
0
answers
168
views
Multiplying by Loewner-ordered matrices
Suppose $A$ and $B$ are symmetric positive (semi-)definite, and $A<B$ in Loewner order, meaning $B-A$ is positive (semi-)definite. Is it true that, for a symmetric positive-definite $C$, we have $...
0
votes
0
answers
92
views
Classification of elements $GL(d, \mathbb{R})$
Any $SL(2, \mathbb{R})$ is either elliptic or hyperbolic, or parabolic up to conjugacy; see here.
Do we have the same classification for $GL(d, \mathbb{R})$? If so, could you please introduce some ...
0
votes
0
answers
150
views
Sequence in matrices converging to Identity
Let $M_{k}(\mathbb{C})$ be the set of $k \times k$ complex matrices. I am trying to find a sequence of polynomials $P_{n}: M_{k}(\mathbb{C}) \to M_{k}(\mathbb{C})$ (or continuous functions $f_{n}$) ...
0
votes
0
answers
139
views
Is it possible to reduce eigenvalues of tensors to an matrix eigenvalue problem?
Can we construct a larger matrix $M$ such that its eigenvalues are the same as the eigenvalues of a tensor $T$ of order 3?
Let $\mathbf{T}$ be a fully symmetric tensor of order $3$ and size $N$. Its ...
0
votes
0
answers
155
views
Derivative of matrix argument function with respect to eigenvalues of argument
Let $\mathsf{SPD}_n$ denote the set of all real symmetric and positive definite $n\times n$ matrices. This set is convex so for every $A,B\in\mathsf{SPD}_n$ there exists a smooth path $\varphi:[0,1]\...
0
votes
0
answers
101
views
Find occurrences of certain matrix inside a matrix
This problem occurred from my need to find all graphs with a certain topology inside a bigger one. I don't need the subgraphs but the graphs that have the exact topology I am searching.
We know for ...
0
votes
0
answers
59
views
A system of inequalities involving a skew-symmetric integer matrix
Which skew-symmetric integer matrices $S$ satisfy the following inequalities
$SV_i \ne z_iE_i$ for all $i = 1,\cdots, n$
where
$V_i$ denotes the column with integer entries such that the $i$-th ...
0
votes
0
answers
96
views
Eigenvalues of the matrix obtained by letting some of the rows vanish, hoping for some inequality
Let $A$ be an $n \times n$ matrix. Let $A_k$ be the matrix obtained by keeping the first $k$ rows of $A$ fixed and substituting $0$ for the rows $k+1$ to $n$. To be precise, we write $A= [R_1...R_k, ...
0
votes
0
answers
83
views
Nullity of infinite matrix in row echelon form
For an $m \times n$ matrix $A$ in row echelon form, $\mathrm{nullity} (A)$ is equal to the number of columns that do not contain a pivot. Is this also true for an infinite matrix in row echelon form ...