Summary
From the point of view of the generation of rounding errors a comparison is made between: 1 the usual algorithm for one step methods for time dependent problems, working with the total value of the nodal unknowns vector; and 2 a variant of this, which consists in calculating only the increment of the vector for the time interval Δt. The superiority of the second algorithm is concluded on the basis of both theoretical and empirical arguments.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Pissanetzky, S.: Numerical simulation of the transient temperature distribution inside a closepacked array of cylindrical tubes during heating and cooling under high-vacuum. Nuclear Eng. and Design56, 359–368 (1980)
Richtmyer, R.D., Morton, K.W.: Difference methods for initial-value problems. New York: Interscience, 1967
Strang, G., Fix, G.: An analysis of the finite element method. New York: Prentice Hall, 1973
Wilkinson, J.H.: The algebraic eigenvalue problem. Monographs on numerical analysis. Oxford: Clarendon Press, 1965
Author information
Authors and Affiliations
Additional information
Comisión Nacional de Energía Atómica
Rights and permissions
About this article
Cite this article
Pissanetzky, S., Basombrío, F.G. On the numerical errors in one step algorithms for time dependent problems. Numer. Math. 38, 31–37 (1982). https://doi.org/10.1007/BF01395806
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01395806