The fully Sinc-Galerkin method is developed for a family of complex-valued partial differential equations with time-dependent boundary conditions. The Sinc-Galerkin discrete system is formulated and represented by a Kronecker product form of those equations. The numerical solution is efficiently calculated and the method exhibits an exponential convergence rate. Several examples, some with a re...

In this paper, we explore the applicability of the SincCollocation method to a three-dimensional (3D) oceanography model. The model describes a wind-driven current with depth-dependent eddy viscosity in the complex-velocity system. In general, the Sinc-based methods excel over other traditional numerical methods due to their exponentially decaying errors, rapid convergence and handling problems...

In this paper, we consider two dimensional nonlinear elliptic equations of the form $ -{rm div}(a(u,nabla u)) = f $. Then, in order to solve these equations on rectangular domains, we propose a numerical method based on Sinc-Galerkin method. Finally, the presented method is tested on some examples. Numerical results show the accuracy and reliability of the proposed method.

We study the Newton method and a fixed-point method for solving the system of nonlinear equations arising from the Sinc-Galerkin discretization of the Burgers equations. In each step of the Newton method or the fixedpoint method, a structured subsystem of linear equations is obtained and needs to be solved numerically. In this paper, preconditioning techniques are applied to solve such linear s...

in this article, we develop the sinc-galerkin method based on double exponential transformation for solving a class of weakly singular nonlinear two-point boundary value problems with nonhomogeneous boundary conditions. also several examples are solved to show the accuracy efficiency of the presented method. we compare the obtained numerical results with results of the other existing methods in...

in this work, we study the performance of the sinc-collocation method for solving bratu's problem. for different choices of step size, we consider the maximum absolute errors in the solutions at sinc grid points and tabulated in tables. the comparison of the obtained results veri ed that this method converges to the exact solution rapidly and with