Related papers: Jordan Normal and Rational Normal Form Algorithms
We elucidate the geometry of matrix models based on simple formally real Jordan algebras. Such Jordan algebras give rise to a nonassociative geometry that is a generalization of Lorentzian geometry. We emphasize constructions for the…
This article describes a normal form algorithm for the Brieskorn lattice of an isolated hypersurface singularity. It is the basis of efficient algorithms to compute the Bernstein-Sato polynomial, the complex monodromy, and Hodge-theoretic…
In this paper, we develop a method to obtain the algebraic classification of noncommutative Jordan algebras from the classification of Jordan algebras of the same dimension. We use this method to obtain the algebraic classification of…
This paper is devoted to the classification of complex pre-Jordan algebras in the sense of isomorphisms in dimensions $\leq$ 3. All Rota-Baxter operators on complex Jordan algebras in dimensions $\leq$ 3 and the induced pre-Jordan algebras…
We study a notion of order in Jordan algebras based on the version for Jordan algebras of the ideas of Fountain and Gould as adapted to the Jordan context by Fern\'{a}ndez-L\'{o}pez and Garc\'{\i}a-Rus, making use of results on general…
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…
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…
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…
We propose a contour integral-based algorithm for computing a few singular values of a matrix or a few generalized singular values of a matrix pair. Mathematically, the generalized singular values of a matrix pair are the eigenvalues of an…
Non-standard parabolic regularization of gradient catastrophes for the Burgers-Hopf equation is proposed. It is based on the analysis of all (generic and higher order) gradient catastrophes and their step by step regularization by embedding…
We present and analyze a simple numerical method that diagonalizes a complex normal matrix A by diagonalizing the Hermitian matrix obtained from a random linear combination of the Hermitian and skew-Hermitian parts of A.
We consider Jordan curves of the form $\gamma=\cup_{j=1}^n \gamma_j$ on the Riemann sphere for which each $\gamma_j$ is a hyperbolic geodesic in $(\widehat{\mathbb C} \smallsetminus \gamma)\cup \gamma_j$. These Jordan curves are…
Let $A$ be a unital algebra over a field $F$ with $\operatorname*{char} (F)\neq2$. In this paper we introduce a new concept of a generalized Jordan derivation, covering Jordan centralizers and Jordan derivations, as follows: a linear map…
We address a Jordan version of Johnson theorem on (associative) algebras of quotients, namely whether a strongly nonsingular (the Jordan version of nonsingularity) has a von Neumann regular algebra of quotients. Although the answer is…
Linearization is a standard method in the computation of eigenvalues and eigenvectors of matrix polynomials. In the last decade a variety of linearization methods have been developed in order to deal with algebraic structures and in order…
It is well known that for any finite Galois extension field $K/F$, with Galois group $G = \mathrm{Gal}(K/F)$, there exists an element $\alpha \in K$ whose orbit $G\cdot\alpha$ forms an $F$-basis of $K$. Such an element $\alpha$ is called…
A fast and weakly stable method for computing the zeros of a particular class of hypergeometric polynomials is presented. The studied hypergeometric polynomials satisfy a higher order differential equation and generalize Laguerre…
We consider ideals involving the maximal minors of a polynomial matrix. For example, those arising in the computation of the critical values of a polynomial restricted to a variety for polynomial optimisation. Gr\"obner bases are a…
We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…
We study Jacobi matrices with $N$-periodically modulated recurrence coefficients when the sequence of $N$-step transfer matrices is convergent to a non-trivial Jordan block. In particular, we describe asymptotic behavior of their…