Summary
C-polynomials for rational approximation to the exponential function was introduced by Nørsett [7] to study stability properties of one-step methods. For one-step collocation methods theC-polynomial has a very simple form. In this paper we studyC-polynomials for multistep collocation methods and obtain results that generalize those in the one-step case, and provide a way to analyze linear stability of such methods.
Similar content being viewed by others
References
Butcher, J.C.: A generlization of singly-implicit methods. BIT21, 175–189 (1981)
Fuchs, P.M.: On the stability of spline-collocation methods of multivalue type. BIT27, 374–388 (1987)
Lie, L.: Multistep collocation for stiff systems. Ph.d. thesis Department of Numerical Mathematics, University of Trondheim, Trondheim, Norway. 1985
Lie, I., Nørsett, S.P.: Superconvergence for multistep collocation. Math. Comput.52, 65–79 (1989)
Muir, T.: The theory of determinants. N.Y.: Dover 1930
Nørsett, S.P.:C-polynomials for the rational approximation to the exponential function. Numer. Math.25, 39–56 (1975)
Nørsett, S.P., Wanner, G.: The real-pole sandwich for rational approximation to oscillation equations. BIT19, 79–94 (1979)
Nørsett, S.P.: Private communication
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lie, I. The stability function for multistep collocation methods. Numer. Math. 57, 779–787 (1990). https://doi.org/10.1007/BF01386443
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01386443