相关论文: Jordan Normal and Rational Normal Form Algorithms

In this paper, we connect two well established theories, the Fibonacci numbers and the Jordan algebras. We give a series of matrices, from literature, used to obtain recurrence relations of second-order and polynomial sequences. We also…

Jordan Normal Forms serve as excellent representatives of conjugacy classes of matrices over closed fields. Once we knows normal forms, we can compute functions of matrices, their main invariant, etc. The situation is much more complicated…

Let $\mathcal{G}=[A & M N & B]$ be a generalized matrix algebra defined by the Morita context $(A, B,_AM_B,_BN_A, \Phi_{MN}, \Psi_{NM})$. In this article we mainly study the question of whether there exist proper Jordan derivations for the…

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 deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…

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…

Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced…

This paper introduces a new algorithm to approximate non orthogonal joint diagonalization (NOJD) of a set of complex matrices. This algorithm is based on the Frobenius norm formulation of the JD problem and takes advantage from combining…

We discuss the eigenvalue problem for 3x3 octonionic Hermitian matrices which is relevant to the Jordan formulation of quantum mechanics. In contrast to the eigenvalue problems considered in our previous work, all eigenvalues are real and…

Let $f, f_1, \ldots, f_\nV$ be polynomials with rational coefficients in the indeterminates $\bfX=X_1, \ldots, X_n$ of maximum degree $D$ and $V$ be the set of common complex solutions of $\F=(f_1,\ldots, f_\nV)$. We give an algorithm…

We present a framework for the construction of linearizations for scalar and matrix polynomials based on dual bases which, in the case of orthogonal polynomials, can be described by the associated recurrence relations. The framework…

We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…

In the first part of the paper, we address an invertible matrix polynomial $L(z)$ and its inverse $\hat{L}(z) := -L(z)^{-1}$. We present a method for obtaining a canonical set of root functions and Jordan chains of $L(z)$ through elementary…

The Golub-Welsch algorithm [ Math. Comp., 23: 221-230 (1969)] has long been assumed symmetric for estimating quadratic forms. Recent research indicates that asymmetric quadrature nodes may be more often and the existence of a practical…

We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…

Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…

We show that a differential algebraic group can be filtered by a finite subnormal series of differential algebraic groups such that successive quotients are almost simple, that is have no normal subgroups of the same type. We give a…

The Macdonald polynomials with prescribed symmetry are obtained from the nonsymmetric Macdonald polynomials via the operations of $t$-symmetrisation, $t$-antisymmetrisation and normalisation. Motivated by corresponding results in Jack…

Dissipative systems can be described in terms of non-hermitian hamiltonians H, whose left eigenvectors f^j and right eigenvectors f_j form a bi-orthogonal system. Bi-orthogonal systems could suffer from two difficulties. (a) If the…

We provide a proof of strong normalisation for lambda+, a recently introduced, explicitly typed, non-deterministic lambda-calculus where isomorphic propositions are identified. Such a proof is a non-trivial adaptation of the reducibility…

We consider the structure of Jordan $H$-pseudoalgebras which are linearly finitely generated over a Hopf algebra $H$. There are two cases under consideration: $H=U(\mathfrak h)$ and $H=U(\mathfrak h)# \mathbb C[\Gamma ]$, where $\mathfrak…