Application of approximate matrix factorization to high order linearly implicit Runge–Kutta methods

• Hong Zhang ^[1] ; Adrian Sandu ^[1] ; Paul Tranquilli ^[1]
  1. [1] Virginia Polytechnic Institute and State University, USA
• Localización: Journal of computational and applied mathematics, ISSN 0377-0427, Vol. 286, Nº 1 (1 October 2015), 2015, págs. 196-210
• Idioma: inglés
• DOI: 10.1016/j.cam.2015.03.005
• Enlaces
  • Texto completo
• Resumen

  • Linearly implicit Runge–Kutta methods with approximate matrix factorization can solve efficiently large systems of differential equations that have a stiff linear part, e.g. reaction–diffusion systems. However, the use of approximate factorization usually leads to loss of accuracy, which makes it attractive only for low order time integration schemes. This paper discusses the application of approximate matrix factorization with high order methods; an inexpensive correction procedure applied to each stage allows to retain the high order of the underlying linearly implicit Runge–Kutta scheme. The accuracy and stability of the methods are studied. Numerical experiments on reaction–diffusion type problems of different sizes and with different degrees of stiffness illustrate the efficiency of the proposed approach.