Skip to main content

All Questions

13 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
6 votes
0 answers
450 views

Can this nonlinear vector equation be solved analytically?

I have the following vector equation: $$ {\bf Ax} + {\bf b} + {\bf Cx}^{ \circ - 1} = {\bf 0}_n $$ Where ${\bf x}$ is a vector of unknown variables. ${\bf b},{\bf x}, {\bf x}^{\circ - 1}, {\bf 0}_n ...
Daniel Turizo's user avatar
4 votes
0 answers
262 views

Two questions about three circulant matrices

Consider the following matrix equation in $n \times n$ circulant $\pm 1$ matrices $A$, $B$, $C$ $$2AA^T+BB^T+CC^T=(4n+4)I-4J$$ where $I$ is the $n \times n$ identity matrix and $J$ is the $n×n$ matrix ...
user369335's user avatar
3 votes
0 answers
138 views

Is there a method to solve a non-linear quadratic matrix equation?

I am interested in solving the following quadratic equation: $$x^{\top} A x = \sqrt{x^{\top} B x}$$ Here, $x \in \mathbb{R^q}$ is an unknown vector, and A and B are two q$\times$q-dimensional ...
Alison's user avatar
  • 31
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
2 votes
0 answers
107 views

Gradient of QZ decomposition

Let $A$ and $B$ be an $m \times n$ matrix of rank $ k_1 \le \min(m,n) $ and $ k_2 \le \min(m,n) $. Then the QZ decomposition or the generalized Schur decomposition is $A = USV^T$ and $B = UTV^T $, ...
newbie's user avatar
  • 61
2 votes
0 answers
176 views

System of matrix equations

Problem definition: Let $x_i \in \mathbb{R}^d$ and $a_i \in [0,1]$, for all $i = 1,\dots, k$ (with $k\geq d$). Define $M(a) = \sum_{i = 1}^k a_i x_ix_i^T,$ and assume $M(a) \succ 0.$ Question: Is ...
Apprentice's user avatar
2 votes
0 answers
203 views

Space of change of basis matrices between two similar matrices - how to reduce it with additional tests?

Assume we have two real symmetric $n\times n$ matrices: $A, B$. We can easily test their similarity: $\textrm{Tr}(A^k)=\textrm{Tr}(B^k)$ for $k=1..n$. In this case both can be rotated to the same ...
Jarek Duda's user avatar
2 votes
0 answers
91 views

Matrix (geometric sum) orbit problem

Is the following algorithmic problem known to be decidable/undecidable? Input: an element $\mathbf{v} \in \mathbb{Z}^n$, a matrix $\mathbf{A} \in GL_n(\mathbb{Z})$, and a subgroup $H \leqslant \...
suitangi's user avatar
  • 343
1 vote
0 answers
146 views

Identities for the determinant of a matrix similar to $\det(A)=\exp\circ\operatorname{tr}\circ\log(A)$ for different matrix functionals

The identity for the determinant of $A$ in the title is well know in matrix analysis and comes from the Jacobi's formula. I am interested in the existence of nontrivial formulas like this one (they do ...
Hvjurthuk's user avatar
  • 573
1 vote
0 answers
192 views

What is the solution of the matrix equation $A X + X A' + B X B' + C = 0$ for $X$?

I know that the matrix equation $A X + X A' + C = 0$ is in the form of the time-continuous Lyapunov equation, so solving for $X$ is pretty trivial since the solution already and numeric solvers ...
Elias Frantz's user avatar
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 ...
Ludwig's user avatar
  • 2,712
1 vote
0 answers
296 views

Finding lower triangular matrix of an indefinite matrix

So I have the system $M = RS = RQQ^{-1}S $ and I have $R$ and $S$ currently. I impose some constraints on $R$ in the form of $r^T$$QQ^Tr = 1$ where $r$ and $r^T$ are rows of R and their transposes. ...
engrishgamer's user avatar
0 votes
0 answers
223 views

Solving a nonlinear matrix equation

Consider the following nonlinear matrix equation: $B=PX^{−1}AX$ where $B$ and $P$ are a $1\times n$ row vector and $A$ is a $n\times n$ matrix which are all strictly positive, and $X=diag(x_1,...,...
ppp's user avatar
  • 101