Let Q be the class of real coefficient polynomials of degree 2 with positive real part in the unit disk and constant term equal to 1. aam coefficient region of polynomials in Q is found and some sharp coefficient esti...Let Q be the class of real coefficient polynomials of degree 2 with positive real part in the unit disk and constant term equal to 1. aam coefficient region of polynomials in Q is found and some sharp coefficient estimates for the polynomials with positive real part in the unit disk are established in this paper.展开更多
The present paper proves that if（x） ∈ C[0,1], changes its sign exactly l times at 0 〈 y1〈 y2 … 〈 y1 〈 1 in （0, 1）, then there exists a pn（x） ∈ Пn（＋）, such that ｜f（x）- p（x）/pn（x）｜≤ Cωφ（f,n^...The present paper proves that if（x） ∈ C[0,1], changes its sign exactly l times at 0 〈 y1〈 y2 … 〈 y1 〈 1 in （0, 1）, then there exists a pn（x） ∈ Пn（＋）, such that ｜f（x）- p（x）/pn（x）｜≤ Cωφ（f,n^（-1/2））, where ρ（x） is defined by ρ（x）={^lПi=1（x-yi）,if f （x）≥0 for x ∈（y1,1）, {-^lПi=1（x-yi）,if f （x）〈0 for x ∈（y1,1）, which improves and generalizes the result of .展开更多
Understanding of the basic properties of the positive semi-definite tensor is a prerequisite for its extensive applications in theoretical and practical fields, especially for its square-root. Uniqueness of the square...Understanding of the basic properties of the positive semi-definite tensor is a prerequisite for its extensive applications in theoretical and practical fields, especially for its square-root. Uniqueness of the square-root of a positive semi-definite tensor is proven in this paper without resorting to the notion of eigenvalues, eigenvectors and the spectral decomposition of the second-order symmetric tensor.展开更多
In the model of geometric programming, values of parameters cannot be gotten owing to data fluctuation and incompletion. But reasonable bounds of these parameters can be attained. This is to say, parameters of this mo...In the model of geometric programming, values of parameters cannot be gotten owing to data fluctuation and incompletion. But reasonable bounds of these parameters can be attained. This is to say, parameters of this model can be regarded as interval grey numbers. When the model contains grey numbers, it is hard for common programming method to solve them. By combining the common programming model with the grey system theory, and using some analysis strategies, a model of grey polynomial geometric programming, a model of θ positioned geometric programming and their quasi-optimum solution or optimum solution are put forward. At the same time, we also developed an algorithm for the problem. This approach brings a new way for the application research of geometric programming. An example at the end of this paper shows the rationality and feasibility of the algorithm.展开更多
L'convergence with 0<p<infinity of the positive operators F.(da,f) and G.(da,f), introduced by Nevai P. [3], and Qn,8(da,f), introduced by Hermann T. and Vertesi P. [1] to f is an element of C[-1,1] is prove...L'convergence with 0<p<infinity of the positive operators F.(da,f) and G.(da,f), introduced by Nevai P. [3], and Qn,8(da,f), introduced by Hermann T. and Vertesi P. [1] to f is an element of C[-1,1] is proved to hold for very general measures.展开更多
In this paper, we further generalize the technique for constructing the normal （or pos- itive definite） and skew-Hermitian splitting iteration method for solving large sparse non- Hermitian positive definite system ...In this paper, we further generalize the technique for constructing the normal （or pos- itive definite） and skew-Hermitian splitting iteration method for solving large sparse non- Hermitian positive definite system of linear equations. By introducing a new splitting, we establish a class of efficient iteration methods, called positive definite and semi-definite splitting （PPS） methods, and prove that the sequence produced by the PPS method con- verges unconditionally to the unique solution of the system. Moreover, we propose two kinds of typical practical choices of the PPS method and study the upper bound of the spectral radius of the iteration matrix. In addition, we show the optimal parameters such that the spectral radius achieves the minimum under certain conditions. Finally, some numerical examples are given to demonstrate the effectiveness of the considered methods.展开更多
The paper is concerned with the improvement of the rational representation theory for solving positive-dimensional polynomial systems. The authors simplify the expression of rational representation set proposed by Tan...The paper is concerned with the improvement of the rational representation theory for solving positive-dimensional polynomial systems. The authors simplify the expression of rational representation set proposed by Tan and Zhang(2010), obtain the simplified rational representation with less rational representation sets, and hence reduce the complexity for representing the variety of a positive-dimensional ideal. As an application, the authors compute a "nearly" parametric solution for the SHEPWM problem with a fixed number of switching angles.展开更多
In this paper we introduce a primal-dual potential reduction algorithm for positive semi-definite programming. Using the symetric preserving scalings for both primal and dual interior matrices, we can construct an alg...In this paper we introduce a primal-dual potential reduction algorithm for positive semi-definite programming. Using the symetric preserving scalings for both primal and dual interior matrices, we can construct an algorithm which is very similar to the primal-dual potential reduction algorithm of Huang and Kortanek [6] for linear programming. The complexity of the algorithm is either O(nlog(X0 · S0/ε) or O(nlog(X0· S0/ε) depends on the value of ρ in the primal-dual potential function, where X0 and S0 is the initial interior matrices of the positive semi-definite programming.展开更多
For any two n-th order polynomials a(s) and b(s), the Hurwitz stability of their convex combination is necessary and sufficient for the existence of a polynomial c(s) such that c(s)/a(s) and c(s)/b(s) are both strictl...For any two n-th order polynomials a(s) and b(s), the Hurwitz stability of their convex combination is necessary and sufficient for the existence of a polynomial c(s) such that c(s)/a(s) and c(s)/b(s) are both strictly positive real.展开更多
In this paper, the nonexistence, existence and the number of limit cycles for a class of differential systems with positive definite polynomial are considered, and the results obtained generalize and supplement those ...In this paper, the nonexistence, existence and the number of limit cycles for a class of differential systems with positive definite polynomial are considered, and the results obtained generalize and supplement those of [1].展开更多
Quillen proved that if a Hermitian bihomogeneous polynomial is strictly positive on the unit sphere, then repeated multiplication of the standard sesquilinear form to this polynomial eventually results in a sum of Her...Quillen proved that if a Hermitian bihomogeneous polynomial is strictly positive on the unit sphere, then repeated multiplication of the standard sesquilinear form to this polynomial eventually results in a sum of Hermitian squares. Catlin-D'Angelo and Varolin deduced this positivstellensatz of Quillen from the eventual positive-definiteness of an associated integral operator. Their arguments involve asymptotic expansions of the Bergman kernel. The goal of this article is to give an elementary proof of the positive-definiteness of this integral operator.展开更多
文摘Let Q be the class of real coefficient polynomials of degree 2 with positive real part in the unit disk and constant term equal to 1. aam coefficient region of polynomials in Q is found and some sharp coefficient estimates for the polynomials with positive real part in the unit disk are established in this paper.
基金Supported in part by National Natural Science Foundations of China under the grant number 10471130
文摘The present paper proves that if（x） ∈ C[0,1], changes its sign exactly l times at 0 〈 y1〈 y2 … 〈 y1 〈 1 in （0, 1）, then there exists a pn（x） ∈ Пn（＋）, such that ｜f（x）- p（x）/pn（x）｜≤ Cωφ（f,n^（-1/2））, where ρ（x） is defined by ρ（x）={^lПi=1（x-yi）,if f （x）≥0 for x ∈（y1,1）, {-^lПi=1（x-yi）,if f （x）〈0 for x ∈（y1,1）, which improves and generalizes the result of .
文摘Understanding of the basic properties of the positive semi-definite tensor is a prerequisite for its extensive applications in theoretical and practical fields, especially for its square-root. Uniqueness of the square-root of a positive semi-definite tensor is proven in this paper without resorting to the notion of eigenvalues, eigenvectors and the spectral decomposition of the second-order symmetric tensor.
基金Supported by the NSF Jiangsu Province(BK2003211)Supported by the NSF of Henan Province(2003120001)
文摘In the model of geometric programming, values of parameters cannot be gotten owing to data fluctuation and incompletion. But reasonable bounds of these parameters can be attained. This is to say, parameters of this model can be regarded as interval grey numbers. When the model contains grey numbers, it is hard for common programming method to solve them. By combining the common programming model with the grey system theory, and using some analysis strategies, a model of grey polynomial geometric programming, a model of θ positioned geometric programming and their quasi-optimum solution or optimum solution are put forward. At the same time, we also developed an algorithm for the problem. This approach brings a new way for the application research of geometric programming. An example at the end of this paper shows the rationality and feasibility of the algorithm.
文摘L'convergence with 0<p<infinity of the positive operators F.(da,f) and G.(da,f), introduced by Nevai P. [3], and Qn,8(da,f), introduced by Hermann T. and Vertesi P. [1] to f is an element of C[-1,1] is proved to hold for very general measures.
文摘In this paper, we further generalize the technique for constructing the normal （or pos- itive definite） and skew-Hermitian splitting iteration method for solving large sparse non- Hermitian positive definite system of linear equations. By introducing a new splitting, we establish a class of efficient iteration methods, called positive definite and semi-definite splitting （PPS） methods, and prove that the sequence produced by the PPS method con- verges unconditionally to the unique solution of the system. Moreover, we propose two kinds of typical practical choices of the PPS method and study the upper bound of the spectral radius of the iteration matrix. In addition, we show the optimal parameters such that the spectral radius achieves the minimum under certain conditions. Finally, some numerical examples are given to demonstrate the effectiveness of the considered methods.
基金supported by the National Natural Science Foundation of China under Grant No.11671169Scientific Research Fund of Liaoning Provincial Education Department under Grant No.L2014008
文摘The paper is concerned with the improvement of the rational representation theory for solving positive-dimensional polynomial systems. The authors simplify the expression of rational representation set proposed by Tan and Zhang(2010), obtain the simplified rational representation with less rational representation sets, and hence reduce the complexity for representing the variety of a positive-dimensional ideal. As an application, the authors compute a "nearly" parametric solution for the SHEPWM problem with a fixed number of switching angles.
基金This research was partially supported by a fund from Chinese Academy of Science,and a fund from the Personal Department of the State Council.It is also sponsored by scientific research foundation for returned overseas Chinese Scholars,State Education
文摘In this paper we introduce a primal-dual potential reduction algorithm for positive semi-definite programming. Using the symetric preserving scalings for both primal and dual interior matrices, we can construct an algorithm which is very similar to the primal-dual potential reduction algorithm of Huang and Kortanek [6] for linear programming. The complexity of the algorithm is either O(nlog(X0 · S0/ε) or O(nlog(X0· S0/ε) depends on the value of ρ in the primal-dual potential function, where X0 and S0 is the initial interior matrices of the positive semi-definite programming.
文摘For any two n-th order polynomials a(s) and b(s), the Hurwitz stability of their convex combination is necessary and sufficient for the existence of a polynomial c(s) such that c(s)/a(s) and c(s)/b(s) are both strictly positive real.
文摘In this paper, the nonexistence, existence and the number of limit cycles for a class of differential systems with positive definite polynomial are considered, and the results obtained generalize and supplement those of [1].
文摘Quillen proved that if a Hermitian bihomogeneous polynomial is strictly positive on the unit sphere, then repeated multiplication of the standard sesquilinear form to this polynomial eventually results in a sum of Hermitian squares. Catlin-D'Angelo and Varolin deduced this positivstellensatz of Quillen from the eventual positive-definiteness of an associated integral operator. Their arguments involve asymptotic expansions of the Bergman kernel. The goal of this article is to give an elementary proof of the positive-definiteness of this integral operator.
