A mesh-free method for the numerical solution of the KdV–Burgers equation

This paper formulates a simple classical radial basis functions (RBFs) collocation (Kansa) method for the numerical solution of the nonlinear dispersive and dissipative KdV–Burgers’ (KdVB) equation. The computed results show implementation of the method to nonlinear partial differential equations. This method has an edge over traditional methods such as finite-difference and finite element methods because it does not require a mesh to discretize the problem domain, and a set of scattered nodes in the domain of influence provided by initial data is required for the realization of the method. Accuracy of the method is assessed in terms of error norms _L2,_L∞$L_2\text{,}{L}_{\infty }$, number of nodes in the domain of influence, parameter dependent RBFs and time step length. Numerical experiments demonstrate accuracy and robustness of the method for solving nonlinear dispersive and dissipative problems.     

A hybrid radial basis functions collocation technique to numerically solve fractional advection–diffusion models

In this work, we propose a hybrid radial basis functions (RBFs) collocation technique for the numerical solution of fractional advection–diffusion models. In the formulation of hybrid RBFs (HRBFs), there exist shape parameter (c* ) and weight parameter (ϵ) that control numerical accuracy and stability. For these parameters, an adaptive algorithm is developed and validated. The proposed HRBFs method is tested for numerical solutions of some fractional Black–Sholes and diffusion models. Numerical simulations performed for several benchmark problems verified the proposed method accuracy and efficiency. The quantitative analysis is made in terms of L_∞, L₂, L_rms , and L_rel error norms as well as number of nodes N over space domain and time-step δt. Numerical convergence in space and time is also studied for the proposed method. The unconditional stability of the proposed HRBFs scheme is obtained using the von Neumann methodology. It is observed that the HRBFs method circumvented the ill-conditioning problem greatly, a major issue in the Kansa method.     

A meshfree method for the numerical solution of the RLW equation

In this paper, we present a meshfree technique for the numerical solution of the regularized long wave (RLW) equation. This approach is based on a global collocation method using the radial basis functions (RBFs). Different kinds of RBFs are used for this purpose. Accuracy of the new method is tested in terms of _L2$L_2$ and _L∞$L_{\infty }$ error norms. In case of non-availability of the exact solution, performance of the new method is compared with existing methods. Stability analysis of the method is established. Propagation of single and double solitary waves, wave undulation, and conservation properties of mass, energy and momentum of the RLW equation are discussed.     

Numerical solution of the system of second-order boundary value problems using the local radial basis functions based differential quadrature collocation method

In this research, we propose a numerical scheme to solve the system of second-order boundary value problems. In this way, we use the Local Radial Basis Function Differential Quadrature (LRBFDQ) method for approximating the derivative. The LRBFDQ method approximates the derivatives by Radial Basis Functions (RBFs) interpolation using a small set of nodes in the support domain of any node. So the new scheme needs much less computational work than the globally supported RBFs collocation method. We use two techniques presented by Bayona et al. (2011, 2012) [29], [30] to determine the optimal shape parameter. Some examples are presented to demonstrate the accuracy and easy implementation of the new technique. The results of numerical experiments are compared with the analytical solution, finite difference (FD) method and some published methods to confirm the accuracy and efficiency of the new scheme presented in this paper.     

Meshless method of lines for the numerical solution of generalized Kuramoto-Sivashinsky equation

In this paper, the numerical solution of the generalized Kuramoto-Sivashinsky equation is presented by meshless method of lines (MOL). In this method the spatial derivatives are approximated by radial basis functions (RBFs) giving an edge over finite difference method (FDM) and finite element method (FEM) because no mesh is required for discretization of the problem domain. Only a set of scattered nodes is required to approximate the solution. The numerical results in comparison with exact solution using different radial basis functions (RBFs) prove the efficiency and accuracy of the method.     

Computation of Gauss-type quadrature formulas

Gaussian formulas for a linear functional L (such as a weighted integral) are best computed from the recursion coefficients relating the monic polynomials orthogonal with respect to L. In Gauss-type formulas, one or more extraneous conditions (such as pre-assigning certain nodes) replace some of the equations expressing exactness when applied to high-order polynomials. These extraneous conditions may be applied by modifying the same number of recursion coefficients. We survey the methods of computing formulas from recursion coefficients, methods of obtaining recursion coefficients and modifying them for Gauss-type formulas, and questions of existence and numerical accuracy associated with those computations.     

Implications of the Choice of Quadrature Nodes for Picard Integral Deferred Corrections Methods for Ordinary Differential Equations

This paper concerns a class of deferred correction methods recently developed for initial value ordinary differential equations; such methods are based on a Picard integral form of the correction equation. These methods divide a given timestep [t_n,t_n+1] into substeps, and use function values computed at these substeps to approximate the Picard integral by means of a numerical quadrature. The main purpose of this paper is to present a detailed analysis of the implications of the location of quadrature nodes on the accuracy and stability of the overall method. Comparisons between Gauss-Legendre, Gauss-Lobatto, Gauss-Radau, and uniformly spaced points are presented. Also, for a given set of quadrature nodes, quadrature rules may be formulated that include or exclude function values computed at the left-hand endpoint t_n. Quadrature rules that do not depend on the left-hand endpoint (which are referred to as right-hand quadrature rules) are shown to lead to L(α)-stable implicit methods with α≈π/2. The semi-implicit analog of this property is also discussed. Numerical results suggest that the use of uniform quadrature nodes, as opposed to nodes based on Gaussian quadratures, does not significantly affect the stability or accuracy of these methods for orders less than ten. In contrast, a study of the reduction of order for stiff equations shows that when uniform quadrature nodes are used in conjunction with a right-hand quadrature rule, the form and extent of order-reduction changes considerably. Specifically, a reduction of order to is observed for uniform nodes as opposed to for non-uniform nodes, where Δt denotes the time step and ε a stiffness parameter such that ε→0 corresponds to the problem becoming increasingly stiff. AMS subject classification (2000) 65B05     

Grid approximation of singularly perturbed parabolic reaction-diffusion equations on large domains with respect to the space and time variables

In an unbounded (with respect to x and t) domain (and in domains that can be arbitrarily large), an initial-boundary value problem for singularly perturbed parabolic reaction-diffusion equations with the perturbation parameter ε² multiplying the higher order derivative is considered. The parameter ε takes arbitrary values in the half-open interval (0, 1]. To solve this problem, difference schemes on grids with an infinite number of nodes (formal difference schemes) are constructed that converge ε-uniformly in the entire unbounded domain. To construct these schemes, the classical grid approximations of the problem on the grids that are refined in the boundary layer are used. Schemes on grids with a finite number of nodes (constructive difference schemes) are also constructed for the problem under examination. These schemes converge for fixed values of ε in the prescribed bounded subdomains that can expand as the number of grid points increases. As ε → 0, the accuracy of the solution provided by such schemes generally deteriorates and the size of the subdomains decreases. Using the condensing grid method, constructive difference schemes that converge ε-uniformly are constructed. In these schemes, the approximation accuracy and the size of the prescribed subdomains (where the schemes are convergent) are independent of ε and the subdomains may expand as the number of nodes in the underlying grids increases.     

Analysis of stationary subdivision schemes for curve design based on radial basis function interpolation

This paper provides a large family of interpolatory stationary subdivision schemes based on radial basis functions (RBFs) which are positive definite or conditionally positive definite. A radial basis function considered in this study has a tension parameter λ>0 such that it provides design flexibility. We prove that for a sufficiently large , the proposed 2L-point (L∈N) scheme has the same smoothness as the well-known 2L-point Deslauriers-Dubuc scheme, which is based on 2L-1 degree polynomial interpolation. Some numerical examples are presented to illustrate the performance of the new schemes, adapting subdivision rules on bounded intervals in a way of keeping the same smoothness and accuracy of the pre-existing schemes on R. We observe that, with proper tension parameters, the new scheme can alleviate undesirable artifacts near boundaries, which usually appear to interpolatory schemes with irregularly distributed control points.     

Domain decomposition method and numerical analysis of a fluid dynamics problem

A two-dimensional problem obtained by time discretization and linearization of a viscous flow governed by the incompressible Navier-Stokes equations is considered. The original domain is divided into subdomains such that their interface is a smooth (nonclosed, self-avoiding) curve with the ends belonging to the boundary of the domain. A nonconforming finite element method is constructed for the problem, and the convergence rate of the discrete solution of the problem to the exact one is estimated in the L ₂(Ω _h ) norm.     

Solution of the Dirichlet problem for a singularly perturbed reaction-diffusion equation in a square on a Bakhvalov grid

The Dirichlet problem for a singularly perturbed reaction-diffusion equation in a square is solved with the help of the classic five-point difference scheme and a grid that is the tensor product of 1D Bakhvalov grids. Without imposing additional matching conditions in the corners of the domain, it is shown that the grid solution to the problem has the accuracy O(N ⁻²) in the norm L _∞ ^h , where N is the number of grid nodes along each direction. The accuracy is uniform with respect to a small parameter. A simulation confirms the theoretical prediction.     

Implicit formulation for advection–diffusion simulation based on particle distribution moments

This paper introduces an implicit method for advection–diffusion equations called Implicit DisPar, based on particle displacement moments applied to uniform grids. The present method tries to solve constraints associated with explicit methods also based on particle displacement methods, in which diffusivity-dominated situations can only be handled by considerably increasing the associated computational costs. In fact, a higher particle destination nodes number allows the use of higher diffusion coefficients for the transport simulation without instabilities. The average was evaluated by an analogy between the Fokker–Planck and the transport equations. The variance is considered to be Fickian. The particle displacement distribution is used to predict deterministic mass transfers between domain nodes. Mass conservation was guaranteed by the distribution concept. In the truncation error analysis, it was shown that the linear Implicit DisPar formulation does not have numerical error up to v − 1 order, if the first v particle moments are forced by the Gaussian moments. It was shown by theoretical tests for linear conditions that the model accuracy level is proportional to the number of particle destination nodes.     

Taylor–Galerkin and Taylor-collocation methods for the numerical solutions of Burgers’ equation using B-splines

In this paper, for the numerical solution of Burgers’ equation, we give two B-spline finite element algorithms which involve a collocation method with cubic B-splines and a Galerkin method with quadratic B-splines. In time discretization of the equation, Taylor series expansion is used. In order to verify the stabilities of the purposed methods, von-Neumann stability analysis is employed. To see the accuracy of the methods, L₂ and L_∞ error norms are calculated and obtained results are compared with some earlier studies.     

Coercive boundary value problems for regular degenerate differential-operator equations

This study focuses on nonlocal boundary value problems (BVP) for degenerate elliptic differential-operator equations (DOE), that are defined in Banach-valued function spaces, where boundary conditions contain a degenerate function and a principal part of the equation possess varying coefficients. Several conditions obtained, that guarantee the maximal L_p regularity and Fredholmness. These results are also applied to nonlocal BVP for regular degenerate partial differential equations on cylindrical domain to obtain the algebraic conditions that ensure the same properties.     

Measure-compact operators, almost compact operators, and linear functional equations in L p

Under study are the measure-compact operators and almost compact operators in L _p . We construct an example of a measure-compact operator that is not almost compact. Introducing two classes of closed linear operators in L _p , we prove that the resolvents of these operators are almost compact or measure-compact. We present methods for the reduction of linear functional equations of the second kind in L _p with almost compact or measure-compact operators to equivalent linear integral equations in L _p with quasidegenerate Carleman kernels.     

On the numerical solution of nonlinear Burgers’-type equations using meshless method of lines

In this paper, a meshless method of lines (MMOL) is proposed for the numerical solution of nonlinear Burgers’-type equations. This technique does not require a mesh in the problem domain, and only a set of scattered nodes provided by initial data is required for the solution of the problem using some radial basis functions (RBFs). The scheme is tested for various examples. The results obtained by this method are compared with the exact solutions and some earlier work.     

Fold completeness of a system of root vectors of a system of unbounded polynomial operator pencils in Banach spaces. II. Application

This paper is a continuation of the author’s paper in 2009,where the abstract theory of fold completeness in Banach spaces has been presented.Using obtained there abstract results,we consider now very general boundary value problems for ODEs and PDEs which polynomially depend on the spectral parameter in both the equation and the boundary conditions.Moreover,equations and boundary conditions may contain abstract operators as well.So,we deal,generally,with integro-differential equations,functional-differential equations,nonlocal boundary conditions,multipoint boundary conditions,integro-differential boundary conditions.We prove n-fold completeness of a system of root functions of considered problems in the corresponding direct sum of Sobolev spaces in the Banach Lq-framework,in contrast to previously known results in the Hilbert L 2-framework.Some concrete mechanical problems are also presented.     

Estimates for solutions of reduced hyperbolic equations of the second order with a large parameter

We consider solutions of inhomogeneous, reduced hyperbolic equations of the second order, with a large parameter multiplying the unknown function. These solutions are defined on the m-dimensional region outside a star-shaped body. They satisfy an “outgoing” radiation condition at infinity and a Dirichlet boundary condition.We obtain a priori estimates for these solutions, at every point outside or on the surface of a two- or three-dimensional star-shaped body, that hold for sufficiently large values of the parameter. We prove that each solution is bounded by a linear combination of (i) the maximum norm of its prescribed boundary values, (ii) the L₂ norm of the prescribed values of its tangential derivative, (iii) an L₂ norm of the source term. This result is based on similar inequalities that we first obtain for a certain L₂ norm of the gradient, and of the normal derivative on the boundary, of each solution defined outside an m-dimensional star-shaped body.For the special case of the reduced wave equation, Morawetz and Ludwig [1] have obtained similar estimates. Just as their results have been used in [3] to confirm the geometrical theory of diffraction, the estimates obtained in this paper can be used to establish the validity of certain formal asymptotic solutions of reduced hyperbolic equations.     

A numerical method for solving linear integral equations of the second kind on the non-rectangular domains based on the meshless method

The main purpose of this article is to describe a numerical scheme for solving two-dimensional linear Fredholm integral equations of the second kind on a non-rectangular domain. The method approximates the solution by the discrete collocation method based on radial basis functions (RBFs) constructed on a set of disordered data. The proposed method does not require any background mesh or cell structures, so it is meshless and consequently independent of the geometry of domain. This approach reduces the solution of the two-dimensional integral equation to the solution of a linear system of algebraic equations. The error analysis of the method is provided. The proposed scheme is also extended to linear mixed Volterra–Fredholm integral equations. Finally, some numerical examples are presented to illustrate the efficiency and accuracy of the new technique.     

Lp – Lq Decay Estimates fo the Solutions of Strictly Hyperbolic Equations of Second Order with Increasing in Time Coefficients

One of the most important questions in the theory of nonlinear wave equations is that for global existence of solutions. An essential tool is the Strichartz inequality for special solutions of the wave equation.In the last time different results were proved generalizing the classical one of Strichartz. In the present paper L_p – L_q estimates are proved for the solutions of strictly hyperbolic equations of second order with time dependent coefficients where these are unbounded at infinity. In the first step the WKB method is applied to the construction of a fundamental system of solutions for ordinary differential equations depending on a parameter. In a second step the method of stationary phase yields the asymptotical behaviour of Fourier multipliers with nonstandard phase functions depending on a parameter.