Computer algebra tailored to matrix inequalities in control
J. William Helton, Maurı́cio C. de Oliveira
Abstract
J. William Helton, Maurı́cio C. de Oliveira
Abstract
A major advance in linear systems theory has been a formalism for converting systems problems to matrix inequalities. We describe computer algebra algorithms, methodology, and implementation which allows users to convert many systems problems to linear matrix inequalities. We focus on computer algebra methodology which can assist with the well known change of variables method for producing LMIs introduced by Scherer, Gahinet and Chilali.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A major advance in linear systems theory has been a formalism for converting systems problems to matrix inequalities. We describe computer algebra algorithms, methodology, and implementation which allows users to convert many systems problems to linear matrix inequalities. We focus on computer algebra methodology which can assist with the well known change of variables method for producing LMIs introduced by Scherer, Gahinet and Chilali.
Key concepts: Algebra over a field, Linear algebra, Matrix algebra, Formalism (music), Computer science, Numerical linear algebra, Focus (optics), Symbolic computation