Adaptive methods for periodic initial value problems of second order differential equations

In this paper numerical methods involving higher order derivatives for the solution of periodic initial value problems of second order differential equations are derived. The methods depend upon a parameter p > 0 and reduce to their classical counter parts as p → 0. The methods are periodically stable when the parameter p is chosen as the square of the frequency of the linear homogeneous equation. The numerical methods involving derivatives of order up to 2q are of polynomial order 2q and trigonometric order one. Numerical results are presented for both the linear and nonlinear problems. The applicability of implicit adaptive methods to linear systems is illustrated.     

P-stable methods for periodic initial value problems of second order differential equations

A class ofP-stable finite difference methods is discussed for solving initial value problems of second order differential equations which have periodic solutions. The methods depend upon a parameterp>0, and reduce to the classical Störmer-Cowell methods forp=0. It is shown that whenp is chosen for linear problems as the square of the frequency of the periodic solution, the methods areP-stable and for some suitable choice ofp, they have extended finite interval of periodicity.     

Hybrid numerical methods for periodic initial value problems involving second-order differential equations

Computer simulation of problems in celestial mechanics often leads to the numerical solution of the system of second-order initial value problems with periodic solutions. When conventional methods are applied to obtain the solution, the time increment must be limited to a value of the order of the reciprocal of the frequency of the periodic solution.In this paper hybrid methods of orders four and six which are P-stable are developed. Further, the adaptive hybrid methods of polynomial order four and trigonometric order one have also been discussed. The numerical results for the undamped Duffing equation with a forced harmonic function are listed.     

High-order one-step P-stable methods for the numerical integration of periodic initial value problems

Using Lobatto nodes, one-step methods of order six and eight have been obtained for the second-order differential equation y″ = f(x, y), y(x₀) = y₀, y′(x₀) = y′₀. The methods are shown to be P-stable. If

, then at each integration step a system of dimension 3s, 4s, respectively, has to be solved. The numerical results, for two problems, obtained by using these methods are given in the end.     

Discontinuous Galerkin methods for periodic boundary value problems

This article considers the extension of well‐known discontinuous Galerkin (DG) finite element formulations to elliptic problems with periodic boundary conditions. Such problems routinely appear in a number of applications, particularly in homogenization of composite materials. We propose an approach in which the periodicity constraint is incorporated weakly in the variational formulation of the problem. Both H¹ and L² error estimates are presented. A numerical example confirming theoretical estimates is shown. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2007     

Piecewise polynomial Taylor methods for initial value problems

A class of explicit Taylor-type methods for numerically solving first-order ordinary differential equations is presented. The basic idea is that of generating a piecewise polynomial approximating function, with a given order of differentiability, by repeated Taylor expansion. Sharp error bounds for the approximation and its derivatives are given along with a stability analysis.This work was supported by the United States Atomic Energy Commission.     

Splitting methods for second‐order initial value problems

We consider implicit integration methods for the solution of stiff initial value problems for second-order differential equations of the special form y' = f(y). In implicit methods, we are faced with the problem of solving systems of implicit relations. This paper focuses on the construction and analysis of iterative solution methods which are effective in cases where the Jacobian of the right‐hand side of the differential equation can be split into a sum of matrices with a simple structure. These iterative methods consist of the modified Newton method and an iterative linear solver to deal with the linear Newton systems. The linear solver is based on the approximate factorization of the system matrix associated with the linear Newton systems. A number of convergence results are derived for the linear solver in the case where the Jacobian matrix can be split into commuting matrices. Such problems often arise in the spatial discretization of time‐dependent partial differential equations. Furthermore, the stability matrix and the order of accuracy of the integration process are derived in the case of a finite number of iterations. This revised version was published online in August 2006 with corrections to the Cover Date.     

Spurious solutions of numerical methods for initial value problems

It is well known that some numerical methods for initial valueproblems admit spurious limit sets. Here the existence and behaviourof spurious solutions of Runge-Kutta, linear multistep and predictor-correctormethods are studied in the limit as the step-size h0. In particular,it is shown that for ordinary differential equations definedby globally Lipschitz vector fields, spurious fixed points andperiod 2 solutions cannot exist for h arbitrarily small, whilstfor locally Lipschitz vector fields, spurious solutions mayexist for h arbitrarily small, but must become unbounded ash0. The existence of spurious solutions is also studied forvector fields merely assumed to be continuous, and an exampleis given, showing that in this case spurious solutions may remainbounded as h0. It is shown that if spurious fixed points orperiod 2 solutions of continuous problems exist for h arbitrarilysmall, then as h0 spurious solutions either converge to steadysolutions of the underlying differential equation or divergeto infinity. A necessary condition for the bifurcation spurioussolutions from h=0 is derived. To prove the above results forimplicit Runge-Kutta methods, an additional assumption on theiteration scheme used to solve the nonlinear equations definingthe method is needed; an example of a Runge-Kutta method whichgenerates a bounded spurious solution for a smooth problem withh arbitrarily small is given, showing that such an assumptionis necessary. It is also shown that an Adams-Bashforth/Adams-Moultonpredictor-corrector method in PC^m implementation can generatespurious fixed point solutions for any m.     

Symmetric multistep Obrechkoff methods with zero phase-lag for periodic initial value problems of second order differential equations

In this paper, symmetric multistep Obrechkoff methods of orders 8 and 12, involving a parameter p to solve a special class of second order initial value problems in which the first order derivative does not appear explicitly, are discussed. It is shown that the methods have zero phase-lag when p is chosen as 2π times the frequency of the given initial value problem.     

A class of two-step P-stable methods for the accurate integration of second order periodic initial value problems

In this paper we consider a two parameter family of two-step methods for the accurate numerical integration of second order periodic initial value problems. By applying the methods to the test equation y″ + λ²y = 0, we determine the parameters α, β so that the phase-lag (frequency distortion) of the method is minimal. The resulting method is a P-stable method with a minimal phase-lag λ⁶h⁶/42000. The superiority of the method over the other P-stable methods is illustrated by a comparative study of the phase-lag errors and by illustrating with a numerical example.     

High orderP-stable formulae for the numerical integration of periodic initial value problems

Summary Recently there has been considerable interest in the approximate numerical integration of the special initial value problemy=f(x, y) for cases where it is known in advance that the required solution is periodic. The well known class of Störmer-Cowell methods with stepnumber greater than 2 exhibit orbital instability and so are often unsuitable for the integration of such problems. An appropriate stability requirement for the numerical integration of periodic problems is that ofP-stability. However Lambert and Watson have shown that aP-stable linear multistep method cannot have an order of accuracy greater than 2. In the present paper a class of 2-step methods of Runge-Kutta type is discussed for the numerical solution of periodic initial value problems.P-stable formulae with orders up to 6 are derived and these are shown to compare favourably with existing methods.     

Convergence on error correction methods for solving initial value problems

Higher-order semi-explicit one-step error correction methods(ECM) for solving initial value problems are developed. ECM provides the excellent convergence O(h^2p+2)$O\left(h^{2p+2}\right)$ one wants to get without any iteration processes required by most implicit type methods. This is possible if one constructs a local approximation having a residual error O(h^p)$O\left(h^p\right)$ on each time step. As a practical example, we construct a local quadratic approximation. Further, it is shown that special choices of parameters for the local quadratic polynomial lead to the known explicit second-order methods which can be improved into a semi-explicit type ECM of the order of accuracy 6$6$. The stability function is also derived and numerical evidences are presented to support theoretical results with several stiff and non-stiff problems. It should be remarked that the ECM approach developed here does not yield explicit methods, but semi-implicit methods of the Rosenbrock type. Both ECM and Rosenbrock’s methods require to solve a few linear systems at each integration step, but the ECM approach involves 2p+2$2p+2$ evaluations of the Jacobian matrix per integration step whereas the Rosenbrock method demands one evaluation only. However, it is much easier to get high order methods by using the ECM approach.     

Spectral methods for initial boundary value problems with nonsmooth data

Summary. In this paper we consider hyperbolic initial boundary value problems with nonsmooth data. We show that if we extend the time domain to minus infinity, replace the initial condition by a growth condition at minus infinity and then solve the problem using a filtered version of the data by the Galerkin-Collocation method using Laguerre polynomials in time and Legendre polynomials in space, then we can recover pointwise values with spectral accuracy, provided that the actual solution is piecewise smooth. For this we have to perform a local smoothing of the computed solution. Received August 1, 1995 / Revised version received August 19, 1997     

Monotonicity and finite element methods for hyperbolic initial value problems

A well known theórem about super- and subfunctions for the solution of hyperbolic initial value problems constructs differentiable functions as upper and lower bounds (see Walter [1], 21 XIII). The proof can be done by transforming the differential equation problem into a set of integral equations, using the monotonicity-properties of the arising integral operators. This proof needs an integral representation for twice differentiable functions. It is shown that this proceeding can be generalized to get upper and lower bounds in terms of finite element functions. To do this, we give an integral representation for continuous, piecewise differentiable functions, including the discontinuities of their derivatives. Then the generalization of the classical proof yields interface conditions for the finite element functions. Finally, it is demonstrated how to realize numerically these conditions.     

Superstable implicit Runge-Kutta methods for second order initial value problems

Using the well known properties of thes-stage implicit Runge-Kutta methods for first order differential equations, single step methods of arbitrary order can be obtained for the direct integration of the general second order initial value problemsy=f(x, y, y),y(x _o)=y _o,y(x _o)=y _o. These methods when applied to the test equationy+2y+ ² y=0, ,0, +>0, are superstable with the exception of a finite number of isolated values ofh. These methods can be successfully used for solving singular perturbation problems for which f/y and/or f/y are negative and large. Numerical results demonstrate the efficiency of these methods.     

Stability of some boundary value methods for the solution of initial value problems

The stability properties of three particular boundary value methods (BVMs) for the solution of initial value problems are considered. Our attention is focused on the BVMs based on the midpoint rule, on the Simpson method and on an Adams method of order 3. We investigate their BV-stability regions by considering the scalar test problem and constant stepsize. The study of the conditioning of the coefficient matrix of the discrete problem is extended to the case of variable stepsize and block ODE problems. We also analyse an appropriate choice for the stepsize for stiff problems. Numerical tests are reported to evidentiate the effectiveness of the BVMs and the differences among the BVMs considered.Work supported by the Ministero della Ricerca Scientifica, 40% project, and C.N.R. (contract of research # 92.00535.01).     

Numerical comparison of methods for solving second-order ordinary initial value problems

In this paper, we apply Adomian decomposition method (shortly, ADM) to develop a fast and accurate algorithm of a special second-order ordinary initial value problems. The ADM does not require discretization and consequently of massive computations. This paper is particularly concerned with the ADM and the results obtained are compared with previously known results using the Quintic C²-spline integration methods. The numerical results demonstrate that the ADM is relatively accurate and easily implemented.     

Parameter-uniform numerical methods for some singularly perturbed nonlinear initial value problems

Parameter-uniform numerical methods for singularly perturbed nonlinear scalar initial value problems are both constructed and analysed in this paper. The conditions on the initial condition for a stable initial layer to form are identified. The character of a stable initial layer in the vicinity of a double root of the reduced algebraic problem is different to the standard layer structures appearing in the neighbourhood of a single stable root of the reduced problem. Results for a problem where two reduced solutions intersect are also discussed. Numerical results are presented to illustrate the theoretical results obtained.     

Trigonometrically fitted multi-step Runge-Kutta methods for solving oscillatory initial value problems

In this paper, trigonometrically fitted multi-step Runge-Kutta (TFMSRK) methods for the numerical integration of oscillatory initial value problems are proposed and studied. TFMSRK methods inherit the frame of multi-step Runge-Kutta (MSRK) methods and integrate exactly the problem whose solutions can be expressed as the linear combinations of functions from the set of \(\{\exp (\mathrm {i}wt),\exp (-\mathrm {i}wt)\},\) or equivalently the set \(\{\cos (wt),\sin (wt)\}\), where w represents an approximation of the main frequency of the problem. The general order conditions are given and four new explicit TFMSRK methods with order three and four, respectively, are constructed. Stability of the new methods is examined and the corresponding regions of stability are depicted. Numerical results show that our new methods are more efficient in comparison with other well-known high quality methods proposed in the scientific literature.     

Runge-Kutta methods without order reduction for linear initial boundary value problems

Summary. It is well-known the loss of accuracy when a Runge–Kutta method is used together with the method of lines for the full discretization of an initial boundary value problem. We show that this phenomenon, called order reduction, is caused by wrong boundary values in intermediate stages. With a right choice, the order reduction can be avoided and the optimal order of convergence in time is achieved. We prove this fact for time discretizations of abstract initial boundary value problems based on implicit Runge–Kutta methods. Moreover, we apply these results to the full discretization of parabolic problems by means of Galerkin finite element techniques. We present some numerical examples in order to confirm that the optimal order is actually achieved. Received July 10, 2000 / Revised version received March 13, 2001 / Published online October 17, 2001