DocumentCode
294417
Title
Computer assistance in discovering formulas and theorems in system engineering
Author
Helton, J. William ; Stankus, Mark
Author_Institution
Dept. of Math., California Univ., San Diego, La Jolla, CA, USA
Volume
1
fYear
1995
fDate
13-15 Dec 1995
Firstpage
303
Abstract
We deal with a highly computer assisted method for discovering certain types of theorems. At the beginning of discovering a theorem, an engineering problem is often presented as a large system of matrix equations. The point is to isolate and to minimize what the user must do by running heavy algorithms. Often when viewing the output of the algorithm, one can see what additional hypothesis should be added to produce a useful theorem and what the relevant matrix quantities are. Rather than using the word algorithm, we call our method a strategy since it allows for modest human intervention. We are under the impression that many theorems in engineering systems might be derivable in this way. The approach we use to manipulate large collections of equations is based largely on a noncommutative Grobner basis algorithm (GBA), and the program we use is based upon a GBA, called NCProcess
Keywords
engineering computing; heuristic programming; mathematics; mathematics computing; spreadsheet programs; systems engineering; NCProcess; engineering systems; noncommutative Grobner basis algorithm; system engineering; theorem discovering; Algebra; Basis algorithms; Control systems; Equations; Humans; Linear systems; Mathematics; Packaging; Systems engineering and theory;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 1995., Proceedings of the 34th IEEE Conference on
Conference_Location
New Orleans, LA
ISSN
0191-2216
Print_ISBN
0-7803-2685-7
Type
conf
DOI
10.1109/CDC.1995.478746
Filename
478746
Link To Document