Sinc-Galerkin method for solving nonlinear weakly singular two point boundary value problems

A study of Sinc-Galerkin method based on double exponential transformation for solving a class of nonlinear weakly singular two point boundary value problems with non-homogeneous boundary conditions is given. The properties of the Sinc-Galerkin approach are utilized to reduce the computation of nonlinear problem to nonlinear system of equations with unknown coefficients. This method tested on several test examples. We compare our numerical results with several numerical results of existing methods. The demonstrated results confirm that proposed method is considerably efficient, accurate nature and rapidly converge.     

An efficient method for solving nonlinear singular initial value problems

In [M.M. Hosseini, Modified Adomain decomposition method for specific second order ordinary differential equations, Appl. Math. Comput. 186 (2007), pp. 117–123] an efficient modification of Adomian decomposition method has been proposed for solving some cases of ordinary differential equations. In this paper, this method is generalized to more cases. The proposed method can be applied to linear, nonlinear, singular and nonsingular problems. Here, it is focused on nonlinear singular initial value problems of ordinary differential equations. The scheme is tested for some examples and the obtained results demonstrate reliability and efficiency of the proposed method.     

Solving singular nonlinear boundary value problems by combining the homotopy perturbation method and reproducing kernel Hilbert space method

This paper investigates singular nonlinear boundary value problems (BVPs). The numerical solutions are developed by combining He's homotopy perturbation method (HPM) and reproducing kernel Hilbert space method (RKHSM). He's HPM is based on the use of traditional perturbation method and homotopy technique. The HPM can reduce a nonlinear problem to a sequence of linear problems and generate a rapid convergent series solution in most cases. RKHSM is also an analytical technique, which can solve powerfully singular linear BVPs. Therefore, we solve singular nonlinear BVPs using advantages of these two methods. Three numerical examples are presented to illustrate the strength of the method.     

A novel method for nonlinear singular fourth order four-point boundary value problems

In this paper, a novel method is proposed for solving nonlinear singular fourth order four-point boundary value problems (BVPs) by combining advantages of the homotopy perturbed method (HPM) and the reproducing kernel method (RKM). Some numerical examples are presented to illustrate the strength of the method.     

Sextic spline collocation methods for nonlinear fifth-order boundary value problems

In this paper, two sextic-spline collocation methods are developed and analysed for approximating solutions of nonlinear fifth-order boundary-value problems. The first method uses a spline interpolant and the second one is based on a spline quasi-interpolant, which are constructed from sextic splines. They are both proved to be second-order convergent. Numerical results confirm the order of convergence predicted by the analysis. It has been observed that the methods developed in this paper are better than the others given in the literature.     

Using reproducing kernel for solving a class of singular weakly nonlinear boundary value problems

Cui et al. [M. Cui and F. Geng, Solving singular two point boundary value problems in reproducing kernel space, J. Comput. Appl. Math. 205 (2007), pp. 6–15; H. Yao and M. Cui, A new algorithm for a class of singular boundary value problems, Appl. Math. Comput. 186 (2007), pp. 1183–1191] presents an algorithm to solve a class of singular linear boundary value problems in the reproducing kernel space. In this paper, we will present three new algorithms to solve a class of singular weakly nonlinear boundary value problems in reproducing kernel space. The algorithms are efficiently applied to solving some model problems. It is demonstrated by the numerical examples that those algorithms are highly accurate.     

A method for high-order multipoint boundary value problems with Birkhoff-type conditions

In this paper an efficient numerical method for solving a class of multipoint boundary value problems with special boundary conditions of Birkhoff-type is presented. After a quick reference to Birkhoff-type interpolation polynomial which satisfies the particular conditions, and a result on the existence and uniqueness of solution of the given problem, an algorithm is introduced to find a polynomial that approximates the solution. It is a general collocation method. Then an a priori estimation of the error of this approximation is given. Finally, to show the efficiency and the applicability of the method, numerical results are presented. These numerical experiments provide favourable comparisons with the NDSolve command of Mathematica.     

The iterated defect correction methods for singular two-point boundary value problems

In this paper, the iterated defect correction (IDeC) techniques based on the centered Euler method for the equivalent first order system of the singular two-point boundary value problem in linear case (x ^α y′(x))′ = f(x), y(0) = a,y(1) = b, where 0 < α < 1 are considered. By using the asymptotic expansion of the global error, it is analyzed that the IDeC methods improved the approximate results by means of IDeC steps and the degree of the interpolating polynomials used. Some numerical examples from the literature are given in illustration of this theory.     

An efficient numerical technique for the solution of nonlinear singular boundary value problems

In this work, a new technique based on Green’s function and the Adomian decomposition method (ADM) for solving nonlinear singular boundary value problems (SBVPs) is proposed. The technique relies on constructing Green’s function before establishing the recursive scheme for the solution components. In contrast to the existing recursive schemes based on the ADM, the proposed technique avoids solving a sequence of transcendental equations for the undetermined coefficients. It approximates the solution in the form of a series with easily computable components. Additionally, the convergence analysis and the error estimate of the proposed method are supplemented. The reliability and efficiency of the proposed method are demonstrated by several numerical examples. The numerical results reveal that the proposed method is very efficient and accurate.     

Differential quadrature method (DQM) for a class of singular two-point boundary value problems

Differential quadrature method is applied in this work to solve singular two-point boundary value problems with a linear or non-linear nature. It is demonstrated through numerical examples that accurate results for the problem with different types of boundary conditions can be obtained using a considerably small number of grid points. The relative, root mean square and maximum absolute errors in computed solutions are given to show the performance of the method.     

Quintic splines method for second-order boundary value problems

Abstract

We develop a numerical method for computing smooth approximations to the solution of a system of second-order boundary value problems associated with obstacle, unilateral and contact problems based on uniform mesh quintic splines. It is shown that this method gives better approximations than those produced by other collocation, finite-difference and spline methods. A numerical example is given to illustrate the applicability of the new method.     

A fixed-point approach for nonlinear discrete boundary value problems

Existence results are established for second-order discrete boundary value problems.     

Automatically identifying the asymptotic behavior of nonlinear singularly perturbed boundary value problems

We describe a computational procedure designed to automatically analyze the behavior of certain general classes of nonlinear singular perturbation problems by applying the combined results of a body of theory that proves the existence of solutions for these problems. We have also created a computer program that implements the computational procedure. The core mathematical knowledge contained in our program is composed of rules that embody the results of mathematical theorems from nonlinear singular perturbation theory. The principle method of proof used in the mathematical theory yields an estimate of a solution by constructing sharp bounding functions that define a region in which the solution exists uniquely. As a result, a successful application of our program produces an approximation of a solution as a side effect. In addition, the mathematical theory can be used to show the existence of multiple solutions for a nonlinear singularly perturbed boundary value problem. This feature is also reflected in the results obtained from our program. The ability to construct such a program depends critically on the successful coupling of a non-deterministic programming technique called path-finding with the capabilities of a computer algebra system. The research reported here was supported in part by the National Science Foundation under NSF Grant EE-14937, and in part by the CAIP Center, Rutgers University, with funds provided by the New Jersey Commission on Science and Technology and by CAIP's industrial members.     

Polynomial time-marching for nonperiodic boundary value problems

A polynomial interpolation time-marching technique can efficiently provide balanced spectral accuracy in both the space and time dimensions for some PDEs. The Newton-form interpolation based on Fejér points has been successfully implemented to march the periodic Fourier pseudospectral solution in time. In this paper, this spectrally accurate time-stepping technique will be extended to solve some typical nonperiodic initial boundary value problems by the Chebyshev collocation spatial approximation. Both homogeneous Neumann and Dirichlet boundary conditions will be incorporated into the time-marching scheme. For the second order wave equation, besides more accurate timemarching, the new scheme numerically has anO(1/N ²) time step size limitation of stability, much larger thanO(1/N ⁴) stability limitation in conventional finitedifference time-stepping, Chebyshev space collocation methods.