On a class of higher order methods for simultaneous rootfinding of generalized polynomials

Summary Using the argument principle higher order methods for simultaneous computation of all zeros of generalized polynomials (like algebraic, trigonometric and exponential polynomials or exponential sums) are derived. The methods can also be derived following the continuation principle from [3]. Thereby, the unified approach of [7] is enlarged to arbitrary orderN. The local convergence as well as a-priori and a-posteriori error estimates for these methods are treated on a general level. Numerical examples are included.     

Structure preservation of exponentially fitted Runge–Kutta methods

The preservation of some structure properties of the flow of differential systems by numerical exponentially fitted Runge–Kutta (EFRK) methods is considered. A complete characterisation of EFRK methods that preserve linear or quadratic invariants is given and, following the approach of Bochev and Scovel [On quadratic invariants and symplectic structure, BIT 34 (1994) 337–345], the sufficient conditions on symplecticity of EFRK methods derived by Van de Vyver [A fourth-order symplectic exponentially fitted integrator, Comput. Phys. Comm. 174 (2006) 255–262] are obtained. Further, a family of symplectic EFRK two-stage methods with order four has been derived. It includes the symplectic EFRK method proposed by Van de Vyver as well as a collocation method at variable nodes that can be considered as the natural collocation extension of the classical RK Gauss method. Finally, the results of some numerical experiments are presented to compare the relative merits of several fitted and nonfitted fourth-order methods in the integration of oscillatory systems.     

Block iterative solvers for higher order finite volume methods

Recently, new higher order finite volume methods (FVM) were introduced in [Z. Cai, J. Douglas, M. Park, Development and analysis of higher order finite volume methods over rectangles for elliptic equations, Adv. Comput. Math. 19 (2003) 3-33], where the linear system derived by the hybridization with Lagrange multiplier satisfying the flux consistency condition is reduced to a linear system for a pressure variable by an appropriate quadrature rule. We study the convergence of an iterative solver for this linear system. The conjugate gradient (CG) method is a natural choice to solve the system, but it seems slow, possibly due to the non-diagonal dominance of the system. In this paper, we propose block iterative methods with a reordering scheme to solve the linear system derived by the higher order FVM and prove their convergence. With a proper ordering, each block subproblem can be solved by fast methods such as the multigrid (MG) method. The numerical experiments show that these block iterative methods are much faster than CG.     

The numerical analysis on a Volterra equation with asymptotically periodic solution

We consider order one operational quadrature methods on a certain integro-differential equation of Volterra type on (0,∞), with piecewise linear convolution kernels. The forms of discretization solution are patterned after a continuous one of Hannsgen (1979) [2]. An l¹ remainder stability and an error bound are derived.     

Stability of collocation-based Runge-Kutta-Nyström methods

We analyse the attainable order and the stability of Runge-Kutta-Nyström (RKN) methods for special second-order initial-value problems derived by collocation techniques. Like collocation methods for first-order equations the step point order ofs-stage methods can be raised to 2s for alls. The attainable stage order is one higher and equalss+1. However, the stability results derived in this paper show that we have to pay a high price for the increased stage order.These investigations were supported by the University of Amsterdam who provided the third author with a research grant for spending a total of two years in Amsterdam.     

Runge–Kutta methods and Banach algebras

The equations defining both the exact and the computed solution to an initial value problem are related to a single functional equation, which can be regarded as prototypical. The functional equation can be solved in terms of a formal Taylor series, which can also be generated using an iteration process. This leads to the formal Taylor expansions of the solution and approximate solutions to initial value problems. The usual formulation, using rooted trees, can be modified to allow for linear combinations of trees, and this gives an insight into the nature of order conditions for explicit Runge–Kutta methods. A short derivation of the family of fourth order methods with four stages is given.     

A robust trigonometrically fitted embedded pair for perturbed oscillators

A new kind of trigonometrically fitted embedded pair of explicit ARKN methods for the numerical integration of perturbed oscillators is presented in this paper. This new pair is based on the trigonometrically fitted ARKN method of order five derived by Yang and Wu in [H.L. Yang, X.Y. Wu, Trigonometrically-fitted ARKN methods for perturbed oscillators, Appl. Numer. Math. 9 (2008) 1375–1395]. We analyze the stability properties, phase-lag (dispersion) and dissipation of the higher-order method of the new pair. Numerical experiments carried out show that our new embedded pair is very competitive in comparison with the embedded pairs proposed in the scientific literature.     

Spline collocation methods for linear multi-term fractional differential equations

Some regularity properties of the solution of linear multi-term fractional differential equations are derived. Based on these properties, the numerical solution of such equations by piecewise polynomial collocation methods is discussed. The results obtained in this paper extend the results of Pedas and Tamme (2011) [15] where we have assumed that in the fractional differential equation the order of the highest derivative of the unknown function is an integer. In the present paper, we study the attainable order of convergence of spline collocation methods for solving general linear fractional differential equations using Caputo form of the fractional derivatives and show how the convergence rate depends on the choice of the grid and collocation points. Theoretical results are verified by some numerical examples.     

Efficient sixth order methods for nonlinear oscillation problems

A class of two-step (hybrid) methods is considered for solving pure oscillation second order initial value problems. The nonlinear system, which results on applying methods of this type to a nonlinear differential system, may be solved using a modified Newton iteration scheme. From this class the author has derived methods which are fourth order accurate,P-stable, require only two (new) function evaluations per iteration and have a true real perfect square iteration matrix. Now, we propose an extension to sixth order,P-stable methods which require only three (new) function evaluations per iteration and for which the iteration matrix is a true realperfect cube. This implies that at most one real matrix must be factorised at each step. These methods have been implemented in a new variable step, local error controlling code.     

B-convergence results for linearly implicit one step methods

B-consistency andB-convergence of linearly implicit one step methods with respect to a class of arbitrarily stiff semi-linear problems are considered. Order conditions are derived. An algorithm for constructing methods of order>1 is shown and examples are given. By suitable modifications of the methods the occurring order reduction is decreased.     

A family of three-point methods of optimal order for solving nonlinear equations

A family of three-point iterative methods for solving nonlinear equations is constructed using a suitable parametric function and two arbitrary real parameters. It is proved that these methods have the convergence order eight requiring only four function evaluations per iteration. In this way it is demonstrated that the proposed class of methods supports the Kung-Traub hypothesis (1974) [3] on the upper bound 2ⁿ of the order of multipoint methods based on n+1 function evaluations. Consequently, this class of root solvers possesses very high computational efficiency. Numerical examples are included to demonstrate exceptional convergence speed with only few function evaluations.     

On Schröder’s families of root-finding methods

Schröder’s methods of the first and second kind for solving a nonlinear equation f(x)=0, originally derived in 1870, are of great importance in the theory and practice of iteration processes. They were rediscovered several times and expressed in different forms during the last 130 years. It was proved in the paper of Petkovi? and Herceg (1999) [7] that even seven families of iteration methods for solving nonlinear equations are mutually equivalent. In this paper we show that these families are also equivalent to another four families of iteration methods and find that all of them have the origin in Schröder’s generalized method (of the second kind) presented in 1870. In the continuation we consider Smale’s open problem from 1994 about possible link between Schröder’s methods of the first and second kind and state the link in a simple way.     

On new higher order families of simultaneous methods for finding polynomial zeros

Two one parameter families of iterative methods for the simultaneous determination of simple zeros of algebraic polynomials are presented. The construction of these families are based on a one parameter family of the third order for finding a single root of nonlinear equation f(x)=0. Some previously derived simultaneous methods can be obtained from the presented families as special cases. We prove that the local convergence of the proposed families is of the order four. Numerical results are included to demonstrate the convergence properties of considered methods.     

On projected Runge-Kutta methods for differential-algebraic equations

Ascher and Petzold recently introducedprojected Runge-Kutta methods for the numerical solution of semi-explicit differential-algebraic systems of index 2. Here it is shown that such a method can be regarded as the limiting case of a standard application of a Runge-Kutta method with a very small implicit Euler step added to it. This interpretation allows a direct derivation of the order conditions and of superconvergence results for the projected methods from known results for standard Runge-Kutta methods for index-2 differential-algebraic systems, and an extension to linearly implicit differential-algebraic systems.     

Third-order iterative methods with applications to Hammerstein equations: A unified approach

The geometrical interpretation of a family of higher order iterative methods for solving nonlinear scalar equations was presented in [S. Amat, S. Busquier, J.M. Gutiérrez, Geometric constructions of iterative functions to solve nonlinear equations. J. Comput. Appl. Math. 157(1) (2003) 197-205]. This family includes, as particular cases, some of the most famous third-order iterative methods: Chebyshev methods, Halley methods, super-Halley methods, C-methods and Newton-type two-step methods. The aim of the present paper is to analyze the convergence of this family for equations defined between two Banach spaces by using a technique developed in [J.A. Ezquerro, M.A. Hernández, Halley’s method for operators with unbounded second derivative. Appl. Numer. Math. 57(3) (2007) 354-360]. This technique allows us to obtain a general semilocal convergence result for these methods, where the usual conditions on the second derivative are relaxed. On the other hand, the main practical difficulty related to the classical third-order iterative methods is the evaluation of bilinear operators, typically second-order Fréchet derivatives. However, in some cases, the second derivative is easy to evaluate. A clear example is provided by the approximation of Hammerstein equations, where it is diagonal by blocks. We finish the paper by applying our methods to some nonlinear integral equations of this type.     

Continuous weak approximation for stochastic differential equations

A convergence theorem for the continuous weak approximation of the solution of stochastic differential equations (SDEs) by general one-step methods is proved, which is an extension of a theorem due to Milstein. As an application, uniform second order conditions for a class of continuous stochastic Runge–Kutta methods containing the continuous extension of the second order stochastic Runge–Kutta scheme due to Platen are derived. Further, some coefficients for optimal continuous schemes applicable to Itô SDEs with respect to a multi–dimensional Wiener process are presented.     

A note on the eigenvalues of a special class of matrices

In the analysis of stability of a variant of the Crank-Nicolson (C-N) method for the heat equation on a staggered grid a class of non-symmetric matrices appear that have an interesting property: their eigenvalues are all real and lie within the unit circle. In this note we shall show how this class of matrices is derived from the C-N method and prove that their eigenvalues are inside [−1,1] for all values of m (the order of the matrix) and all values of a positive parameter σ, the stability parameter. As the order of the matrix is general, and the parameter σ lies on the positive real line this class of matrices turns out to be quite general and could be of interest as a test set for eigenvalue solvers, especially as examples of very large matrices.     

A bound on the maximum strong order of stochastic Runge-Kutta methods for stochastic ordinary differential equations

In Burrage and Burrage [1] it was shown that by introducing a very general formulation for stochastic Runge-Kutta methods, the previous strong order barrier of order one could be broken without having to use higher derivative terms. In particular, methods of strong order 1.5 were developed in which a Stratonovich integral of order one and one of order two were present in the formulation. In this present paper, general order results are proven about the maximum attainable strong order of these stochastic Runge-Kutta methods (SRKs) in terms of the order of the Stratonovich integrals appearing in the Runge-Kutta formulation. In particular, it will be shown that if ans-stage SRK contains Stratonovich integrals up to orderp then the strong order of the SRK cannot exceed min{(p+1)/2, (s−1)/2},p≥2,s≥3 or 1 ifp=1.     

Order conditions for numerical methods for partitioned ordinary differential equations

Summary Motivated by the consideration of Runge-Kutta formulas for partitioned systems, the theory of P-series is studied. This theory yields the general structure of the order conditions for numerical methods for partitioned systems, and in addition for Nyström methods fory=f(y,y), for Rosenbrock-type methods with inexact Jacobian (W-methods). It is a direct generalization of the theory of Butcher series [7, 8]. In a later publication, the theory ofP-series will be used for the derivation of order conditions for Runge-Kutta-type methods for Volterra integral equations [1].