Rational Univariate Representation of Zero-Dimensional Ideals with Parameters
Pages 217 - 224
Abstract
An algorithm for computing the rational univariate representation of zero-dimensional ideals with parameters is presented in the paper. Different from the rational univariate representation of zero-dimensional ideals without parameters, the number of zeros of zero-dimensional ideals with parameters under various specializations is different, which leads to choosing and checking the separating element, the key to computing the rational univariate representation, is difficult. In order to pick out the separating element, by partitioning the parameter space we can ensure that under each branch the ideal has the same number of zeros. Subsequently based on the extended subresultant theorem for parametric cases, the separating element corresponding to each branch is chosen with the further partition of parameter space. Finally, with the help of parametric greatest common divisor theory a finite set of the rational univariate representation of zero-dimensional ideals with parameters can be obtained.
References
[1]
W. Auzinger and H.J. Stetter. 1988. An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations. International Series of Numerical Mathematics, Vol. 86 (1988), 11--30.
[2]
T. Becker and V. Weispfenning. 1993. Gröbner Bases. Springer-Verlag.
[3]
D. Cox, J. Little, and D. O'shea. 2005. Using Algebraic Geometry. Springer.
[4]
David A Cox, John Little, and Donal O'shea. 2006. Using algebraic geometry. Vol. 185. Springer Science & Business Media.
[5]
M. Kalkbrener. 1997. On the Stability of Gröbner Bases Under Specializations. Journal of Symbolic Computation, Vol. 24, 1 (1997), 51--58.
[6]
D. Kapur, D. Lu, M. Monagan, Y. Sun, and D.K. Wang. 2018. An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD. In Proceedings of the 2018 International Symposium on Symbolic and Algebraic Computation. 239--246.
[7]
D. Kapur, Y. Sun, and D.K. Wang. 2013. An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial systems. Journal of Symbolic Computation, Vol. 49 (2013), 27--44.
[8]
X.D. Ma, Y. Sun, and D.K. Wang. 2012. Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis. Science China Mathematics, Vol. 55, 6 (2012), 1293--1302.
[9]
X.D. Ma, Y. Sun, D.K. Wang, and Y.S. Xue. 2017. On Checking Linear Dependence of Parametric Vectors. In Intelligent Computing Theories and Application. 188--196.
[10]
Bhubaneswar Mishra. 1993. Algorithmic algebra .Springer-Verlag, New York.
[11]
A. Montes. 2002. A new algorithm for discussing Gröbner basis with parameters. Journal of Symbolic Computation, Vol. 33 (2002), 183--208.
[12]
K. Nabeshima. 2007. A speed-up of the algorithm for computing comprehensive Gröbner systems. In Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation. 299--306.
[13]
K. Nagasaka. 2017. Parametric Greatest Common Divisors using Comprehensive Gröbner Systems. In Proceedings of the 2017 International Symposium on Symbolic and Algebraic Computation. 341--348.
[14]
M. Noro and K. Yokoyama. 1999. A modular method to compute the rational univariate representation of zero-dimensional ideals. Journal of Symbolic Computation, Vol. 28, 1--2 (1999), 243--263.
[15]
K. Ouchi and J. Keyser. 2008. Rational univariate reduction via toric resultants. Journal of Symbolic Computation, Vol. 43, 11 (2008), 811--844.
[16]
F. Rouillier. 1999. Solving zero-dimensional systems through the rational univariate representation. Applicable Algebra in Engineering Communication and Computing, Vol. 9, 5 (1999), 433--461.
[17]
M. Safey El Din, Z.H. Yang, and L.H. Zhi. 2018. On the complexity of computing real radicals of polynomial systems. In Proceedings of the 2018 International Symposium on Symbolic and Algebraic Computation. 351--358.
[18]
É. Schost. 2003. Computing parametric geometric resolutions. Applicable Algebra in Engineering Communication and Computing, Vol. 13, 5 (2003), 349--393.
[19]
B.X. Shang, S.G. Zhang, C. Tan, and P. Xia. 2017. A simplified rational representation for positive-dimensional polynomial systems and SHEPWM equation solving. Journal of Systems Science and Complexity, Vol. 30 (2017), 1470--1482.
[20]
H.J. Stetter. 1996. Matrix eigenproblem are at the heart of polynomial system solving. ACM SIGSAM Bull., Vol. 30 (1996), 27--36.
[21]
A. Suzuki and Y. Sato. 2006. A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases. In Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation. 326--331.
[22]
C. Tan. 2009. The rational representation for solving polynomial systems (in Chinese). Ph.D. Dissertation.
[23]
C. Tan and S.C. Zhang. 2009. Separating element computation for the rational univariate representation with short coefficients in zero-dimensional algebraic varieties. Journal of Jilin University (Science Edition), Vol. 47 (2009), 174--178.
[24]
C. Tan and S.G. Zhang. 2010. Computation of the rational representation for solutions of high-dimensional systems. Communications in Mathematical Research, Vol. 26, 2 (2010), 119--130.
[25]
V. Weispfenning. 1992. Comprehensive Gröbner bases. Journal of Symbolic Computation, Vol. 14, 1 (1992), 1--29.
[26]
W.T. Wu. 1984. Basic Principles of Mechanical Theorem Proving in Geometries (in Chinese), Vol. I:Part of Elementary Geometries .Science Press.
[27]
F.H. Xiao, D. Lu, X.D. Ma, and D.K. Wang. 2021. An Improvement of the Rational Representation for High-Dimensional Systems. Journal of Systems Science and Complexity, Vol. 34, 6 (2021), 2410--2427.
[28]
G.X. Zeng and S.J. Xiao. 2010. Computing the rational univariate representations for zero-dimensional systems by Wu's method. Science China Mathematics(Chinese), Vol. 40, 10 (2010), 999--1016.
Index Terms
- Rational Univariate Representation of Zero-Dimensional Ideals with Parameters
Recommendations
Rational univariate representations of bivariate systems and applications
ISSAC '13: Proceedings of the 38th International Symposium on Symbolic and Algebraic ComputationWe address the problem of solving systems of two bivariate polynomials of total degree at most d with integer coefficients of maximum bitsize τ We suppose known a linear separating form (that is a linear combination of the variables that takes different ...
Separating linear forms and Rational Univariate Representations of bivariate systems
We address the problem of solving systems of bivariate polynomials with integer coefficients. We first present an algorithm for computing a separating linear form of such systems, that is a linear combination of the variables that takes different values ...
Root isolation of zero-dimensional polynomial systems with linear univariate representation
In this paper, a linear univariate representation for the roots of a zero-dimensional polynomial equation system is presented, where the complex roots of the polynomial system are represented as linear combinations of the roots of several univariate ...
Comments
Information & Contributors
Information
Published In
July 2022
547 pages
Copyright © 2022 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 05 July 2022
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
ISSAC '22
Sponsor:
ISSAC '22: International Symposium on Symbolic and Algebraic Computation
July 4 - 7, 2022
Villeneuve-d'Ascq, France
Acceptance Rates
Overall Acceptance Rate 395 of 838 submissions, 47%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 56Total Downloads
- Downloads (Last 12 months)6
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in