2 research outputs found

    Optimal stability polynomials for numerical integration of initial value problems

    Full text link
    We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest stable step size and corresponding method for a given problem when the spectrum of the initial value problem is known. The problem is expressed in terms of a general least deviation feasibility problem. Its solution is obtained by a new fast, accurate, and robust algorithm based on convex optimization techniques. Global convergence of the algorithm is proven in the case that the order of approximation is one and in the case that the spectrum encloses a starlike region. Examples demonstrate the effectiveness of the proposed algorithm even when these conditions are not satisfied

    A class of high-order Runge-Kutta-Chebyshev stability polynomials

    Get PDF
    The analytic form of a new class of factorized Runge-Kutta-Chebyshev (FRKC) stability polynomials of arbitrary order NN is presented. Roots of FRKC stability polynomials of degree L=MNL=MN are used to construct explicit schemes comprising LL forward Euler stages with internal stability ensured through a sequencing algorithm which limits the internal amplification factors to ∼L2\sim L^2. The associated stability domain scales as M2M^2 along the real axis. Marginally stable real-valued points on the interior of the stability domain are removed via a prescribed damping procedure. By construction, FRKC schemes meet all linear order conditions; for nonlinear problems at orders above 2, complex splitting or Butcher series composition methods are required. Linear order conditions of the FRKC stability polynomials are verified at orders 2, 4, and 6 in numerical experiments. Comparative studies with existing methods show the second-order unsplit FRKC2 scheme and higher order (4 and 6) split FRKCs schemes are efficient for large moderately stiff problems.Comment: 24 pages, 5 figures. Accepted for publication in Journal of Computational Physics, 22 Jul 2015. Revise
    corecore