Abstract
In [ASTW] it was given a Gröbner reduction based division formula for entire functions by polynomial ideals. Here we give degree bounds where the input function can be truncated in order to compute approximations of the coefficients of the power series appearing in the division formula within a given precision. In addition, this method can be applied to the approximation of the value of the remainder function at some point.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alonso, M.E., Mora, T., Raimondo, M.: A computational method for algebraic power series. J. Pure Appl. Algebra 77 (1992) 1–38.
Apel, J., Stückrad, J., Tworzewski, P., Winiarski, T.: Reduction of everywhere convergent power series with respect to Gröbner bases. J. Pure Appl. Algebra, (to appear).
Bayer, D.: The division algorithm and the Hilbert Scheme. Ph.D. Thesis, Harvard University (1982).
Becker, T., Weispfenning, V.: Gröbner Bases, A Computational Approach to Commutative Algebra. Springer, New York, Berlin, Heidelberg (1993).
Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Ph.D. Thesis, Univ. Innsbruck (1965).
Grauert, H., Remmert, R.: Analytische Stellenalgebren. Springer (1971).
Hironaka, H.: Resolution of singularities of an algebraic variety over a field of characteristic zero. Annals of Math. 79 (1964) 109–326.
Mora, T.: Seven variations on standard bases. Preprint, Univ. di Genova, Dip. di Mathematica, N. 45 (1988).
Robbiano, L.: Term orderings on the polynomial ring. L.N.C.S. 204 (1985) 513–517.
Robbiano, L.: On the theory of graded structures. J.Symb.Comp. 2 (1986) 139–170.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Apel, J. (1995). Division of entire functions by polynomial ideals. In: Cohen, G., Giusti, M., Mora, T. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1995. Lecture Notes in Computer Science, vol 948. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60114-7_6
Download citation
DOI: https://doi.org/10.1007/3-540-60114-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60114-2
Online ISBN: 978-3-540-49440-9
eBook Packages: Springer Book Archive