Algebraic Condition for Decomposition of Large-Scale Linear Dynamic Systems
From MaRDI portal
Recommendations
Cites work
- Decomposition of algebraic functions
- Decreasing the nesting depth of expressions involving square roots
- Functional decomposition of polynomials: the tame case
- Giesbrecht's algorithm, the HFE cryptosystem and Ore's p^s-polynomials
- scientific article; zbMATH DE number 4093248 (Why is no real title available?)
- scientific article; zbMATH DE number 1279024 (Why is no real title available?)
- scientific article; zbMATH DE number 3090981 (Why is no real title available?)
- Polynomial decomposition algorithms
Cited in
(3)
This page was built for publication: Algebraic Condition for Decomposition of Large-Scale Linear Dynamic Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392517)