Breuer's grow factor algorithm in computer algebra

Authors:
J. A. van Hulzen
Affiliations:
-
Venue:
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Year:
1981

Citing 12
Cited 4

Code Generation for Expressions with Common Subexpressions

Journal of the ACM (JACM)
Variations on the Common Subexpression Problem

Journal of the ACM (JACM)
Automatic Error Analysis Using Computer Algebraic Manipulation

ACM Transactions on Mathematical Software (TOMS)
Automatic Differentiation of Computer Programs

ACM Transactions on Mathematical Software (TOMS)
Algebraic simplification: a guide for the perplexed

Communications of the ACM
Generation of optimal code for expressions via factorization

Communications of the ACM
Experience with FORMAC algorithm design

Communications of the ACM
The theory of parsing, translation, and compiling

The theory of parsing, translation, and compiling
Symbolic-Numeric Interface: a review (in absentia)

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Solving systems of polynomial equations with floating-point coefficients

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
REDUCE 2: A system and language for algebraic manipulation

SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
A cancellation free algorithm, with factoring capabilities, for the efficient solution of large sparse sets of equations

SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation

A code optimization package for REDUCE

ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
A cancellation free algorithm, with factoring capabilities, for the efficient solution of large sparse sets of equations

SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
NETFORM and code optimizer manual

ACM SIGSAM Bulletin
An expression analysis package for REDUCE

ACM SIGSAM Bulletin

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.