9 research outputs found

    Cover

    No full text

    Implicit and explicit BDF algorithms with orders higher than 6 and 2, respectively

    No full text
    Backward differentiation formulae (BDF) are the basis of well-known implementations for solving stiff problems in ordinary or algebraic-differential equations. As yet, the maximal order p of these algorithms was limited to p#<=#6 for zero stable implicit BDF formulas and to p#<=#2 for zero stable explicit variants. In this paper, new class classes of BDF formulae are introduced by using a modified interpolation polynomial. Modified explicit and implicit BDF formulae of minimal order p=7 and p=12, respectively, are constructed. (orig.)Available from TIB Hannover: RR 1606(98-44) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman

    Survey of Recent Historical Works on Belgium and the Netherlands Published in Dutch

    No full text
    corecore