On the numerical method for solving a hypersingular integral equation with the computation of the solution gradient

We consider a linear integral equation, which arises when solving the Neumann boundary value problem for the Laplace equation with the representation of the solution in the form of a double layer potential, with a hypersingular integral treated in the sense of Hadamard finite value. We consider the case in which the exterior or interior problem is solved in a domain whose boundary is a closed smooth surface and the integral equation is written over that surface. A numerical scheme for solving the integral equation is constructed with the use of quadrature formulas of the type of the method of discrete singularities with a regularization for the use of an irregular grid. We prove the convergence, uniform over the grid points, of the numerical solutions to the exact solution of the hypersingular equation and, in addition, the uniform convergence of the values of the approximate finite-difference derivative operator on the numerical solution to the values on the projection of the exact solution onto the subspace of grid functions with nodes at the collocation points.     

High order finite difference methods on non-uniform meshes for space fractional operators

In the past decades, the finite difference methods for space fractional operators develop rapidly; to the best of our knowledge, all the existing finite difference schemes, including the first and high order ones, just work on uniform meshes. The nonlocal property of space fractional operator makes it difficult to design the finite difference scheme on non-uniform meshes. This paper provides a basic strategy to derive the first and high order discretization schemes on non-uniform meshes for fractional operators. And the obtained first and second schemes on non-uniform meshes are used to solve space fractional diffusion equations. The error estimates and stability analysis are detailedly performed; and extensive numerical experiments confirm the theoretical analysis or verify the convergence orders.     

The Conservation and Convergence of Two Finite Difference Schemes for KdV Equations with Initial and Boundary Value Conditions

Korteweg-de Vries equation is a nonlinear evolutionary partial differential equation that is of third order in space. For the approximation to this equation with the initial and boundary value conditions using the finite difference method, the difficulty is how to construct matched finite difference schemes at all the inner grid points. In this paper, two finite difference schemes are constructed for the problem. The accuracy is second-order in time and first-order in space. The first scheme is a two-level nonlinear implicit finite difference scheme and the second one is a three-level linearized finite difference scheme. The Browder fixed point theorem is used to prove the existence of the nonlinear implicit finite difference scheme. The conservation, boundedness, stability, convergence of these schemes are discussed and analyzed by the energy method together with other techniques. The two-level nonlinear finite difference scheme is proved to be unconditionally convergent and the three-level linearized one is proved to be conditionally convergent. Some numerical examples illustrate the efficiency of the proposed finite difference schemes.     

Strong-form approach to elasticity: Hybrid finite difference-meshless collocation method (FDMCM)

We propose a numerical method that combines the finite difference (FD) and strong form (collocation) meshless method (MM) for solving linear elasticity equations. We call this new method FDMCM. The FDMCM scheme uses a uniform Cartesian grid embedded in complex geometries and applies both methods to calculate spatial derivatives. The spatial domain is represented by a set of nodes categorized as (i) boundary and near boundary nodes, and (ii) interior nodes. For boundary and near boundary nodes, where the finite difference stencil cannot be defined, the Discretization Corrected Particle Strength Exchange (DC PSE) scheme is used for derivative evaluation, while for interior nodes standard second order finite differences are used. FDMCM method combines the advantages of both FD and DC PSE methods. It supports a fast and simple generation of grids and provides convergence rates comparable to weak formulations. We demonstrate the appropriateness and robustness of the proposed scheme through various benchmark problems in 2D and 3D. Numerical results show good accuracy and h-convergence properties. The ease of computational grid generation makes the method particularly suited for problems where geometries are very complicated and known only imperfectly from images, frequently occurring in e.g. geomechanics and patient-specific biomechanics, where the proposed FDMCM method, after its extension to non-linear regime, appears to be a promising alternative to the traditional weak form-based numerical schemes used in the field.     

Formulation of boundary conditions for vorticity in viscous incompressible flow problems

For the stream function-vorticity formulation of the Navier-Stokes equations, vorticity boundary conditions are required on the body surface and the far-field boundary. A two-parameter approximating formula is derived that relates the velocity and vorticity on the outer boundary of the computational domain. The formula is used to construct an algorithm for correcting the conventional far-field boundary conditions. Specifically, a soft boundary condition is set for the vorticity and a uniform flux is specified for the transversal velocity. A third-order accurate three-parameter formula for the vorticity on the wall is derived. The use of the formula does not degrade the convergence of the iterative process of finding the vorticity as compared with a previously derived and tested two-parameter formula.     

Approximation of the solution and its derivative for the singularly perturbed Black-Scholes equation with nonsmooth initial data

A problem for the black-Scholes equation that arises in financial mathematics is reduced, by a transformation of variables, to the Cauchy problem for a singularly perturbed parabolic equation with the variables x, t and a perturbation parameter ɛ, ɛ ∈ (0, 1]. This problem has several singularities such as the unbounded domain, the piecewise smooth initial function (its first-order derivative in x has a discontinuity of the first kind at the point x = 0), an interior (moving in time) layer generated by the piecewise smooth initial function for small values of the parameter ɛ, etc. In this paper, a grid approximation of the solution and its first-order derivative is studied in a finite domain including the interior layer. On a uniform mesh, using the method of additive splitting of a singularity of the interior layer type, a special difference scheme is constructed that allows us to ɛ-uniformly approximate both the solution to the boundary value problem and its first-order derivative in x with convergence orders close to 1 and 0.5, respectively. The efficiency of the constructed scheme is illustrated by numerical experiments. The text was submitted by the authors in English.     

New higher-order compact finite difference schemes for 1D heat conduction equations

In this paper, we present two higher-order compact finite difference schemes for solving one-dimensional (1D) heat conduction equations with Dirichlet and Neumann boundary conditions, respectively. In particular, we delicately adjust the location of the interior grid point that is next to the boundary so that the Dirichlet or Neumann boundary condition can be applied directly without discretization, and at the same time, the fifth or sixth-order compact finite difference approximations at the grid point can be obtained. On the other hand, an eighth-order compact finite difference approximation is employed for the spatial derivative at other interior grid points. Combined with the Crank–Nicholson finite difference method and Richardson extrapolation, the overall scheme can be unconditionally stable and provides much more accurate numerical solutions. Numerical errors and convergence rates of these two schemes are tested by two examples.     

Some computational features of two-dimensional problems of gas dynamics on irregular triangular grids

We consider a number of computational features of two-dimensional Lagrangian schemes on triangular grids: loss of approximation near the axis (cylindrical symmetry) and measures to counteract this effect; approximation and operator interpretation at corner points where the type of the boundary conditions changes; loss of stability with free approximation of type II boundary conditions; distortion of the Lagrangian grid associated with first-order accuracy on the boundary of an irregular grid.Translated from Vychislitel'naya Matematika i Matematicheskoe Obespechenie EVM, pp. 10–20, 1985.     

On Two Iterative Least-Squares Finite Element Schemes for the Incompressible Navier–Stokes Problem

This paper is mainly devoted to a comparative study of two iterative least-squares finite element schemes for solving the stationary incompressible Navier–Stokes equations with velocity boundary condition. Introducing vorticity as an additional unknown variable, we recast the Navier–Stokes problem into a first-order quasilinear velocity–vorticity–pressure system. Two Picard-type iterative least-squares finite element schemes are proposed to approximate the solution to the nonlinear first-order problem. In each iteration, we adopt the usual L ² least-squares scheme or a weighted L ² least-squares scheme to solve the corresponding Oseen problem and provide error estimates. We concentrate on two-dimensional model problems using continuous piecewise polynomial finite elements on uniform meshes for both iterative least-squares schemes. Numerical evidences show that the iterative L ² least-squares scheme is somewhat suitable for low Reynolds number flow problems, whereas for flows with relatively higher Reynolds numbers the iterative weighted L ² least-squares scheme seems to be better than the iterative L ² least-squares scheme. Numerical simulations of the two-dimensional driven cavity flow are presented to demonstrate the effectiveness of the iterative least-squares finite element approach.     

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.     

Multiresolution based adaptive schemes for second order hyperbolic PDEs in elastodynamic problems

An enhanced interpolation wavelet-based adaptive-grid scheme is implemented for simulating high gradient smooth solutions (as well as, discontinuous ones) in elastodynamic problems in domains with irregular boundary shapes. In the method, spatially adaptive smoothing is used to improve interpolation property of the solution in high gradient zones. In hyperbolic systems, in fact, there are no certain inherent regularities; hence, the erroneous adapted grid may be achieved because of small spurious oscillations in the solution domain. These oscillations, mainly formed in the vicinity of high gradient and discontinuity zones, make the adaptation procedure strongly unstable. To cover this drawback, enhanced smoothing splines are used to denoise directly non-physical oscillations in the irregular grid points, a kind of ill-posed problem. Controllable smoothing is achieved using non-uniform weight coefficients. As the smoothing splines are a kind of the Thikhonov regularization method, they work stably in irregular grid points. Regarding the Thikhonov regularization method, L-curve scheme could be used to investigate trade-off between accuracy and smoothness of the solutions. This relationship, in fact, could not be reliably captured by common computational methods. The proposed method, in general, is easy and conceptually straightforward; as all calculations are carried out in the physical domain. This concept is verified using a variety of 2D numerical examples.     

Accuracy,robustness and efficiency comparison in iterative computation of convection diffusion equation with boundary layers

Nine‐point fourth‐order compact finite difference scheme, central difference scheme, and upwind difference scheme are compared for solving the two‐dimensional convection diffusion equations with boundary layers. The domain is discretized with a stretched nonuniform grid. A grid transformation technique maps the nonuniform grid to a uniform one, on which the difference schemes are applied. A multigrid method and a multilevel preconditioning technique are used to solve the resulting sparse linear systems. We compare the accuracy of the computed solutions from different discretization schemes, and demonstrate the relative efficiency of each scheme. Comparisons of maximum absolute errors, iteration counts, CPU timings, and memory cost are made with respect to the two solution strategies. © 2000 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 16: 379–394, 2000     

Accurate finite difference schemes for solving a 3D micro heat transfer model in an N-carrier system with the Neumann boundary condition in spherical coordinates

In this study, we propose a 3D generalized micro heat transfer model in an N-carrier system with the Neumann boundary condition in spherical coordinates, which can be applied to describe the non-equilibrium heating in biological cells. Two improved unconditionally stable Crank-Nicholson schemes are then presented for solving the generalized model. In particular, we delicately adjust the location of the interior grid point that is next to the boundary so that the Neumann boundary condition can be applied directly without discretization. As such, a second-order accurate finite difference scheme without using any fictitious grid points is obtained. The convergence rates of the numerical solution are tested by an example. Results show that the convergence rates of the present schemes are about 2.0 with respect to the spatial variable r, which improves the accuracy of the Crank-Nicholson scheme coupled with the conventional first-order approximation for the Neumann boundary condition.     

Analytic and Experimental Studies of the Errors in Numerical Methods for the Valuation of Options

The value of a European option satisfies the Black-Scholes equation with appropriately specified final and boundary conditions.We transform the problem to an initial boundary value problem in dimensionless form.There are two parameters in the coefficients of the resulting linear parabolic partial differential equation.For a range of values of these parameters,the solution of the problem has a boundary or an initial layer.The initial function has a discontinuity in the first-order derivative,which leads to the appearance of an interior layer.We construct analytically the asymptotic solution of the equation in a finite domain.Based on the asymptotic solution we can determine the size of the artificial boundary such that the required solution in a finite domain in x and at the final time is not affected by the boundary.Also,we study computationally the behaviour in the maximum norm of the errors in numerical solutions in cases such that one of the parameters varies from finite (or pretty large) to small values,while the other parameter is fixed and takes either finite (or pretty large) or small values. Crank-Nicolson explicit and implicit schemes using centered or upwind approximations to the derivative are studied.We present numerical computations,which determine experimentally the parameter-uniform rates of convergence.We note that this rate is rather weak,due probably to mixed sources of error such as initial and boundary layers and the discontinuity in the derivative of the solution.     

A method of asymptotic constructions with improved accuracy for a quasilinear singularly perturbed parabolic convection-diffusion equation

The Dirichlet problem on an interval for quasilinear singularly perturbed parabolic convection-diffusion equation is considered. The higher order derivative of the equation is multiplied by a parameter ε that takes any values from the half-open interval (0, 1]. For this type of linear problems, the order of the ε-uniform convergence (with respect to x and t) for the well-known schemes is not higher than unity (in the maximum norm). For the boundary value problem under consideration, grid approximations are constructed that converge ε-uniformly at the rate of O(N ^?2ln² N + N ^?2 ₀), where N + 1 and N ₀ + 1 are the numbers of the mesh points with respect to x and t, respectively. On the x axis, piecewise uniform meshes that condense in the boundary layer are used. If the parameter value is small compared to the effective step of the spatial grid, the domain decomposition method is used, which is motivated by “asymptotic constructions.” Monotone approximations of “auxiliary” subproblems describing the main terms of the asymptotic expansion of the solution outside a neighborhood of the boundary layer neighborhood are used. In the neighborhood of the boundary layer (of the width O(ε ln N)) the first derivative with respect to x is approximated by the central difference derivative. These subproblems are successively solved in the subdomains on uniform grids. If the parameter values are not sufficiently small (compared to the effective step of the mesh with respect to x), the classical implicit difference schemes approximating the first derivative with respect to x by the central difference derivative are applied. To improve the accuracy in t, the defect correction technique is used. Notice that the calculation of the solution of the constructed difference scheme (the scheme based on the method of asymptotic constructions) can be considerably simplified for sufficiently small values of the parameter ε.     

Nonconformal schemes of the finite-element method for nonlinear hyperbolic conservation laws

We suggest a method for constructing grid schemes for initial-boundary value problems for many-dimensional nonlinear systems of first-order equations of hyperbolic type on the basis of the Galerkin-Petrov limit approximation to the mixed statement of an original problem. Our grid schemes are versions of the nonconformal finite-element method in which the approximate solution is constructed in the space of piecewise polynomial functions that admit discontinuities on the boundary of triangulation elements of the design domain.     

Meshfree isoparametric finite point interpolation method (IFPIM) with weak and strong forms for evaporative laser drilling

An isoparametric finite point interpolation method (IFPIM) with weak and strong forms has been developed to analyze evaporative laser drilling. The method is based on isoparametric finite point representation of the unknowns in the influence domain. The local influence domains are mapped onto a master domain where the shape functions and their derivatives are known. The solution in the master domain is approximated by a linear combination of shape functions. The present method employs a simple strong form in the domain and a weak form on the boundary. Three different types of boundary conditions considered are of essential, convection, and laser irradiation type. The problem is geometrically nonlinear because the domain is not known a priori due to material removal in drilling. An iterative scheme is used to solve the nonlinear problem. The material removal is handled by redistributing points in the domain. This renders the point distribution non-uniform as in random distribution. The numerical results show excellent agreement with those by FEM and BEM in terms of groove shape, temperature and heat flux distributions, and amount of material removal. The results are superior to those from the isoparametric finite point interpolation methods with only strong forms.     

The comparison between the DRBEM and DQM solution of nonlinear reaction–diffusion equation

In this study, both the dual reciprocity boundary element method and the differential quadrature method are used to discretize spatially, initial and boundary value problems defined by single and system of nonlinear reaction–diffusion equations. The aim is to compare boundary only and a domain discretization method in terms of accuracy of solutions and computational cost. As the time integration scheme, the finite element method is used achieving solution in terms of time block with considerably large time steps. The comparison between the dual reciprocity boundary element method and the differential quadrature method solutions are made on some test problems. The results show that both methods achieve almost the same accuracy when they are combined with finite element method time discretization. However, as a method providing very good accuracy with considerably small number of grid points differential quadrature method is preferrable.     

Practical finite‐analytic method for solving differential equations by compact numerical schemes

Methodology for development of compact numerical schemes by the practical finite‐analytic method (PFAM) is presented for spatial and/or temporal solution of differential equations. The advantage and accuracy of this approach over the conventional numerical methods are demonstrated. In contrast to the tedious discretization schemes resulting from the original finite‐analytic solution methods, such as based on the separation of variables and Laplace transformation, the practical finite‐analytical method is proven to yield simple and convenient discretization schemes. This is accomplished by a special universal determinant construction procedure using the general multi‐variate power series solutions obtained directly from differential equations. This method allows for direct incorporation of the boundary conditions into the numerical discretization scheme in a consistent manner without requiring the use of artificial fixing methods and fictitious points, and yields effective numerical schemes which are operationally similar to the finite‐difference schemes. Consequently, the methods developed for numerical solution of the algebraic equations resulting from the finite‐difference schemes can be readily facilitated. Several applications are presented demonstrating the effect of the computational molecule, grid spacing, and boundary condition treatment on the numerical accuracy. The quality of the numerical solutions generated by the PFAM is shown to approach to the exact analytical solution at optimum grid spacing. It is concluded that the PFAM offers great potential for development of robust numerical schemes. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009