An optimal sixth‐order quartic B‐spline collocation method for solving Bratu‐type and Lane‐Emden–type problems

This paper is concerned with the numerical solutions of Bratu‐type and Lane‐Emden–type boundary value problems, which describe various physical phenomena in applied science and technology. We present an optimal collocation method based on quartic B‐spine basis functions to solve such problems. This method is constructed by perturbing the original problem and on a uniform mesh. The method has been tested by four nonlinear examples. In order to show the advantage of the new method, numerical results are compared with those obtained by some of the existing methods, such as normal quartic B‐spline collocation method and the finite difference method (FDM). It has been observed that the order of convergence of the proposed method is six, which is two orders of magnitude larger than the normal quartic B‐spline collocation method. Moreover, our method gives highly accurate results than the FDM.     

求解非光滑方程组的三次正则化方法

考虑求解非光滑方程组的三次正则化方法及其收敛性分析.利用信赖域方法的技巧,保证该方法是全局收敛的.在子问题非精确求解和BD正则性条件成立的前提下,分析了非光滑三次正则化方法的局部收敛速度.最后,数值实验结果验证了该算法的有效性.     

B‐spline collocation algorithm for numerical solution of the generalized Burger's‐Huxley equation

The cubic B‐spline collocation scheme is implemented to find numerical solution of the generalized Burger's–Huxley equation. The scheme is based on the finite‐difference formulation for time integration and cubic B‐spline functions for space integration. Convergence of the scheme is discussed through standard convergence analysis. The proposed scheme is of second‐order convergent. The accuracy of the proposed method is demonstrated by four test problems. The numerical results are found to be in good agreement with the exact solutions. Results are compared with other results given in literature. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

The use of cubic B‐spline scaling functions for solving the one‐dimensional hyperbolic equation with a nonlocal conservation condition

Problems for parabolic partial differential equations with nonlocal boundary conditions have been studied in many articles, but boundary value problems for hyperbolic partial differential equations have so far remained nearly uninvestigated. In this article a numerical technique is presented for the solution of a nonclassical problem for the one‐dimensional wave equation. This method uses the cubic B‐spline scaling functions. Some numerical results are reported to support our study. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Numerical analysis nonlinear multi‐term time fractional differential equation with collocation method via fractional B‐spline

In this work, we present numerical analysis for nonlinear multi‐term time fractional differential equation which involve Caputo‐type fractional derivatives for . The proposed method is based on utilization of fractional B‐spline basics in collocation method. The scheme can be readily obtained efficient and quite accurate with less computational work numerical result. The proposal approach transform nonlinear multi‐term time fractional differential equation into a suitable linear system of algebraic equations which can be solved by a suitable numerical method. The numerical experiments will be verify to demonstrate the effectiveness of our method for solving one‐ and two‐dimensional multi‐term time fractional differential equation.     

An inverse problem for space‐fractional backward diffusion problem

In this paper, an inverse problem for space‐fractional backward diffusion equation, which is highly ill‐posed, is considered. This problem is obtained from the classical diffusion equation by replacing the second‐order space derivative with a Riesz–Feller derivative of order α ∈ (0,2]. We show that such a problem is severely ill‐posed, and further present a simplified Tikhonov regularization method to deal with this problem. Convergence estimate is presented under a priori choice of regularization parameter. Numerical experiments are given to illustrate the accuracy and efficiency of the proposed method. Copyright © 2013 John Wiley & Sons, Ltd.     

Efficient hybrid method for solving special type of nonlinear partial differential equations

In this article, an efficient hybrid method has been developed for solving some special type of nonlinear partial differential equations. Hybrid method is based on tanh–coth method, quasilinearization technique and Haar wavelet method. Nonlinear partial differential equations have been converted into a nonlinear ordinary differential equation by choosing some suitable variable transformations. Quasilinearization technique is used to linearize the nonlinear ordinary differential equation and then the Haar wavelet method is applied to linearized ordinary differential equation. A tanh–coth method has been used to obtain the exact solutions of nonlinear ordinary differential equations. It is easier to handle nonlinear ordinary differential equations in comparison to nonlinear partial differential equations. A distinct feature of the proposed method is their simple applicability in a variety of two‐ and three‐dimensional nonlinear partial differential equations. Numerical examples show better accuracy of the proposed method as compared with the methods described in past. Error analysis and stability of the proposed method have been discussed.     

Implicitly enriched Galerkin methods for numerical solutions of fourth‐order partial differential equations containing singularities

Highlights are the following:

• For any integer , we construct ‐continuous partition of unity (PU) functions with flat‐top from B‐spline functions to have numerical solutions of fourth‐order equations with singularities. B‐spline functions are modified to satisfy clamped boundary conditions.
• To handle singularity arising in fourth‐order elliptic differential equations, these modified B‐spline functions are enriched either by introducing enrichment basis functions implicitly through particular geometric mappings or by adding singular basis functions explicitly.
• To show the effectiveness of the proposed implicit enrichment methods (mapping method), the accuracy, the number of degrees of freedom (DOF), and matrix condition numbers are computed and compared in the h‐refinement, the p‐refinement, and the k‐refinement of the approximation space of B‐spline basis functions.

Using Partition of unity (PU) functions with flat‐top, B‐spline functions are modified to satisfy boundary conditions of the fourth‐order equations. Since the standard isogeometric analysis (IGA) as well as the conventional FEM have limitations in handling fourth‐order differential equations containing singularities, we consider two enrichment methods (explicit and implicit) in the framework of the p‐, the k, and the h‐refinements of IGA. We demonstrate that both enrichment methods yield good approximate solutions, but explicit enrichment methods give large (almost singular) matrix condition numbers and face integrating singular functions. Because of these limitations of external enrichment methods, we extensively investigate implicit enrichment methods (mapping methods) that virtually convert fourth‐order elliptic problems with singularities to problems with no influence of the singularities. Effectiveness of the proposed mapping method extensively tested to one‐dimensional fourth‐order equation with singularities. The implicit enrichment (mapping) method is extended to the two‐dimensional cases and test it to fourth‐order partial differential equations on cracked domains.     

Multiquadric quasi‐interpolation methods for solving partial differential algebraic equations

In this article, we propose two meshless collocation approaches for solving time dependent partial differential algebraic equations (PDAEs) in terms of the multiquadric quasi‐interpolation schemes. In presenting the process of the solution, the error is estimated. Furthermore, the comparisons on condition numbers of the collocation matrices using different methods and the sensitivity of the shape parameter c are given. With the use of the appropriate collocation points, the method for PDAEs with index‐2 is improved. The results show that the methods have some advantages over some known methods, such as the smaller condition numbers or more accurate solutions for PDAEs which has an modal index‐2 or an impulse solution with index‐2. Copyright © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 95–119, 2014     

Analysis of a moving collocation method for one-dimensional partial differential equations

A moving collocation method has been shown to be very efficient for the adaptive solution of second- and fourth-order time-dependent partial differential equations and forms the basis for the two robust codes MOVCOL and MOVCOL4.In this paper,the relations between the method and the traditional collocation and finite volume methods are investigated.It is shown that the moving collocation method inherits desirable properties of both methods: the ease of implementation and high-order convergence of the traditional collocation method and the mass conservation of the finite volume method.Convergence of the method in the maximum norm is proven for general linear two-point boundary value problems.Numerical results are given to demonstrate the convergence order of the method.     

Numerical simulation of the nonlinear generalized time‐fractional Klein–Gordon equation using cubic trigonometric B‐spline functions

In this paper, an efficient numerical procedure for the generalized nonlinear time‐fractional Klein–Gordon equation is presented. We make use of the typical finite difference schemes to approximate the Caputo time‐fractional derivative, while the spatial derivatives are discretized by means of the cubic trigonometric B‐splines. Stability and convergence analysis for the numerical scheme are discussed. We apply our scheme to some typical examples and compare the obtained results with the ones found by other numerical methods. The comparison shows that our scheme is quite accurate and can be applied successfully to a variety of problems of applied nature.     

Two Tikhonov‐type regularization methods for inverse source problem on the Poisson equation

In this paper, we investigate a problem of the identification of an unknown source on Poisson equation from some fixed location. A conditional stability estimate for an inverse heat source problem is proved. We show that such a problem is mildly ill‐posed and further present two Tikhonov‐type regularization methods (a generalized Tikhonov regularization method and a simplified generalized Tikhonov regularization method) to deal with this problem. Convergence estimates are presented under the a priori choice of the regularization parameter. Numerical results are presented to illustrate the accuracy and efficiency of our methods. Copyright © 2012 John Wiley & Sons, Ltd.     

Numerical solution of Fokker‐Planck equation using the cubic B‐spline scaling functions

In this article a numerical technique is presented for the solution of Fokker‐Planck equation. This method uses the cubic B‐spline scaling functions. The method consists of expanding the required approximate solution as the elements of cubic B‐spline scaling function. Using the operational matrix of derivative, the problem will be reduced to a set of algebraic equations. Some numerical examples are included to demonstrate the validity and applicability of the technique. The method is easy to implement and produces very accurate results. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

B-splines methods with redefined basis functions for solving fourth order parabolic partial differential equations

In this work, we discuss two methods for solving a fourth order parabolic partial differential equation. In Method-I, we decompose the given equation into a system of second order equations and solve them by using cubic B-spline method with redefined basis functions. In Method-II, the equation is solved directly by applying quintic B-spline method with redefined basis functions. Stability of these methods have been discussed. Both methods are unconditionally stable. These methods are tested on four examples. The computed results are compared wherever possible with those already available in literature. We have developed Method-I for fourth order non homogeneous parabolic partial differential equation from which we can obtain displacement and bending moment both simultaneously, while Method-II gives only displacement. The results show that the derived methods are easily implemented and approximate the exact solution very well.     

A layer adaptive B‐spline collocation method for singularly perturbed one‐dimensional parabolic problem with a boundary turning point

In this article, we develop a parameter uniform numerical method for a class of singularly perturbed parabolic equations with a multiple boundary turning point on a rectangular domain. The coefficient of the first derivative with respect to x is given by the formula a₀(x, t)x^p, where a₀(x, t) ≥ α > 0 and the parameter p ∈ [1,∞) takes the arbitrary value. For small values of the parameter ε, the solution of this particular class of problem exhibits the parabolic boundary layer in a neighborhood of the boundary x = 0 of the domain. We use the implicit Euler method to discretize the temporal variable on uniform mesh and a B‐spline collocation method defined on piecewise uniform Shishkin mesh to discretize the spatial variable. Asymptotic bounds for the derivatives of the solution are established by decomposing the solution into smooth and singular component. These bounds are applied in the convergence analysis of the proposed scheme on Shishkin mesh. The resulting method is boundary layer resolving and has been shown almost second‐order accurate in space and first‐order accurate in time. It is also shown that the proposed method is uniformly convergent with respect to the singular perturbation parameter ε. Some numerical results are given to confirm the predicted theory and comparison of numerical results made with a scheme consisting of a standard upwind finite difference operator on a piecewise uniform Shishkin mesh. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1143–1164, 2011     

New solvers for higher dimensional poisson equations by reduced B‐splines

We use higher dimensional B‐splines as basis functions to find the approximations for the Dirichlet problem of the Poisson equation in dimension two and three. We utilize the boundary data to remove unnecessary bases. Our method is applicable to more general linear partial differential equations. We provide new basis functions which do not require as many B‐splines. The number of new bases coincides with that of the necessary knots. The reducing process uses the boundary conditions to redefine a basis without extra artificial assumptions on knots which are outside the domain. Therefore, more accuracy would be expected from our method. The approximation solutions satisfy the Poisson equation at each mesh point and are solved explicitly using tensor product of matrices. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 393–405, 2014     

Exponential convergence and H‐c multiquadric collocation method for partial differential equations

The radial basis function (RBF) collocation method uses global shape functions to interpolate and collocate the approximate solution of PDEs. It is a truly meshless method as compared to some of the so‐called meshless or element‐free finite element methods. For the multiquadric and Gaussian RBFs, there are two ways to make the solution converge—either by refining the mesh size h, or by increasing the shape parameter c. While the h‐scheme requires the increase of computational cost, the c‐scheme is performed without extra effort. In this paper we establish by numerical experiment the exponential error estimate ? ～ O(λ^√c?h) where 0 < λ < 1. We also propose the use of residual error as an error indicator to optimize the selection of c. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 571–594, 2003     

Rational Chebyshev collocation method for solving higher‐order linear ordinary differential equations

A collocation method to find an approximate solution of higher‐order linear ordinary differential equation with variable coefficients under the mixed conditions is proposed. This method is based on the rational Chebyshev (RC) Tau method and Taylor‐Chebyshev collocation methods. The solution is obtained in terms of RC functions. Also, illustrative examples are included to demonstrate the validity and applicability of the technique, and performed on the computer using a program written in maple9. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1130–1142, 2011     

Radial basis collocation method and quasi‐Newton iteration for nonlinear elliptic problems

This work presents a radial basis collocation method combined with the quasi‐Newton iteration method for solving semilinear elliptic partial differential equations. The main result in this study is that there exists an exponential convergence rate in the radial basis collocation discretization and a superlinear convergence rate in the quasi‐Newton iteration of the nonlinear partial differential equations. In this work, the numerical error associated with the employed quadrature rule is considered. It is shown that the errors in Sobolev norms for linear elliptic partial differential equations using radial basis collocation method are bounded by the truncation error of the RBF. The combined errors due to radial basis approximation, quadrature rules, and quasi‐Newton and Newton iterations are also presented. This result can be extended to finite element or finite difference method combined with any iteration methods discussed in this work. The numerical example demonstrates a good agreement between numerical results and analytical predictions. The numerical results also show that although the convergence rate of order 1.62 of the quasi‐Newton iteration scheme is slightly slower than rate of order 2 in the Newton iteration scheme, the former is more stable and less sensitive to the initial guess. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008