Using nonconvergence of iteration to partition ODEs

From MaRDI portal





Many systems of ordinary differential equations (ODEs) defined as stiff contain nonstiff subsystems. Attempts have been made to partition them. In a previous paper of \textit{G. Hall} and the first author [SIAM J. Sci. Stat. Comput. 6, 384-697 (1985; Zbl 0601.65055)] described a code that partitioned the subsystems automatically. In this paper a more precise variation of the criteria for partitioning is given and an attempt is made to explain these criteria using a system of two linear equations. In section 2 previous criteria for partitioning are described. Reasons for a new variation are given in Sections 3 and 4. From the practical point of view the core of this paper is Section 5 -- tests for partitioning together with algorithms for partitioning. The last two Sections are devoted to numerical problems and results.











This page was built for publication: Using nonconvergence of iteration to partition ODEs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1194400)