In many fields of science and engineering, it is needed to find all solutions of mixed trigonometric polynomial systems. Commonly, mixed trigonometric polynomial systems are transformed into polynomial systems by vari...In many fields of science and engineering, it is needed to find all solutions of mixed trigonometric polynomial systems. Commonly, mixed trigonometric polynomial systems are transformed into polynomial systems by variable substitution and adding some quadratic equations, and then solved by some numerical methods. However, transformation of a mixed trigonometric polynomial system into a polynomial system will increase the dimension of the system and hence induces extra computational work. In this paper, we consider to solve the mixed trigonometric polynomial. systems by homotopy method directly. Homotopy with the start system constructed by GBQ-algorithm is presented and homotopy theorems are proved. Preliminary numerical results show that our constructed direct homotopy method is more efficient than the existent direct homotopy methods.展开更多
Finding all zeros of polynomial systems is very interesting and it is also useul for many applied science problems.In this paper,based on Wu's method,we give an algorithm to find all isolated zeros of polynomial s...Finding all zeros of polynomial systems is very interesting and it is also useul for many applied science problems.In this paper,based on Wu's method,we give an algorithm to find all isolated zeros of polynomial systems (or polynomial equations).By solving Lorenz equations,it is shown that our algo-rithm is efficient and powerful.展开更多
This paper presents a generalization of the authors＇ earlier work. In this paper, the two concepts, generic regular decomposition （GRD） and regular-decomposition-unstable （RDU） variety introduced in the authors＇...This paper presents a generalization of the authors＇ earlier work. In this paper, the two concepts, generic regular decomposition （GRD） and regular-decomposition-unstable （RDU） variety introduced in the authors＇ previous work for generic zero-dimensional systems, are extended to the case where the parametric systems are not necessarily zero-dimensional. An algorithm is provided to compute GRDs and the associated RDU varieties of parametric systems simultaneously on the basis of the algorithm for generic zero-dimensional systems proposed in the authors＇ previous work. Then the solutions of any parametric system can be represented by the solutions of finitely many regular systems and the decomposition is stable at any parameter value in the complement of the associated RDU variety of the parameter space. The related definitions and the results presented in the authors＇ previous work are also generalized and a further discussion on RDU varieties is given from an experimental point of view. The new algorithm has been implemented on the basis of DISCOVERER with Maple 16 and experimented with a number of benchmarks from the literature.展开更多
In this paper, we discuss the limit cycles of the systemdx/dt=y·[1+(A(x)]oy/dt=(-x+δy+α_1x^2+α_2xy+α_5x^2y)[1+B(x)] (1)where A(x)=sum form i=1 to n(a_ix~), B(x)=sum form j=1 to m(β_jx^j) and 1+B(x)>0. We ...In this paper, we discuss the limit cycles of the systemdx/dt=y·[1+(A(x)]oy/dt=(-x+δy+α_1x^2+α_2xy+α_5x^2y)[1+B(x)] (1)where A(x)=sum form i=1 to n(a_ix~), B(x)=sum form j=1 to m(β_jx^j) and 1+B(x)>0. We prove that (1) possesses at most one limit cycle and give out the necessary and sufficient conditions of existence and uniqueness of limit cycles.展开更多
This note shows that when studying geometric pro perties, a polynomial system is defined as a line field on a projective space such that its singular set has co dimension at least 2. By this definition, the concept ...This note shows that when studying geometric pro perties, a polynomial system is defined as a line field on a projective space such that its singular set has co dimension at least 2. By this definition, the concept of the degree of a polynomial system does not coincide with the usual one. The usual degenerate polynomial system of degree n+1 should be regarded as a system of degree n . Note that the definition is independent coordinate system. And, by this definition, some geometric properties concerning polynomial vector fields turn out to be evident.展开更多
A class of polynomial system was structured, which depends on a parameter delta. When delta monotonous changes, more than one neighbouring limit cycles located in the vector field of this polynomial system can expand ...A class of polynomial system was structured, which depends on a parameter delta. When delta monotonous changes, more than one neighbouring limit cycles located in the vector field of this polynomial system can expand (or reduce) together with thee. But the expansion (or reduction) of these limit cycles is not surely monotonous. This vector field is like the rotated vector field. So these limit cycles of the polynomial system are called to constitute an 'analogue rotated vector field' with delta. They may become an effective tool to study the bifurcation of multiple limit cycle or fine separatrix cycle.展开更多
In this paper, a Ritt-Wu＇s characteristic set method for ordinary difference systems is proposed, which is valid for any admissible ordering. New definition for irreducible chains and new zero decomposition algorithm...In this paper, a Ritt-Wu＇s characteristic set method for ordinary difference systems is proposed, which is valid for any admissible ordering. New definition for irreducible chains and new zero decomposition algorithms are also proposed.展开更多
In this paper, the global controllability for a class of high dimensional polynomial systems has been investigated and a constructive algebraic criterion algorithm for their global controllability has been obtained. B...In this paper, the global controllability for a class of high dimensional polynomial systems has been investigated and a constructive algebraic criterion algorithm for their global controllability has been obtained. By the criterion algorithm, the global controllability can be determined in finite steps of arithmetic operations. The algorithm is imposed on the coefficients of the polynomials only and the analysis technique is based on Sturm Theorem in real algebraic geometry and its modern progress. Finally, the authors will give some examples to show the application of our results.展开更多
We present a novel formulation, based on the latest advancement in polynomial system solving via linear algebra, for identifying limit cycles in general n-dimensional autonomous nonlinear polynomial systems. The condi...We present a novel formulation, based on the latest advancement in polynomial system solving via linear algebra, for identifying limit cycles in general n-dimensional autonomous nonlinear polynomial systems. The condition for the existence of an algebraic limit cycle is first set up and cast into a Macaulay matrix format whereby polynomials are regarded as coefficient vectors of monomials. This results in a system of polynomial equations whose roots are solved through the null space of another Macaulay matrix. This two-level Macaulay matrix approach relies solely on linear algebra and eigenvalue computation with robust numerical implementation. Furthermore, a state immersion technique further enlarges the scope to cover also non-polynomial (including exponential and logarithmic) limit cycles. Application examples are given to demonstrate the efficacy of the proposed framework.展开更多
As a crucial component of intelligent chassis systems,air suspension significantly enhances driver comfort and vehicle stability.To further improve the adaptability of commercial vehicles to complex and variable road ...As a crucial component of intelligent chassis systems,air suspension significantly enhances driver comfort and vehicle stability.To further improve the adaptability of commercial vehicles to complex and variable road conditions,this paper proposes a linear motor active suspension with quasi-zero stiffness(QZS)air spring system.Firstly,a dynamic model of the linear motor active suspension with QZS air spring system is established.Secondly,considering the random uncertainties in the linear motor parameters due to manufacturing and environmental factors,a dynamic model and state equations incorporating these uncertainties are constructed using the polynomial chaos expansion(PCE)method.Then,based on H_(2) robust control theory and the Kalman filter,a state feedback control law is derived,accounting for the random parameter uncertainties.Finally,simulation and hardware-in-the-loop(HIL)experimental results demonstrate that the PCE-H_(2) robust controller not only provides better performance in terms of vehicle ride comfort compared to general H_(2) robust controller but also exhibits higher robustness to the effects of random uncertain parameters,resulting in more stable control performance.展开更多
A novel suppression method of the phase noise is proposed to reduce the negative impacts of phase noise in coherent optical orthogonal frequency division multiplexing(CO-OFDM)systems.The method integrates the sub-symb...A novel suppression method of the phase noise is proposed to reduce the negative impacts of phase noise in coherent optical orthogonal frequency division multiplexing(CO-OFDM)systems.The method integrates the sub-symbol second-order polynomial interpolation(SSPI)with cubature Kalman filter(CKF)to improve the precision and effectiveness of the data processing through using a three-stage processing approach of phase noise.First of all,the phase noise values in OFDM symbols are calculated by using pilot symbols.Then,second-order Newton interpolation(SNI)is used in second-order interpolation to acquire precise noise estimation.Afterwards,every OFDM symbol is partitioned into several sub-symbols,and second-order polynomial interpolation(SPI)is utilized in the time domain to enhance suppression accuracy and time resolution.Ultimately,CKF is employed to suppress the residual phase noise.The simulation results show that this method significantly suppresses the impact of the phase noise on the system,and the error floors can be decreased at the condition of 16 quadrature amplitude modulation(16QAM)and 32QAM.The proposed method can greatly improve the CO-OFDM system's ability to tolerate the wider laser linewidth.This method,compared to the linear interpolation sub-symbol common phase error compensation(LI-SCPEC)and Lagrange interpolation and extended Kalman filter(LRI-EKF)algorithms,has superior suppression effect.展开更多
Estimating the number of isolated roots of a polynomial system is not only a fundamental study theme in algebraic geometry but also an important subproblem of homotopy methods for solving polynomial systems. For the m...Estimating the number of isolated roots of a polynomial system is not only a fundamental study theme in algebraic geometry but also an important subproblem of homotopy methods for solving polynomial systems. For the mixed trigonometric polynomial systems, which are more general than polynomial systems and rather frequently occur in many applications, the classical B6zout number and the multihomogeneous Bezout number are the best known upper bounds on the number of isolated roots. However, for the deficient mixed trigonometric polynomial systems, these two upper bounds are far greater than the actual number of isolated roots. The BKK bound is known as the most accurate upper bound on the number of isolated roots of a polynomial system. However, the extension of the definition of the BKK bound allowing it to treat mixed trigonometric polynomial systems is very difficult due to the existence of sine and cosine functions. In this paper, two new upper bounds on the number of isolated roots of a mixed trigonometric polynomial system are defined and the corresponding efficient algorithms for calculating them are presented. Numerical tests are also given to show the accuracy of these two definitions, and numerically prove they can provide tighter upper bounds on the number of isolated roots of a mixed trigonometric polynomial system than the existing upper bounds, and also the authors compare the computational time for calculating these two upper bounds.展开更多
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.展开更多
This paper investigates the stability of(switched)polynomial systems.Using semi-tensor product of matrices,the paper develops two tools for testing the stability of a(switched)polynomial system.One is to convert a pro...This paper investigates the stability of(switched)polynomial systems.Using semi-tensor product of matrices,the paper develops two tools for testing the stability of a(switched)polynomial system.One is to convert a product of multi-variable polynomials into a canonical form,and the other is an easily verifiable sufficient condition to justify whether a multi-variable polynomial is positive definite.Using these two tools,the authors construct a polynomial function as a candidate Lyapunov function and via testing its derivative the authors provide some sufficient conditions for the global stability of polynomial systems.展开更多
Triangular decomposition with different properties has been used for various types of problem solving.In this paper,the concepts of pure chains and square-free pure triangular decomposition(SFPTD)of zero-dimensional p...Triangular decomposition with different properties has been used for various types of problem solving.In this paper,the concepts of pure chains and square-free pure triangular decomposition(SFPTD)of zero-dimensional polynomial systems are defined.Because of its good properties,SFPTD may be a key way to many problems related to zero-dimensional polynomial systems.Inspired by the work of Wang(2016)and of Dong and Mou(2019),the authors propose an algorithm for computing SFPTD based on Gr¨obner bases computation.The novelty of the algorithm is that the authors make use of saturated ideals and separant to ensure that the zero sets of any two pure chains are disjoint and every pure chain is square-free,respectively.On one hand,the authors prove the arithmetic complexity of the new algorithm can be single exponential in the square of the number of variables,which seems to be among the rare complexity analysis results for triangular-decomposition methods.On the other hand,the authors show experimentally that,on a large number of examples in the literature,the new algorithm is far more efficient than a popular triangular-decomposition method based on pseudodivision,and the methods based on SFPTD for real solution isolation and for computing radicals of zero-dimensional ideals are very efficient.展开更多
In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic varia...In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic variable from a set of polynomials in one step using the theory of multivariate resultant. This seems to be the first differential triangular decomposition algorithm with elementary computation complexity.展开更多
A method for positive polynomial validation based on polynomial decomposition is proposed to deal with control synthesis problems. Detailed algorithms for decomposition are given which mainly consider how to convert c...A method for positive polynomial validation based on polynomial decomposition is proposed to deal with control synthesis problems. Detailed algorithms for decomposition are given which mainly consider how to convert coefficients of a polynomial to a matrix with free variables. Then, the positivity of a polynomial is checked by the decomposed matrix with semidefinite programming solvers. A nonlinear control law is presented for single input polynomial systems based on the Lyapunov stability theorem. The control synthesis method is advanced to multi-input systems further. An application in attitude control is finally presented. The proposed control law achieves effective performance as illustrated by the numerical example.展开更多
A new iterating method based on homotopy function is developed in this paper. All solutions can be found easily without the need of choosing proper initial values. Compared to the homotopy continuation method, the sol...A new iterating method based on homotopy function is developed in this paper. All solutions can be found easily without the need of choosing proper initial values. Compared to the homotopy continuation method, the solution process of the present method is simplified, and the computation efficiency as well as the reliability for obtaining all solutions is also improved. By application of the method to the mechanisms problems, the results are satisfactory.展开更多
Based on the frequency domain training sequences, the polynomial-based carrier frequency offset （CFO） estimation in multiple-input multiple-output （ MIMO ） orthogonal frequency division multiplexing （ OFDM ） sys...Based on the frequency domain training sequences, the polynomial-based carrier frequency offset （CFO） estimation in multiple-input multiple-output （ MIMO ） orthogonal frequency division multiplexing （ OFDM ） systems is extensively investigated. By designing the training sequences to meet certain conditions and exploiting the Hermitian and real symmetric properties of the corresponding matrices, it is found that the roots of the polynomials corresponding to the cost functions are pairwise and that both meger CFO and fractional CFO can be estimated by the direct polynomial rooting approach. By analyzing the polynomials corresponding to the cost functions and their derivatives, it is shown that they have a common polynomial factor and the former can be expressed in a quadratic form of the common polynomial factor. Analytical results further reveal that the derivative polynomial rooting approach is equivalent to the direct one in estimation at the same signal-to-noise ratio（SNR） value and that the latter is superior to the former in complexity. Simulation results agree well with analytical results.展开更多
基金Supported by the National Natural Science Foundation of China(Grant Nos.1110106711171051)the Fundamental Research Funds for the Central Universities(Grant No.DUT16LK04)
文摘In many fields of science and engineering, it is needed to find all solutions of mixed trigonometric polynomial systems. Commonly, mixed trigonometric polynomial systems are transformed into polynomial systems by variable substitution and adding some quadratic equations, and then solved by some numerical methods. However, transformation of a mixed trigonometric polynomial system into a polynomial system will increase the dimension of the system and hence induces extra computational work. In this paper, we consider to solve the mixed trigonometric polynomial. systems by homotopy method directly. Homotopy with the start system constructed by GBQ-algorithm is presented and homotopy theorems are proved. Preliminary numerical results show that our constructed direct homotopy method is more efficient than the existent direct homotopy methods.
文摘Finding all zeros of polynomial systems is very interesting and it is also useul for many applied science problems.In this paper,based on Wu's method,we give an algorithm to find all isolated zeros of polynomial systems (or polynomial equations).By solving Lorenz equations,it is shown that our algo-rithm is efficient and powerful.
基金supported by by the National Natural Science Foundation of China under Grant Nos.11271034,11290141the Project SYSKF1207 from SKLCS,IOS,the Chinese Academy of Sciences
文摘This paper presents a generalization of the authors＇ earlier work. In this paper, the two concepts, generic regular decomposition （GRD） and regular-decomposition-unstable （RDU） variety introduced in the authors＇ previous work for generic zero-dimensional systems, are extended to the case where the parametric systems are not necessarily zero-dimensional. An algorithm is provided to compute GRDs and the associated RDU varieties of parametric systems simultaneously on the basis of the algorithm for generic zero-dimensional systems proposed in the authors＇ previous work. Then the solutions of any parametric system can be represented by the solutions of finitely many regular systems and the decomposition is stable at any parameter value in the complement of the associated RDU variety of the parameter space. The related definitions and the results presented in the authors＇ previous work are also generalized and a further discussion on RDU varieties is given from an experimental point of view. The new algorithm has been implemented on the basis of DISCOVERER with Maple 16 and experimented with a number of benchmarks from the literature.
文摘In this paper, we discuss the limit cycles of the systemdx/dt=y·[1+(A(x)]oy/dt=(-x+δy+α_1x^2+α_2xy+α_5x^2y)[1+B(x)] (1)where A(x)=sum form i=1 to n(a_ix~), B(x)=sum form j=1 to m(β_jx^j) and 1+B(x)>0. We prove that (1) possesses at most one limit cycle and give out the necessary and sufficient conditions of existence and uniqueness of limit cycles.
文摘This note shows that when studying geometric pro perties, a polynomial system is defined as a line field on a projective space such that its singular set has co dimension at least 2. By this definition, the concept of the degree of a polynomial system does not coincide with the usual one. The usual degenerate polynomial system of degree n+1 should be regarded as a system of degree n . Note that the definition is independent coordinate system. And, by this definition, some geometric properties concerning polynomial vector fields turn out to be evident.
文摘A class of polynomial system was structured, which depends on a parameter delta. When delta monotonous changes, more than one neighbouring limit cycles located in the vector field of this polynomial system can expand (or reduce) together with thee. But the expansion (or reduction) of these limit cycles is not surely monotonous. This vector field is like the rotated vector field. So these limit cycles of the polynomial system are called to constitute an 'analogue rotated vector field' with delta. They may become an effective tool to study the bifurcation of multiple limit cycle or fine separatrix cycle.
文摘In this paper, a Ritt-Wu＇s characteristic set method for ordinary difference systems is proposed, which is valid for any admissible ordering. New definition for irreducible chains and new zero decomposition algorithms are also proposed.
基金supported by the Natural Science Foundation of China under Grant Nos.60804008,61174048and 11071263the Fundamental Research Funds for the Central Universities and Guangdong Province Key Laboratory of Computational Science at Sun Yat-Sen University
文摘In this paper, the global controllability for a class of high dimensional polynomial systems has been investigated and a constructive algebraic criterion algorithm for their global controllability has been obtained. By the criterion algorithm, the global controllability can be determined in finite steps of arithmetic operations. The algorithm is imposed on the coefficients of the polynomials only and the analysis technique is based on Sturm Theorem in real algebraic geometry and its modern progress. Finally, the authors will give some examples to show the application of our results.
文摘We present a novel formulation, based on the latest advancement in polynomial system solving via linear algebra, for identifying limit cycles in general n-dimensional autonomous nonlinear polynomial systems. The condition for the existence of an algebraic limit cycle is first set up and cast into a Macaulay matrix format whereby polynomials are regarded as coefficient vectors of monomials. This results in a system of polynomial equations whose roots are solved through the null space of another Macaulay matrix. This two-level Macaulay matrix approach relies solely on linear algebra and eigenvalue computation with robust numerical implementation. Furthermore, a state immersion technique further enlarges the scope to cover also non-polynomial (including exponential and logarithmic) limit cycles. Application examples are given to demonstrate the efficacy of the proposed framework.
基金Supported by National Natural Science Foundation of China(Grant No.51875256)Open Platform Fund of Human Institute of Technology(Grant No.KFA22009).
文摘As a crucial component of intelligent chassis systems,air suspension significantly enhances driver comfort and vehicle stability.To further improve the adaptability of commercial vehicles to complex and variable road conditions,this paper proposes a linear motor active suspension with quasi-zero stiffness(QZS)air spring system.Firstly,a dynamic model of the linear motor active suspension with QZS air spring system is established.Secondly,considering the random uncertainties in the linear motor parameters due to manufacturing and environmental factors,a dynamic model and state equations incorporating these uncertainties are constructed using the polynomial chaos expansion(PCE)method.Then,based on H_(2) robust control theory and the Kalman filter,a state feedback control law is derived,accounting for the random parameter uncertainties.Finally,simulation and hardware-in-the-loop(HIL)experimental results demonstrate that the PCE-H_(2) robust controller not only provides better performance in terms of vehicle ride comfort compared to general H_(2) robust controller but also exhibits higher robustness to the effects of random uncertain parameters,resulting in more stable control performance.
基金supported by the National Natural Science Foundation of China(Nos.U21A20447 and 61971079)。
文摘A novel suppression method of the phase noise is proposed to reduce the negative impacts of phase noise in coherent optical orthogonal frequency division multiplexing(CO-OFDM)systems.The method integrates the sub-symbol second-order polynomial interpolation(SSPI)with cubature Kalman filter(CKF)to improve the precision and effectiveness of the data processing through using a three-stage processing approach of phase noise.First of all,the phase noise values in OFDM symbols are calculated by using pilot symbols.Then,second-order Newton interpolation(SNI)is used in second-order interpolation to acquire precise noise estimation.Afterwards,every OFDM symbol is partitioned into several sub-symbols,and second-order polynomial interpolation(SPI)is utilized in the time domain to enhance suppression accuracy and time resolution.Ultimately,CKF is employed to suppress the residual phase noise.The simulation results show that this method significantly suppresses the impact of the phase noise on the system,and the error floors can be decreased at the condition of 16 quadrature amplitude modulation(16QAM)and 32QAM.The proposed method can greatly improve the CO-OFDM system's ability to tolerate the wider laser linewidth.This method,compared to the linear interpolation sub-symbol common phase error compensation(LI-SCPEC)and Lagrange interpolation and extended Kalman filter(LRI-EKF)algorithms,has superior suppression effect.
基金supported in part by the National Natural Science Foundation of China under Grant Nos.11101067 and 11571061Major Research Plan of the National Natural Science Foundation of China under Grant No.91230103the Fundamental Research Funds for the Central Universities
文摘Estimating the number of isolated roots of a polynomial system is not only a fundamental study theme in algebraic geometry but also an important subproblem of homotopy methods for solving polynomial systems. For the mixed trigonometric polynomial systems, which are more general than polynomial systems and rather frequently occur in many applications, the classical B6zout number and the multihomogeneous Bezout number are the best known upper bounds on the number of isolated roots. However, for the deficient mixed trigonometric polynomial systems, these two upper bounds are far greater than the actual number of isolated roots. The BKK bound is known as the most accurate upper bound on the number of isolated roots of a polynomial system. However, the extension of the definition of the BKK bound allowing it to treat mixed trigonometric polynomial systems is very difficult due to the existence of sine and cosine functions. In this paper, two new upper bounds on the number of isolated roots of a mixed trigonometric polynomial system are defined and the corresponding efficient algorithms for calculating them are presented. Numerical tests are also given to show the accuracy of these two definitions, and numerically prove they can provide tighter upper bounds on the number of isolated roots of a mixed trigonometric polynomial system than the existing upper bounds, and also the authors compare the computational time for calculating these two upper bounds.
基金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.
基金supported partly by the National Natural Science Foundation of China under Grant Nos.60674022,60736022,and 60221301.
文摘This paper investigates the stability of(switched)polynomial systems.Using semi-tensor product of matrices,the paper develops two tools for testing the stability of a(switched)polynomial system.One is to convert a product of multi-variable polynomials into a canonical form,and the other is an easily verifiable sufficient condition to justify whether a multi-variable polynomial is positive definite.Using these two tools,the authors construct a polynomial function as a candidate Lyapunov function and via testing its derivative the authors provide some sufficient conditions for the global stability of polynomial systems.
基金supported by National Key R&D Program of China under Grant No.2022YFA1005102the National Natural Science Foundation of China under Grant No.61732001。
文摘Triangular decomposition with different properties has been used for various types of problem solving.In this paper,the concepts of pure chains and square-free pure triangular decomposition(SFPTD)of zero-dimensional polynomial systems are defined.Because of its good properties,SFPTD may be a key way to many problems related to zero-dimensional polynomial systems.Inspired by the work of Wang(2016)and of Dong and Mou(2019),the authors propose an algorithm for computing SFPTD based on Gr¨obner bases computation.The novelty of the algorithm is that the authors make use of saturated ideals and separant to ensure that the zero sets of any two pure chains are disjoint and every pure chain is square-free,respectively.On one hand,the authors prove the arithmetic complexity of the new algorithm can be single exponential in the square of the number of variables,which seems to be among the rare complexity analysis results for triangular-decomposition methods.On the other hand,the authors show experimentally that,on a large number of examples in the literature,the new algorithm is far more efficient than a popular triangular-decomposition method based on pseudodivision,and the methods based on SFPTD for real solution isolation and for computing radicals of zero-dimensional ideals are very efficient.
基金supported by the National Natural Science Foundation of China under Grant No.60821002the National Key Basic Research Project of China
文摘In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic variable from a set of polynomials in one step using the theory of multivariate resultant. This seems to be the first differential triangular decomposition algorithm with elementary computation complexity.
基金the National Natural Science Foundation of China (Nos. 60674028 and 60736021)the Hi-Tech Research andDevelopment Program (863) of China (Nos. 2006AA04Z184 and 2007AA041406)+1 种基金the Key Technologies R&D Program of Zhejiang Province, China (No. 2006C11066)the Joint Funds of NSFC-Guangdong Province of China (No. U0735003)
文摘A method for positive polynomial validation based on polynomial decomposition is proposed to deal with control synthesis problems. Detailed algorithms for decomposition are given which mainly consider how to convert coefficients of a polynomial to a matrix with free variables. Then, the positivity of a polynomial is checked by the decomposed matrix with semidefinite programming solvers. A nonlinear control law is presented for single input polynomial systems based on the Lyapunov stability theorem. The control synthesis method is advanced to multi-input systems further. An application in attitude control is finally presented. The proposed control law achieves effective performance as illustrated by the numerical example.
文摘A new iterating method based on homotopy function is developed in this paper. All solutions can be found easily without the need of choosing proper initial values. Compared to the homotopy continuation method, the solution process of the present method is simplified, and the computation efficiency as well as the reliability for obtaining all solutions is also improved. By application of the method to the mechanisms problems, the results are satisfactory.
基金The National Natural Science Foundation of China(No.60702028)the National High Technology Research and Development Program of China(863Program)(No.2007AA01Z268)
文摘Based on the frequency domain training sequences, the polynomial-based carrier frequency offset （CFO） estimation in multiple-input multiple-output （ MIMO ） orthogonal frequency division multiplexing （ OFDM ） systems is extensively investigated. By designing the training sequences to meet certain conditions and exploiting the Hermitian and real symmetric properties of the corresponding matrices, it is found that the roots of the polynomials corresponding to the cost functions are pairwise and that both meger CFO and fractional CFO can be estimated by the direct polynomial rooting approach. By analyzing the polynomials corresponding to the cost functions and their derivatives, it is shown that they have a common polynomial factor and the former can be expressed in a quadratic form of the common polynomial factor. Analytical results further reveal that the derivative polynomial rooting approach is equivalent to the direct one in estimation at the same signal-to-noise ratio（SNR） value and that the latter is superior to the former in complexity. Simulation results agree well with analytical results.
