Related papers: D\'ecomposition effective de Jordan-Chevalley et s…
In this note we mainly study the fine Jordan-Chevalley decomposition: a refinement of the classical Jordan-Chevalley decomposition of a matrix and we pay a particular attention to the field of the coefficients of the matrix. Moreover we…
The purpose of this note is to advertise an elegant algorithmic proof for the Jordan--Chevalley decomposition of a matrix, following and (slightly) revising the discussion of Couty, Esterle und Zarouf (2011). The basic idea of that method…
Let $\g$ be a finite dimensional Lie algebra over a field $k$ of characteristic zero. An element $x$ of $\g$ is said to have an \emph{abstract Jordan-Chevalley decomposition} if there exist unique $s,n\in\g$ such that $x=s+n$, $[s,n]=0$ and…
We introduce some basic notions and results for quaternionic linear operators analogous to those for complex linear operators. Our main result is to prove the additive and multiplicative Jordan-Chevalley decompositions for quaternionic…
We prove that if $\mathfrak{s}$ is a solvable Lie algebra of matrices over a field of characteristic 0, and $A\in\mathfrak{s}$, then the semisimple and nilpotent summands of the Jordan-Chevalley decomposition of $A$ belong to $\mathfrak{s}$…
In this paper, we calculate the Jordan decomposition (or say, the Jordan canonical form) for a class of non-symmetric Ornstein-Uhlenbeck operators with the drift coefficient matrix being a Jordan block and the diffusion coefficient matrix…
These notes are not intended to substitute for a course in linear algebra on reduction of endomorphisms nor an exhaustive presentation of the Dunford's decomposition. We will limit ourselves to the case where the base is R or C, and the…
We show that, for $n \ge 3$, the mapping on $M_n(\mathbb{C})$ which sends a matrix to its diagonalizable part in its Jordan-Chevalley decomposition, is {\bf norm-unbounded} on any neighbourhood of the zero matrix. Let $X$ be a Stonean…
This paper proposes a power method for computing the dominant eigenvalues of a non-Hermitian dual quaternion matrix (DQM). Although the algorithmic framework parallels the Hermitian case, the theoretical analysis is substantially more…
A square matrix $A$ has the usual Jordan canonical form that describes the structure of $A$ via eigenvalues and the corresponding Jordan blocks. If $A$ is a linear relation in a finite-dimensional linear space ${\mathfrak H}$ (i.e., $A$ is…
Diagonalization, or eigenvalue decomposition, is very useful in many areas of applied mathematics, including signal processing and quantum physics. Matrix decomposition is also a useful tool for approximating matrices as the product of a…
We propose a new method for computing the eigenvalue decomposition of a dense real normal matrix $A$ through the decomposition of its skew-symmetric part. The method relies on algorithms that are known to be efficiently implemented, such as…
The Jordan Canonical Form of a matrix is highly sensitive to perturbations, and its numerical computation remains a formidable challenge. This paper presents a regularization theory that establishes a well-posed least squares problem of…
The Schur decomposition of a square matrix $A$ is an important intermediate step of state-of-the-art numerical algorithms for addressing eigenvalue problems, matrix functions, and matrix equations. This work is concerned with the following…
A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…
We construct fast, structure-preserving iterations for computing the sign decomposition of a unitary matrix $A$ with no eigenvalues equal to $\pm i$. This decomposition factorizes $A$ as the product of an involutory matrix $S =…
It is well-known that every non-negative univariate real polynomial can be written as the sum of two polynomial squares with real coefficients. When one allows a weighted sum of finitely many squares instead of a sum of two squares, then…
The canonical polyadic decomposition (CPD) is a fundamental tensor decomposition which expresses a tensor as a sum of rank one tensors. In stark contrast to the matrix case, with light assumptions, the CPD of a low rank tensor is…
For finite p-groups P of class 2 and exponent p the following are invariants of fully refined central decompositions of P: the number of members in the decomposition, the multiset of orders of the members, and the multiset of orders of…
We review known factorization results in quaternion matrices. Specifically, we derive the Jordan canonical form, polar decomposition, singular value decomposition, the QR factorization. We prove there is a Schur factorization for commuting…