Accession Number : ADA298215
Title : Three Cuts for Accelerated Interval Propagation.
Descriptive Note : Memorandum rept.,
Corporate Author : MASSACHUSETTS INST OF TECH CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB
Personal Author(s) : McAllester, David A. ; Van Hentenryck, Pascal ; Kapur, Deepak
PDF Url : ADA298215
Report Date : MAY 1995
Pagination or Media Count : 7
Abstract : This paper addresses the problem of nonlinear multivariate root finding. In an earlier paper we describe a system called Newton which finds roots of systems of nonlinear equations using refinements of interval methods. The refinements are inspired by Al constraint propagation techniques. Newton is competitive 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.
Descriptors : *MULTIVARIATE ANALYSIS, *NUMERICAL ANALYSIS, *ARTIFICIAL INTELLIGENCE, *SQUARE ROOTS, CONTROL SYSTEMS, LINEAR PROGRAMMING, MATHEMATICAL LOGIC, NONLINEAR SYSTEMS, HEURISTIC METHODS, NONLINEAR ALGEBRAIC EQUATIONS, INTERVALS.
Subject Categories : Numerical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE