Muaz Seydaoğlu

Dr. Muaz Seydaoğlu

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
1 January 2016 in Journal of Computational and Applied Mathematics
Verified
Journal Article
Closed access
MSMuaz Seydaoğlu
Muaz Seydaoğlu
UEUtku Erdoğan
Utku Erdoğan
TÖT. Öziş
T. Öziş

1 December 2018 in Journal of Computational and Applied Mathematics
Verified
Journal Article
Closed access
MSMuaz Seydaoğlu
Muaz Seydaoğlu

22 January 2019 in Mathematics
Verified
Journal Article
Open access
PDF file
MSMuaz Seydaoğlu
Muaz Seydaoğlu
An efficient technique is proposed to solve the one-dimensional Burgers’ equation based on multiquadric radial basis function (MQ-RBF) for space approximation and a Lie-Group scheme for time integration. The comparisons of the numerical results obtained for different values of kinematic viscosity are made with the exact solutions and the reported results to demonstrate the efficiency and accuracy of the algorithm. It is shown that the numerical solutions concur with existing results and the proposed algorithm is efficient and can be easily implemented.

1 October 2014 in Applied Numerical Mathematics
Verified
Journal Article
Closed access
MSMuaz Seydaoğlu
Muaz Seydaoğlu
Sergio BlanesSergio Blanes
Sergio Blanes

30 January 2019 in Numerical Methods for Partial Differential Equations
Verified
Journal Article
Closed access
PDF file
FYFatma Zürnacı Yetiş
Fatma Zürnacı Yetiş
MSMuaz Seydaoğlu
Muaz Seydaoğlu

1 January 2015 in SIAM Journal on Matrix Analysis and Applications
Verified
Journal Article
Closed access
PBPhilipp Bader
Philipp Bader
Sergio BlanesSergio Blanes
Sergio Blanes
MSMuaz Seydaoğlu
Muaz Seydaoğlu
We propose splitting methods for the computation of the exponential of perturbed matrices which can be written as the sum $A=D+\varepsilon B$ of a sparse and efficiently exponentiable matrix $D$ with sparse exponential $e^D$ and a dense matrix $\varepsilon B$ which is of small norm in comparison with $D$. The predominant algorithm is based on scaling the large matrix $A$ by a small number $2^{-s}$, which is then exponentiated by efficient Padé or Taylor methods and finally squared in order to obtain an approximation for the full exponential. In this setting, the main portion of the computational cost arises from dense-matrix multiplications and we present a modified squaring which takes advantage of the smallness of the perturbed matrix $B$ in order to reduce the number of squarings necessary. Theoretical results on local error and error propagation for splitting methods are complemented with numerical experiments and show a clear improvement over existing methods when medium precision is sought.