An approximate solver for symbolic equations

  • Authors:

  • Elisha Sacks

  • Affiliations:

  • Department of Computer Science, Princeton University, Princeton, NJ

  • Venue:
  • IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes a program, called NEWTON, that finds approximate symbolic solutions to parameterized equations in one variable. NEWTON derives an initial approximation by solving for the dominant term in the equation, or if this fails, by bisection. It refines this approximation by a symbolic version of Newton's method. It tests whether the first Newton iterate lies closer to the solution than does the initial solution. If so, it returns this iterate; otherwise, it chooses a new initial solution and tries again.