返回
Singularly perturbed control systems using non-commutative computer algebra
DOI:10.1002/1099-1239(200009/10)10:11/12<983::AID-RNC535>3.0.CO;2-#.png)
摘要
En 中文
Most algebraic calculations which one sees in linear systems theory, for example in IEEE TAG, involve block matrices and so are highly non-commutative. Thus conventional commutative computer algebra packages, as in Mathematica and Maple, do not address them. Here we investigate the usefulness of non-commutative computer algebra in a particular area of control theory-singularly perturbed dynamic systems-where working with the non-commutative polynomials involved is especially tedious. Our conclusion is that they have considerable potential for helping practitioners with such computations. Commutative Grobner basis algorithms are powerful and make up the engines in symbolic algebra packages' Solve commands. Non-commutative Grobner basis algorithms are more recent, but we shall see that they, together with an algorithm for removing redundant equations, are useful in manipulating the messy sets of non-commutative polynomial equations which arise in singular perturbation calculations. We use the non-commutative algebra package NCAlgebra and the non-commutative Grobner basis package NCGB which runs under it on two different problems. We illustrate the method on the classical state feedback optimal control problem, see [1], where we obtain one more (very long) term than was done previously. Then we use it to derive singular perturbation expansions for the relatively new (linear) information state equation. Copyright (C) 2000 John Wiley & Sons, Ltd.
Keyword:
non-commutative algebra
computer algebra
dynamic control
singular perturbation
control systems
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.2
论文数:
7.0K
被引数:
1.4W
机构
暂无机构信息

