Breuer's grow factor algorithm in computer algebra
J. A. van Hulzen · ACM Symposium on Symbolic and Algebraic Computation (SYMSAC) · 1981
Computer algebra can be of importance in solving electrical network synthesis problems. It enables to generate automatically FORTRAN-programs needed to solve the underlying systems of nonlinear multivariate polynomial equations. Such systems are obtained by equating the numerical target function and a symbolically computed equivalent. Breuer's grow factor algorithm is extended not only to eventually improve the result of required determinant calculations, but also to optimize FORTRAN-code describing the system and the associated Jacobian. It is indicated how this common subexpression search approach can be extended.
Cited by 15 works. doi:10.1145/800206.806377
Authors
References
- An empirical study of FORTRAN programs
- Variations on the Common Subexpression Problem
- Code Generation for Expressions with Common Subexpressions
- Algebraic simplification
- REDUCE 2
- Computer design of linear frequency selective networks
- Automatic Differentiation of Computer Programs
- Generation of optimal code for expressions via factorization
- Symbolic-numeric interface: A review
- The problem of substitution