Related papers: Computer modeling of exponential and logarithmic f…
The structure of method for constructing a representation of an exponential function in hypercomplex number systems(HNS) by the method of solving an associated system of linear differential equations is considered. Brief information about…
A method of reducing general quaternion functions of first degree, i.e., linear quaternion functions, to quaternary canonical form is given. Linear quaternion functions, once reduced to canonical form, can be maintained in this form under…
This work provides a quaternioinc reprsentation for real symplectic matrices in dimension four, analogous to the pair of unit quaternions representation for special orthogonal matrices. In the process of finding formulae for this…
We provide algorithms for symbolic integration of hyperlogarithms multiplied by rational functions, which also include multiple polylogarithms when their arguments are rational functions. These algorithms are implemented in Maple and we…
Many interesting and useful symbolic computation algorithms manipulate mathematical expressions in mathematically meaningful ways. Although these algorithms are commonplace in computer algebra systems, they can be surprisingly difficult to…
We use isomorphism $\varphi$ between matrix algebras and simple orthogonal Clifford algebras $\cl(Q)$ to compute matrix exponential ${e}^{A}$ of a real, complex, and quaternionic matrix A. The isomorphic image $p=\varphi(A)$ in $\cl(Q),$…
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,…
In the last decade major steps towards an algorithmic treatment of orthogonal polynomials and special functions (OP & SF) have been made, notably Zeilberger's brilliant extension of Gosper's algorithm on algorithmic definite hypergeometric…
The class of non-commutative hypercomplex number systems (HNS) of 4-dimension, constructed by using of non-commutative Grassmann-Clifford procedure of doubling of 2-dimensional systems is investigated in the article and established here are…
In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical…
An efficient systematic procedure is provided for symbolic computation of Lie groups of equivalence transformations and generalized equivalence transformations of systems of differential equations that contain arbitrary elements (arbitrary…
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…
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…
This paper presents an experimental study on the application of quaternions in several machine learning algorithms. Quaternion is a mathematical representation of rotation in three-dimensional space, which can be used to represent complex…
Symmetry plays a central role in accelerating symbolic computation involving polynomials. This chapter surveys recent developments and foundational methods that leverage the inherent symmetries of polynomial systems to reduce complexity,…
In this work a general approach to compute a compressed representation of the exponential $\exp(h)$ of a high-dimensional function $h$ is presented. Such exponential functions play an important role in several problems in Uncertainty…
The hypercomputers compute functions or numbers, or more generally solve problems or carry out tasks, that cannot be computed or solved by a Turing machine. Several numerical simulations of a possible hypercomputational algorithm based on…
Transcendental functions, such as exponentials and logarithms, appear in a broad array of computational domains: from simulations in curvilinear coordinates, to interpolation, to machine learning. Unfortunately they are typically expensive…
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…
In this work, we move beyond the traditional complex-valued representations, introducing more expressive hypercomplex representations to model entities and relations for knowledge graph embeddings. More specifically, quaternion embeddings,…