Algorithmic Power from Declarative Use of Redundant Constraints |
| |
Authors: | M. H. van Emden |
| |
Affiliation: | (1) Department of Computer Science, University of Victoria, P. O. Box 3055, Victoria, B. C., V8W 3P6, Canada |
| |
Abstract: | Interval constraints can be used to solve problems in numerical analysis. In this paper we show that one can improve the performance of such an interval constraint program by the declarative use of constraints that are redundant in the sense of not needed to define the problem. The first example shows that computation of an unstable recurrence relation can be improved. The second example concerns a solver of nonlinear equations. It shows that, by adding as redundant constraints instances of Taylor's theorem, one can obtain convergence that appears to be quadratic. |
| |
Keywords: | interval constraints redundant constraints Newton's method unstable recurrance |
本文献已被 SpringerLink 等数据库收录! |
|