Computing switching surfaces in optimal control based on triangular decomposition
From MaRDI portal
Recommendations
Cites work
- A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
- An elimination method for polynomial systems
- Basic principles of mechanical theorem proving in elementary geometries
- Characteristic set algorithms for equation solving in finite fields
- Computing triangular systems and regular systems
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
- Decomposing polynomial systems into simple systems
- scientific article; zbMATH DE number 4164173 (Why is no real title available?)
- scientific article; zbMATH DE number 3970886 (Why is no real title available?)
- scientific article; zbMATH DE number 1795751 (Why is no real title available?)
- scientific article; zbMATH DE number 3256013 (Why is no real title available?)
- On the computation of switching surfaces in optimal control: a Grobner basis approach
- Partial cylindrical algebraic decomposition for quantifier elimination
- Proximate time-optimal control of third-order servomechanisms
- Some Properties of Triangular Sets and Improvement Upon Algorithm CharSer
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
Cited in
(4)
This page was built for publication: Computing switching surfaces in optimal control based on triangular decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175452)