Book chapter
Validated Constraint Compilation
Principles and Practice of Constraint Programming – CP’99, pp.482-483
Lecture Notes in Computer Science, Springer Berlin Heidelberg
1999
DOI: 10.1007/978-3-540-48085-3_37
Abstract
Inaccurate scientific computation is useless at best and dangerous at worst. We address several major sources of inaccuracy. Roundoff error is well known and there is a great deal of work on minimizing it [Act96,Tay97]. By using interval constraints, we don’t eliminate roundoff error, but we make it explicit, so each answer comes with a clear indication of its accuracy. Another source of error arises from misapplying an algorithm (e.g. starting the Newton method with a poor initial choice, or using a method in a case where it does not perform well). We propose a method for reducing the chance of numerical errors in scientific programming by casting the problem as the design of an appropriate constraint solving algorithm and then separating the algorithm design process into two steps.
Details
- Title: Subtitle
- Validated Constraint Compilation
- Creators
- Timothy J. Hickey - Brandeis UniversityDavid K. Wittenberg - Brandeis University
- Resource Type
- Book chapter
- Publication Details
- Principles and Practice of Constraint Programming – CP’99, pp.482-483
- Publisher
- Springer Berlin Heidelberg; Berlin, Heidelberg
- Series
- Lecture Notes in Computer Science
- DOI
- 10.1007/978-3-540-48085-3_37
- eISSN
- 1611-3349
- ISSN
- 0302-9743
- Language
- English
- Date published
- 1999
- Academic Unit
- Cinematic Arts; English
- Record Identifier
- 9984398052502771
Metrics
10 Record Views