On Runge-Kutta Methods for Parabolic Problems with Time-Dependent Coefficients
- 1 July 1986
- journal article
- research article
- Published by JSTOR in Mathematics of Computation
- Vol. 47 (175) , 77-101
- https://doi.org/10.2307/2008083
Abstract
Galerkin fully discrete approximations for parabolic equations with time-dependent coefficients are analyzed. The schemes are based on implicit Runge-Kutta methods, and are coupled with preconditioned iterative methods to approximately solve the resulting systems of linear equations. It is shown that for certain classes of Runge-Kutta methods, the fully discrete equations exhibit parallel features that can be exploited to reduce the final execution time to that of a low-order method.This publication has 13 references indexed in Scilit:
- Semidiscrete and Single Step Fully Discrete Approximations for Second Order Hyperbolic Equations With Time-Dependent CoefficientsMathematics of Computation, 1984
- Efficiently Implementable Algebraically Stable Runge–Kutta MethodsSIAM Journal on Numerical Analysis, 1982
- Efficient Higher Order Single Step Methods for Parabolic Problems: Part IMathematics of Computation, 1980
- Incomplete Iteration for Time-Stepping a Galerkin Method for a Quasilinear Parabolic ProblemSIAM Journal on Numerical Analysis, 1979
- Sur laB-stabilit des m thodes de Runge-KuttaNumerische Mathematik, 1979
- Stability Criteria for Implicit Runge–Kutta MethodsSIAM Journal on Numerical Analysis, 1979
- Single Step Galerkin Approximations for Parabolic ProblemsMathematics of Computation, 1977
- Solution of linear systems of equations: Iterative methodsLecture Notes in Mathematics, 1977
- On the implementation of implicit Runge-Kutta methodsBIT Numerical Mathematics, 1976
- Implicit Runge-Kutta ProcessesMathematics of Computation, 1964