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

Authors:
Clifton Williamson, Jr.
Affiliations:
University of California, Berkeley
Venue:
ACM SIGSAM Bulletin
Year:
1984

Citing 3
Cited 1

All Algebraic Functions Can Be Computed Fast

Journal of the ACM (JACM)
Convergence behavior of the Newton iteration for first order differential equations

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
The design of a language for algebraic computation systems

The design of a language for algebraic computation systems

Advances and trends in the design and construction of algebraic manipulation systems

ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

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.