English
Related papers

Related papers: Jordan Normal and Rational Normal Form Algorithms

200 papers

The notion of root polynomials of a polynomial matrix $P(\lambda)$ was thoroughly studied in [F. Dopico and V. Noferini, Root polynomials and their role in the theory of matrix polynomials, Linear Algebra Appl. 584:37--78, 2020]. In this…

Optimization and Control · Mathematics 2022-10-07 Vanni Noferini , Paul Van Dooren

Jordan isomorphisms of rings are defined by two equations. The first one is the equation of additivity while the second one concerns multiplicativity with respect to the so-called Jordan product. In this paper we present results showing…

Operator Algebras · Mathematics 2007-05-23 Lajos Molnar

In this paper we prove an asymptotically sharp Bernstein-type inequality for polynomials on analytic Jordan arcs. Also a general statement on mapping of a domain bounded by finitely many Jordan curves onto a complement to a system of the…

Complex Variables · Mathematics 2015-06-05 Sergei Kalmykov , Béla Nagy

We present a fast Jacobi-like algorithm for computing the eigenvalues, and optionally the eigenvectors, of a real normal matrix. The method gains a computational advantage by using Paardekooper's method for skew-symmetric matrices The…

Numerical Analysis · Mathematics 2026-05-27 Simon Mataigne , P. -A. Absil

A representation of finite-dimensional probabilistic models in terms of formally real Jordan algebras is obtained, in a strikingly easy way, from simple assumptions. This provides a framework in which real, complex and quaternionic quantum…

Quantum Physics · Physics 2018-05-09 Alexander Wilce

There exists a generalization of the concept, completely bounded norm for multilinear maps on C*-algebras. We will use the word, Jordan norm, for this norm. The Jordan norm of a multilinear map is obtained via factorizations of the map,…

Operator Algebras · Mathematics 2024-01-29 Erik Christensen

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…

Rings and Algebras · Mathematics 2025-09-16 Shinichi Tajima , Katsuyoshi Ohara , Akira Terui

We propose a numerical linear algebra based method to find the multiplication operators of the quotient ring $\mathbb{C}[x]/I$ associated to a zero-dimensional ideal $I$ generated by $n$ $\mathbb{C}$-polynomials in $n$ variables. We assume…

Numerical Analysis · Mathematics 2018-03-23 Simon Telen , Marc Van Barel

Let A(z) be an analytic square matrix and $\lambda_{0}$ an eigenvalue of A(0) of multiplicity m. Then under the generic condition, the characteristic polynomial of A(z) evaluated at $\lambda_{0}$ has a simple zero at z=0, we prove that the…

Spectral Theory · Mathematics 2010-11-24 Aaron Welters

A Lyapunov matrix equation can be converted, by using the Jordan decomposition theorem for matrices, into an equivalent Lyapunov matrix equation where the matrix is a Jordan matrix. The Lyapunov matrix equation with Jordan matrix can be…

Rings and Algebras · Mathematics 2019-05-10 Dan Comănescu

Let $M_n(\mathbb{F})$ be the algebra of $n \times n$ matrices over a field $\mathbb{F}$ of characteristic not equal to $2$. If $n\ge 2$, we show that an arbitrary map $\phi : M_n(\mathbb{F}) \to M_n(\mathbb{F})$ is Jordan multiplicative,…

Rings and Algebras · Mathematics 2025-11-26 Ilja Gogić , Mateo Tomašević

We present a construction of a Jordan scheme from an elementary abelian $2$-group of rank $n$ and a $\{1,-1\}$-matrix of order $2^n$ that satisfies a specified condition. We then prove that the orders of matrices with the specified…

Combinatorics · Mathematics 2025-09-04 Akihide Hanaki , Masayoshi Yoshikawa

We review the Preparata-Sarwate algorithm, a simple $O(n^{3.5})$ method for computing the characteristic polynomial, determinant and adjugate of an $n \times n$ matrix using only ring operations together with exact divisions by small…

Numerical Analysis · Mathematics 2020-11-26 Fredrik Johansson

Given a positive integer $r$ and a prime power $q$, we estimate the probability that the characteristic polynomial $f_{A}(t)$ of a random matrix $A$ in $\mathrm{GL}_{n}(\mathbb{F}_{q})$ is square-free with $r$ (monic) irreducible factors…

Combinatorics · Mathematics 2022-09-09 Gilyoung Cheong , Jungin Lee , Hayan Nam , Myungjun Yu

The fundamental identity of quadratic Jordan algebras $Q_{Q_a b} = Q_aQ_bQ_a$ is commonly proven as a consequence of MacDonalds theorem or using more analytic methods. In this short note we give a self-contained purely algebraic proof using…

Rings and Algebras · Mathematics 2018-07-03 John van de Wetering

Let $V$ be a finite dimensional vector space over a field $\mathrm{k}$ of characteristic $0$. Let $A$ be a linear mapping of $V$ into itself. This paper gives a normal form for $A$, which gives a better description of the structure of $A$…

Symplectic Geometry · Mathematics 2014-05-28 Richard Cushman

We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. Normal form algorithms provide an algebraic approach to solve this problem.…

Algebraic Geometry · Mathematics 2018-12-10 Bernard Mourrain , Simon Telen , Marc Van Barel

Let k be an algebraically closed field of characteristic p \ge 0. We shall consider the problem of finding out a Jordan canonical form of J(\alpha,s) \otimes_{k} J(\beta,t), where J(\alpha,s) means the Jordan block with eigenvalue \alpha…

Commutative Algebra · Mathematics 2008-06-03 Kei-ichiro Iima , Ryo Iwamatsu

We construct a new family of linearizations of rational matrices $R(\lambda)$ written in the general form $R(\lambda)= D(\lambda)+C(\lambda)A(\lambda)^{-1}B(\lambda)$, where $D(\lambda)$, $C(\lambda)$, $B(\lambda)$ and $A(\lambda)$ are…

Numerical Analysis · Mathematics 2020-03-09 Javier Pérez , María C. Quintana

We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field. This algorithm differs from previous ones in that it computes a local Smith form for each irreducible factor in the determinant…

Symbolic Computation · Computer Science 2015-03-13 Jon Wilkening , Jia Yu