scientific article; zbMATH DE number 1252488
From MaRDI portal
Publication:4229394
Cited in
(20)- System theoretic based characterisation and computation of the least common multiple of a set of polynomials.
- Quantified constraints under perturbation
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
- Structured matrix methods computing the greatest common divisor of polynomials
- Input-output linearization of nonlinear systems using multivariable Legendre polynomials
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
- Computer symbolic transformations in control problems
- NLSOFT: an interactive graphical software for designing nonlinear controllers
- Symbolic control design of incrementally stable nonlinear systems with dynamic regular language specifications
- Numerical and symbolical methods for the GCD of several polynomials
- Controller design for nonlinear multi-input – multi-output systems based on an algorithmic plant description
- Symbolic expression of transfer functions in compartmental systems with control
- Design of Symbolic Controllers for Networked Control Systems
- Special issue on the use of computer algebra systems for computer aided control system design
- Parametric optimization and optimal control using algebraic geometry methods
- Designing control systems using exact and symbolic manipulations of formulae
- Sensitivity bond graphs
- Symbolic models for control systems
- Symbolic computation application for the design of linear multivariable control systems
- The ERES method for computing the approximate GCD of several polynomials
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229394)
