Three Cuts for Accelerated Interval Propagation.

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1995
Accession Number
ADA298215

Entities

People

  • David A. Mcallester
  • Deepak Kapur
  • Pascal Van Hentenryck

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Energy and Power Technologies
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Artificial Intelligence
  • Coefficients
  • Computations
  • Computer Programming
  • Computer Science
  • Electrical Engineering
  • Engineering
  • Equations
  • Heuristic Methods
  • Intervals
  • Mathematics
  • Numerical Analysis
  • Polynomials
  • Test And Evaluation

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Approximation Theory.
  • Artificial Intelligence
  • Systems Analysis and Design