共查询到20条相似文献,搜索用时 46 毫秒
1.
Summary. Our task in this paper is to present a new family of methods of the Runge–Kutta type for the numerical integration of perturbed
oscillators. The key property is that those algorithms are able to integrate exactly, without truncation error, harmonic oscillators,
and that, for perturbed problems the local error contains the perturbation parameter as a factor. Some numerical examples
show the excellent behaviour when they compete with Runge–Kutta–Nystr?m type methods.
Received June 12, 1997 / Revised version received July 9, 1998 相似文献
2.
This paper describes some problems that are encountered in the implementation of a class of Singly Diagonally Implicit Runge-Kutta (SDIRK) methods. The contribution to the local error from the local truncation error and the residual error from the algebraic systems involved are analysed. A section describes a special interpolation formula. This is used as a prediction stage in the iterative solution of the algebraic equations. A strategy for computing a starting stepsize is presented. The techniques are applied to numerical examples. 相似文献
3.
In this article we develop a family of three explicit symmetric linear four-step methods. The new methods, with nullified phase-lag, are optimized for the efficient solution of the Schrödinger equation and related oscillatory problems. We perform an analysis of the local truncation error of the methods for the general case and for the special case of the Schrödinger equation, where we show the decrease of the maximum power of the energy in relation to the corresponding classical methods. We also perform a periodicity analysis, where we find that there is a direct relationship between the periodicity intervals of the methods and their local truncation errors. In addition we determine their periodicity regions. We finally compare the new methods to the corresponding classical ones and other known methods from the literature, where we show the high efficiency of the new methods. 相似文献
4.
In this paper we study advantages of numerical integration by quasi-consistent Nordsieck formulas. All quasi-consistent numerical methods possess at least one important property for practical use, which has not attracted attention yet, i.e. the global error of a quasi-consistent method has the same order as its local error. This means that the usual local error control will produce a numerical solution for the prescribed accuracy requirement if the principal term of the local error dominates strongly over remaining terms. In other words, the global error control can be as cheap as the local error control in the methods under discussion. 相似文献
5.
Z.A. Anastassi 《Applied Mathematics Letters》2011,24(8):1468-1472
On the basis of a classical symmetric eight-step method, an optimized method with fifth trigonometric order for the numerical solution of the Schrödinger equation is developed in this work. The local truncation error analysis of the method proves the decrease of the maximum power of the energy in relation to the corresponding classical method, which renders the method highly efficient. This is confirmed by comparing the method to other methods from the literature while integrating the equation. The superiority of the method is strengthened by the existence of a larger interval of periodicity of the new method in comparison to the corresponding classical method. 相似文献
6.
Recently, Kulikov presented the idea of double quasi-consistency, which facilitates global error estimation and control, considerably. More precisely, a local error control implemented in such methods plays a part of global error control at the same time. However, Kulikov studied only Nordsieck formulas and proved that there exists no doubly quasi-consistent scheme among those methods.Here, we prove that the class of doubly quasi-consistent formulas is not empty and present the first example of such sort. This scheme belongs to the family of superconvergent explicit two-step peer methods constructed by Weiner, Schmitt, Podhaisky and Jebens. We present a sample of s-stage doubly quasi-consistent parallel explicit peer methods of order s−1 when s=3. The notion of embedded formulas is utilized to evaluate efficiently the local error of the constructed doubly quasi-consistent peer method and, hence, its global error at the same time. Numerical examples of this paper confirm clearly that the usual local error control implemented in doubly quasi-consistent numerical integration techniques is capable of producing numerical solutions for user-supplied accuracy conditions in automatic mode. 相似文献
7.
A necessary condition for a (non-autonomous) ordinary differential equation to be exactly solved by a one-step, finite difference method is that the principal term of its local truncation error be null. A procedure to determine some ordinary differential equations exactly solved by a given numerical scheme is developed. Examples of differential equations exactly solved by the explicit Euler, implicit Euler, trapezoidal rule, second-order Taylor, third-order Taylor, van Niekerk’s second-order rational, and van Niekerk’s third-order rational methods are presented. 相似文献
8.
The method of lines is used to transform the initial/boundary-value problem associated with the two-dimensional sine-Gordon equation in two space variables into a second-order initial-value problem. The finite-difference methods are developed by replacing the matrix-exponential term in a recurrence relation with rational approximants. The resulting finite-difference methods are analyzed for local truncation error, stability and convergence. To avoid solving the nonlinear system a predictor–corrector scheme using the explicit method as predictor and the implicit as corrector is applied. Numerical solutions for cases involving the most known from the bibliography line and ring solitons are given. 相似文献
9.
In addition to their usefulness in the numerical solution of initial value ODE's, the implicit Runge-Kutta (IRK) methods are also important for the solution of two-point boundary value problems. Recently, several classes of modified IRK methods which improve significantly on the efficiency of the standard IRK methods in this application have been presented. One such class is the Averaged IRK methods; a member of the class is obtained by applying an averaging operation to a non-symmetric IRK method and its reflection. In this paper we investigate the forms of the error expressions for reflected and averaged IRK methods. Our first result relates the expression for the local error of the reflected method to that of the original method. The main result of this paper relates the error expression of an averaged method to that of the method upon which it is based. We apply these results to show that for each member of the class of the averaged methods, there exists an embedded lower order method which can be used for error estimation, in a formula-pair fashion.This work was supported by the Natural Science and Engineering Research Council of Canada. 相似文献
10.
Summary. A general method for constructing high-order approximation schemes for
Hamilton-Jacobi-Bellman equations is given. The method is based on a
discrete version of the Dynamic Programming Principle. We prove a
general convergence result for this class of approximation schemes also
obtaining, under more restrictive assumptions, an estimate in
of the order of convergence and of the local truncation error. The
schemes can be applied, in particular, to the stationary linear first
order equation in . We present several
examples of schemes
belonging to this class and with fast convergence to the solution.
Received July 4, 1992 / Revised version received July 7, 1993 相似文献
11.
The class of linearly-implicit parallel two-step peer W-methods has been designed recently for efficient numerical solutions of stiff ordinary differential equations. Those schemes allow for parallelism across the method, that is an important feature for implementation on modern computational devices. Most importantly, all stage values of those methods possess the same properties in terms of stability and accuracy of numerical integration. This property results in the fact that no order reduction occurs when they are applied to very stiff problems. In this paper, we develop parallel local and global error estimation schemes that allow the numerical solution to be computed for a user-supplied accuracy requirement in automatic mode. An algorithm of such global error control and other technical particulars are also discussed here. Numerical examples confirm efficiency of the presented error estimation and stepsize control algorithm on a number of test problems with known exact solutions, including nonstiff, stiff, very stiff and large-scale differential equations. A comparison with the well-known stiff solver RODAS is also shown. 相似文献
12.
We describe a construction of continuous extensions to a new representation of two-step Runge–Kutta methods for ordinary differential equations. This representation makes possible the accurate and reliable estimation of local discretization error, facilitates the efficient implementation of these methods in variable stepsize environment, and adapts readily to the numerical solution of a class of delay differential equations. A number of numerical tests carried out on the obtained methods of order 3 with quadratic interpolants show their efficiency and robust performance which allow them to compete with the state-of-the-art dde23 code from Matlab. 相似文献
13.
We prove convergence results on finite time intervals, as the user-defined tolerance τ→0, for a class of adaptive timestepping
ODE solvers that includes the ode23 routine supplied in MATLAB Version 4.2. In contrast to existing theories, these convergence
results hold with error constants that are uniform in the neighbourhood of equilibria; such uniformity is crucial for the
derivation of results concerning the numerical approximation of dynamical systems. For linear problems the error estimates
are uniform on compact sets of initial data. The analysis relies upon the identification of explicit embedded Runge-Kutta
pairs for which all but the leading order terms of the expansion of the local error estimate areO(∥f(u∥)2).
This work was partially supported by NSF Grant DMS-95-04879. 相似文献
14.
We describe an adaptive mesh refinement finite element method-of-lines procedure for solving one-dimensional parabolic partial differential equations. Solutions are calculated using Galerkin's method with a piecewise hierarchical polynomial basis in space and singly implicit Runge-Kutta (SIRK) methods in time. A modified SIRK formulation eliminates a linear systems solution that is required by the traditional SIRK formulation and leads to a new reduced-order interpolation formula. Stability and temporal error estimation techniques allow acceptance of approximate solutions at intermediate stages, yielding increased efficiency when solving partial differential equations. A priori energy estimates of the local discretization error are obtained for a nonlinear scalar problem. A posteriori estimates of local spatial discretization errors, obtained by order variation, are used with the a priori error estimates to control the adaptive mesh refinement strategy. Computational results suggest convergence of the a posteriori error estimate to the exact discretization error and verify the utility of the adaptive technique.This research was partially supported by the U.S. Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant Number AFOSR-90-0194; the U.S. Army Research Office under Contract Number DAAL 03-91-G-0215; by the National Science Foundation under Grant Number CDA-8805910; and by a grant from the Committee on Research, Tulane University. 相似文献
15.
R. M. Thomas 《BIT Numerical Mathematics》1987,27(4):599-614
In this paper, a family of fourth orderP-stable methods for solving second order initial value problems is considered. When applied to a nonlinear differential system, all the methods in the family give rise to a nonlinear system which may be solved using a modified Newton method. The classical methods of this type involve at least three (new) function evaluations per iteration (that is, they are 3-stage methods) and most involve using complex arithmetic in factorising their iteration matrix. We derive methods which require only two (new) function evaluations per iteration and for which the iteration matrix is a true real perfect square. This implies that real arithmetic will be used and that at most one real matrix must be factorised at each step. Also we consider various computational aspects such as local error estimation and a strategy for changing the step size. 相似文献
16.
We discuss error control for explicit methods when the stepsize is bounded by stability on the imaginary axis. Our main result is a formulation of a condition on the estimator of the local error which prevents the fast components to exceed the prescribed error tolerance. A PECE Adams method of 4th order accuracy is proposed for mildly stiff oscillatory systems. For comparison we also discuss embedded Runga-Kutta methods.Partially supported by the Office of Naval Research N00014-90-J-1382 相似文献
17.
Winfried Auzinger Othmar Koch Mechthild Thalhammer 《Journal of Computational and Applied Mathematics》2012
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. 相似文献
18.
We consider the error introduced using QR methods to approximate Lyapunov exponents. We give a backward error statement for
linear non-autonomous systems, and further discuss nonlinear autonomous problems. In particular, for linear systems we show
that one approximates a ``nearby' discontinuous problem where how nearby is measured in terms of local errors and a measure
of non-normality. For nonlinear problems we use a type of shadowing result.
This work was supported in part under NSF Grants DMS/FRG-0139895 and DMS/FRG-0139824 相似文献
19.
Helena Zarin 《Journal of Computational and Applied Mathematics》2009,231(2):626-636
We study convergence properties of a numerical method for convection-diffusion problems with characteristic layers on a layer-adapted mesh. The method couples standard Galerkin with an h-version of the nonsymmetric discontinuous Galerkin finite element method with bilinear elements. In an associated norm, we derive the error estimate as well as the supercloseness result that are uniform in the perturbation parameter. Applying a post-processing operator for the discontinuous Galerkin method, we construct a new numerical solution with enhanced convergence properties. 相似文献
20.
M.A. El-Gebeily K.M. Furati Donal O’Regan Ravi Agarwal 《Journal of Computational and Applied Mathematics》2009
We investigate the approximation of the solutions of a class of nonlinear second order singular boundary value problems with a self-adjoint linear part. Our strategy involves two ingredients. First, we take advantage of certain boundary condition functions to obtain well behaved functions of the solutions. Second, we integrate the problem over an interval that avoids the singularity. We are able to prove a uniform convergence result for the approximate solutions. We describe how the approximation is constructed for the various values of the deficiency index associated with the differential equation. The solution of the nonlinear problem is obtained by a globally convergent iterative method. 相似文献