Questions tagged [symmetric-matrices]

A symmetric matrix is a square matrix that is equal to its transpose.

Filter by
Sorted by
Tagged with
0 votes
1 answer
27 views

Help in proving the dimension of the symmetric linear maps

I'm trying to prove that the set $$S=\{A \in \mathscr{L}(\mathbb{R}^N,\mathbb{R}^N) | A^*=A\}$$ ie the symmetric linear maps in $\mathbb{R}^N$ is a vector subspace of $\mathscr{L}(\mathbb{R}^N,\mathbb{...
Lourenco Entrudo's user avatar
0 votes
1 answer
35 views

condition to be a symmetric matrix

Let us consider two matrices $X$ and $Y$ where both $X$ and $Y$ are $n \times k$ and $X \neq Y$. It is clear that $X'X$ is a symmetric matrix. What I want to know is whether $X'Y$ is always non ...
user0131's user avatar
  • 257
0 votes
1 answer
29 views

Eigenvalues of $M^{\top} D M$ with $M$ skew-symmetric and $D$ positive diagonal.

I was wondering whether there was a way to bound the smallest eigenvalue of $M^{\top} D M$ when $M$ is skew-symmetric and $D$ is a positive diagonal matrix. In particular, I was hoping that $M^{\top} ...
Vito Zarra's user avatar
1 vote
1 answer
40 views

Zero set of system of two real quadratic forms

Background: Consider the equation $x^T A_1 x = 0$ where $x \in \mathbb{R}^\mu$ and $A_1 \in \mathbb{R}^{\mu \times \mu}$ is a symmetric matrix. Suppose we also demand the normalization $x^T x = 1$. ...
Eric Kubischta's user avatar
2 votes
2 answers
89 views

Effect of Scaling a Row and Column on Multiplicities of Nonzero Eigenvalues of a Symmetric Matrix

Question: Let $A$ be a real symmetric $n\times n$ matrix with eigenvalues $\lambda_1, \lambda_2,\cdots, \lambda_n $ and corresponding algebraic multiplicities $a_1, a_2, \cdots, a_n$. Consider a ...
Eddie Lin's user avatar
  • 321
3 votes
0 answers
20 views

Determinant of a particular form of block matrix with commutating property

What is the determinant of the block matrix $$\begin{pmatrix}A&J&\ldots&\ldots&J\\J&A&\ldots\ldots&J\\\vdots&\vdots&\ddots(2^m-times)&&\vdots\\\vdots&\...
vidyarthi's user avatar
  • 6,890
1 vote
0 answers
17 views

Determinant of sparse Hilbert matrix

It is known that the determinant of the Hilbert matrix of dimension $N$ with elements $$ H^N_{tr}=\frac{1}{t+r-1}, \quad t,r=1,\dots,N $$ namely of the form \begin{pmatrix} 1 & \frac{1}{2} & \...
Matteo Saccardi's user avatar
0 votes
0 answers
61 views

Prove that if $A$ is symmetric and nonsingular, then $A^{-1}$ is symmetric

Here is my attempt: If $A$ is nonsingular and $A=A^T$, then $A^{-1}A=A^{-1} A^T=I_n.$ Since $A^T$ is nonsingular, we multiply $(A^T)^{-1}$ on both sides and we get $(A^T)^{-1}I_n=A^{-1}I_n \implies (A^...
dutch's user avatar
  • 21
1 vote
0 answers
22 views

Intuitive difference between optimal transport distance and Fisher information distance

Let me start by saying I'm not a mathematician but a biologist with an interest in mathematics. I have a set of covariance matrices and I am interested in studying their geometry in the Symmetric ...
dherrera's user avatar
  • 138
1 vote
0 answers
38 views

Multiplication with a diagonal matrix that can have infinity values

I'm thinking how to program the evaluation of the expression $A (B+A)^{-1}$, where $A$ is a diagonal matrix with elements equal or greater than zero, and B is a square symmetric definite positive ...
cesss's user avatar
  • 113
-4 votes
2 answers
46 views

when A matrix has one solution IF M>N [closed]

if a matrix A is m by n , and m>n , in this case we have one solution? i don't understand how more rows of a matrix can still have one solution
Lina Naif's user avatar
1 vote
1 answer
41 views

Does the product of a PSD matrix and a positive eigenvalue matrix have positive eigenvalues?

It's known that if $A$ is a positive definite (symmetric) matrix and $B$ is positive semi-definite (not necessarily symmetric), then $AB$ has non-negative eigenvalues. It follows from knowing that $A$ ...
Dan1618's user avatar
  • 651
0 votes
1 answer
50 views

Solving a certain matrix differential equation

I am trying to solve the following differential equation. All the matrices here are on $\mathbb{R}$. Let $\sigma$ be a time $t$ dependent $2n \times 2n$ Hermitian matrix. I want to solve the following ...
RSG's user avatar
  • 1,293
0 votes
1 answer
69 views

suppose $A$ is an $m\times n$ real matrix and $A^\top A$ is $3\times3$ nonsingular matrix, then $n =$? [closed]

the answer of this question is $n<3$ , why? I mean how we decided that is $n<3$ when $A$ multiply $A^\top$ will be singular?
Lina Naif's user avatar
0 votes
1 answer
54 views

A,B matrices and column space [closed]

if A,B have the same column space , does that means they have the same number of rows and the same rank?
Lina Naif's user avatar
2 votes
0 answers
31 views

Invariant eigenvalues of real symmetric matrices under sign change of off-diagonal elements?

I am looking for the minimum additional restrictions on a real symmetric $(n\times n)$ matrix $A$, such that its eigenvalues are invariant under a sign change of all off-diagonal elements. I don't ...
faber's user avatar
  • 21
0 votes
0 answers
23 views

Distance between two positive semidefinite matrices

Given two positive semidefinite matrices X, and Y. My question is, can we use von Neumann or the log-Determinant divergences to measure the distance between the two matrices. Most Manifold measure ...
MathLearner's user avatar
1 vote
1 answer
60 views

determinant of symmetric block matrix with positive definite diagonal blocks

I have a matrix of the form $B = \left[\begin{array}{cccc} A_1 & C^T\\ C & A_2\\ \end{array} \right]$ Where $A_1,A_2$ and $C$ are all square, and $A_1,A_2$ are symmetric positive definite. ...
Paul's user avatar
  • 587
0 votes
1 answer
74 views

Proving that a symmetric real matrix with a specific structure is positive definite.

Let $H$ be an $N\times N$ symmetric matrix with the following structure: \begin{equation} [H]_{n,m}\triangleq\begin{cases} {\left|x_{n}\right|}, &\text{if}\ n=m,\\ -\mathsf{Re}{\left(...
Mori_Math's user avatar
0 votes
0 answers
20 views

Invertibility of the symmteric matrix observed under least squaress solution

I am having trouble in proving the following statement Let $X$ be a $K \times d$ matrix with rank $d$ and let $W$ be a diagonal matrix with $d$ non-zero positive elements on the diagonal, that is rank ...
rostader's user avatar
  • 467
0 votes
1 answer
59 views

Proving that the semi-implicit Euler method is symplectic

I'm having trouble understanding the following proof that the semi-implicit Euler method $$\begin{cases} p^{k+1} = p^k-\Delta t \frac{\partial H}{\partial q}(p^{k+1},q^k) \\ q^{k+1} = q^k + \Delta t \...
Dude3400's user avatar
0 votes
0 answers
125 views

Understanding an Inequality In a Paper

The paper is the following: https://arxiv.org/pdf/1608.06412.pdf Right above (5) on page 5, the first inequality of the line where they use lemma 8, I'm not quite sure I see how they are using lemma 8....
Will's user avatar
  • 11
0 votes
1 answer
51 views

What's the best way to make a symmetric matrix positive definite?

Assume that you have a matrix $X \in \mathbb R^{m \times m}$ and it's symmetric, but it's not positive definite. What's the best way to turn the matrix $X$ into a positive definite matrix? I have a ...
euraad's user avatar
  • 2,830
0 votes
1 answer
44 views

On the $\log \det$ of identity matrix plus a symmetric positive definite matrix

I am trying to learn some matrix differentiation, and came across example of calculating the derivative of $$f(X)=\log\det(X)$$ where the $X$ is a symmetric positive definite matrix. I came to the ...
Michael's user avatar
  • 101
1 vote
0 answers
55 views

Is there a case in which PSD matrices $A$ and $B$ satisfy the condition $A \approx B$ but $A^2 \not \approx B^2$?

For two PSD matrices $A, B$ and a positive number $\alpha$, let's define $A \approx_{\alpha} B$ as $A \preceq \alpha B$ and $B \preceq \alpha A$, where $A \preceq B$ means $B - A$ is PSD. And if there ...
Yongyi Yang's user avatar
1 vote
0 answers
33 views

Existence of a real symmetric matrix similar to a Jordan block corresponding to 0

Let $n$ be a positive integer. Let $J_n(0)$ denote the $n$-by-$n$ Jordan block corresponding to 0. For each $n$, does there exist a real symmetric matrix $B$ such that $B$ is similar to $J_n(0)$? ...
MinaaaaaniM's user avatar
0 votes
1 answer
51 views

If $A$ is positive real symmetric matrix and $B$ is real symmetric, does there exist some $V$ such that $V^{T}AV$=$I$ and $V^TBV$ is diagonal matrix?

Let's say we have two matrices $A$ (a positive real symmetric matrix) and $B$ (a real symmetric matrix). And let us suppose that in general $A$ and $B$ don't commute with each other. Then, Q. Is it ...
Fermion's user avatar
2 votes
0 answers
75 views

$A,B$ positive semidefinite matrices with $A \geq B$ implies $A^2 \geq B^2$? [duplicate]

Is it true that if I am considering positive semidefinite matrices $A, B$ with $A \geq B$ then $A^2 \geq B^2$? Could you help me prove this or think of a counterexample (eventually assuming the ...
Extreme_Math's user avatar
2 votes
0 answers
46 views

Inequalities about trace of Hadamard product of matrices

Denote $A\circ B$ as the Hadamard product of two matrices, that is, $$A\circ B=(a_{ij}b_{ij}).$$ Let $A$ be a $n\times n$ symmetric positive definite matrix. First, I know that $$tr(A\circ A)\leq tr(A^...
tt Chen's user avatar
  • 147
0 votes
3 answers
62 views

When is a symmetric matrix with diagonal 1 and off-diagonal <1 positive definite?

I'm interested in running simulations with multivariate normal distributions in which the covariance matrix A has diagonal entries $a_{ii}=1$ and off-diagonal entries $|a_{ij}|<1,i\neq j$. There ...
J.D.'s user avatar
  • 41
1 vote
0 answers
34 views

Connection between multiplication table $n * k$ and partial sums of the partial sums of the Dirichlet inverse of the Euler totient function.

I am watching this video: L-functions and the Langlands program (RH Saga S1E2) This reminds me of a recurrence: Let $c=1$ and a recurrence be: ...
Mats Granvik's user avatar
  • 7,272
3 votes
0 answers
36 views

On the transitivity of the Löwner order

If the Löwner order is a partial order, then it is transitive. If so, how can one prove it? Proposition. Let ${\Bbb S}_n ({\Bbb R})$ denote the set of $n \times n$ symmetric matrices over $\Bbb R$. ...
Rodrigo de Azevedo's user avatar
2 votes
0 answers
45 views

Eigenvalues of a symmetric tridiagonal matrix

I'm looking for the eigenvalues of the following symmetric tridiagonal matrix \begin{pmatrix} a & z & 0 & 0 & 0 \\ z & b & z & 0 & 0 \\ 0 & z & 0 & z & ...
clement3337's user avatar
0 votes
2 answers
95 views

Matrix relations involving trace and eigenvalues

Given the real symmetric positive definite matrix $A \succ 0$, consider the following inequality in $\alpha \in \mathbb{R}$. $$ A \succ \alpha I $$ where $I$ is an identity matrix of appropriate ...
AdamsK's user avatar
  • 147
1 vote
1 answer
42 views

Inequality involving quadratic forms for positive definite symmetric matrices

Suppose that for a given fixed $v$, and two positive definite symmetric matrices $A$ and $B$ (with real-valued entries) it holds that: $$ v^T A v > v^T B v. $$ Does it then hold that $$ v^T A^{-1} ...
usr313's user avatar
  • 19
-1 votes
1 answer
51 views

If $A$ is symetric and positive definite, when will $A + B$ be invertible?

$A$ is a symmetric and positive definite matrix with size of $n \times n$, and $B$ is a matrix of the same size. Under which circumstance will $A+B$ be invertible?
star river's user avatar
1 vote
0 answers
67 views

Trace of square of a rank-$1$ Hermitian matrix ${\bf A} = {\bf a}{\bf a}^H$

Given matrix ${\bf A} = {\bf a}{\bf a}^H$, where ${\bf a}$ is a complex column vector. Are the following correct? ${\rm Tr}({\bf A}) = {\rm Tr} \left( {\bf a}{\bf a}^H \right) = {\rm Tr}({\bf a}^H{\...
BoltzBooz's user avatar
  • 162
0 votes
0 answers
23 views

Eigenspace and structured matrices

I have to design a matrix A that solves a linear system: $y = A x$ The requirement is that A is an RBF kernel, i.e., it has the following structure: $ a_{ij} = \alpha \exp\left (\frac{-d_{ij}^2}{2\...
user3284182's user avatar
2 votes
1 answer
368 views

Iterative algorithm for computing $\Sigma^{1/2} x$

Say I have a PSD matrix $\Sigma$ and a vector $x$, is there an iterative algorithm (faster than computing $\Sigma^{1/2}$ using Cholesky decomposition) for computing $\Sigma^{1/2} x$? (In this ...
Thomas Ahle's user avatar
  • 4,412
0 votes
1 answer
40 views

Projecting a symetric matrix on a subspace of known kernel

Given a symmetric matrix ${\bf S} \in S_n(\mathbb{R})$ and linearly independent vectors ${\bf u}, {\bf v}, {\bf w} \in \mathbb{R}^n$, how can one numerically compute the projection of $\bf S$ onto the ...
WIP's user avatar
  • 103
3 votes
1 answer
109 views

Why does Wolfram say this symmetric matrix has complex eigenvalues?

According to Wolfram, the following matrix has complex eigenvalues. Symmetric matrices have real eigenvalues, so I’m not sure what I’m failing to understand. The matrix is the shape operator of the ...
Simon M's user avatar
  • 409
0 votes
2 answers
71 views

Prove that condition number of a matrix increases in its dimension

This is my first time asking a question here. Thus, I apologise in advance if it is not articulated correctly or something else turns out to be wrong with it. Before asking the question itself, ...
nura khazhimurat's user avatar
0 votes
2 answers
70 views

How to calculate the differentiation of this expressions which contains matrix variable?

it is assumed that $\mathbf{X}\in\mathbb{R}^{n\times n}$ is symmetric, and $\mathbf{Y}=\mathbf{M}^\textsf{T}{\mathbf{X}}^{-1}\mathbf{M}$, where $\mathbf{M}\in\mathbb{R}^{n\times m}$ has no special ...
Haokun Xiong's user avatar
2 votes
0 answers
48 views

Eigenvalues of a squared symmetric matrix

In Page 185 here it says ... $M^2 y=\sigma^2y$. Since $M$ is symmetric, it follows that $y$ is an eigenvector of $M$ with eigenvalue $\pm \sigma$. It seems to contradict the example here. What am I ...
Dan Feldman's user avatar
0 votes
3 answers
62 views

Span of positive (semi)definite matrices

In this answer, Ben Grossmann said that $\operatorname{span}\{P:P \succ 0\} = \{A:A = A^T\} =: \mathcal S$. I am not sure, however, why this is true. Also, I guess $\operatorname{span}\{ P:P\succeq 0 \...
wsz_fantasy's user avatar
  • 1,104
1 vote
1 answer
37 views

definiteness of asymmetric matrices

The english wikipedia page requires a symmetric matrix to determine definiteness. ( A is an n × n symmetric matrix ...) The german Wikipedia page on the definiteness of matrices states that a $n\times ...
Kitsune's user avatar
  • 13
0 votes
0 answers
23 views

Definition of the (anti-)symmetric part of a tensor

Consider the following tensor: $$ A_{ij} = B_{k,i}C_{k,j} $$ which can be decomposed into its symmetric and antisymmetric parts: $A_{ij} = A_{ij}^s + A_{ij}^a$. I'm all confused as to how to express ...
Bjaam's user avatar
  • 77
0 votes
1 answer
50 views

What are the minimal conditions for this matrix to be invertible?

Let $A>0$ be a $n \times n$ symmetric positive definite (SPD) and $B$ be an $n \times m$ matrix, then form the matrix $$ C = \left[\begin{array}{cc} A & B \\ B^T & 0\end{array}\right],$$ ...
karlabos's user avatar
  • 1,229
2 votes
1 answer
100 views

Grothendieck's inequality guarantee of relaxation for Semidefinite problem

I am struggling to understand a proof of theorem 3.5.6 in Roman Vershynin's High-Dimensional Probability Theorem: $$\text{INT}(A) = \max_{x_i = \pm 1 \text{ for } i = 1,\ldots,n} \sum_{i,j=1}^{n} A_{...
Lose' CKi's user avatar
-1 votes
2 answers
53 views

How do I prove that for any $2\times2$ matrix $A$, $A^2$ can be written in the linear form $aA + bI$ where $a$ and $b$ are scalars? [closed]

How do I prove that for any $2\times2$ matrix $A$, $A^2$ can be written in the linear form $aA + bI$ where $a$ and $b$ are scalars? I've tried letting the elements of A be $w$, $x$, $y$, and $z$ then ...
Harry Tim's user avatar

1
2 3 4 5
36