Muaz Seydaoğlu

Philipp Bader, Sergio Blanes, 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.

Philipp Bader, Sergio Blanes, Enrique Ponsoda et al.

We consider the numerical integration of the matrix Hill's equation. Parametric resonances can appear and this property is of great interest in many different physical applications. Usually, the Hill's equations originate from a Hamiltonian function and the fundamental matrix solution is a symplectic matrix. This is a very important property to be preserved by the numerical integrators. In this work we present new sixth-and eighth-order symplectic exponential integrators that are tailored to the Hill's equation. The methods are based on an efficient symplectic approximation to the exponential of high dimensional coupled autonomous harmonic oscillators and yield accurate results for oscillatory problems at a low computational cost. Several numerical examples illustrate the performance of the new methods.

Nurcan Gücüyenen Kaymak, Fatma Zürnacı-Yetiş, Muaz Seydaoğlu

Operator splitting is an effective technique for the numerical solution of nonlinear partial differential equations by decomposing a complex problem into simpler subproblems. In this study, we present and analyze a fully discrete scheme for the fifth-order Korteweg-de Vries-Burgers-Fisher equation (KBF) by combining Strang splitting for time discretization with the Fourier collocation method for spatial discretization. In particular, the Fourier collocation method is an essential component of the proposed fully discrete scheme and yields spectral accuracy in space under suitable regularity assumptions. The KBF equation describes the interaction of reaction, dissipative, and dispersive mechanisms by incorporating the Fisher reaction term together with Burgers-type diffusion and higher-order KdV dispersion. The equation is split into a linear operator and a nonlinear operator, and the resulting subproblems are solved within the Strang splitting framework. Convergence is analyzed in the Sobolev space $H^s$. The local error is derived using operator-theoretic arguments in Banach spaces together with Lie commutator estimates, while the global error is obtained using the Lady Windermere's fan argument. The analysis yields second-order convergence in time and spectral convergence in space. Numerical results confirm the theoretical error estimates and demonstrate the accuracy of the proposed fully discrete scheme.

Muaz Seydaoğlu, Utku Erdoğan, Turgut Öziş

In this work, high order splitting methods have been used for calculating the numerical solutions of the Burgers' equation in one space dimension with periodic and Dirichlet boundary conditions. However, splitting methods with real coefficients of order higher than two necessarily have negative coefficients and can not be used for time-irreversible systems, such as Burgers equations, due to the time-irreversibility of the Laplacian operator. Therefore, the splitting methods with complex coefficients and extrapolation methods with real and positive coefficients have been employed. If we consider the system as the perturbation of an exactly solvable problem(or can be easily approximated numerically), it is possible to employ highly efficient methods to approximate Burgers' equation. The numerical results show that the methods with complex time steps having one set of coefficients real and positive, say $a_i\in\mathbb{R}^+$ and $b_i\in\mathbb{C}^+$, and high order extrapolation methods derived from a lower order splitting method produce very accurate solutions of the Burgers' equation.