Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 62673

Equations whose unknown is a matrix, such as, for instance, algebraic Riccati equations $XAX+XB+CX+D=0$ or matrix differential equations (e.g. $\dot X(t)=AX(t)$. This tag is *not* meant for general systems of linear equations $Ax=b$.

4 votes
3 answers
238 views

Properties of matrix $X=\left[\frac{1}{1-\bar\alpha_i \alpha_j}\right]_{ij}$

Let $\{\alpha_i\}_{i=1}^n$ be complex numbers such that $|\alpha_i|<1$, and consider the following $n\times n$ structured matrix $$ X=\left[\frac{1}{1-\bar\alpha_i \alpha_j}\right]_{ij}. $$ Such matri …
Ludwig's user avatar
  • 2,712
16 votes
2 answers
502 views

The number of 0-1 normal matrices

Let $A\in\{0,1\}^{n\times n}$ be a $n\times n $ matrix with entries in the discrete set $\{0,1\}$. My question: What is the number of matrices in $\{0,1\}^{n\times n}$ that are normal, that is, th …
Ludwig's user avatar
  • 2,712
8 votes
0 answers
376 views

A limiting sequence of positive definite matrices

Let $A\in\mathbb{R}^{n\times n}$ be a matrix with eigenvalues having (strictly) negative real part. Let $X\in\mathbb{R}^{n\times n}$, $X\succ 0$, be a positive definite matrix and let $P\succ 0$ be th …
Ludwig's user avatar
  • 2,712
3 votes
0 answers
252 views

On the existence of fixed points of a matrix iteration

Let $A\in\mathbb{R}^{n\times n}$ be a Hurwitz stable matrix (i.e. all eigenvalues of $A$ have negative real part). Let $\succeq$ denote the standard partial order in the cone of positive semidefinite …
Ludwig's user avatar
  • 2,712
3 votes
0 answers
175 views

On a matrix inequality based on the Schur-Horn theorem

Let $A\in\mathbb{R}^{n\times n}$ be a diagonalizable matrix with real and (strictly) positive eigenvalues. (Notice that $A$ is not required to be symmetric.) Let $A_s$ denote the symmetric part of $A …
Ludwig's user avatar
  • 2,712
9 votes
2 answers
673 views

A trace-constrained maximization problem in the cone of positive definite matrices

Let $A\in\mathbb{R}^{n\times n}$ be a matrix having eigenvalues with strictly negative real part (in other words, $A$ is supposed to be Hurwitz stable). Let $\mathrm{tr}(\cdot)$ denote the trace opera …
Ludwig's user avatar
  • 2,712
1 vote
1 answer
326 views

On a condition for a matrix sum to be zero

Let $\{Y_i\}_{i=1}^N\in\mathbb{R}^{n\times m}$ be a set of full column rank matrices ($\mathrm{rank}(Y_i)=m$ for all $i$) and $\{P_i\}_{i=1}^N\in\mathbb{R}^{m\times m}$ be a set of positive definite m …
Ludwig's user avatar
  • 2,712
3 votes
1 answer
267 views

Solving a "reversed" Stein equation

Let $P$ and $Q$ be positive definite matrices. Consider the following matrix equation $$\label{star}\tag{$\star$} XPX^\top - P = -Q, \quad X\in\mathbb{R}^{n\times n}. $$ My question. Is it true th …
Ludwig's user avatar
  • 2,712
2 votes
0 answers
54 views

Lower bounds on eigenvalues of Lyapunov solutions

Let $A\in\mathbb{R}^{n\times n}$, $B\in\mathbb{R}^{n\times m}$ and let $X\in\mathbb{R}^{n\times n}$, $X=X^\top>0$ be the solution of the following Lyapunov algebraic equation $$ AX+XA^\top=-BB^\top. $ …
Ludwig's user avatar
  • 2,712
3 votes
1 answer
157 views

A matrix monotonicity question

Let $X\in\mathbb{R}^{n\times n}$ be a positive semi-definite matrix and $A\in\mathbb{R}^{n\times n}$ be a stable matrix, i.e. a matrix whose eigenvalues are strictly inside the left-half complex plane …
Ludwig's user avatar
  • 2,712
1 vote
0 answers
172 views

A vanishing sum of symmetric matrices

Let $\{G_i\}_{i=1}^N\in\mathbb{R}^{n\times m}$ be a set of full column rank matrices (i.e., $\mathrm{rank}(G_i)=m$ for all $i$) and $\{P_i\}_{i=1}^N\in\mathbb{R}^{m\times m}$ be a set of positive defi …
Ludwig's user avatar
  • 2,712
3 votes
1 answer
1k views

Completing the square of a matrix expression

Let $A,C\in\mathbb{R}^{m\times n}$, $n\ge m$, $B\in\mathbb{R}^{n\times m}$, and $P$ be a real positive definite $m\times m$ matrix. Denote by $\mathcal{S}^n$ the space of $n\times n$ real symmetric ma …
Ludwig's user avatar
  • 2,712
2 votes
1 answer
451 views

Constrained optimization over a trace functional

Let $A\in\mathbb{R}^{n\times n}$ be a stable matrix (i.e., the eigenvalues of $A$ have negative real parts). Consider the following optimization problem in $X \in \mathbb{R}^{n \times n}$ $$\begin{ar …
Ludwig's user avatar
  • 2,712
2 votes
1 answer
183 views

Condition for non-vanishing trace

Let $A$ and $B$ be two full column rank real matrices of dimension $n \times m$, where $n \ge m$. Let $P$ be an $m\times m$ positive definite matrix. Question: Does there always exist a symmetric $n …
Ludwig's user avatar
  • 2,712
4 votes
1 answer
376 views

On the solvability of a matrix equation

Let $\{C_i\}_{i=1}^N$ be a set of $n\times m$ real matrices of full column-rank and such that $\mathrm{Range}[C_1,C_2,\dots,C_N]=\mathbb{R}^n$, $\{P_i\}_{i=1}^N$ a set of $m\times m$ positive definite …
Ludwig's user avatar
  • 2,712

15 30 50 per page