AUTOMATIC PARTITIONING IN LINEARLY-IMPLICIT RUNGE-KUTTA METHODS

Authors
BUTTNER M SCHMITT BA WEINER R
Citation
M. Buttner et al., AUTOMATIC PARTITIONING IN LINEARLY-IMPLICIT RUNGE-KUTTA METHODS, Applied numerical mathematics, 13(1-3), 1993, pp. 41-55
Citations number
20
Categorie Soggetti
Mathematics,Mathematics
Journal title
Applied numerical mathematics → ACNP
ISSN journal
01689274
Volume
13
Issue
1-3
Year of publication
1993
Pages
41 - 55
Database
ISI
SICI code
0168-9274(1993)13:1-3<41:APILRM>2.0.ZU;2-0
Abstract
Two approaches for automatic partitioning in linearly-implicit Runge-K utta methods using Krylov techniques and avoiding the explicit computa tion of the Jacobian are considered. The first (global) approach corre sponds to an approximation of all stiff components. In the second one only the actually important stiff components are considered. Consisten cy and stability results are given. Numerical tests illustrate the the oretical investigations.