Explicit,optimal stability functionals and their application to cyclic discretization methods

The present paper contains a stability concept for discretization methods of a certain, very general classM, which is optimal (in the sense of yielding the best general, two-sided error bounds) without being more restrictive than any of the classical stability definitions. The optimal stability functional Ψ_h related to it depends on the linear part of the discretization operator, and has the important property that Ψ_h δ] may be of orderq+1, i.e. Ψ_h δ] = O(h ^q+1), even if the local error δ only has orderq, δ = O(h ^q). This result may be used for the construction of methods with maximum order. Its application to linear cyclic methods, for example, furnishes a new approach to the theory of linearM-cyclick-step methods of maximum order.