Taylor series solutions of explicit ODE's in a strongly typed algebra system

ABSTRACT

This paper describes how Taylor series solutions of explicit ODE's were implemented in a strongly typed algebra system. The use of hierarchical typing allows one to write code which can be modified and expanded easily in a mathematically structured way. We also give a brief explanation of recent work at UC Berkeley in the context of algebraic system building.

REFERENCES

• 1: John Keith Foderaro, The design of a language for algebraic computation systems, 1983
• 2: Keith O. Geddes, Convergence behavior of the Newton iteration for first order differential equations, Proceedings of the International Symposiumon on Symbolic and Algebraic Computation, p.189-199, June 01, 1979
• 3: H. T. Kung , J. F. Traub, All Algebraic Functions Can Be Computed Fast, Journal of the ACM (JACM), v.25 n.2, p.245-260, April 1978 [doi>10.1145/322063.322068]