Sinem Simsek

Dr. Sinem Simsek


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

8 May 2023 in Advances in Applied Clifford Algebras
Verified
Journal Article
Closed access
PDF file
SSSinem Simsek
Sinem Simsek

8 June 2024 in Calcolo
Verified
Journal Article
Open access
PDF file
SSSinem Simsek
Sinem Simsek
We consider the quaternion linear system $$AX = B$$ A X = B for the unknown matrix X, where A, B are given $$n\times n$$ n × n , $$n\times s$$ n × s matrices with quaternion entries, motivated by applications that arise from fields such as quantum mechanics and signal processing. Our primary concern is the large-scale setting when n is large so that direct solutions are not feasible. We describe a block Krylov subspace method for the iterative solution of these quaternion linear systems. One difference compared to usual block Krylov subspace methods over complex Euclidean spaces is that the multiplication of quaternion scalars is not commutative. We describe a block quaternion Arnoldi process, taking noncommutativity features of quaternions into account, to generate an orthonormal basis for the quaternion Krylov space $$\text {blockspan} \{ R_0, A R_0, \dots , A^k R_0 \}$$ blockspan { R 0 , A R 0 , ⋯ , A k R 0 } , where $$R_0 = B - A X_0$$ R 0 = B - A X 0 and $$X_0$$ X 0 is an initial guess for the solution. Then the best solution of $$AX = B$$ A X = B in the least-squares sense is sought in the generated Krylov space. We explain how these least-squares problems over quaternion Krylov spaces can be solved efficiently by means of Householder reflectors. Most notably, we analyze rigorously the convergence of the proposed block quaternion GMRES approach when A is diagonalizable, and in the more general setting when A is not necessarily diagonalizable by making use of the Jordan form of A. Finally, we report numerical results that confirm the validity of the deduced theoretical convergence results, in particular illustrate that the proposed block quaternion Krylov subspace method converges quickly when A has clustered eigenvalues.

30 June 2024 in Journal of New Theory
Verified
Journal Article
Open access
PDF file
SSSinem Simsek
Sinem Simsek
This study concerns the Sylvester matrix equation in the quaternion setting when the coefficient matrices as well as the unknown matrix have quaternion entries. We propose a global Generalized Minimal Residual (GMRES) method for the solution of such a matrix equation. The proposed approach works directly with the Sylvester operator to generate orthonormal bases for Krylov subspaces formed of matrices. Then, the best approximate matrix solution to the Sylvester equation at hand in such a Krylov subspace is constructed from a matrix minimizing the Frobenius norm of the residual. We describe how this minimization of the residual norm can be carried out efficiently and report numerical results on real examples related to image restoration.

31 August 2023 in Yüzüncü Yıl Üniversitesi Fen Bilimleri Enstitüsü Dergisi
Verified
Journal Article
Closed access
SSSinem Simsek
Sinem Simsek
AKAyça Körükçü
Ayça Körükçü
This study aims at the simultaneous solution of several quaternion linear systems with the same Hermitian and positive definite coefficient matrix by employing the conjugate gradient method. We consider the setting when the quaternion Hermitian positive definite coefficient matrix at hand is very large so that direct methods are not applicable. In the study, we first transform linear quaternion systems into real linear systems. The transformed real linear systems have special structure due to the fact that they are real representations of quaternion systems. Benefitting from the special structure, we further reduce the size of these linear systems. Then a block conjugate gradient method is applied to the resulting reduced real linear systems. The solution obtained after applying the conjugate gradient method is a real representation of the solution of the original quaternion problem. Thus, a conversion of this real solution to the quaternion setting is performed in the end.