Invariant Discretization Schemes Using Evolution–Projection Techniques
نویسندگان
چکیده
Finite difference discretization schemes preserving a subgroup of the maximal Lie invariance group of the one-dimensional linear heat equation are determined. These invariant schemes are constructed using the invariantization procedure for non-invariant schemes of the heat equation in computational coordinates. We propose a new methodology for handling moving discretization grids which are generally indispensable for invariant numerical schemes. The idea is to use the invariant grid equation, which determines the locations of the grid point at the next time level only for a single integration step and then to project the obtained solution to the regular grid using invariant interpolation schemes. This guarantees that the scheme is invariant and allows one to work on the simpler stationary grids. The discretization errors of the invariant schemes are established and their convergence rates are estimated. Numerical tests are carried out to shed some light on the numerical properties of invariant discretization schemes using the proposed evolution–projection strategy.
منابع مشابه
Computation of frequency responses for linear time-invariant PDEs on a compact interval
We develop mathematical framework and computational tools for calculating frequency responses of linear time-invariant PDEs in which an independent spatial variable belongs to a compact interval. In conventional studies this computation is done numerically using spatial discretization of differential operators in the evolution equation. In this paper, we introduce an alternative method that avo...
متن کاملStability of Spline-Type Systems in the Abelian Case
In this paper, the stability of translation-invariant spaces of distributions over locally compact groups is stated as boundedness of synthesis and projection operators. At first, a characterization of the stability of spline-type spaces is given, in the standard sense of the stability for shift-invariant spaces, that is, linear independence characterizes lower boundedness of the synthesis oper...
متن کاملA posteriori error analysis for finite element methods with projection operators as applied to explicit time integration techniques
We derive a posteriori error estimates for two classes of explicit finite difference schemes for ordinary differential equations. To facilitate the analysis, we derive a systematic reformulation of the finite difference schemes as finite element methods. The a posteriori error estimates quantify various sources of discretization errors, including effects arising from explicit discretization. Th...
متن کاملNumerical Studies of Variational-type Time-discretization Techniques for Transient Oseen Problem
In this paper, we combine continuous Galerkin-Petrov (cGP) and discontinuous Galerkin (dG) time stepping schemes with local projection method applied to inf-sup stable discretization of the transient Oseen problem. Using variational-type time-discretization methods of polynomial degree k, we show that the cGP(k) and dG(k) methods are accurate of order k+1, in the whole time interval. Moreover, ...
متن کاملA comparative study of some time { stepping
We present a numerical comparison of some time{stepping schemes for the discretization and solution of the nonstationary incompressible Navier{Stokes equations. The spatial discretization is by nonconforming quadrilateral nite elements which satisfy the LBB{condition. The major focus is on the diierences in accuracy and eeciency between the Backward Euler-, Crank{Nicolson-or Fractional{step{{sc...
متن کامل