AbstractThis paper is devoted to the study of some formulas for polynomial decomposition of the exponential of a square matrix A. More precisely, we suppose that the minimal polynomial MA(X) of A is known and has degree m. Therefore, etA is given in terms of P0(A),…,Pm−1(A), where the Pj(A) are polynomials in A of degree less than m, and some explicit analytic functions. Examples and applications are given. In particular, the two cases m=5 and m=6 are considered
AbstractFor an arbitrary polynomial p two characterizations of a square matrix A satisfying the poly...
A few years ago Beelen developed an algorithm to determine a minimal basis for the kernel of a polyn...
A matrix S is a solvent of the matrix polynomial M(X)=A₀Xᵐ +...+ Am if M(S)=O where A, X, and S are ...
AbstractThis paper is devoted to the study of some formulas for polynomial decomposition of the expo...
The main contribution of this work is to provide two algorithms for the computation of the minimal p...
In linear algebra, the minimal polynomial of an n-by-n matrix A over a field F is the monic polynomi...
We want look at the coordinate-free formulation of the idea of a diagonal matrix, which will be call...
AbstractWe give a matrix generalization of the family of exponential polynomials in one variable φk(...
part(Ⅰ)of this work is on the theory of minimal polynomial matrix and Part(Ⅱ)onthe applications of t...
[EN] A new way to compute the Taylor polynomial of a matrix exponential is presented which reduces t...
AbstractGiven a polynomial solution of a differential equation, its m -ary decomposition, i.e. its d...
How to calculate the exponential of matrices in an explicit manner is one of fundamental problems in...
We use isomorphism ϕ between matrix algebras and simple orthogonal Clifford alge-bras C(Q) to comput...
Given a polynomial solution of a differential equation, its m-ary decomposition, i.e. its decomposit...
The matrix exponential plays a fundamental role in the solution of differential systems which appear...
AbstractFor an arbitrary polynomial p two characterizations of a square matrix A satisfying the poly...
A few years ago Beelen developed an algorithm to determine a minimal basis for the kernel of a polyn...
A matrix S is a solvent of the matrix polynomial M(X)=A₀Xᵐ +...+ Am if M(S)=O where A, X, and S are ...
AbstractThis paper is devoted to the study of some formulas for polynomial decomposition of the expo...
The main contribution of this work is to provide two algorithms for the computation of the minimal p...
In linear algebra, the minimal polynomial of an n-by-n matrix A over a field F is the monic polynomi...
We want look at the coordinate-free formulation of the idea of a diagonal matrix, which will be call...
AbstractWe give a matrix generalization of the family of exponential polynomials in one variable φk(...
part(Ⅰ)of this work is on the theory of minimal polynomial matrix and Part(Ⅱ)onthe applications of t...
[EN] A new way to compute the Taylor polynomial of a matrix exponential is presented which reduces t...
AbstractGiven a polynomial solution of a differential equation, its m -ary decomposition, i.e. its d...
How to calculate the exponential of matrices in an explicit manner is one of fundamental problems in...
We use isomorphism ϕ between matrix algebras and simple orthogonal Clifford alge-bras C(Q) to comput...
Given a polynomial solution of a differential equation, its m-ary decomposition, i.e. its decomposit...
The matrix exponential plays a fundamental role in the solution of differential systems which appear...
AbstractFor an arbitrary polynomial p two characterizations of a square matrix A satisfying the poly...
A few years ago Beelen developed an algorithm to determine a minimal basis for the kernel of a polyn...
A matrix S is a solvent of the matrix polynomial M(X)=A₀Xᵐ +...+ Am if M(S)=O where A, X, and S are ...