Details:
| Title | Automated Simplification and Deduction for Engineering Formulas | | Author(s) | John J. Wavrik | | Type | Technical Report, Misc | | Abstract | The commutative version of the Groebner Basis Algorithm has become one of the most powerful tools in computer algebra. The recent adaptation of the algorithm to noncommuting variables has potential applications to matrix and operator expressions. A Forth-based research system was used to implement and study applications of a noncommutative variant of the Groebner Basis Algorithm. It has been used in automated simplification and deduction for formulas in engineering. The paper will discuss this work and the use of Forth in producing systems for mathematics research. | | Length | 15 |
| Language | English | | Year | 2005 | | Edition | 0 | | Translation |
No | | Refereed |
No |
|
