Computer simplification of formulas in linear systems theory
From MaRDI portal
Publication:4396062
DOI10.1109/9.661584zbMath0919.93029OpenAlexW2138135391MaRDI 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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra ⋮ Algorithmic operator algebras via normal forms in tensor rings ⋮ Computing elements of certain form in ideals to prove properties of operators ⋮ Formal proofs of operator identities by a single formal computation ⋮ A new symbolic method for solving linear two-point boundary value problems on the level of operators ⋮ Algebraic proof methods for identities of matrices and operators: improvements of Hartwig's triple reverse order law ⋮ Designing control systems using exact and symbolic manipulations of formulae ⋮ Solving Linear Boundary Value Problems Via Non-commutative Gröbner Bases ⋮ Model of time-varying linear systems and Kolmogorov equations ⋮ Computer assistance for ``discovering formulas in system engineering and operator theory
Uses Software
This page was built for publication: Computer simplification of formulas in linear systems theory
