Towards a computer algebraic algorithm for flat output determination
DOI10.1145/1390768.1390773zbMATH Open1487.93005OpenAlexW1968450648MaRDI QIDQ5301595FDOQ5301595
Authors: Felix Anritter, Jean Lévine 
Publication date: 20 January 2009
Published in: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://hal-mines-paristech.archives-ouvertes.fr/hal-00575672/file/ISSAC08_FA_JL.pdf
Recommendations
- Output-sensitive algorithm for generating the flats of a matroid
- scientific article; zbMATH DE number 493123
- Characterization of flat outputs of switched linear discrete-time systems: algebraic condition and algorithm
- Flat output characterization for linear systems using polynomial matrices.
- Algorithmic computation of flattenings and of modular deformations
- scientific article; zbMATH DE number 4045090
- Flat Inputs: Theory and Applications
- Algorithms yield upper bounds in differential algebra
- Computing with an algebraic-perturbation variant of Barvinok's algorithm
- Algebraic simplification in computer algebra: an analysis of bottom-up algorithms
Symbolic computation and algebraic computation (68W30) Nonlinear ordinary differential equations and systems (34A34) Control problems involving ordinary differential equations (34H05) Software, source code, etc. for problems pertaining to systems and control theory (93-04) Algebraic methods (93B25)
Cited In (2)
This page was built for publication: Towards a computer algebraic algorithm for flat output determination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301595)
