Show simple item record

Three Cuts for Accelerated Interval Propagation

dc.date.accessioned2004-10-08T20:36:08Z
dc.date.accessioned2018-11-24T10:21:21Z
dc.date.available2004-10-08T20:36:08Z
dc.date.available2018-11-24T10:21:21Z
dc.date.issued1995-05-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6642
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6642
dc.description.abstractThis 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.en_US
dc.format.extent174936 bytes
dc.format.extent310056 bytes
dc.language.isoen_US
dc.titleThree Cuts for Accelerated Interval Propagationen_US


Files in this item

FilesSizeFormatView
AIM-1542.pdf310.0Kbapplication/pdfView/Open
AIM-1542.ps174.9Kbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record