Related papers: A Hardware-Efficient Approach to Computing the Rot…
This paper presents an innovative set of tools developed to support a methodology to find the left eigenvalues of $m$ order quaternion square matrix. It is solving four real polynomial equations of order not greater than $4m-3$ in four…
A revised version of the quaternion approach for numerical integration of the equations of motion for rigid polyatomic molecules is proposed. The modified approach is based on a formulation of the quaternion dynamics with constraints. This…
A rotation-based synthesis framework for reversible logic is proposed. We develop a canonical representation based on binary decision diagrams and introduce operators to manipulate the developed representation model. Furthermore, a…
This paper introduces a Moment-Quaternion-Sum-of-Squares (QSOS) hierarchy for solving a class of quaternion polynomial optimization problems. This hierarchy is formulated directly in the quaternion domain and consists of a sequence of…
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…
By using complex quaternion, which is the system of quaternion representation extended to complex numbers, we show that the laws of electromagnetism can be expressed much more simply and concisely. We also derive the quaternion…
Elliptical rotation is the motion of a point on an ellipse through some angle about a vector. The purpose of this paper is to examine the generation of elliptical rotations and to interpret the motion of a point on an elipsoid using…
We show how to construct highly symmetric algorithms for matrix multiplication. In particular, we consider algorithms which decompose the matrix multiplication tensor into a sum of rank-1 tensors, where the decomposition itself consists of…
We analyze effective approximation of unitary matrices. In our formulation, a unitary matrix is represented as a product of rotations in two-dimensional subspaces, so-called Givens rotations. Instead of the quadratic dimension dependence…
The polynomial subtraction method, a new numerical approach for reducing the noise variance of Lattice QCD disconnected matrix elements calculation, is introduced in this paper. We use the MinRes polynomial expansion of the QCD matrix as…
The quaternion equation X^n=A is solved for any integer number n > 1. A is a given quaternion with komplex numbers as its elements. We use the isomorphism between quaternions and (4,4)-matrices to solve this equation.
Motion polynomials (polynomials over the dual quaternions with nonzero real norm) describe rational motions. We present a necessary and sufficient condition for reduced bounded motion polynomials to admit factorizations into monic linear…
Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on Fast Fourier Transform (FFT), they for instance multiply two polynomials…
Weighted singular value decomposition (WSVD) of a quaternion matrix and with its help determinantal representations of the quaternion weighted Moore-Penrose inverse have been derived recently by the author. In this paper, using these…
This paper presents new approaches for finding the determinant and inverse of a matrix. The choice of pivot selection is kept arbitrary and can be made according to the users need. So the ill conditioned matrices can be handled easily. The…
We present a novel method to solve the Maxwell-Liouville-von Neumann (MLN) equations in an accurate and efficient way without invoking the rotating wave approximation (RWA). The method is a combination of two established concepts, namely…
Color image completion is a challenging problem in computer vision, but recent research has shown that quaternion representations of color images perform well in many areas. These representations consider the entire color image and…
Inverse iteration is known to be an effective method for computing eigenvectors corresponding to simple and well-separated eigenvalues. In the non-symmetric case, the solution of shifted Hessenberg systems is a central step. Existing…
We present RXTX, a new algorithm for computing the product of matrix by its transpose $XX^{t}$ for $X\in \mathbb{R}^{n\times m}$. RXTX uses $5\%$ fewer multiplications and $5\%$ fewer operations (additions and multiplications) than…
In this work, new closed-form formulas for the matrix exponential are provided. Our method is direct and elementary, it gives tractable and manageable formulas not current in the extensive literature on this essential subject. Moreover,…