Computer simplification of formulas in linear systems theory
From MaRDI portal
Recommendations
Cited in
(22)- Computer assistance for ``discovering formulas in system engineering and operator theory
- Rewrite rules and simplification of matrix expressions
- Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra
- Formally verifying proofs for algebraic identities of matrices
- 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
- Singularly perturbed control systems using non-commutative computer algebra
- A package for generic noncommutative matrices
- scientific article; zbMATH DE number 705057 (Why is no real title available?)
- 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
- On Microcomputer-Based Simulation of Linear Multivariable Systems
- Certifying operator identities via noncommutative Gröbner bases
- Simplifications of Uniform Expressions Specified by Systems
- How to Automatise Proofs of Operator Statements: Moore–Penrose Inverse; A Case Study
- \textsf{f4ncgb}: high performance Gröbner basis computations in free algebras
- Universal truth of operator statements via ideal membership
- Modular algorithms for computing Gröbner bases in free algebras
This page was built for publication: Computer simplification of formulas in linear systems theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4396062)
