Abstract
In this paper we discuss Gröbner basis computation over algebraic number fields. Buchberger algorithm can be executed over any computable field, but the computation is often inefficient if the field operations for algebraic numbers are directly used. Instead we can execute the algorithm over the rationals by adding the defining polynomials to the input ideal and by setting an elimination order. In this paper we propose another method, which is a combination of the two methods above. We implement it in a computer algebra system Risa/Asir and examine its efficiency.
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
Risa/Asir : A computer algebra system, http://www.math.kobe-u.ac.jp/Asir/asir.html
SymbolicData, http://www.SymbolicData.org
Della Dora, J., Discrescenso, C., Duval, D.: About a new method for computing in algebraic number fields. In: Caviness, B.F. (ed.) ISSAC 1985 and EUROCAL 1985. LNCS, vol. 204, pp. 289–290. Springer, Heidelberg (1985)
Traverso, C.: Gröbner trace algorithms. In: Gianni, P. (ed.) ISSAC 1988. LNCS, vol. 358, pp. 125–138. Springer, Heidelberg (1989)
Noro, M., McKay, J.: Computation of replicable functions on Risa/Asir. In: Proceedings of the Second International Symposium on Symbolic Computation PASCO 1997, pp. 130–138. ACM Press, New York (1997)
Faugère, J.C.: A new efficient algorithm for computing Groebner bases (F 4). Journal of Pure and Applied Algebra 139, 1–3, 61–88 (1999)
Noro, M.: Modular Dynamic Evaluation. In: Proc. ISSAC (to appear, 2006)
Yan, T.: The Geobucket Data Structure for Polynomials. J. Symb. Comp. 25(3), 285–294 (1998)
Schönemann, H.: SINGULAR in a Framework for Polynomial Computations. In: Joswig, M., Takayama, N. (eds.) Algebra, Geometry, and Software Systems, pp. 163–176. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Noro, M. (2006). An Efficient Implementation for Computing Gröbner Bases over Algebraic Number Fields. In: Iglesias, A., Takayama, N. (eds) Mathematical Software - ICMS 2006. ICMS 2006. Lecture Notes in Computer Science, vol 4151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11832225_9
Download citation
DOI: https://doi.org/10.1007/11832225_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38084-9
Online ISBN: 978-3-540-38086-3
eBook Packages: Computer ScienceComputer Science (R0)