Computer simplification of formulas in linear systems theory
From MaRDI portal
Publication:4396062
DOI10.1109/9.661584zbMath0919.93029MaRDI QIDQ4396062
J. William Helton, John J. Wavrik, Mark Stankus
Publication date: 23 August 1998
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://digitalcommons.calpoly.edu/cgi/viewcontent.cgi?article=1021&context=math_fac
68W30: Symbolic computation and algebraic computation
93C05: Linear systems in control theory
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
Related Items
Solving Linear Boundary Value Problems Via Non-commutative Gröbner Bases, Model of time-varying linear systems and Kolmogorov equations, Designing control systems using exact and symbolic manipulations of formulae, Computer assistance for ``discovering formulas in system engineering and operator theory, Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra, Formal proofs of operator identities by a single formal computation, Algebraic proof methods for identities of matrices and operators: improvements of Hartwig's triple reverse order law, Algorithmic operator algebras via normal forms in tensor rings, A new symbolic method for solving linear two-point boundary value problems on the level of operators, Computing elements of certain form in ideals to prove properties of operators
Uses Software
