相关论文: Matrix exponential via Clifford algebras
Formulas to calculate multivector exponentials in a base-free representation and in a orthonormal basis are presented for an arbitrary Clifford geometric algebra Cl(p,q). The formulas are based on the analysis of roots of characteristic…
In this note explicit algorithms for calculating the exponentials of important structured 4 x 4 matrices are provided. These lead to closed form formulae for these exponentials. The techniques rely on one particular Clifford Algebra…
An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…
Closed form expressions for a multivector exponential and logarithm are presented in real Clifford geometric algebras Cl(p,q)when n=p+q=1 (complex and hyperbolic numbers) and n=2 (Hamilton, split and conectorine quaternions). Starting from…
We present different methods for symbolic computer algebra computations in higher dimensional (\ge9) Clifford algebras using the \Clifford\ and \Bigebra\ packages for \Maple(R). This is achieved using graded tensor decompositions,…
Modern advances in general-purpose computer algebra systems offer solutions to a variety of problems, which in the past required substantial time investments by trained mathematicians. An excellent example of such development are the…
A classification of idempotents in Clifford algebras C(p,q) is presented. It is shown that using isomorphisms between Clifford algebras C(p,q) and appropriate matrix rings, it is possible to classify idempotents in any Clifford algebra into…
{\sc CLIFFORD} is a Maple package for computations in Clifford algebras $\cl (B)$ of an arbitrary symbolic or numeric bilinear form B. In particular, B may have a non-trivial antisymmetric part. It is well known that the symmetric part g of…
CLIFFORD performs various computations in Grassmann and Clifford algebras. It can compute with quaternions, octonions, and matrices with entries in Cl(B) - the Clifford algebra of a vector space V endowed with an arbitrary bilinear form B.…
For the complex Clifford algebra Cl(p,q) of dimension n=p+q we define a Hermitian scalar product. This scalar product depends on the signature (p,q) of Clifford algebra. So, we arrive at unitary spaces on Clifford algebras. With the aid of…
The modern algebra concepts are used to construct tables of algebraic spinors related to Clifford algebra multivectors with real and complex coefficients. The following data computed by Mathematica are presented in form of tables for…
In this work, we present a new way to compute the Taylor polynomial of the matrix exponential which reduces the number of matrix multiplications in comparison with the de-facto standard Patterson-Stockmeyer method. This reduction is…
Recently the authors presented a matrix representation approach to real Appell polynomials essentially determined by a nilpotent matrix with natural number entries. It allows to consider a set of real Appell polynomials as solution of a…
A particular orthogonal map on a finite dimensional real quadratic vector space (V,Q) with a non-degenerate quadratic form Q of any signature (p,q) is considered. It can be viewed as a correlation of the vector space that leads to a dual…
This work presents a new algorithm to compute the matrix exponential within a given tolerance. Combined with the scaling and squaring procedure, the algorithm incorporates Taylor, partitioned and classical Pad\'e methods shown to be…
After a brief discussion of the computational complexity of Clifford algebras, we present a new basis for even Clifford algebra Cl(2m) that simplifies greatly the actual calculations and, without resorting to the conventional matrix…
Closed form expressions to calculate the exponential of a general multivector (MV) in Clifford geometric algebras (GAs) Cl(p,q) are presented for n=p+q=3. The obtained exponential formulas were applied to find exact GA trigonometric and…
We give a formula for matrix exponentials and partial fraction decompositions.
The paper deals with the process of mathematical modeling representations of exponential and logarithmic functions hypercomplex number system of generalized quaternions via determining a linear differential equation with hypercomplex…
The evaluation of a matrix exponential function is a classic problem of computational linear algebra. Many different methods have been employed for its numerical evaluation [Moler C and van Loan C 1978 SIAM Review 20 4], none of which…