Abstract
Exact real computation allows many of the advantages of numerical computation (e.g. high performance) to be accessed also in symbolic computation, providing validated results. In this paper we present our approach to build a transparent and easy to use connection between the two worlds, using this paradigm. The main discussed topics are: representation of exact real objects, operations on exact real matrices, polynomial greatest common divisor and root computation. Some of these problems are ill-posed; we use regularization methods to solve them.
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
Aberth, O. (1998): Precise numerical methods using C++. Academic Press Inc., San Diego, CA
Arsenin, V., and Tikhonov, A. N. (1977): Solutions of ill-posed problems. Wiley
Ben-Israel, A., and Greville, T. N. E. (1974): Generalized Inverses: Theory and Applications. Wiley
Bini, D., and Fiorentino, G. (2000): Design, analysis, and implementation of a multiprecision polynomial rootfinder. Num. Alg. 23, 127–173
Boehm, H., and Cartwright, R. (1990): Exact real arithmetic, formulating real numbers as functions. In: Research Topics in Functional Programming, Turner D. (ed.) Addison-Wesley, 43–64
Corless, R., Gianni, P., Trager, B., and Watt, S. (1995): The singular value decomposition for polynomial systems. In: Proc. ISSAC’95, ACM Press, 195–207
Engl, H. (1999): Regularization methods for solving inverse problems. In: Proc. ICIAM 99
Escardó, M. H. (2000): Exact numerical computation. In: ISSAC’00, ACM Press, tutorial.
Gianantonio, P. (1993): Real number computability and domain theory. In: Proc. Math. Found. Comp. Sci.’ 93, Springer, 413–422
Gonzalez-Vega, L., Rouillier, F., Roy, M.-F., and Trujillo, G. (2000): Symbolic recipes for real solutions. Algorith. Comp. Math. 4, 121–167
Higham, N. J. (1993): Accuracy and stability of numerical algorithms. SIAM
Hribernig, V., and Stetter, H.-J. (1997) Detection and validation of clusters of polynomial zeroes. Journal of Symbolic Computation 24, 667–682
Ménissier-Morain, V. (2001): Arbitrary precision real arithmetic: design and algorithms. Preprint
Moore, R. E. (1966): Interval Anaysis. Prentice-Hall, Englewood Cliffs, N.J.
Neumaier, A. (1988): An existence test for root clusters and multiple roots. ZAMM 68, 257–259
Noda, M. T., and Sasaki, T. (1989): Approximate square-free decomposition and rootfinding for ill-conditioned algebraic equations. J. Inf. Proc. 12, 159–168
Roy, M.-F., and Szpirglas, A. (1990): Complexity of computation of real algebraic numbers. Journal of Symbolic Computation 10, 39–51
Stetter, H.-J. (2000): Condition analysis of overdetermined algebraic problems. In: Proc. CASC 2000, 345–365.
Strzeboński, A. (1997): Computing in the field of complex algebraic numbers. Journal of Symbolic Computation 24, 647–656
Tran, Q.-N. (1996): A Hybrid Symbolic-Numerical Approach in Computer Aided Geometric Design (CAGD) and Visualization. PhD thesis, Johannes Kepler University, RISC-Linz
Winkler, F. (1996): Polynomial algorithms in computer algebra. Springer
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bodnár, G., Kaltenbacher, B., Pau, P., Schicho, J. (2003). Exact Real Computation in Computer Algebra. In: Winkler, F., Langer, U. (eds) Symbolic and Numerical Scientific Computation. SNSC 2001. Lecture Notes in Computer Science, vol 2630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45084-X_14
Download citation
DOI: https://doi.org/10.1007/3-540-45084-X_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40554-2
Online ISBN: 978-3-540-45084-9
eBook Packages: Springer Book Archive