In this paper we present necessary and sufficient conditions for Runge-Kuna methods to be contractive. We consider not only unconditional contractivity for arbitrary dissipative initial value problems, but also conditional contractivity for initial value problems where the right hand side function satisfies a circle condition. Our results are relevant for arbitrary norms, in particular for the maximum norm.For contractive methods, we also focus on the question whether there exists a unique solution to the algebraic equations in each step. Further we show that contractive methods have a limited order of accuracy. Various optimal methods are presented, mainly of explicit type. We provide a numerical illustration to our theoretical results by applying the method of fines to a parabolic and a hyperbolic partial differential equation.

Summary. This paper deals with polynomial approximations qS(x) to the exponential function exp(x) related to numerical procedures for solving initial value problems. Motivated by positivity and contractivity requirements imposed on these numerical procedures we study the smallest negative argument, denoted by -R(~b), at which ~b is absolutely monotonic. For given integers p>l, m>l we determine the maximum of R(q~) when ~b varies over the class of all polynomials of a degree

This article addresses the general problem of establishing upper bounds for the norms of the nth powers of square matrices. The focus is on upper bounds that grow only moderately (or stay constant) where n, or the order of the matrices, increases. The so-called resolvant condition, occuring in the famous Kreiss matrix theorem, is a classical tool for deriving such bounds.Recently the classical upper bounds known to be valid under Kreiss's resolvant condition have been improved. Moreover, generalizations of this resolvant condition have been considered so as to widen the range of applications. The main purpose of this article is to review and extend some of these new developments.The upper bounds for the powers of matrices discussed in this article are intimately connected with the stability analysis of numerical processes for solving initial(-boundary) value problems in ordinary and partial linear differential equations. The article highlights this connection.The article concludes with numerical illustrations in the solution of a simple initial-boundary value problem for a partial differential equation.

We address the problem how to operate the injectors and producers of an oil field so as to maximize the value of the field. Instead of agressively producing and injecting fluids at maximum rate aiming at large short term profits, we are after optimizing the total value (e.g. discounted oil volume) over the whole lifecycle of the field. An essential tool in tackling this optimization problem is the adjoint method from optimal control theory. Starting from a base case reservoir simulation run, this extremely efficient method makes it possible to compute the sensitivities of the total (lifecycle) value with respect to all (time-dependent) well control variables in one go, at a cost less than that of an extra reservoir simulation run. These sensitivities can be used in an optimization loop to iteratively improve well controls. We implemented the adjoint method and an associated optimization algorithm in our in-house reservoir simulator. In addition to conventional well control options based on the well's pressure or total rate, we have also implemented smart well control options which allow the separate control of individual inflow intervals. Special adaptations of the optimization algorithm were required to allow the inclusion of inequality constraints on well control (pressure and rate constraints). We applied the optimization algorithm to a number of cases, and found interesting, non-trivial solutions to some optimal waterflood design problems, that would not easily have been found otherwise. In this paper, we also present a self-contained elementary derivation of the adjoint method, which is different from, but equivalent to the well-known derivation based on the Lagrange formalism. Introduction We focus on the problem of designing an optimal waterflood for an oil field. We limit ourselves to the situation where the well configuration and well types are given, so the only degree of freedom left is the way the injector and producer wells are operated. The waterflood design we are looking for should be optimal in the lifecycle sense, i.e., it should maximize the lifecycle integral Equation (1) where the integrand is a weighted sum of field rates, Equation. Here the weights are denoted by the letter and the field rates by the letter . The subscripts and refer to "oil" and "water", while the superscripts "prod" and "inj" refer to "production" and "injection", respectively. We note that the weights, which are given functions of time, can have arbitrary sign. This makes it possible to combine oil revenues and water costs in the lifecycle integral. Well control is modeled with one or more time-dependent well control variables per well. For conventional wells, there is just one control variable, which can be tubinghead pressure (THP), bottomhole pressure (BHP) or a rate. For smart wells there are generally more control variables corresponding to the setting of downhole inflow or outflow devices which can be controlled independently. Well control is not completely free as it should take into account certain operational limits such as rate and pressure constraints. These operational limits correspond to inequality constraints, either directly on the control variables or indirectly, in terms of certain state variables of the well/reservoir system. Apart from constraints on individual wells, there can also be global constraints dealing with several wells. Examples can be (equality or inequality) constraints imposed by surface facilities, or constraints imposed by reservoir management considerations (e.g., voidage balance constraints). The mathematical optimization problem to be solved is to maximize the lifecycle integral by choosing the optimal well control while satisfying all constraints.

Summary. This paper deals with rational functions ~b(z) approximating the exponential function exp(z) related to numerical procedures for solving initial value problems. Motivated by positivity and contractivity requirements imposed on these numerical procedures we study the greatest nonnegative number R, denoted by R(qS), such that ~b is absolutely monotonic on (-R,0]. An algorithm for the computation of R(th) is presented. Application of this algorithm yields the value R(th) for the well-known Pad6 approximations to exp(z). For some specific values of m, n and p we determine the maximum of R(q~) when ~b varies over the class of all rational functions q~ with degree of the numerator