English
Related papers

Related papers: Jordan Normal and Rational Normal Form Algorithms

200 papers

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,…

Rings and Algebras · Mathematics 2026-05-07 Alia Bonnet

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…

Data Structures and Algorithms · Computer Science 2022-11-29 Papri Dey , Ravi Kannan , Nick Ryder , Nikhil Srivastava

We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.

Number Theory · Mathematics 2015-08-13 Samuel H. Dalalyan

Let $\lambda$ be a partition of an integer $n$ and ${\mathbb F}_q$ be a finite field of order $q$. Let $P_\lambda(q)$ be the number of strictly upper triangular $n\times n$ matrices of the Jordan type $\lambda$. It is known that the…

Representation Theory · Mathematics 2022-04-04 Dmitry Fuchs , Alexandre Kirillov

A special class of Jordan algebras over a field $F$ of characteristic zero is considered. Such an algebra consists of an $r$-dimensional subspace of the vector space of all square matrices of a fixed order $n$ over $F$. It contains the…

Combinatorics · Mathematics 2019-11-15 Mikhail Klin , Mikhail Muzychuk , Sven Reichard

A well-known characterization of Jordan vectors of a matrix polynomial $L(z)$ is generalized to a characterization of Jordan vectors of the operator-valued function $Q(z)$ at an eigenvalue $\alpha \in \mathbb{C}$. The results are then…

Functional Analysis · Mathematics 2026-01-21 Muhamed Borogovac

We obtain a parametric normal form for any non-degenerate perturbation of the generalized saddle-node case of Bogdanov--Takens singularity. Explicit formulas are derived and greatly simplified for an efficient implementation in any computer…

Dynamical Systems · Mathematics 2014-12-25 Majid Gazor , Mojtaba Moazeni

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…

Probability · Mathematics 2013-02-21 Yong Chen , Ying Li

In this paper we present two algorithms for the computation of a diagonal form of a matrix over non-commutative Euclidean domain over a field with the help of Gr\"obner bases. This can be viewed as the pre-processing for the computation of…

Rings and Algebras · Mathematics 2011-10-26 Viktor Levandovskyy , Kristina Schindelar

We present matrix identities which yield respectively the Jordan canonical form of the Pascal matrix P_n = (i -1 choose j -1)_{1 <= i,j <= n} modulo a prime, the eigenvectors of (i choose j)_{1 <= i,j <= n}, and the Smith normal form of…

Combinatorics · Mathematics 2007-05-23 David Callan

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…

Rings and Algebras · Mathematics 2019-06-06 Han Gang , Yu Jing , Sun Zheyu

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…

Numerical Analysis · Mathematics 2017-04-25 Felipe Hernández , Adi Pick , Steven G. Johnson

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…

Rings and Algebras · Mathematics 2026-05-08 Vanni Noferini

We introduce a natural notion of determinant in matrix JB$^*$-algebras, i.e., for hermitian matrices of biquaternions and for hermitian $3\times 3$ matrices of complex octonions. We establish several properties of these determinants which…

Operator Algebras · Mathematics 2025-01-14 Jan Hamhalter , Ondřej F. K. Kalenda , Antonio M. Peralta

Given an $n \times n$ nonsingular matrix A and the characteristic polynomial of A as the starting point, we will leverage the Cayley-Hamilton Theorem to efficiently calculate the maximal length Jordan Chains for each distinct eigenvalue of…

Rings and Algebras · Mathematics 2022-03-02 Lloyd Nesbitt

The Jordan algebra of the symmetric matrices of order two over a field $K$ has two natural gradings by $\mathbb{Z}_2$, the cyclic group of order 2. We describe the graded polynomial identities for these two gradings when the base field is…

Rings and Algebras · Mathematics 2020-09-08 Plamen Koshlukov , Diogo Diniz P. S. Silva

We give a self contained and elementary description of normal forms for symplectic matrices, based on geometrical considerations. The normal forms in question are expressed in terms of elementary Jordan matrices and integers with values in…

Symplectic Geometry · Mathematics 2014-03-20 Jean Gutt

Over a field of characteristic $0$ we give a concrete, computation--ready description of Jordan algebra structures and their low--order deformation theory. The Jordan identity is quartic in the elements and cubic in the multiplication, and…

Rings and Algebras · Mathematics 2026-02-10 Vincent E. Coll

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F} \in \mathbb{K}[x]^{n \times n}$ over a field $\mathbb{K}$, we give a fast, deterministic algorithm for finding the Hermite normal form of $\mathbf{F}$ with complexity…

Symbolic Computation · Computer Science 2016-02-08 George Labahn , Wei Zhou

We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…

Symbolic Computation · Computer Science 2024-11-19 Xavier Caruso , Antoine Leudière
‹ Prev 1 2 3 10 Next ›