Published in Proceedings of the 35th Conference on Decision and Control, Kobe, Japan, December 11, 1996, pages 4412-4418.
Copyright © 1996 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. The definitive version is available at http://dx.doi.org/10.1109/CDC.1996.577487.
NOTE: At the time of publication, the author Mark Stankus was not yet affiliated with Cal Poly.
[HSWcdc94] focused on procedures for simplifying complicated expressions automatically. [HScdc95] turned to the adventurous pursuit of developing a highly computer assisted method for “discovering” certain types of formulas and theorems.
It is often the case that some variables in the formulation of a problem are not the natural “coordinates” for solution of the problem. Gröbner Basis Algorithms, which lie at the core of our method, are very good at eliminating unknowns, but have no way of finding good changes of variables. This paper gives a way of incorporating changes of variables into our method.
As an example, we “discover” the DGKF equations of H∞ control.