Splitting method for an inverse source problem in parabolic differential equations: Error analysis and applications

In this work, we present a numerical method based on a splitting algorithm to find the solution of an inverse source problem with the integral condition. The source term is reconstructed by using the specified data and by employing the Lie splitting method, we decompose the equation into linear and nonlinear parts. Each subproblem is solved by the Fourier transform and then by combining the solutions of subproblems, the solution of the original problem is computed. Moreover, the framework of strongly continuous semigroup (or C₀-semigroup) is employed in error analysis of operator splitting method for the inverse problem. The convergence of the proposed method is also investigated and proved. Finally, some numerical examples in one, two, and three-dimensional spaces are provided to confirm the efficiency and capability of our work compared with some other well-known methods.     

Iterative operator‐splitting methods for nonlinear differential equations and applications

In this article, we consider iterative operator‐splitting methods for nonlinear differential equations with bounded and unbounded operators. The main feature of the proposed idea is the embedding of Newton's method for solving the split parts of the nonlinear equation at each step. The convergence properties of such a mixed method are studied and demonstrated. We confirm with numerical applications the effectiveness of the proposed scheme in comparison with the standard operator‐splitting methods by providing improved results and convergence rates. We apply our results to deposition processes. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1026–1054, 2011     

Implicit Euler and Lie splitting discretizations of nonlinear parabolic equations with delay

A convergence analysis is presented for the implicit Euler and Lie splitting schemes when applied to nonlinear parabolic equations with delay. More precisely, we consider a vector field which is the sum of an unbounded dissipative operator and a delay term, where both point delays and distributed delays fit into the framework. Such equations are frequently encountered, e.g. in population dynamics. The main theoretical result is that both schemes converge with an order (of at least) \(q=1/2\) , without any artificial regularity assumptions. We discuss implementation details for the methods, and the convergence results are verified by numerical experiments demonstrating both the correct order, as well as the efficiency gain of Lie splitting as compared to the implicit Euler scheme.     

Defect-based local error estimators for splitting methods,with application to Schrödinger equations,Part I: The linear case

We introduce a defect correction principle for exponential operator splitting methods applied to time-dependent linear Schrödinger equations and construct a posteriori local error estimators for the Lie–Trotter and Strang splitting methods. Under natural commutator bounds on the involved operators we prove asymptotical correctness of the local error estimators, and along the way recover the known a priori convergence bounds. Numerical examples illustrate the theoretical local and global error estimates.     

Convergence of an operator splitting method on a bounded domain for a convection-diffusion-reaction system

We solve a convection-diffusion-sorption (reaction) system on a bounded domain with dominant convection using an operator splitting method. The model arises in contaminant transport in groundwater induced by a dual-well, or in controlled laboratory experiments. The operator splitting transforms the original problem to three subproblems: nonlinear convection, nonlinear diffusion, and a reaction problem, each with its own boundary conditions. The transport equation is solved by a Riemann solver, the diffusion one by a finite volume method, and the reaction equation by an approximation of an integral equation. This approach has proved to be very successful in solving the problem, but the convergence properties where not fully known. We show how the boundary conditions must be taken into account, and prove convergence in L1,loc of the fully discrete splitting procedure to the very weak solution of the original system based on compactness arguments via total variation estimates. Generally, this is the best convergence obtained for this type of approximation. The derivation indicates limitations of the approach, being able to consider only some types of boundary conditions. A sample numerical experiment of a problem with an analytical solution is given, showing the stated efficiency of the method.     

On the convergence of Newton-like methods using restricted domains

We present a new semi-local convergence analysis for Newton-like methods in order to approximate a locally unique solution of a nonlinear equation containing a non-differentiable term in a Banach space setting. The new idea uses more precise convergence domains. This way the new sufficient convergence conditions are weaker, and the error bounds are tighter than in earlier studies. Applications and numerical examples, involving a nonlinear integral equation of Chandrasekhar-type, are also provided in this study.     

A Stirling-like method with Hölder continuous first derivative in Banach spaces

In this paper, the convergence of a Stirling-like method used for finding a solution for a nonlinear operator in a Banach space is examined under the relaxed assumption that the first Fréchet derivative of the involved operator satisfies the Hölder continuity condition. Many results exist already in the literature to cover the stronger case when the second Fréchet derivative of the involved operator satisfies the Lipschitz/Hölder continuity condition. Our convergence analysis is done by using recurrence relations. The error bounds and the existence and uniqueness regions for the solution are obtained. Finally, two numerical examples are worked out to show that our convergence analysis leads to better error bounds and existence and uniqueness regions for the fixed points.     

Efficient numerical methods for pricing American options under stochastic volatility

Five numerical methods for pricing American put options under Heston's stochastic volatility model are described and compared. The option prices are obtained as the solution of a two‐dimensional parabolic partial differential inequality. A finite difference discretization on nonuniform grids leading to linear complementarity problems with M‐matrices is proposed. The projected SOR, a projected multigrid method, an operator splitting method, a penalty method, and a componentwise splitting method are considered. The last one is a direct method while all other methods are iterative. The resulting systems of linear equations in the operator splitting method and in the penalty method are solved using a multigrid method. The projected multigrid method and the componentwise splitting method lead to a sequence of linear complementarity problems with one‐dimensional differential operators that are solved using the Brennan and Schwartz algorithm. The numerical experiments compare the accuracy and speed of the considered methods. The accuracies of all methods appear to be similar. Thus, the additional approximations made in the operator splitting method, in the penalty method, and in the componentwise splitting method do not increase the error essentially. The componentwise splitting method is the fastest one. All multigrid‐based methods have similar rapid grid independent convergence rates. They are about two or three times slower that the componentwise splitting method. On the coarsest grid the speed of the projected SOR is comparable with the multigrid methods while on finer grids it is several times slower. ©John Wiley & Sons, Inc. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

A study on the local convergence and the dynamics of Chebyshev–Halley–type methods free from second derivative

The error behavior of exponential operator splitting methods for nonlinear Schrödinger equations in the semiclassical regime is studied. For the Lie and Strang splitting methods, the exact form of the local error is determined and the dependence on the semiclassical parameter is identified. This is enabled within a defect-based framework which also suggests asymptotically correct a posteriori local error estimators as the basis for adaptive time stepsize selection. Numerical examples substantiate and complement the theoretical investigations.     

Adaptive operator splitting finite element method for Allen–Cahn equation

In this paper, a new numerical method is proposed and analyzed for the Allen–Cahn (AC) equation. We divide the AC equation into linear section and nonlinear section based on the idea of operator splitting. For the linear part, it is discretized by using the Crank–Nicolson scheme and solved by finite element method. The nonlinear part is solved accurately. In addition, a posteriori error estimator of AC equation is constructed in adaptive computation based on superconvergent cluster recovery. According to the proposed a posteriori error estimator, we design an adaptive algorithm for the AC equation. Numerical examples are also presented to illustrate the effectiveness of our adaptive procedure.     

Exact solutions of the time fractional nonlinear Schrödinger equation with two different methods

In the present paper, exact solutions of fractional nonlinear Schrödinger equations have been derived by using two methods: Lie group analysis and invariant subspace method via Riemann‐Liouvill derivative. In the sense of Lie point symmetry analysis method, all of the symmetries of the Schrödinger equations are obtained, and these operators are applied to find corresponding solutions. In one case, we show that Schrödinger equation can be reduced to an equation that is related to the Erdelyi‐Kober functional derivative. The invariant subspace method for constructing exact solutions is presented for considered equations.     

High order splitting methods for analytic semigroups exist

In this paper, we are concerned with the construction and analysis of high order exponential splitting methods for the time integration of abstract evolution equations which are evolved by analytic semigroups. We derive a new class of splitting methods of orders three to fourteen based on complex coefficients. An optimal convergence analysis is presented for the methods when applied to equations on Banach spaces with unbounded vector fields. These results resolve the open question whether there exist splitting schemes with convergence rates greater then two in the context of semigroups. As a concrete application we consider parabolic equations and their dimension splittings. The sharpness of our theoretical error bounds is further illustrated by numerical experiments.     

On exact dimensional splitting for a multidimensional scalar quasilinear hyperbolic conservation law

A dimensional splitting scheme is applied to a multidimensional scalar homogeneous quasilinear hyperbolic equation (conservation law). It is proved that the splitting error is zero. The proof is presented for the above partial differential equation in an arbitrary number of dimensions. A numerical example is given that illustrates the proved accuracy of the splitting scheme. In the example, the grid convergence of split (locally one-dimensional) compact and bicompact difference schemes and unsplit bicompact schemes combined with high-order accurate time-stepping schemes (namely, Runge–Kutta methods of order 3, 4, and 5) is analyzed. The errors of the numerical solutions produced by these schemes are compared. It is shown that the orders of convergence of the split schemes remain high, which agrees with the conclusion that the splitting error is zero.     

A convergence analysis and applications for the Newton-Kantorovich method in K-normed spaces

We study the local and semilocal convergence of the Newton-Kantorovich method to a solution of a nonlinear operator equation on aK-normed space setting. Using more precise majorizing sequences than before we show that in the semilocal case finer error bounds can be determined on the distances involved and an at least as precise information on the location of the solution as in earlier results. In the local case we show that a larger radius of convergence can be obtained.     

A fully Galerkin method for the damped generalized regularized long‐wave (DGRLW) equation

In this article, a fully discrete Galerkin scheme based on a nonlinear Crank–Nicolson method to approximate the solution of the DGRLW equation is constructed. Some a priori bounds are proved as well as error estimates. Then, a linearized modification scheme by an extrapolation method is discussed. The two schemes are time second order convergence. The last part is devoted to some numerical results. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Operator splittings and spatial approximations for evolution equations

The convergence of various operator splitting procedures, such as the sequential, the Strang and the weighted splitting, is investigated in the presence of a spatial approximation. To this end the relevant notions and results of numerical analysis are presented, a variant of Chernoff’s product formula is proved and the general Trotter–Kato approximation theorem is used. The methods are applied to an abstract partial delay differential equation. To Rainer Nagel, our teacher and friend     

Convergence conditions for secant-type methods

We provide new sufficient convergence conditions for the convergence of the secant-type methods to a locally unique solution of a nonlinear equation in a Banach space. Our new idea uses recurrent functions, and Lipschitz-type and center-Lipschitz-type instead of just Lipschitz-type conditions on the divided difference of the operator involved. It turns out that this way our error bounds are more precise than earlier ones and under our convergence hypotheses we can cover cases where earlier conditions are violated. Numerical examples are also provided.     

Operator splitting for numerical solution of the modified Burgers' equation using finite element method

The aim of this study is to obtain numerical behavior of a one‐dimensional modified Burgers' equation using cubic B‐spline collocation finite element method after splitting the equation with Strang splitting technique. Moreover, the Ext4 and Ext6 methods based on Strang splitting and derived from extrapolation have also been applied to the equation. To observe how good and effective this technique is, we have used the well‐known the error norms L₂ and L_∞ in the literature and compared them with previous studies. In addition, the von Neumann (Fourier series) method has been applied after the nonlinear term has been linearized to investigate the stability of the method.     

Error analysis of the numerical solution of split differential equations

The operator splitting method is a widely used approach for solving partial differential equations describing physical processes. Its application usually requires the use of certain numerical methods in order to solve the different split sub-problems. The error analysis of such a numerical approach is a complex task. In the present paper we show that an interaction error appears in the numerical solution when an operator splitting procedure is applied together with a lower-order numerical method. The effect of the interaction error is investigated by an analytical study and by numerical experiments made for a test problem.     

An improved local error estimator for symmetric time-stepping schemes

We propose a symmetrized version of the defect to be used in the estimation of the local time-stepping error of symmetric one-step methods for the time propagation of linear autonomous evolution equations. Using the anti-commutator of the numerical flow and the right-hand side operator in the definition of the defect of the numerical approximation, a local error estimator is obtained which has higher accuracy asymptotically than an established version using the common defect. This theoretical result is illustrated for a splitting method applied to a linear Schrödinger equation.