Regularized additive operator-difference schemes

The construction of additive operator-difference (splitting) schemes for the approximate solution Cauchy problem for the first-order evolutionary equation is considered. Unconditionally stable additive schemes are constructed on the basis of the Samarskii regularization principle for operator-difference schemes. In the case of arbitrary multicomponent splitting, these schemes belong to the class of additive full approximation schemes. Regularized additive operator-difference schemes for evolutionary problems are constructed without the assumption that the regularizing operator and the operator of the problem are commutable. Regularized additive schemes with double multiplicative perturbation of the additive terms of the problem’s operator are proposed. The possibility of using factorized multicomponent splitting schemes, which can be used for the approximate solution of steadystate problems (finite difference relaxation schemes) are discussed. Some possibilities of extending the proposed regularized additive schemes to other problems are considered.     

A Two-Grid Finite-Element Method for the Nonlinear Schrödinger Equation

In this paper, some two-grid finite element schemes are constructed for solving the nonlinear Schrödinger equation. With these schemes, the solution of the original problem is reduced to the solution of the same problem on a much coarser grid together with the solutions of two linear problems on a fine grid. We have shown, both theoretically and numerically, that our schemes are efficient and achieve asymptotically optimal accuracy.     

Fundamental mode exact schemes for unsteady problems

The problem of increasing the accuracy of an approximate solution is considered for boundary value problems for parabolic equations. For ordinary differential equations (ODEs), nonstandard finite difference schemes are in common use for this problem. They are based on a modification of standard discretizations of time derivatives and, in some cases, allow to obtain the exact solution of problems. For multidimensional problems, we can consider the problem of increasing the accuracy only for the most important components of the approximate solution. In the present work, new unconditionally stable schemes for parabolic problems are constructed, which are exact for the fundamental mode. Such two‐level schemes are designed via a modification of standard schemes with weights using Padé approximations. Numerical results obtained for a model problem demonstrate advantages of the proposed fundamental mode exact schemes.     

TWO-GRID DISCRETIZATION SCHEMES OF THE NONCONFORMING FEM FOR EIGENVALUE PROBLEMS

This paper extends the two-grid discretization scheme of the conforming finite elements proposed by Xu and Zhou （Math. Comput., 70 （2001）, pp.17-25） to the nonconforming finite elements for eigenvalue problems. In particular, two two-grid discretization schemes based on Rayleigh quotient technique are proposed. By using these new schemes, the solution of an eigenvalue problem on a fine mesh is reduced to that on a much coarser mesh together with the solution of a linear algebraic system on the fine mesh. The resulting solution still maintains an asymptotically optimal accuracy. Comparing with the two-grid discretization scheme of the conforming finite elements, the main advantages of our new schemes are twofold when the mesh size is small enough. First, the lower bounds of the exact eigenvalues in our two-grid discretization schemes can be obtained. Second, the first eigenvalue given by the new schemes has much better accuracy than that obtained by solving the eigenvalue problems on the fine mesh directly.     

Numerical solution by the quasi-reversibility method of unstable problems for the first-order evolution equation

Prior bounds are derived on the solution of the perturbed problem in different versions of the quasi-reversibility method used for approximate solution of unstable problems for first-order evolution equations. An example of such a problem is provided by the problem backward in time for the equation of heat conduction. Approximate solution of perturbed problems by difference methods is considered. The investigation of the difference schemes of the quasi-reversibility method relies on the general theory of p-stability of difference schemes. Specific features of solution of problems with non-self-adjoint operators are considered. Efficient difference schemes are constructed for multidimensional problems.Translated from Matematicheskoe Modelirovanie i Reshenie Obratnykh Zadach. Matematicheskoi Fiziki, pp. 93–124, 1993.     

Operator-difference schemes for a class of systems of evolution equations

For a special system of evolution equations of first order, discrete time approximations for the approximate solution of the Cauchy problem are considered. Such problems arise after the spatial approximation in the Schrödinger equation and the subsequent separation of the imaginary and real parts and in nonstationary problems of acoustics and electrodynamics. Unconditionally stable two time level operator-difference weighted schemes are constructed. The second class of difference schemes is based on the formal passage to explicit operator-difference schemes for evolution equations of second order when explicit-implicit approximation is used for isolated equations of the system. The regularization of such schemes in order to obtain unconditionally stable operator difference schemes is discussed. Splitting schemes involving the solution of simplest problems at each time step are constructed.     

Three-level schemes of the alternating triangular method

In this paper, the schemes of the alternating triangular method are set out in the class of splitting methods used for the approximate solution of Cauchy problems for evolutionary problems. These schemes are based on splitting the problem operator into two operators that are conjugate transposes of each other. Economical schemes for the numerical solution of boundary value problems for parabolic equations are designed on the basis of an explicit-implicit splitting of the problem operator. The alternating triangular method is also of interest for the construction of numerical algorithms that solve boundary value problems for systems of partial differential equations and vector systems. The conventional schemes of the alternating triangular method used for first-order evolutionary equations are two-level ones. The approximation properties of such splitting methods can be improved by transiting to three-level schemes. Their construction is based on a general principle for improving the properties of difference schemes, namely, on the regularization principle of A.A. Samarskii. The analysis conducted in this paper is based on the general stability (or correctness) theory of operator-difference schemes.     

High-order accurate monotone compact running scheme for multidimensional hyperbolic equations

Monotone absolutely stable conservative difference schemes intended for solving quasilinear multidimensional hyperbolic equations are described. For sufficiently smooth solutions, the schemes are fourth-order accurate in each spatial direction and can be used in a wide range of local Courant numbers. The order of accuracy in time varies from the third for the smooth parts of the solution to the first near discontinuities. This is achieved by choosing special weighting coefficients that depend locally on the solution. The presented schemes are numerically efficient thanks to the simple two-diagonal (or block two-diagonal) structure of the matrix to be inverted. First the schemes are applied to system of nonlinear multidimensional conservation laws. The choice of optimal weighting coefficients for the schemes of variable order of accuracy in time and flux splitting is discussed in detail. The capabilities of the schemes are demonstrated by computing well-known two-dimensional Riemann problems for gasdynamic equations with a complex shock wave structure.     

Symplectic Collocation Schemes for Hamiltonian Systems

The symplectic collocation schemes, which are based on the framework established by Feng Kang [1], are proposed for numerical solution of Hamiltonian systems. The sufficient and necessary conditions for various collocation schemes to be symplectic are obtained. Some examples of symplectic collocation schemes are also given.     

Efficient numerical schemes for the solution of generalized time fractional Burgers type equations

The main aim of this paper is to propose two semi-implicit Fourier pseudospectral schemes for the solution of generalized time fractional Burgers type equations, with an analysis of consistency, stability, and convergence. Under some assumptions, the unconditional stability of the schemes is shown. In implementation of these schemes, the fast Fourier transform (FFT) can be used efficiently to improve the computational cost. Various test problems are included to illustrate the results that we have obtained regarding the proposed schemes. The results of numerical experiments are compared with analytical solutions and other existing methods in the literature to show the efficiency of proposed schemes in both accuracy and CPU time. As numerical solution of fractional stochastic nonlinear partial differential equations driven by Brownian motions are among current related research interests, we report the performance of these schemes on stochastic time fractional Burgers equation as well.     

On bicompact grid-characteristic schemes for the linear advection equation

A set of grid-characteristic schemes for the linear advection equation is considered. Depending on the behavior of the solution, hybrid compact difference schemes of second–third order accuracy are proposed as based on interpolation polynomials. The schemes produce monotone solutions and only slightly smear discontinuities.     

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     

Splitting algorithms as applied to the Navier-Stokes equations

Implicit finite-difference schemes of approximate factorization and predictor-corrector schemes based on a special splitting of operators are proposed for the numerical solution of the Navier-Stokes equations governing a viscous compressible heat-conducting gas. The schemes are based on scalar tridiagonal Gaussian elimination and are unconditionally stable. The accuracy and efficiency of the algorithms are confirmed by computing two-dimensional flows of complex geometry.     

Discontinuous mixed penalty-free Galerkin method for second-order quasilinear elliptic equations

Discrete schemes for finding an approximate solution of the Dirichlet problem for a second-order quasilinear elliptic equation in conservative form are investigated. The schemes are based on the discontinuous Galerkin method (DG schemes) in a mixed formulation and do not involve internal penalty parameters. Error estimates typical of DG schemes with internal penalty are obtained. A new result in the analysis of the schemes is that they are proved to satisfy the Ladyzhenskaya-Babuska-Brezzi condition (inf-sup) condition.     

On the perturbation algorithm for the semidiscrete scheme for the evolution equation and estimation of the approximate solution error using semigroups

In a Banach space, for the approximate solution of the Cauchy problem for the evolution equation with an operator generating an analytic semigroup, a purely implicit three-level semidiscrete scheme that can be reduced to two-level schemes is considered. Using these schemes, an approximate solution to the original problem is constructed. Explicit bounds on the approximate solution error are proved using properties of semigroups under minimal assumptions about the smoothness of the data of the problem. An intermediate step in this proof is the derivation of an explicit estimate for the semidiscrete Crank–Nicolson scheme. To demonstrate the generality of the perturbation algorithm as applied to difference schemes, a four-level scheme that is also reduced to two-level schemes is considered.     

Block monotone iterative methods for numerical solutions of nonlinear elliptic equations

Summary. Two block monotone iterative schemes for a nonlinear algebraic system, which is a finite difference approximation of a nonlinear elliptic boundary-value problem, are presented and are shown to converge monotonically either from above or from below to a solution of the system. This monotone convergence result yields a computational algorithm for numerical solutions as well as an existence-comparison theorem of the system, including a sufficient condition for the uniqueness of the solution. An advantage of the block iterative schemes is that the Thomas algorithm can be used to compute numerical solutions of the sequence of iterations in the same fashion as for one-dimensional problems. The block iterative schemes are compared with the point monotone iterative schemes of Picard, Jacobi and Gauss-Seidel, and various theoretical comparison results among these monotone iterative schemes are given. These comparison results demonstrate that the sequence of iterations from the block iterative schemes converges faster than the corresponding sequence given by the point iterative schemes. Application of the iterative schemes is given to a logistic model problem in ecology and numerical ressults for a test problem with known analytical solution are given. Received August 1, 1993 / Revised version received November 7, 1994     

The hyperbolic–elliptic equation with the nonlocal condition

The nonlocal boundary value problem for a hyperbolic–elliptic equation in a Hilbert space is considered. The stability estimate for the solution of the given problem is obtained. The first and second orders of difference schemes approximately solving this boundary value problem are presented. The stability estimates for the solution of these difference schemes are established. The theoretical statements for the solution of these difference schemes are supported by the results of numerical experiments. Copyright © 2013 John Wiley & Sons, Ltd.     

Modified equation based mesh adaptation algorithm for evolutionary scalar partial differential equations

It is well known that on uniform mesh classical higher order schemes for evolutionary problems yield an oscillatory approximation of the solution containing discontinuity or boundary layers. In this article, an entirely new approach for constructing locally adaptive mesh is given to compute nonoscillatory solution by representative “second” order schemes. This is done using modified equation analysis and a notion of data dependent stability of schemes to identify the solution regions for local mesh adaptation. The proposed algorithm is applied on scalar problems to compute the solution with discontinuity or boundary layer. Presented numerical results show underlying second order schemes approximate discontinuities and boundary layers without spurious oscillations.     

Stable difference schemes for the hyperbolic problems subject to nonlocal boundary conditions with self-adjoint operator

In the present paper the first and second orders of accuracy difference schemes for the numerical solution of multidimensional hyperbolic equations with nonlocal boundary and Dirichlet conditions are presented. The stability estimates for the solution of difference schemes are obtained. A method is used for solving these difference schemes in the case of one dimensional hyperbolic equation.     

Two-sided approximations for unilateral variational inequalities by multi-grid methods

For the numerical solution of unilateral variational inequalities two iterative schemes are developed which provide approximations from below resp. from above. Both schemes are based on some kind of active set strategy and require the solution of an algebraic system of equations at each iteration step which is done by means of multigrid techniques. Convergence results are established and illustrated by some numerical results for the elastic-plastic torsion problem