In this paper,the so-called invertibility is introduced for rational univariate representations,and a characterization of the invertibility is given.It is shown that the rational univariate representations,obtained by...In this paper,the so-called invertibility is introduced for rational univariate representations,and a characterization of the invertibility is given.It is shown that the rational univariate representations,obtained by both Rouillier’s approach and Wu’s method,are invertible.Moreover,the ideal created by a given rational univariate representation is defined.Some results on invertible rational univariate representations and created ideals are established.Based on these results,a new approach is presented for decomposing the radical of a zero-dimensional polynomial ideal into an intersection of maximal ideals.展开更多
This paper investigates the equality-constrained minimization of polynomial functions. Let R be the field of real numbers, and R[x1,..., xn] the ring of polynomials over R in variables x1,..., xn. For an f ∈ R[x1,......This paper investigates the equality-constrained minimization of polynomial functions. Let R be the field of real numbers, and R[x1,..., xn] the ring of polynomials over R in variables x1,..., xn. For an f ∈ R[x1,..., xn] and a finite subset H of R[x1,..., xn], denote by V(f : H) the set {f( ˉα) | ˉα∈ Rn, and h( ˉα) =0, ? h ∈ H}. We provide an effective algorithm for computing a finite set U of non-zero univariate polynomials such that the infimum inf V(f : H) of V(f : H) is a root of some polynomial in U whenever inf V(f : H) = ±∞.The strategies of this paper are decomposing a finite set of polynomials into triangular chains of polynomials and computing the so-called revised resultants. With the aid of the computer algebraic system Maple, our algorithm has been made into a general program to treat the equality-constrained minimization of polynomials with rational coefficients.展开更多
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 limxˉ→0f g=0 for two non-zero polynomials f,g∈R[x1,...,xn]with...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 limxˉ→0f g=0 for two non-zero polynomials f,g∈R[x1,...,xn]with f(0,...,0)=g(0,...,0)=0.For two such polynomials f and g,we establish two necessary and sufcient conditions for the rational functionf g to have its limit 0 at the origin.Based on these theoretic results,we present an algorithm for deciding whether or not lim(x1,...,xn)→(0,...,0)f g=0,where f,g∈R[x1,...,xn]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 efectiveness of our algorithm.展开更多
In a recent article, the authors provided an effective algorithm for both computing the global infimum of f and deciding whether or not the infimum of f is attained, where f is a multivariate polynomial over the field...In a recent article, the authors provided an effective algorithm for both computing the global infimum of f and deciding whether or not the infimum of f is attained, where f is a multivariate polynomial over the field R of real numbers. As a complement, the authors investigate the semi- algebraically connected components of minimum points of a polynomial function in this paper. For a given multivariate polynomial f over R, it is shown that the above-mentioned algorithm can find at least one point in each semi-algebraically connected component of minimum points of f whenever f has its global minimum.展开更多
In this paper,the notion of rational univariate representations with variables is introduced.Consequently,the ideals,created by given rational univariate representations with variables,are defined.One merit of these c...In this paper,the notion of rational univariate representations with variables is introduced.Consequently,the ideals,created by given rational univariate representations with variables,are defined.One merit of these created ideals is that some of their algebraic properties can be easily decided.With the aid of the theory of valuations,some related results are established.Based on these results,a new approach is presented for decomposing the radical of a polynomial ideal into an intersection of prime ideals.展开更多
基金the National Natural Science Foundation of China under Grant No.12161057。
文摘In this paper,the so-called invertibility is introduced for rational univariate representations,and a characterization of the invertibility is given.It is shown that the rational univariate representations,obtained by both Rouillier’s approach and Wu’s method,are invertible.Moreover,the ideal created by a given rational univariate representation is defined.Some results on invertible rational univariate representations and created ideals are established.Based on these results,a new approach is presented for decomposing the radical of a zero-dimensional polynomial ideal into an intersection of maximal ideals.
基金supported by National Natural Science Foundation of China(Grant No.11161034)
文摘This paper investigates the equality-constrained minimization of polynomial functions. Let R be the field of real numbers, and R[x1,..., xn] the ring of polynomials over R in variables x1,..., xn. For an f ∈ R[x1,..., xn] and a finite subset H of R[x1,..., xn], denote by V(f : H) the set {f( ˉα) | ˉα∈ Rn, and h( ˉα) =0, ? h ∈ H}. We provide an effective algorithm for computing a finite set U of non-zero univariate polynomials such that the infimum inf V(f : H) of V(f : H) is a root of some polynomial in U whenever inf V(f : H) = ±∞.The strategies of this paper are decomposing a finite set of polynomials into triangular chains of polynomials and computing the so-called revised resultants. With the aid of the computer algebraic system Maple, our algorithm has been made into a general program to treat the equality-constrained minimization of polynomials with rational coefficients.
基金supported by National Natural Science Foundation of China(Grant No.11161034)the Science Foundation of the Eduction Department of Jiangxi Province(Grant No.Gjj12012)
文摘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 limxˉ→0f g=0 for two non-zero polynomials f,g∈R[x1,...,xn]with f(0,...,0)=g(0,...,0)=0.For two such polynomials f and g,we establish two necessary and sufcient conditions for the rational functionf g to have its limit 0 at the origin.Based on these theoretic results,we present an algorithm for deciding whether or not lim(x1,...,xn)→(0,...,0)f g=0,where f,g∈R[x1,...,xn]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 efectiveness of our algorithm.
基金supported by the National Natural Science Foundation of China under Grant No.11161034the Science Foundation of the Education Department of Jiangxi Province under Grant No.Gjj12012
文摘In a recent article, the authors provided an effective algorithm for both computing the global infimum of f and deciding whether or not the infimum of f is attained, where f is a multivariate polynomial over the field R of real numbers. As a complement, the authors investigate the semi- algebraically connected components of minimum points of a polynomial function in this paper. For a given multivariate polynomial f over R, it is shown that the above-mentioned algorithm can find at least one point in each semi-algebraically connected component of minimum points of f whenever f has its global minimum.
基金supported by the National Natural Science Foundation of China under Grant No.12161057。
文摘In this paper,the notion of rational univariate representations with variables is introduced.Consequently,the ideals,created by given rational univariate representations with variables,are defined.One merit of these created ideals is that some of their algebraic properties can be easily decided.With the aid of the theory of valuations,some related results are established.Based on these results,a new approach is presented for decomposing the radical of a polynomial ideal into an intersection of prime ideals.
