DocumentCode :
2099083
Title :
Solving the ARE symbolically
Author :
Forsman, Krister ; Eriksson, Jan
Author_Institution :
Dept. of Electr. Eng., Linkoping Univ., Sweden
fYear :
1993
fDate :
15-17 Dec 1993
Firstpage :
363
Abstract :
Methods from computer algebra, mostly so called Grobner bases (gb) from commutative algebra, are used to solve the algebraic Riccati equation (ARE) symbolically. The methods suggested allow us to track the influence of parameters in the system or penalty matrices on the solution. Some nontrivial aspects arise when addressing the problem from the point of view commutative algebra, for example the original equations are rational, not polynomial. We explain how this can be dealt with rather easily. Some methods for lowering the computational complexity are suggested and different methods are compared regarding efficiency. Preprocessing of the equations before applying gb can make computations more efficient
Keywords :
computational complexity; control system analysis; matrix algebra; symbol manipulation; ARE; Grobner bases; algebraic Riccati equation; commutative algebra; computational complexity; computer algebra; penalty matrices; symbolic algebra; Algebra; Computational complexity; Computational geometry; Mathematics; Nonlinear equations; Optimal control; Polynomials; Riccati equations; Terminology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Decision and Control, 1993., Proceedings of the 32nd IEEE Conference on
Conference_Location :
San Antonio, TX
Print_ISBN :
0-7803-1298-8
Type :
conf
DOI :
10.1109/CDC.1993.325129
Filename :
325129
Link To Document :
بازگشت