Three Cuts for Accelerated Interval Propagation
Author(s)
McAllester, D.; Henlenryck, P. Van; Kapur, T.
DownloadAIM-1542.ps (170.8Kb)
Additional downloads
Metadata
Show full item recordAbstract
This paper addresses the problem of nonlinear multivariate root finding. In an earlier paper we described a system called Newton which finds roots of systems of nonlinear equations using refinements of interval methods. The refinements are inspired by AI constraint propagation techniques. Newton is competative with continuation methods on most benchmarks and can handle a variety of cases that are infeasible for continuation methods. This paper presents three "cuts" which we believe capture the essential theoretical ideas behind the success of Newton. This paper describes the cuts in a concise and abstract manner which, we believe, makes the theoretical content of our work more apparent. Any implementation will need to adopt some heuristic control mechanism. Heuristic control of the cuts is only briefly discussed here.
Date issued
1995-05-01Other identifiers
AIM-1542
Series/Report no.
AIM-1542