Abstract
The purpose of this paper is to solve the problem of determining the limits of multivariate rational functions. It is essential to decide whether or not {ie1-1} for two non-zero polynomials f, g ∈ ℝ[x 1, …, x n ] with f(0, …, 0) = g(0, …, 0) = 0. For two such polynomials f and g, we establish two necessary and sufficient conditions for the rational function {ie1-2} to have its limit 0 at the origin. Based on these theoretic results, we present an algorithm for deciding whether or not {ie1-3}, where f, g ∈ ℝ[x 1, …, x n ] are two non-zero polynomials. The design of our algorithm involves two existing algorithms: one for computing the rational univariate representations of a complete chain of polynomials, another for catching strictly critical points in a real algebraic variety. The two algorithms are based on the well-known Wu’s method. With the aid of the computer algebraic system Maple, our algorithm has been made into a general program. In the final section of this paper, several examples are given to illustrate the effectiveness of our algorithm.
Similar content being viewed by others
References
Basu S, Pollack R, Roy M F. Algorithms in Real Algebraic Geometry, Algorithms and Computation in Math. Berlin: Springer-Verlag, 2003
Bochnak J, Coste M, Roy M F. Real Algebraic Geometry. New York-Berlin-Heidelberg: Springer-Verlag, 1998
Borden R S. A Course in Advanced Calculus. New York: Elsevier Sci. Publishing Co. Inc., 1983
Gonzales-Vega L, Rouillier F, Roy M F. Symbolic recipes for polynomial system solving. In: Cohen A M, Cuypers H, Sterk H, eds. Some Tapas of Computer Algebra. New York-Berlin-Heidelberg: Springer-Verlag, 1999, 34–65
Heck A. Introduction to Maple. New York-Berlin-Heidelberg: Springer-Verlag, 1993
Mishra B. Algorithmic Algebra, Texts and Monographs in Computer Science. New York-Berlin-Heidelberg: Springer-Verlag, 1993
Prestel A. Lectures on Formally Real Fields. In: Lecture Notes in Mathematics, vol. 1093. Berlin-Heidelberg-New York: Springer-Verlag, 1984
Rouillier F. Solving zero-dimensional systems through the rational univariate representation. Appl Algebra Engrg Comm Comput, 1999, 9: 433–461
Wang D K. Zero decomposition algorithms for systems of polynomial Equations. In: Gao X S, Wang D M, eds. Computer Mathematics, Proceedings of the Fourth Asian Symposium. Singapore: World Scientific Publishing Co., 2000, 67–70
Wu W T. Mathematics Mechanization: Mechanical Geometry Theorem-Proving, Mechanical Geometry Problem-Solving and Polynomial Equations-Solving. Beijing-Dordrecht-Boston-London: Science Press/Kluwer Academic Publishers, 2000
Varberg D, Purcell E J, Rigdon S E. Calculus. New Jersey: Prentice-Hall, Inc., 2000
Xiao S J, Zeng G X. Algorithms for computing the global infimum and minimum of a polynomial function. Sci China Math, 2012, 55: 881–891
Zariski O, Samuel P. Commutative Algebra. Berlin-Heidelberg-New York: Springer-Verlag, 1958
Zeng G X. The software RationalLimit. In: shengaozhuanjia@163.com, password: shengao2012
Zeng G X, Xiao S J. Computing the rational univariate representations for zero-dimensional systems by Wu’s method (in Chinese). Sci Sin Math, 2010, 40: 999–1016
Zeng G X, Zeng X N. An effective decision method for semidefinite polynomials. J Symbolic Comput, 2004, 37: 83–99
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Xiao, S., Zeng, G. Determination of the limits for multivariate rational functions. Sci. China Math. 57, 397–416 (2014). https://doi.org/10.1007/s11425-013-4661-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11425-013-4661-6
Keywords
- rational function
- limit
- infinitesimal element
- strictly critical point
- rational univariate representation (RUR)
- Wu’s method
- transfer principle