Abstract
Extrapolation methods are used in numerical analysis to accelerate the convergence of real number sequences. Interval tightening algorithms produce interval vector sequences. Extrapolation can be applied directly on some of these sequences. Nevertheless, bounds are no longer guaranteed. This paper investigates how to use extrapolation methods without losing solutions and reports some experimental results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G. Alefeld and J. Hezberger, editors. Introduction to Interval Computations. Academic press, 1983.
F. Benhamou, D. McAllester, and P. Van Hentenryck. CLP(intervals) revisited. In Logic Programming - Proceedings of the 1994 International Symposium, pages 124–138. The MIT Press, 1994.
C. Brezinski, editor. Algorithmes d’accélération de la convergence: étude numériques. Tech-nip, 1978.
C. Brezinski and R. Zaglia, editors. Extrapolation methods. Studies in Computational Mathematics. North-Holland, 1990.
E. Davis. Constraint propagation with interval labels. Journal of Artificial Intelligence, pages 32: 281–331, 1987.
J. P Delahaye. Optimalité du procédé S2 d’aitken pour l’accélération de la convergence linéaire. RAIRO, Anal. Numér., pages 15: 321–330, 1981.
J. P. Delahaye and B. Germain-Bonne. Résultats négatifs en accélération de la convergence. Numer. Math, pages 35: 443–457, 1980.
E. C. Freuder. Synthesizing constraint expressions. Communications of the ACM, pages 21: 958–966, 1978.
Yahia Lebbah and Olivier Lhomme. Acceleration methods for numeric CSPs. In AAAI-98, pages 19–25. MIT Press, July 26–30 1998.
O. Lhomme. Consistency techniques for numeric CSPs. In IJCAI-93, pages 232–238, 1993.
R. Moore, editor. Interval Analysis. Prentice Hall, 1966.
J.F. Puget and P. Van-Hentenryck. A constraints satisfaction approach to a circuit design problem. Journal of global optimization, pages 13 (1): 75–93, 1998.
P. Van-Hentenryck, D. Mc Allester, and D. Kapur. Solving polynomial systems using branch and prune approach. SIAM Journal on Numerical Analysis, pages 34 (2): 797–827, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Lebbah, Y., Lhomme, O. (1999). Prediction by extrapolation for interval tightening methods. In: Csendes, T. (eds) Developments in Reliable Computing. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1247-7_13
Download citation
DOI: https://doi.org/10.1007/978-94-017-1247-7_13
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5350-3
Online ISBN: 978-94-017-1247-7
eBook Packages: Springer Book Archive