Related papers: Leveraging the Cayley Hamilton Theorem for Efficie…
We present an algorithm to compute the Jordan chain of a nearly defective matrix with a $2\times2$ Jordan block. The algorithm is based on an inverse-iteration procedure and only needs information about the invariant subspace corresponding…
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 nonlinear dynamics of a system can be analyzed using a square matrix. If off resonance, the lead vector of a Jordan chain in a left eigenspace of the square matrix is an accurate action- angle variable for sufficiently high power order.…
In this paper, we present a determinist Jordan normal form algorithms based on the Fadeev formula: \[(\lambda \cdot I-A) \cdot B(\lambda)=P(\lambda) \cdot I\] where $B(\lambda)$ is $(\lambda \cdot I-A)$'s comatrix and $P(\lambda)$ is $A$'s…
Let $\mathbb{F}$ be an algebraically closed field of characteristic $0$. Given a square matrix $A \in \mathbb{F}^{n \times n}$ and a polynomial $f \in \mathbb{F}[w]$, we determine the Jordan canonical form of the formal Fr\'{e}chet…
An efficient method is proposed for computing the structure of Jordan blocks of a matrix of integers or rational numbers by exact computation. We have given a method for computing Jordan chains of a matrix with exact computation. However,…
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…
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…
An effective exact method is proposed for computing generalized eigenspaces of a matrix of integers or rational numbers. Keys of our approach are the use of minimal annihilating polynomials and the concept of the Jourdan-Krylov basis. A new…
We study the bit complexity of two related fundamental computational problems in linear algebra and control theory. Our results are: (1) An $\tilde{O}(n^{\omega+3}a+n^4a^2+n^\omega\log(1/\epsilon))$ time algorithm for finding an…
We present a short proof of the Jordan-H\"older theorem with uniqueness for semimodular semilattice: Given two maximal chains in a semimodular semilattice of finite height, they both have the same length. Moreover there is a unique…
At the exceptional point where two eigenstates coalesce in open quantum systems, the usual diagonalization scheme breaks down and the Hamiltonian can only be reduced to Jordan block form. Most of the studies on the exceptional point…
A proof of the Jordan canonical form, suitable for a first course in linear algebra, is given. The proof includes the uniqueness of the number and sizes of the Jordan blocks.
The paper develops Newton's method of finding multiple eigenvalues with one Jordan block and corresponding generalized eigenvectors for matrices dependent on parameters. It computes the nearest value of a parameter vector with a matrix…
We study the case when solution of an ODE at a given initial condition fail to be unique and investigate what are the possible time-1 sections of the `solution funnel'. Along the way we give construction of a natural complete metric on the…
The question of matrix similarity is a classical one in linear algebra. For a field $\mathbb{F}$ and some positive integer $n \in \mathbb{N}$, one may consider the following problems: 1. Given two matrices $A, B \in \mathrm{GL}(n,…
We prove the Jordan curve theorem by generalizing the sweepline algorithm for trapezoidal decomposition of a polygon. Our proof uses Zorn's lemma (or, equivalently the axiom of choice). Though several proofs have been given for the Jordan…
We consider models of growing random trees $\{\mathcal{T}_f(n):n\geq 1\}$ with model dynamics driven by an attachment function $f:\mathbb{Z}_+\to \mathbb{R}_+$. At each stage a new vertex enters the system and connects to a vertex $v$ in…
Hamiltonian matrices appear in a variety or problems in physics and engineering, mostly related to the time evolution of linear dynamical systems as for instance in ion beam optics. The time evolution is given by symplectic transfer…
The general entire solution to a linear system of moment differential equations is obtained in terms of a moment kernel function for generalized summability, and the Jordan decomposition of the matrix defining the problem. The growth at…