Constructing of linearly implicit schemes which are LN-equivalent to implicit Runge-Kutta methods
New family of linearly implicit schemes are presented. This family allows to obtain methods which are equivalent to stiffly accurate implicit Runge-Kutta schemes (such as RadauIIA and LobattoIIIC) on nonautonomous linear problems. Notion of LN-equivalence of schemes is introduced. Order conditions a...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | Russian |
Published: |
Institute of Computer Science
2012-09-01
|
Series: | Компьютерные исследования и моделирование |
Subjects: | |
Online Access: | http://crm.ics.org.ru/uploads/crmissues/crm_2012_3/483-496.pdf |