Next Article in Journal
γ-Dual Codes over Finite Commutative Chain Rings
Next Article in Special Issue
Join Spaces and Lattices
Previous Article in Journal
Two-Dimensional Time Fractional River-Pollution Model and Its Remediation by Unsteady Aeration
Previous Article in Special Issue
Characterizations of Spatial Quaternionic Partner-Ruled Surfaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Elliptic Quaternion Matrices: Theory and Algorithms

Faculty of Sciences, Department of Mathematics, Sakarya University, Sakarya TR-54050, Türkiye
*
Author to whom correspondence should be addressed.
Axioms 2024, 13(10), 656; https://doi.org/10.3390/axioms13100656
Submission received: 30 July 2024 / Revised: 16 September 2024 / Accepted: 20 September 2024 / Published: 24 September 2024
(This article belongs to the Special Issue Advances in Classical and Applied Mathematics)

Abstract

:
In this study, we obtained results for the computation of eigen-pairs, singular value decomposition, pseudoinverse, and the least squares problem for elliptic quaternion matrices. Moreover, we established algorithms based on these results and provided illustrative numerical experiments to substantiate the accuracy of our conclusions. In the experiments, it was observed that the p-value in the algebra of elliptic quaternions directly affects the performance of the problem under consideration. Selecting the optimal p-value for problem-solving and the elliptic behavior of many physical systems make this number system advantageous in applied sciences.

1. Introduction

Eigenvalues and eigenvectors, singular value decomposition, the pseudoinverse, and the least squares solution form the foundational pillars of matrix theory, with significant applications in diverse fields such as theoretical and computational mathematics, image and signal processing, principal component analysis, data compression, machine learning, deep learning, etc. For example, Israel and Greville comprehensively treated eigenvalues, eigenvectors, singular value decomposition, the pseudoinverse, and the least squares solution. The book explores the interconnections between these concepts, presenting both their underlying theories and practical applications across various fields [1]. Samar et al. presented a K-weighted pseudoinverse and gave results for condition numbers for the solution of the least squares problem with equality constraint [2]. Samar et al. explored the conditioning theory of the M L -weighted least squares and M L -weighted pseudoinverse problems [3]. Simsek focused on obtaining least-squares solutions for generalized Sylvester-type quaternion matrix equations using pseudoinverses and applied these solutions to color image restoration processes [4]. Dian et al. presented a novel hyperspectral image and multispectral image fusion method based on the subspace representation and convolutional neural network denoiser. They obtained the subspaces via singular value decomposition of a high-resolution hyperspectral image [5]. Hashemipour et al. proposed a new lossy data compression framework centered on optimal singular value decomposition for big data compression [6]. Wang and Zhu focused on the implementation of data reduction algorithms in machine learning by using eigenvalues-eigenvectors, singular value decomposition, and principal component analysis [7].
These mathematical concepts not only form the basis of numerous applications but also extend to n-dimensional hypercomplex number systems. There is a generalization involving 2-dimensional hypercomplex numbers [8]. The following is the definition of these numbers, known as generalized complex numbers:
q ( g ) = q ( g ) , r + q ( g ) , i i ,
where q ( g ) , r , q ( g ) , i R , i R and i 2 = p p R . Generalized Segre quaternions are generalized complex numbers extended to 4 dimensions. Generalized Segre quaternions are defined as follows:
q G S = q G S , r + q G S , i i + q G S , j j + q G S , k k ,
where q G S , r , q G S , i , q G S , j , q G S , k R , i , j , k R . The multiplication rules for units i , j and k are given below:
i 2 = k 2 = p , j 2 = 1 , i j = j i = k , j k = k j = i , k i = i k = p j , p R .
Based on the value of p, generalized complex numbers and Segre quaternions are classified into three categories: they are referred to as hyperbolic complex numbers and hyperbolic quaternions when p > 0 , parabolic complex numbers and parabolic quaternions when p = 0 , and elliptic complex numbers and elliptic quaternions when p < 0 , [8,9]. Each number system has various scientific and technological applications. For example, some problemsin non-Euclidean geometries can be solved by hyperbolic complex numbers and hyperbolic quaternions [10]. In domains like robotic control and spatial mechanics, parabolic complex (dual) numbers and parabolic quaternions are employed [11]. On the other hand, as numerous physical systems demonstrate elliptical behavior, the practical applications of elliptic complex numbers and elliptic quaternions in applied science are noteworthy. One of the examples is that, Ozdemir defined elliptic quaternions (non-commutative) and generated an elliptical rotation matrix for the motion of a point on an ellipse through some angle about a vector using those quaternions [12]. Dundar et al. studied elliptical harmonic motion, which is the superposition of two simple harmonic motions in perpendicular directions with the same angular frequency and phase difference of π 2 using elliptic complex numbers [13]. Derin and Gungor proposed the generalization of gravity, including the Proca-type and gravitomagnetic monopole by means of elliptic biquaternions [14]. Catoni et al. introduced algebraic properties and the differential conditions of elliptic quaternionic systems [9]. Additionally, Catoni et al. studied the constant curvature spaces associated with the geometry generated by elliptic quaternions. They formulated geodesic equations within the context of Riemann geometry [15]. Gua et al. defined the elliptic quaternionic canonical transform and investigated Parseval’s theorem with the help of this transform [16]. Yuan et al. obtained the Hermitian solutions of the elliptic quaternion matrix equation A X B , C X D = E , G [17]. Tosun and Kosal characterized the existence of the solution to Sylvester s-conjugate elliptic quaternion matrix equations. They obtained the solution explicitly using a real representation of an elliptic quaternion matrix [18]. Gai and Huang developed a new convolutional neural network with elliptic quaternion values. They conducted extensive experiments on colour image classification and colour image denoising to evaluate the performance of the proposed convolutional neural network [19]. Guo et al. studied the problem of solutions to Maxwell’s equations of elliptic quaternions using a real representation of elliptic quaternion matrices [20]. Atali et al. obtained the elliptic quaternionic least-squares solution with the minimum norm of the elliptic quaternion matrix equation A X = B . Furthermore, leveraging the insights derived from their theories, they developed a novel color image restoration model known as the elliptical quaternionic least squares restoration filter [21].
As observed, the elliptic quaternions and their matrices find numerous practical applications in various branches of applied sciences. Thus, further study of the theoretical properties and numerical computations of elliptic quaternions and their matrices is becoming increasingly necessary. In this regard, we derive outcomes concerning the computation of eigen-pairs, singular value decomposition, pseudoinverse, and least squares solutions with the minimum norm for elliptic quaternion matrices. Additionally, algorithms are formulated based on these results, accompanied by illustrative numerical experiments to validate our findings’ precision empirically. Within the context of this paper, the following notations are employed. Let R , C , C p , and H p denote the sets of real numbers, complex numbers, elliptic complex numbers, and elliptic quaternions, respectively. R m × n , C m × n , C p m × n , and H p m × n denote the set of all m × n matrices on R , C , C p and H p , respectively. Throughout the study, we will also denote elliptic complex numbers as EC numbers and elliptic quaternions as EQs for short. Also, we use the following notations: q represents a complex number when = c , an EC number when = e , and an EQ when = E . Similarly, Q denotes a complex matrix when = c , an EC matrix when = e , and an EQ matrix when = E .

2. Preliminaries

In this section, some basic algebraic properties and notations for EC numbers and EQs are given. This section provides the basis for further operations, which are discussedin the following sections.
An EC number q e is denoted by q e = q e , r + q e , i i , where i 2 = p < 0 and q e , r , q e , i , p R . The real and imaginary parts of q e are denoted by Re q e = q e , r and Im q e = q e , i , respectively. The conjugate and norm of q e C p are defined as q e ¯ = q e , r q e , i i and q e p = q e , r 2 p q e , i 2 , respectively [22]. The multiplication of two EC numbers q 1 , e = q 1 , e , r + q 1 , e , i i and q 2 , e = q 2 , e , r + q 2 , e , i i is defined as
q 1 , ( e ) q 2 , ( e ) = q 1 , ( e ) , r q 2 , ( e ) , r + p q 1 , ( e ) , i q 2 , ( e ) , i + i q 1 , ( e ) , r q 2 , ( e ) , i + q 2 , ( e ) , r q 1 , ( e ) , i .
An EC matrix Q ( e ) is denoted as Q ( e ) = Q ( e ) , r + Q ( e ) , i i , where i 2 = p < 0 , p R , and Q ( e ) , r , Q ( e ) , i R m × n . The conjugate, transpose, conjugate transpose and Frobenius norm of Q ( e ) C p m × n are defined by Q e ¯ = Q e , r Q e , i i , Q e T = Q e , r T + Q e , i T i , Q e = Q e , r T Q e , i T i , and Q ( e ) p = Q ( e ) , r 2 p Q ( e ) , i 2 , respectively. The multiplication of two EC matrices Q 1 , e = Q 1 , e , r + Q 1 , e , i i and Q 2 , e = Q 2 , e , r + Q 2 , e , i i is defined as
Q 1 , ( e ) Q 2 , ( e ) = Q 1 , ( e ) , r Q 2 , ( e ) , r + p Q 1 , ( e ) , i Q 2 , ( e ) , i + i Q 1 , ( e ) , r Q 2 , ( e ) , i + Q 2 , ( e ) , r Q 1 , ( e ) , i .
There exists an isomorphism between EC matrices and complex matrices, as depicted in the following:
H p : C p m × n C m × n Q e = Q e , r + Q e , i i H p Q e = Q c = Q e , r + I p Q e , i ,
where I represents the complex unit ( I 2 = 1 ). Some algebraic operations of this isomorphism are listed below, where Q e , 1 and Q e , 2 are EC matrices of appropriate sizes:
(a)
H p Q e , 1 Q e , 2 = H p Q e , 1 H p Q e , 2 ,
(b)
H p Q e , 1 T = H p Q e , 1 T ,
(c)
H p Q e , 1 = H p Q e , 1 ,
(d)
H p Q e , 1 ¯ = H p Q e , 1 ¯ .
Many algebraic properties of EC numbers (or matrices) can be derived from their corresponding complex counterparts using this isomorphism [8,23].
An EQ  q ( E ) is denoted as q ( E ) = q ( E ) , r + q ( E ) , i i + q ( E ) , j j + q ( E ) , k k , where i 2 = k 2 = p < 0 , j 2 = 1 , i j = j i = k , j k = k j = i , k i = i k = p j , and q ( E ) , r , q ( E ) , i , q ( E ) , j , q ( E ) , k , p R [9,22]. An EQ  q E is denoted in the forms:
q E = q E , r + i q E , i + q E , j + i q E , k j = q e , 1 e 1 + q e , 2 e 2 ,
where
q e , 1 = q E , r + q E , j + q E , i + q E , k i
and
q e , 2 = q E , r q E , j + q E , i q E , k i ,
are EC numbers and e 1 = 1 + j 2 , e 2 = 1 j 2 . Clearly, e 1 e 2 = 0 , e 1 + e 2 = 1 , e 1 2 = e 1 and e 2 2 = e 2 . As a result, e 1 and e 2 are disjoint idempotent units. The multiplication of two EQs q 1 , E = q 1 , e , 1 e 1 + q 1 , e , 2 e 2 and q 2 , E = q 2 , e , 1 e 1 + q 2 , e , 2 e 2 is defined by
q 1 , E q 2 , E = q 1 , e , 1 q 2 , e , 1 e 1 + q 1 , e , 2 q 2 , e , 2 e 2 .
The conjugate and norm of the EQ  q E = q e , 1 e 1 + q e , 2 e 2 are defined by q E ¯ = q e , 1 ¯ e 1 + q e , 2 ¯ e 2 and q E p = 1 2 q e , 1 p 2 + q e , 2 p 2 , respectively.
An EQ matrix Q E is represented as
Q E = Q E , r + Q E , i i + Q E , j j + Q E , k k = Q E , r + Q E , i i + j Q E , j + Q E , k i = Q e , 1 e 1 + Q e , 2 e 2 ,
where
Q e , 1 = Q E , r + Q E , j + Q E , i + Q E , k i
and
Q e , 2 = Q E , r Q E , j + Q E , i Q E , k i
are EC matrices and Q E , r , Q E , i , Q E , j , Q E , k R m × n [18,21]. The multiplication of two EQ matrices Q 1 , E = Q 1 , e , 1 e 1 + Q 1 , e , 2 e 2 and Q 2 , E = Q 2 , e , 1 e 1 + Q 2 , e , 2 e 2 is defined by
Q 1 , E Q 2 , E = Q 1 , e , 1 Q 2 , e , 1 e 1 + Q 1 , e , 2 Q 2 , e , 2 e 2 .
The conjugate, transpose, conjugate transpose, and Frobenius norm of EQ matrix Q E = Q e , 1 e 1 + Q e , 2 e 2 H p m × n are defined by Q E ¯ = Q e , 1 ¯ e 1 + Q e , 2 ¯ e 2 , Q E T = Q e , 1 T e 1 + Q e , 2 T e 2 , Q E = Q e , 1 T ¯ e 1 + Q e , 2 T ¯ e 2 and Q E p = 1 2 Q e , 1 p 2 + Q e , 2 p 2 .

3. Eigenvalues and Eigenvectors, Singular Value Decomposition, Pseudoinverse, and Least Squares Problem for EQ Matrices

In the ensuing discourse, we delineate a series of lemmas pivotal for the computation of eigen-pairs, singular value decomposition, pseudoinverse, and the resolution of the least squares problem specifically tailored for EC matrices. Subsequently, leveraging these foundational lemmas, we derive the pertinent theoretical framework associated with elliptic quaternion matrices.

3.1. EC Matrices

Lemma 1.
A polynomial function of degree N with EC number coefficients presented by
f p ( x ( e ) ) = x ( e ) N + q ( e ) , N 1 x ( e ) N 1 + + q ( e ) , 1 x ( e ) + q ( e ) , 0
has exactly N zeros in the set of EC numbers.
Proof. 
Let
f p ( x ( e ) ) = x ( e ) N + q ( e ) , N 1 x ( e ) N 1 + + q ( e ) , 1 x ( e ) + q ( e ) , 0
be a polynomial of degree N with EC coefficients and values. Its complex representation is as follows:
H p f p ( x ( e ) ) = H p x ( e ) N + H p q ( e ) , N 1 H p x ( e ) N 1 + + H p q ( e ) , 1 H p x ( e ) + H p q ( e ) , 0 .
Since this representation is a polynomial of degree N with complex coefficients and values, the fundamental theorem of algebra tells us that it has exactly N roots. Suppose that the complex number x ( c ) = x ( c ) , r + x ( c ) , i I is a root of the polynomial H p f p ( x ( e ) ) . Then, we have:
H p f p ( x ( e ) ) = x ( c ) N + H p q ( e ) , N 1 x ( c ) N 1 + + H p q ( e ) , 1 x ( c ) + H p q ( e ) , 0 = 0 .
Applying the inverse of the isomorphism H p to both sides of the above equation, we get:
f p ( x ( e ) ) = H p 1 x ( c ) N + q ( e ) , N 1 H p 1 x ( c ) N 1 + + q ( e ) , 1 H p 1 x ( c ) + q ( e ) , 0 .
This simplifies to:
f p ( x ( e ) ) = x ( c ) , r + i p x ( c ) , i N + q ( e ) , N 1 x ( c ) , r + i p x ( c ) , i N 1 + + q ( e ) , 1 x ( c ) , r + i p x ( c ) , i + q ( e ) , 0 = 0 .
Therefore, if x ( c ) = x ( c ) , r + x ( c ) , i I is a root of the polynomial H p f p ( x ( e ) ) , then the EC number x ( e ) = x ( c ) , r + i p x ( c ) , i is a root of the polynomial f p ( x ( e ) ) . As a result, f p ( x ( e ) ) has exactly N roots.    □
Lemma 2.
An EC matrix Q e C p n × n has at most n elliptic eigenvalues.
Proof. 
Since the characteristic polynomial f p ( λ e ) = det ( Q e λ e I n ) of the matrix Q e C p n × n is an n-th order polynomial with EC coefficients and values, by Lemma 1, the EC matrix Q e has at most n eigenvalues.    □
Lemma 3.
Let the eigenvalues of an complex matrix H p Q e be denoted by λ H p Q e , and let the corresponding eigenvectors be represented by x H p Q e . Then, the eigenvalues of the EC matrix Q ( e ) C p n × n are given by
λ ( e ) = Re ( λ H p ( Q ( e ) ) ) + i p Im ( λ H p ( Q ( e ) ) )
and the corresponding eigenvectors are given by
x ( e ) = Re ( x H p ( Q ( e ) ) ) + i p Im ( x H p ( Q ( e ) ) ) .
The converse of this lemma is also true.
Proof. 
Let Q ( e ) C p n × n be an EC matrix, and the eigenvalues of an complex matrix H p Q e be denoted by λ H p Q e , and let the corresponding eigenvectors be represented by x H p Q e . Then, we have H p Q ( e ) x H p Q ( e ) = λ H p Q ( e ) x H p Q ( e ) . Applying the inverse of the isomorphism H p to both sides of the last equation, we get:
Q ( e ) H p 1 x H p Q ( e ) = H p 1 λ H p Q ( e ) H p 1 x H p Q ( e ) .
Thus, we get
λ ( e ) = Re λ H p Q ( e ) + i p Im λ H p Q ( e ) ,
and
x ( e ) = Re x H p Q ( e ) + i p Im x H p Q ( e ) .
Lemma 4.
Let Q ( e ) C p n × n . An EC matrix Q e is nonsingular if and only if the complex matrix H p ( Q ( e ) ) is nonsingular. If H p ( Q ( e ) ) is nonsingular, then
Q ( e ) 1 = Re H p Q ( e ) 1 + i p Im H p Q ( e ) 1 .
Proof. 
Let the EC matrix Q ( e ) = Q ( e ) , r + Q ( e ) , i i be nonsingular. Then, there exists an inverse matrix Q ( e ) 1 C p n × n such that Q ( e ) Q ( e ) 1 = Q ( e ) 1 Q ( e ) = I n . If we apply the isomorphism H p to both sides of the last equation, we obtain:
H p Q ( e ) H p Q ( e ) 1 = H p Q ( e ) 1 H p Q ( e ) = I n .
Hence, we conclude that H p Q ( e ) 1 = H p Q ( e ) 1 . On the other hand, since
H p Q ( e ) 1 = Re H p Q ( e ) 1 + I Im H p Q ( e ) 1 ,
we can apply the inverse of the isomorphism H p to this equation, yielding:
Q ( e ) 1 = Re H p Q ( e ) 1 + i p Im H p Q ( e ) 1 .
Lemma 5.
Let Q ( e ) C p m × n be an EC matrix. The pseudoinverse of Q ( e ) , denoted by Q ( e ) , is given by
Q ( e ) = Re H p Q ( e ) + i p Im H p Q ( e ) ,
where H p Q ( e ) is the pseudoinverse of the complex matrix H p Q ( e ) .
Proof. 
Suppose that Q e is the pseudoinverse of the matrix Q e . In that case, the following equations hold:
Q e Q e Q e = Q e , Q e Q e Q e = Q e ,
Q e Q e = Q e Q e , Q e Q e = Q e Q e .
Applying the isomorphism H p to the above equations, we get the following results:
H p Q e H p Q e H p Q e = H p Q e , H p Q e H p Q e H p Q e = H p Q e , H p Q e H p Q e = H p Q e H p Q e , H p Q e H p Q e = H p Q e H p Q e .
As a result, we obtain the following pseudoinverse transformation under the isomorphism  H p :
H p Q e = H p Q e ,
and
Q e = Re H p Q e + i p Im H p Q e .
Lemma 6.
Let Q ( e ) C p m × n . Suppose that the singular value decomposition of the complex matrix H p Q ( e ) is given by H p Q ( e ) = U c Σ V c . Then, the singular value decomposition of the EC matrix Q ( e ) is
Q ( e ) = U e Σ V e ,
where
U e = Re U c + i p Im U c a n d V e = Re U c + i p Im U c .
The converse of this statement is also true.
Proof. 
Suppose that the singular value decomposition of the complex representation H p Q ( e ) is given by:
H p Q ( e ) = U c Σ V c .
Now, using the expansion of the real and imaginary parts of the unitary matrices, we have:
H p Q ( e ) = Re U c + i Im U c Σ Re V c + i Im V c .
Applying the inverse of the isomorphism H p to both sides of the last equation, we obtain:
Q ( e ) = Re U c + i p Im U c Σ Re V c + i p Im V c .
On the other hand, since U c and V c are unitary matrices, we have
U e U e = Re U c + i p Im U c Re U c T i p Im U c T = I n
and
V e V e = Re V c + i p Im V c Re V c T i p Im V c T = I n .
Corollary 1.
Let Q ( e ) C p m × n . Then r a n k Q e = r a n k H p Q e .
Proof. 
Since matrices Q e and H p Q e have the same number of nonzero singular values, we have r a n k Q e = r a n k H p Q e .    □
Lemma 7.
Let Q ( e ) C p m × n . Suppose that H p Q ( e ) = U c Σ V c . In this case, the pseudoinverse of EC matrix Q ( e ) is given by
Q ( e ) = Re V c + i p Im V c Σ Re U c + i p Im U c .
Proof. 
Let H p Q ( e ) = U c Σ V c . Then the pseudoinverse of the complex matrix H p Q ( e ) is H p ( Q ( e ) ) = V ( c ) Σ U ( c ) . From Lemma 5, we have H p ( Q ( e ) ) = H p ( Q ( e ) ) . Substituting this into the previous equation, we have: H p ( Q ( e ) ) = V ( c ) Σ U ( c ) . Applying the inverse of the isomorphism H p to both sides, we conclude that
Q ( e ) = Re ( V ( c ) ) + i p Im ( V ( c ) ) Σ Re ( U ( c ) ) + i p Im ( U ( c ) ) .
Lemma 8.
Let Q 1 , ( e ) C p m × n and Q 2 , ( e ) C p m × q . Suppose that H p Q 1 , ( e ) = U c Σ V c . In this case, the least squares solution with the minimum norm X ( e ) of the EC matrix equation Q 1 , ( e ) X ( e ) = Q 2 , ( e ) is given by
X ( e ) = Re V e + i p Im V e Σ Re U e + i p Im U e Q 2 , e .
Proof. 
Let Q 1 , ( e ) C p m × n and Q 2 , ( e ) C p m × q , and suppose that H p Q 1 , ( e ) = U c Σ V c . Given the EC matrix equation Q 1 , ( e ) X ( e ) = Q 2 , ( e ) , the complex representation of this equation is H p Q 1 , ( e ) H p X ( e ) = H p Q 2 , ( e ) . The least-norm least-squares solution to this complex matrix equation is given by H p X ( e ) = V c Σ U c H p Q 2 , ( e ) . If we apply the inverse of the isomorphism H p to above equation, we get
X ( e ) = Re V ( e ) + i p Im V ( e ) Σ Re U ( e ) + i p Im U ( e ) Q 2 , ( e ) .

3.2. EQ Matrices

Let Q E = Q e , 1 e 1 + Q e , 2 e 2 H p m × n . Since e 1 and e 2 are disjoint idempotent units, the mathematical properties associated with EQ matrices are closely related to EC matrices Q e , 1 , Q e , 2 . In this subsection, results related to eigen-pairs, singular value decomposition, pseudoinverse, and least squares solution with the minimum norm for EQ matrices have been derived from this fact.
Theorem 1.
A polynomial function of degree N with EQ number coefficients presented by
f p x E = x E N + q N 1 , E x E N 1 + + q 1 , E x E + q 0 , E
has exactly N 2 zeros in the set of EQs.
Proof. 
The polynomial f p x E can be written in the form
f p x E = x e , 1 e 1 + x e , 2 e 2 N + q N 1 , e , 1 e 1 + q N 1 , e , 2 e 2 x e , 1 e 1 + x e , 2 e 2 N 1 + + q 1 , e , 1 e 1 + q 1 , e , 2 e 2 x e , 1 e 1 + x e , 2 e 2 + q 0 , e , 1 e 1 + q 0 , e , 2 e 2 = x e , 1 N + q N 1 , e , 1 x e , 1 N 1 + + q 1 , e , 1 x e , 1 + q 0 , e , 1 e 1 + x e , 2 N + q N 1 , e , 2 x e , 2 N 1 + + q 1 , e , 2 x e , 2 + q 0 , e , 2 e 2 = f p x e , 1 e 1 + f p x e , 2 e 2 ,
where f p x e , 1 and f p x e , 2 are polynomials of degree N with EC number coefficients and values. Then, these polynomials have exactly N zeros each from Lemma 1. Suppose that the roots of f p x e , 1 are x α , e , 1 and the roots of f p x e , 2 are x β , e , 1 , where α , β 1 , 2 , 3 , , N . From the last equation, we deduce that the roots of the polynomial f p x E , 1 are x E = x α , e , 1 e 1 + x β , e , 2 e 2 . Since the number of possible different x α , e , 1 , x β , e , 2 pairs is N 2 , the polynomial f p x E , 1 has exactly N 2 zeros in the set of EQs.    □
Theorem 2.
An EQ matrix Q E = Q e , 1 e 1 + Q e , 2 e 2 H p n × n is nonsingular if and only if the EC matrices Q e , 1 , Q e , 2 C p n × n are nonsingular. If Q e , 1 , Q e , 2 C p n × n are nonsingular, then
Q E 1 = Q e , 1 1 e 1 + Q e , 2 1 e 2 .
Proof. 
Suppose that Q E = Q e , 1 e 1 + Q e , 2 e 2 H p n × n is nonsingular and Q E 1 = P e , 1 e 1 + P e , 2 e 2 is inverse of Q E . In this case,
Q E Q E 1 = Q e , 1 P e , 1 e 1 + Q e , 2 P e , 2 e 2 = I n e 1 + I n e 2
holds. By this fact,
Q e , 1 P e , 1 = I n a n d Q e , 2 P e , 2 = I n
are obtained. Then, we get
Q e , 1 1 = P e , 1 a n d Q e , 2 1 = P e , 2 .
Conversely, let’s assume that Q e , 1 , Q e , 2 C p n × n are nonsingular EC matrices. In this case,
Q e , 1 e 1 + Q e , 2 e 2 Q e , 1 1 e 1 + Q e , 2 1 e 2 = I n e 1 + I n e 2
holds. Consequently, Q E = Q e , 1 e 1 + A e , 2 e 2 H p n × n is nonsingular and
Q E 1 = Q e , 1 1 e 1 + Q e , 2 1 e 2
is valid.    □
Theorem 3.
Let Q E = Q e , 1 e 1 + Q e , 2 e 2 H p n × n . Suppose that λ e , 1 and λ e , 2 are eigenvalues of EC matrices Q e , 1 and Q e , 2 corresponding to the eigenvectors x e , 1 and x e , 2 , respectively. Then λ E = λ e , 1 e 1 + λ e , 2 e 2 is an eigenvalue of Q E corresponding to the eigenvector x E = x e , 1 e 1 + x e , 2 e 2 and its converse is also true.
Proof. 
Suppose λ e , 1 , x e , 1 and λ e , 2 , x e , 2 are the eigen-pairs of EC matrices Q e , 1 and Q e , 2 , respectively. Then,
Q E x E = Q E x e , 1 e 1 + x 2 , 2 e 2 = Q e , 1 e 1 + Q e , 2 e 2 x e , 1 e 1 + x e , 2 e 2 = Q e , 1 x e , 1 e 1 + Q e , 2 x e , 2 e 2 = λ e , 1 x e , 1 e 1 + λ e , 2 x e , 2 e 2 = λ e , 1 e 1 + λ e , 2 e 2 x e , 1 e 1 + x e , 2 e 2 = λ E x E .
Thus, λ E , x E is an eigen-pair of Q E . Conversely, assume that λ E , x E is an eigen-pair of Q E . Then, we get Q E x E = λ E x E and
Q e , 1 x e , 1 e 1 + Q e , 2 x e , 2 e 2 = λ e , 1 x e , 1 e 1 + λ e , 2 x e , 2 e 2
which implies
Q e , 1 x e , 1 = λ e , 1 x e , 1 and Q e , 2 x e , 2 = λ e , 2 x e , 2 .
Corollary 2.
Let Q E = Q e , 1 e 1 + Q e , 2 e 2 H p n × n . Then, the EQ matrix Q E has at most n 2 eigenvalues.
Proof. 
Let Q E = Q e , 1 e 1 + Q e , 2 e 2 H p n × n . Then, EC matrices Q e , 1 and Q e , 2 have at most n eigenvalues from Lemma 2. Suppose that eigenvalues of Q e , 1 are λ α , e , 1 and eigenvalues of Q e , 2 are λ β , e , 1 , where α , β 1 , 2 , 3 , , n . From Theorem 3, we deduce that eigenvalues of EQ matrix Q E = Q e , 1 e 1 + Q e , 2 e 2 H p n × n are λ E = λ α , e , 1 e 1 + λ β , e , 2 e 2 . Since the number of possible different λ α , e , 1 , λ β , e , 2 pairs is n 2 , EQ matrix Q E = Q e , 1 e 1 + Q e , 2 e 2 H p n × n has at most n 2 eigenvalues.    □
Theorem 4.
Let Q E = Q e , 1 e 1 + Q e , 2 e 2 H p m × n . Suppose that singular value decompositions of Q e , 1 and Q e , 2 are Q e , 1 = U e , 1 Σ 1 V e , 1 and Q e , 2 = U e , 2 Σ 2 V e , 2 , respectively. Then, the singular value decomposition of EQ matrix Q E is given by
Q E = U E Σ E V E ,
where Σ E = Σ 1 e 1 + Σ 2 e 2 , U E = U e , 1 e 1 + U e , 2 e 2 and V E = V e , 1 e 1 + V e , 2 e 2 such that U E and V E are unitary matrices.
Proof. 
Let the singular value decompositions of Q e , 1 and Q e , 2 be Q e , 1 = U e , 1 Σ 1 V e , 1 and Q e , 2 = U e , 2 Σ 2 V e , 2 , respectively. Then, the singular value decomposition of Q E is as follows:
Q E = Q e , 1 e 1 + Q e , 2 e 2 = U e , 1 Σ 1 V e , 1 e 1 + U e , 2 Σ 2 V e , 2 e 2 = U e , 1 e 1 + U e , 2 e 2 Σ 1 e 1 + Σ 2 e 2 V e , 1 e 1 + V e , 2 e 2 = U E Σ E V E ,
where
U E U E = U e , 1 e 1 + U e , 2 e 2 U e , 1 e 1 + U e , 2 e 2 = U e , 1 U e , 1 e 1 + U e , 2 U e , 2 e 2 = I n e 1 + I n e 2 = I n , V E V E = V e , 1 e 1 + V e , 2 e 2 V e , 1 e 1 + V e , 2 e 2 = V e , 1 V e , 1 e 1 + V e , 2 V e , 2 e 2 = I n e 1 + I n e 2 = I n ,
and Σ E is hyperbolic matrix. ( Σ E is real matrix if and only if Σ 1 = Σ 2 . )    □
Corollary 3.
Let Q E = Q e , 1 e 1 + Q e , 2 e 2 H p m × n . Then
r a n k Q E = max r a n k Q e , 1 , r a n k Q e , 2 .
Proof. 
Let Q E = U E Σ E V E , Q e , 1 = U e , 1 Σ 1 V e , 1 and Q e , 2 = U e , 2 Σ 2 V e , 2 . In this case, the ranks of matrices Q E , Q e , 1 , and Q e , 2 , are equal to the rank of matrix Σ E , Σ 1 , and Σ 2 , respectively. Since Σ E = Σ 1 e 1 + Σ 2 e 2 , we get
r a n k Σ E = max r a n k Σ 1 , r a n k Σ 2 = max r a n k Q e , 1 , r a n k Q e , 2 .
Thus, we have
r a n k Q E = max r a n k Q e , 1 , r a n k Q e , 2 .
Corollary 4.
Let Q E = Q e , 1 e 1 + Q e , 2 e 2 H p m × n and Q E = U E Σ E V E . Then, the pseudoinverse of Q E is Q E = V E Σ E U E , where Σ = Σ 1 e 1 + Σ 2 e 2 and Σ 1 , Σ 2 R m × n .
Proof. 
Since the units e 1 and e 2 are adjoint idempotent, we get Q E = Q e , 1 e 1 + Q e , 2 e 2 . Then, the pseudoinverse of Q E is as follows:
Q E = Q e , 1 e 1 + Q e , 2 e 2 = V e , 1 Σ 1 U e , 1 e 1 + V e , 2 Σ 2 U e , 2 e 2 = V e , 1 e 1 + V e , 2 e 2 Σ 1 e 1 + Σ 2 e 2 U e , 1 e 1 + U e , 2 e 2 = V E Σ E U E .
Theorem 5.
The least squares solution with the minimum norm of the EQ matrix equation Q 1 , E X E = Q 2 , E is
X E = Q 1 , E Q 2 , E = V E Σ E U E Q 2 , E ,
where Q 1 , E H p m × n and Q 2 , E H p m × q .
Proof. 
Let the least squares solution with the minimum norm of the EQ matrix equation Q 1 , E X E = Q 2 , E be X E . Then we get Q 1 , E X E Q 2 , E p = min and
Q 1 , E X E Q 2 , E p 2 = Q 1 , e , 1 e 1 + Q 1 , e , 2 e 2 X e , 1 e 1 + X e , 2 e 2 Q 2 , e , 1 e 1 + Q 2 , e , 2 e 2 p 2 = Q 1 , e , 1 X e , 1 e 1 + Q 1 , e , 2 X e , 2 e 2 Q 2 , e , 1 e 1 + Q 2 , e , 2 e 2 p 2 = Q 1 , e , 1 X e , 1 Q 2 , e , 1 e 1 + Q 1 , e , 2 X e , 2 Q 2 , e , 2 e 2 p 2 .
From the definition of the Frobenius norm of EQ matrices, we have
Q 1 , E X E Q 2 , E p 2 = 1 2 Q e , 1 X e , 1 Q 2 , e , 1 p 2 + Q 1 , e , 2 X e , 2 Q 2 , e , 2 p 2 .
Hence, Q 1 , E X E Q 2 , E p = min if and only if
Q 1 , e , 1 X e , 1 Q 2 , e , 1 p = min , and Q 1 , e , 2 X e , 2 Q 2 , e , 2 p = min .
If Q 1 , e , 1 X e , 1 Q 2 , e , 1 p = min , then X e , 1 = Q 1 , e , 1 Q 2 , e , 1 and similarly, X e , 2 = Q 1 , e , 2 Q 2 , e , 2 , where Q 1 , e , 1 = V e , 1 Σ 1 U e , 1 and Q 1 , e , 2 = V e , 2 Σ 2 U e , 2 . Therefore, the least squares solution of the equation Q 1 , E X E = Q 2 , E is
X E = V e , 1 Σ 1 U e , 1 Q 2 , e , 1 e 1 + V e , 2 Σ 2 U e , 2 Q 2 , e , 2 e 2 = V e , 1 Σ 1 U e , 1 e 1 + V e , 2 Σ 2 U e , 2 e 2 Q 2 , e , 1 e 1 + Q 2 , e , 2 e 2 = V e , 1 e 1 + V e , 2 e 2 Σ 1 e 1 + Σ 2 e 2 U e , 1 e 1 + U e , 2 e 2 Q 2 , e , 1 e 1 + Q 2 , e , 2 e 2 = V E Σ E U E Q 2 , E = Q 1 , E Q 2 , E
which completes the proof.    □

3.2.1. Algorithms

The following algorithms delineate the computational procedures for determining eigen-pairs, singular value decomposition, pseudoinverse computation, and the derivation of least squares solution with the minimum norm for EQ matrices.
Algorithm 1 This algorithm calculates the eigenvalues and eigenvectors of the EQ matrix Q E H p n × n .
1:
Start
2:
  Input Q E , r , Q E , i , Q E , j , Q E , k and p
3:
  Form Q e , 1 and Q e , 2 according to Equation (1)
4:
  Compute λ e , 1 and λ e , 2 according to Lemma 3 and Theorem 3
5:
  Compute x e , 1 and x e , 2 according to Lemma 3 and Theorem 3
6:
  Form λ E = λ e , 1 e 1 + λ e , 2 e 2 according to Theorem 3
7:
  Form x E = x e , 1 e 1 + x e , 2 e 2 according to Theorem 3
8:
  Output λ E and x E
9:
End
Algorithm 2 This algorithm performs the singular value decomposition of the EQ matrix Q E H p m × n .
1:
Start
2:
  Input Q E , r , Q E , i , Q E , j , Q E , k and p
3:
  Form Q e , 1 and Q e , 2 according to Equation (1)
4:
  Compute Q e , 1 = U e , 1 Σ 1 V e , 1 and Q e , 2 = U e , 2 Σ 2 V e , 2 according to Lemma 6
5:
  Form U E = U e , 1 e 1 + U e , 2 e 2 , Σ E = Σ 1 e 1 + Σ 2 e 2 , and V E = V e , 1 e 1 + V e , 2 e 2 according to Theorem 4
6:
  Output U E , Σ E , V E
7:
End
Algorithm 3 This algorithm calculates the pseudoinverse of the EQ matrix Q E H p m × n .
1:
Start
2:
  Run the Algorithm 2 for EQ matrix Q E
3:
  Form Q E = U E Σ E V E
4:
  Compute Q E = V E Σ E U E
5:
  Output Q E
6:
End
Algorithm 4 This algorithm calculates the minimum norm least squares solution of the EQ matrix equation Q 1 , E X E = Q 2 , E .
1:
Start
2:
  Input Q 1 , E , r , Q 1 , E , i , Q 1 , E , j , Q 1 , E , k , Q 2 , E , r , Q 2 , E , i , Q 2 , E , j , Q 2 , E , k and p
3:
  Run the Algorithm 3 for EQ matrix Q 1 , E
4:
  Compute X E = Q 1 , E Q 2 , E = V E Σ E U E Q 2 , E
5:
  Output X E
6:
End
The fact that EQs are commutative with respect to multiplication, can be written as a linear combination of two adjoint idempotent units, can choose the most appropriate p-value for the solution of the problem under consideration, and many physical systems exhibit elliptical behavior make this number system advantageous in applied sciences. Therefore, using the algorithms given above in applied sciences will solve many problems related to time, memory, and performance in the problem-solving processes.

3.2.2. Numerical Examples

In this subsection, some illustrative examples are given to prove the authenticity of our results and distinguish them from existing ones. Moreover, all computations are performed using the MATLAB® 2024a (64 bit) on an Intel(R) Xeon(R) CPU E5-1650 v4 @3.60 GHz (12 CPUs)/16 GB (DDR3) RAM computer.
Example 1.
Given the EQ matrices Q 1 , E and Q 2 , E as follows:
Q 1 , E = 9 + i 7 j + 2 k 2 7 i + j + 5 k 8 4 i + 7 j 4 k 5 + 8 i j + 4 k 4 + 7 i + j k 9 6 i 3 j + 8 k 8 + 9 i + 3 j 4 k 9 2 i + 8 j + 2 k 6 5 i + 9 j 6 k H 0.5 3 × 3 ,
and
Q 2 , E = 7 + 2 i + 3 j + k 7 6 i + j + 4 k 3 + 3 i 5 j 8 k H 0.5 3 × 1 .
Let’s find the least squares solution with the minimum norm by using Algorithms 2–4 for p = 0.5 . By the Algorithm 2, we get the singular value decomposition of EQ matrix Q 1 , E as follows:
Σ = 27.1507 + 5.1850 j 0 0 0 13.3956 3.6604 j 0 0 0 3.5511 + 0.0727 j ,
U = 0.5887 0.0895 i + 0.1905 j 0.1797 k 0.5737 + 0.2198 i + 0.2880 j 0.0213 k 0.1504 0.0811 i + 0.3531 j + 0.1408 k 0.2573 0.4628 i + 0.0895 j 0.0090 k 0.2014 0.8270 i + 0.0050 j + 0.3648 k 0.1490 + 0.6752 i + 0.1013 j + 0.4671 k 0.4969 0.4443 i 0.2639 j + 0.0273 k 0.1356 + 0.2676 i 0.1680 j 0.2529 k 0.1172 + 0.4220 i 0.326 j 0.7217 k ,
and
V = 0.6674 + 0.2309 j 0.1204 0.3768 j 0.5534 + 0.1965 j 0.3280 0.3659 i 0.1703 j + 0.0553 k 0.4857 + 0.1440 i 0.0426 j + 0.0036 k 0.3596 0.6220 i 0.2807 j + 0.5391 k 0.2692 0.5713 i 0.2100 j 0.1815 k 0.4859 0.3190 i + 0.1157 j + 0.7682 k 0.1476 0.1702 i + 0.2676 j + 0.0299 k .
By Algorithms 3 and 4, the least squares solution and minimum norm are found as
X E = Q 1 , E Q 2 , E = V E Σ E U E Q 2 , E = 0.7612 1.5582 i 0.1979 j 0.5332 k 1.4757 0.2366 i + 0.1496 j + 1.2282 k 0.0461 + 0.2919 i + 0.4652 j 0.0282 k
and
Q 1 , E X E Q 2 , E p = 1.1801 × 10 14 ,
respectively.
Example 2.
Let’s define the dimensions of the EQ matrices Q 1 , E and Q 2 , E given by:
m = 50 : 50 : 1000 , Q 1 , E = r a n d m , m + r a n d m , m i + r a n d m , m j + r a n d m , m k , Q 2 , E = r a n d m , 1 + r a n d m , 1 i + r a n d m , 1 j + r a n d m , 1 k .
Then, the errors (or minimum norms) corresponding p and m-values are shown in Figure 1. Here, Algorithm 4 was executed for each m-value, iterating over each p-value in the range 1 p 0.1 with a step size of 0.1 . The minimal errors were identified and highlighted on the surface plot with red dots. Also, we compare our new proposed Algorithm 4 and the Algorithm documented by Atali et al. in [21], focusing on CPU time and error metrics. The experimental results of this comparison are depicted in Figure 2 (CPU times) and Figure 3 (Errors). Figure 2 and Figure 3 show that our proposed algorithm outperforms the algorithm presented by Atali et al. in [21] regarding computational efficiency and accuracy.

4. Conclusions

In this study, we derived outcomes for determining eigen-pairs, performing singular value decomposition, obtaining pseudoinverse, and finding the least squares solution with the minimum norm for EQ matrices. Additionally, we developed algorithms grounded on these outcomes and presented illustrative numerical instances to validate our results. This number system is more useful in applied sciences since it allows one to select the ideal p-value suited for the type of problem, considering the elliptical behavior of many physical systems. As a result, the use of EQs in today’s critical technology fields—information security, data analytics, simulation technologies, robotics, signal processing, image processing, artificial intelligence, and machine learning—may effectively solve many problems related to time, memory, and performance.

Author Contributions

Conceptualization, H.H.K.; Formal analysis, E.K. and M.A.; H.H.K., E.K. and B.Ç. wrote the main manuscript text. All authors reviewed the manuscript. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The data used to support the findings of this study are available from the corresponding author upon request.

Acknowledgments

This paper was supported by the Scientific and Technological Research Institution of TÜRKİYE (TUBITAK-1002-a-121F289). We thank TÜBİTAK for their support.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Ben-Israel, A.; Greville, T.N. Generalized Inverses: Theory and Applications; Springer Science Business Media: Berlin/Heidelberg, Germany, 2006. [Google Scholar]
  2. Samar, M.; Li, H.; Wei, Y. Condition numbers for the K-weighted pseudoinverse and their statistical estimation. Linear Multilinear Algebra 2021, 69, 752–770. [Google Scholar] [CrossRef]
  3. Samar, M.; Zhu, X.; Xu, H. Conditioning Theory for M L -Weighted Pseudoinverse and M L -Weighted Least Squares Problem. Axioms 2021, 13, 345. [Google Scholar] [CrossRef]
  4. Simsek, S. Least-squares solutions of generalized Sylvester-type quaternion matrix equations. Adv. Appl. Clifford Algebr. 2023, 33, 28. [Google Scholar] [CrossRef]
  5. Dian, R.; Li, S.; Kang, X. Regularizing hyperspectral and multispectral image fusion by CNN denoiser. IEEE Trans. Neural Netw. Learn. Syst. 2021, 32, 1124–1135. [Google Scholar] [CrossRef] [PubMed]
  6. Hashemipour, N.; Aghaei, J.; Kavousi-Fard, A.; Niknam, T.; Salimi, L.; del Granado, P.C.; Shafie-Khah, M.; Wang, F.; Catalão, J.P.S. Optimal Singular value decomposition based big data compression approach in smart grids. IEEE Trans. Ind. Appl. 2021, 32, 1124–1135. [Google Scholar] [CrossRef]
  7. Wang, Y.C.; Zhu, L. Research and implementation of SVD in machine learning. In Proceedings of the 2017 IEEE/ACIS 16th International Conference on Computer and Information Science, Wuhan, China, 24–26 May 2017; pp. 471–475. [Google Scholar]
  8. Harkin, A.A.; Harkin, J.B. Geometry of generalized complex numbers. Math. Mag. 2004, 77, 118–129. [Google Scholar] [CrossRef]
  9. Catoni, F.; Cannata, R.; Zampetti, P. An introduction to commutative quaternions. Adv. Appl. Clifford Algebr. 2006, 16, 1–28. [Google Scholar] [CrossRef]
  10. Yaglom, I.M. A Simple Non-Euclidean Geometry and Its Physical Basis; Springer: New York, NY, USA, 1979. [Google Scholar]
  11. Condurache, D.; Burlacu, A. Dual tensors based solutions for rigid body motion parameterization. Mech. Mach. Theory 2014, 74, 390–412. [Google Scholar] [CrossRef]
  12. Ozdemir, M. An alternative approach to elliptical motion. Adv. Appl. Clifford Algebr. 2016, 26, 279–304. [Google Scholar] [CrossRef]
  13. Dundar, F.S.; Ersoy, S.; Pereira, N.T.S. Bobillier formula for the elliptical harmonic motion. An. St. Univ. Ovidius Constanta 2018, 26, 103–110. [Google Scholar] [CrossRef]
  14. Derin, Z.; Gungor, M.A. Elliptic biquaternionic equations of gravitoelectromagnetism. Math. Methods Appl. Sci. 2022, 45, 4231–4243. [Google Scholar] [CrossRef]
  15. Catoni, F.; Cannata, R.; Zampetti, P. An introduction to constant curvature spaces in the commutative (Segre) quaternion geometry. Adv. Appl. Clifford Algebr. 2006, 16, 85–101. [Google Scholar] [CrossRef]
  16. Guo, L.; Zhu, M.; Ge, X. Reduced biquaternion canonical transform, convolution and correlation. Signal Process. 2011, 91, 2147–2153. [Google Scholar] [CrossRef]
  17. Yuan, S.F.; Tian, Y.; Li, M.Z. On Hermitian solutions of the reduced biquaternion matrix equation (AXB, CXD) = (E, G). Linear Multilinear Algebra 2020, 68, 1355–1373. [Google Scholar] [CrossRef]
  18. Tosun, M.; Kosal, H.H. An algorithm for solving the Sylvester s-conjugate elliptic quaternion matrix equations. In Algorithms as a Basis of Modern Applied Mathematics; Hošková-Mayerová, Š., Flaut, C., Maturo, F., Eds.; Springer International Publishing: Cham, Switzerland, 2021; pp. 279–292. [Google Scholar]
  19. Gai, S.; Huang, X. Reduced biquaternion convolutional neural network for color image processing. IEEE Trans. Circuits Syst. Video Technol. 2022, 32, 1061–1075. [Google Scholar] [CrossRef]
  20. Guo, Z.; Zhang, D.; Vasiliev, V.I.; Jiang, T. Algebraic techniques for Maxwell’s equations in commutative quaternionic electromagnetics. Eur. Phys. J. Plus 2022, 137, 577–1075. [Google Scholar]
  21. Atali, G.; Kosal, H.H.; Pekyaman, M. A new image restoration model associated with special elliptic quaternionic least-squares solutions based on LabVIEW. J. Comput. Appl. Math. 2023, 425, 115071. [Google Scholar] [CrossRef]
  22. Catoni, F.; Boccaletti, D.; Cannata, R.; Catoni, V.; Nichelatti, E.; Zampetti, P. The Mathematics of Minkowski Space–Time: With an Introduction to Commutative Hypercomplex Numbers; Birkhäuser: Basel, Switzerland, 2008. [Google Scholar]
  23. Surekci, A.; Kosal, H.H.; Gungor, M.A. A Note on Gershgorin disks in the elliptic plane. J. Math. Sci. Model. 2021, 4, 104–109. [Google Scholar]
Figure 1. Errors corresponding p and m-values.
Figure 1. Errors corresponding p and m-values.
Axioms 13 00656 g001
Figure 2. CPU times comparison proposed algorithm with the algorithm in [21].
Figure 2. CPU times comparison proposed algorithm with the algorithm in [21].
Axioms 13 00656 g002
Figure 3. Errors comparison proposed algorithm with the algorithm in [21].
Figure 3. Errors comparison proposed algorithm with the algorithm in [21].
Axioms 13 00656 g003
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Kösal, H.H.; Kişi, E.; Akyiğit, M.; Çelik, B. Elliptic Quaternion Matrices: Theory and Algorithms. Axioms 2024, 13, 656. https://doi.org/10.3390/axioms13100656

AMA Style

Kösal HH, Kişi E, Akyiğit M, Çelik B. Elliptic Quaternion Matrices: Theory and Algorithms. Axioms. 2024; 13(10):656. https://doi.org/10.3390/axioms13100656

Chicago/Turabian Style

Kösal, Hidayet Hüda, Emre Kişi, Mahmut Akyiğit, and Beyza Çelik. 2024. "Elliptic Quaternion Matrices: Theory and Algorithms" Axioms 13, no. 10: 656. https://doi.org/10.3390/axioms13100656

APA Style

Kösal, H. H., Kişi, E., Akyiğit, M., & Çelik, B. (2024). Elliptic Quaternion Matrices: Theory and Algorithms. Axioms, 13(10), 656. https://doi.org/10.3390/axioms13100656

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop