Efficient computation of zero-dimensional Gro¨bner bases by change of ordering
Journal of Symbolic Computation
Robust and optimal control
Simulation and optimization by quantifier elimination
Journal of Symbolic Computation - Special issue: applications of quantifier elimination
A modular method to compute the rational univariate representation of zero-dimensional ideals
Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Canonical comprehensive Gröbner bases
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Sum of roots with positive real parts
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Complexity of the resolution of parametric systems of polynomial equations and inequations
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Positive Trigonometric Polynomials and Signal Processing Applications
Positive Trigonometric Polynomials and Signal Processing Applications
Journal of Symbolic Computation
Hi-index | 0.00 |
This paper constructs an algebraic solution approach to the algebraic Riccati equation, an important equation in signal processing and control system design. Key features of the proposed approach are the exploitation of useful structures inherent in the problem and the avoidance of Gröbner basis computation by generic algorithms. The approach extends the algebraic approach to polynomial spectral factorization by means of the Sum of Roots. The approach further finds an effective symbolic expression of the eigenvector of the associated Hamiltonian matrix in a simple way. An example is presented to demonstrate the proposed algorithm.