Abstract
The piecewise algebraic variety is the set of all common zeros of multivariate splines. We show that solving a parametric piecewise algebraic variety amounts to solve a finite number of parametric polynomial systems containing strict inequalities. With the regular decomposition of semi-algebraic systems and the partial cylindrical algebraic decomposition method, we give a method to compute the supremum of the number of torsion-free real zeros of a given zero-dimensional parametric piecewise algebraic variety, and to get distributions of the number of real zeros in every n-dimensional cell when the number reaches the supremum. This method also produces corresponding necessary and sufficient conditions for reaching the supremum and its distributions. We also present an algorithm to produce a necessary and sufficient condition for a given zero-dimensional parametric piecewise algebraic variety to have a given number of distinct torsion-free real zeros in every n-cell in the n-complex.
Similar content being viewed by others
References
Jacek B, Michel C, Marie-Francoise R. Real Algebraic Geometry. New York: Spinger, 1998
Wang R H, Lai Y S. Real piecewise algebraic variety. J Comput Math, 21(4): 473–480 (2003)
Cox D, Little J, O’shea D. Using Algebraic Geometry. New York: Springer-Verlag, 1998
Billera L J, Rose L L. A dimension series for multivariate splines. Discrete Comput Geom, 6: 107–128 (1991)
Wang R H, Shi X Q, Luo Z X, et al. Multivariate Spline Functions and Their Applications. Beijing-New York: Science Press/Kluwer Pub, 2001
Wang R H. The structural characterization and interpolation for Multivariate spline. Acta Math Sinica, 18: 91–106 (1975)
Lai Y S, Wang R H. The Nöther and Riemann-Roch type theorems for piecewise algebraic curve. Sci China Ser A, 2: 165–182 (2007)
Nürnberger G, Rayevskaya G, Schumaker L L, et al. Lagrange interpolation with bivariate splines of arbitrary smoothness. Constr Approx, 23(1): 133–159 (2005)
Nürnberger G, Zeilfelder F. Lagrange interpolation by bivariate C 1 splines with optimal approximation order. Adv in Comp Math, 21(3–4): 381–419 (2004)
Yang L, Hou X R, Xia B C. A complete algorithm for automated discovering of a class of inequality-type theorems. Sci China Ser F, 44(1): 33–49 (2001)
Xia B C, Yang L. An algorithm for isolating the real solutions of semi-algebraic systems. J Symb Comput, 34: 461–477 (2002)
Collins G E. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. Lecture Notes in Computer Science Vol 33. New York: Springer, 1975
Collins G E, Hong H. Partial cylindrical algebraic decomposition for quantifier elimination. J Symb Comput, 12: 299–328 (1991)
Brown C W. Simple CAD construction and its applications. J Symb Comput, 31: 521–547 (2001)
Buchberger B. Gröbner bases: An algorithmic method in polynomial ideal theory. In: Bose N K ed. Multidimensional Systems Theory. Dordrecht: D Reidel, 1985, 184–232
Lazard D, Rouillier F. Solving parametric polynomial systems. J Symb Comput, 42(6): 636–667 (2007)
Yang L, Zhang J Z, Hou X R. Nonlinear Algebraic Equation System and Automated Theorem Proving. Shanghai: Shanghai Scientific and Technological Education Publishing House, 1996
Yang L, Zhang J Z, Hou X R. An efficient decomposition algorithm for geometry theorem proving without factorization. In: Shi H, Kobayashi H. eds. Proceedings of Asian Symposium on Computer Mathematics 1995. Japan: Scientists Incorporated, 1995, 33–41
Wu W T. On zeros of algebraic equation-an application of Ritt principle. Kexue Tongbao, 31: 1–5 (1986)
Wu W T. Mechanical Theorem Proving in Geometries: Basic Principle. Berlin: Springer-Verlag, 1994
Wang D M. Computing triangular systems and regular systems. J Symb Comput, 30: 221–236 (2000)
Wang D M. Decomposing polynomial systems into simple systems. J Symb Comput, 25: 295–314 (1998)
Winkler F. Polynomial Algorithms in Computer Algebra. Wein: Springer-Verlag, 1996
Basu S, Pollack R, Roy M F. Algorithms in Real Algebraic Geometry. New York: Springer-Verlag, 2003
Guernic L, Rouillier F, Safey EI Din M. Computing sampling points in a semi-algebraic set defined by non-strict inequalities. Application to Pattern-Matching Problems, in “EACA, Santander”. New York: ACM Press, 2004
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by National Natural Science Foundation of China (Grant Nos. 10271022, 60373093, 60533060), the Natural Science Foundation of Zhejiang Province (Grant No. Y7080068) and the Foundation of Department of Education of Zhejiang Province (Grant Nos. 20070628 and Y200802999)
Rights and permissions
About this article
Cite this article
Lai, Y., Wang, R. & Wu, J. Real zeros of the zero-dimensional parametric piecewise algebraic variety. Sci. China Ser. A-Math. 52, 817–832 (2009). https://doi.org/10.1007/s11425-008-0141-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11425-008-0141-9