Numerical exploration of numerical constraint satisfaction problems

dc.contributor.authorParvataneni, Seshuen_US
dc.date.accessioned2024-08-15T17:14:06Z
dc.date.available2024-08-15T17:14:06Z
dc.date.copyright2003en_US
dc.date.issued2003
dc.degree.departmentDepartment of Computer Science
dc.degree.levelMaster of Arts M.A.en
dc.description.abstractOne of the problems of conventional numerical computation is rounding error. Interval methods like interval arithmetic and interval constraints automatically compute an estimate of the error for each real number. These methods have proved to be valuable in numerical computation because of their certainty in the results. But problems with conventional numerical analysis performance is the key issue. The only way to get the guarantees of the interval methods accepted, is to offer the guarantees without penalty in performance. An application of a commercially available package NUMERICA, which finds all solutions to nonlinear systems of equations, proves this. However, the package is proprietary. In this thesis, we develop an interval constraint system by composing reusable units of software using the Component Object Model(COM) architecture. Our design of the interval constraint system ensures reusability and interoperability among different programs on the same machine. The programs may have been developed using different programming languages. In addition, we develop a graphical user interface application for the interval constraint system. This is the first system for the interactive exploration of constraint satisfaction problems.
dc.format.extent94 pages
dc.identifier.urihttps://hdl.handle.net/1828/19238
dc.rightsAvailable to the World Wide Weben_US
dc.titleNumerical exploration of numerical constraint satisfaction problemsen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
PARVATANENI_Seshu_MSc_2003_1315203.pdf
Size:
2.25 MB
Format:
Adobe Portable Document Format