An Approximate Solver for Symbolic Equations
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Automated Deduction. Pages 431-433.
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.
@inproceedings{ijcai1989p69,
title = {An Approximate Solver for Symbolic Equations},
author = {Sacks, Elisha},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {431--433},
year = {1989},
month = {8},
note = {Automated Deduction},
url = {https://ijcai.org/proceedings/1989/69},
}
TY - CPAPER TI - An Approximate Solver for Symbolic Equations AU - Sacks, Elisha T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 431 EP - 433 UR - https://ijcai.org/proceedings/1989/69 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
