Series solutions of algebraic and differential equations: a comparison of linear and quadratic algebraic convergence

Authors:
R. J. Fateman
Affiliations:
University of California, Berkeley
Venue:
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Year:
1989

Citing 4
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
An Algorithm to Obtain Formal Solutions of a Linear Homogeneous Differential Equation at an Irregular Singular Point

EUROCAM '82 Proceedings of the European Computer Algebra Conference on Computer Algebra
Newton's method: a great algebraic algorithm

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation

High-level proofs of mathematical programs using automatic differentiation, simplification, and some common sense

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Speed of convergence of Newton-like iterations in an algebraic domain can be affected heavily by the increasing cost of each step, so much so that a quadratically convergent algorithm with complex steps may be comparable to a slower one with simple steps. This note gives two examples: solving algebraic and first-order ordinary differential equations using the MACSYMA algebraic manipulation system, demonstrating this phenomenon. The relevant programs are exhibited in the hope that they might give rise to more widespread application of these techniques.