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 questions only not deleted user 75761

Questions about the properties of vector spaces and linear transformations, including linear systems in general.

3 votes
0 answers
109 views

Has a complex-orthogonal analog of the Schur decomposition ever been studied?

I've looked around for a study of the following matrix decomposition: $A = QUQ^T$ where $A$ is a complex matrix, $QQ^T = I$, and $U$ is an upper triangular matrix. It can be shown that not all matrice …
wlad's user avatar
  • 4,943
2 votes
1 answer
97 views

Anti-Takagi: Given a Hermitian matrix $M$, is there a canonical form under $P \mapsto PMP^*$...

The Takagi decomposition provides a canonical form for a complex symmetric matrix $S$ under $U \mapsto USU^T$ where $UU^* = I$. Question: Is there an anti-Takagi decomposition? I.e. Is there a canonic …
wlad's user avatar
  • 4,943
6 votes
1 answer
266 views

Double-diagonalisation of nxn matrices?

I've come up with the following piece of Python code (using the library Sympy): def double_diagonalize(m1, m2): V, _ = (m1.T * m2).diagonalize() U, _ = (m1 * m2.T).diagonalize() return U, …
wlad's user avatar
  • 4,943
2 votes
1 answer
252 views

Is the following set of real square matrices dense: Those that can be diagonalised by a squa...

It's well known that the following set of real square matrices is dense: those matrices $M$ for which there exists an invertible matrix $P$ such that $P M P^{-1}$ is diagonal. My question is can this …
wlad's user avatar
  • 4,943
8 votes
1 answer
1k views

Why does an invertible complex symmetric matrix always have a complex symmetric square root?

Chapter XI Theorem 3 from here implicitly states that an invertible complex symmetric matrix always has a complex symmetric square root. It's clear that a square root exists, by appealing to the Jorda …
wlad's user avatar
  • 4,943
0 votes
1 answer
234 views

Apparent occurrence of the dual numbers in the Jordan decomposition

Maybe this question is too elementary or too vague, but there might be something interesting here: A $2 \times 2$ Jordan matrix is of the form $\begin{pmatrix} \lambda & 1 \\ 0 & \lambda\end{pmatrix} …
wlad's user avatar
  • 4,943
4 votes
2 answers
333 views

Is there half an iteration of the QR algorithm?

Every real square matrix $M$ has a QR decomposition $M = QR$ where $Q^{-1}=Q^T$ and $R$ is an upper triangular matrix with non-negative reals on the diagonal. Call the function $f(QR)=RQ$ the Francis …
wlad's user avatar
  • 4,943
5 votes
0 answers
178 views

Is there a list of all real unital subalgebras of M(2,C)?

Is there a complete classification of all real unital subalgebras of $M(2,\mathbb C)$ up to isomorphism? The list should include $M(2,\mathbb C)$, the quaternions, complex numbers, split-complex numbe …
wlad's user avatar
  • 4,943
3 votes
1 answer
202 views

Does there exist an O(n^3) algorithm for deciding whether PAP^T = LDU is solvable given some...

Let $A$ be an arbitrary real square matrix. Does there exist an $\mathcal O(n^3)$ algorithm for deciding whether there exists a permutation matrix $P$, lower unit triangular matrix $L$, upper unit tri …
wlad's user avatar
  • 4,943
4 votes
1 answer
122 views

How to compute an indefinite generalisation of QR decomposition

Given an arbitrary complex matrix $M$ and real, diagonal but possibly indefinite matrix $\Delta$, the problem is to solve the following system of equations: $$\begin{aligned} M^*\Delta M &= LD^2L^*\\ …
wlad's user avatar
  • 4,943
2 votes
0 answers
215 views

Which matrix decompositions feature permutation matrices?

It's well known that LU decomposition is only numerically stable if it's combined with row and/or column pivoting. It makes me wonder if there are other matrix decompositions that can profitably be co …
wlad's user avatar
  • 4,943
1 vote
0 answers
141 views

Has anyone studied this possible generalisation of the Singular Value Decomposition to all c...

I don't know any abstract algebraists personally, which is why I'm asking this question here. Let $(R,*)$ be a commutative $*$-ring where $*:R \to R$ is an involution. Each conjecture below is stated …
wlad's user avatar
  • 4,943
1 vote
0 answers
44 views

A "spectral theorem" to SVD reduction for every commutative *-ring

Given any commutative $*$-ring $R$ of uneven characteristic, is it true that for every square matrix $M$ and unitary matrix $W$, if $W^* \begin{bmatrix} 0 & M \\ M^* & 0 \end{bmatrix} W$ is equal to $ …
wlad's user avatar
  • 4,943
1 vote
0 answers
69 views

Does there exist a canonical form for normal matrices which extends the following embedding?

Given an unordered pair of complex numbers $\{w,z\}$, we can associate to it the complex matrix $$\frac 1 2\left[\begin{matrix}w + z + \frac{\left(w - z\right)^{2} + \left|{w - z}\right|^{2}}{2 \left| …
wlad's user avatar
  • 4,943
1 vote
1 answer
211 views

Does Wilkinson's shift need to be discontinuous?

Given a symmetric Hessenberg matrix $A = \left[\begin{matrix}\ddots& \vdots & \vdots\\\dotsb & a & b\\\dotsb& b & c\end{matrix}\right]$, the Wilkinson shift $\mu$ employed in some eigenvalue solvers i …
wlad's user avatar
  • 4,943

15 30 50 per page