Three Cuts for Accelerated Interval Propagation

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6642

Full metadata record

DC Field	Value	Language
dc.creator	McAllester, D.	-
dc.creator	Henlenryck, P. Van	-
dc.creator	Kapur, T.	-
dc.date	2004-10-08T20:36:08Z	-
dc.date	2004-10-08T20:36:08Z	-
dc.date	1995-05-01	-
dc.date.accessioned	2013-10-09T02:46:20Z	-
dc.date.available	2013-10-09T02:46:20Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-1542	-
dc.identifier	http://hdl.handle.net/1721.1/6642	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	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.	-
dc.format	174936 bytes	-
dc.format	310056 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-1542	-
dc.title	Three Cuts for Accelerated Interval Propagation	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI