A new algebra core for the minimal form' problem
Abstract
The demands of largescale algebraic computation have led to the development of many new algorithms for manipulating algebraic objects in computer algebra systems. For instance, parallel versions of many important algorithms have been discovered. Simultaneously, more effective symbolic representations of algebraic objects have been sought. Also, while some clever techniques have been found for improving the speed of the algebraic simplification process, little attention has been given to the issue of restructuring expressions, or transforming them into minimal forms.'' By minimal form,'' we mean that form of an expression that involves a minimum number of operations. In a companion paper, we introduce some new algorithms that are very effective at finding minimal forms of expressions. These algorithms require algebraic and combinatorial machinery that is not readily available in most algebra systems. In this paper we describe a new algebra core that begins to provide the necessary capabilities.
 Authors:
 (Institute for Defense Analyses, Princeton, NJ (United States). Center for Communications Research)
 (Lawrence Livermore National Lab., CA (United States))
 Publication Date:
 Research Org.:
 Lawrence Livermore National Lab., CA (United States)
 Sponsoring Org.:
 USDOE; USDOE, Washington, DC (United States)
 OSTI Identifier:
 5254684
 Report Number(s):
 UCRLJC109226; CONF9207604
ON: DE92011966
 DOE Contract Number:
 W7405ENG48
 Resource Type:
 Conference
 Resource Relation:
 Conference: International symposium on symbolic and algebraic computation, Berkeley, CA (United States), 2729 Jul 1992
 Country of Publication:
 United States
 Language:
 English
 Subject:
 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; PROGRAMMING; ALGEBRA; ALGORITHMS; PARALLEL PROCESSING; MATHEMATICAL LOGIC; MATHEMATICS; 990200*  Mathematics & Computers
Citation Formats
Purtill, M.R., Oliveira, J.S., and Cook, G.O. Jr. A new algebra core for the minimal form' problem. United States: N. p., 1991.
Web.
Purtill, M.R., Oliveira, J.S., & Cook, G.O. Jr. A new algebra core for the minimal form' problem. United States.
Purtill, M.R., Oliveira, J.S., and Cook, G.O. Jr. Fri .
"A new algebra core for the minimal form' problem". United States.
doi:.
@article{osti_5254684,
title = {A new algebra core for the minimal form' problem},
author = {Purtill, M.R. and Oliveira, J.S. and Cook, G.O. Jr.},
abstractNote = {The demands of largescale algebraic computation have led to the development of many new algorithms for manipulating algebraic objects in computer algebra systems. For instance, parallel versions of many important algorithms have been discovered. Simultaneously, more effective symbolic representations of algebraic objects have been sought. Also, while some clever techniques have been found for improving the speed of the algebraic simplification process, little attention has been given to the issue of restructuring expressions, or transforming them into minimal forms.'' By minimal form,'' we mean that form of an expression that involves a minimum number of operations. In a companion paper, we introduce some new algorithms that are very effective at finding minimal forms of expressions. These algorithms require algebraic and combinatorial machinery that is not readily available in most algebra systems. In this paper we describe a new algebra core that begins to provide the necessary capabilities.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Fri Dec 20 00:00:00 EST 1991},
month = {Fri Dec 20 00:00:00 EST 1991}
}

The demands of largescale algebraic computation have led to the development of many new algorithms for manipulating algebraic objects in computer algebra systems. For instance, parallel versions of many important algorithms have been discovered. Simultaneously, more effective symbolic representations of algebraic objects have been sought. Also, while some clever techniques have been found for improving the speed of the algebraic simplification process, little attention has been given to the issue of restructuring expressions, or transforming them into ``minimal forms.`` By ``minimal form,`` we mean that form of an expression that involves a minimum number of operations. In a companion paper,more »

New algorithms for the minimal form'' problem
It is widely appreciated that largescale algebraic computation (performing computer algebra operations on large symbolic expressions) places very significant demands upon existing computer algebra systems. Because of this, parallel versions of many important algorithms have been successfully sought, and clever techniques have been found for improving the speed of the algebraic simplification process. In addition, some attention has been given to the issue of restructuring large expressions, or transforming them into minimal forms.'' By minimal form,'' we mean that form of an expression that involves a minimum number of operations in the sense that no simple transformation on the expressionmore » 
New algorithms for the ``minimal form`` problem
It is widely appreciated that largescale algebraic computation (performing computer algebra operations on large symbolic expressions) places very significant demands upon existing computer algebra systems. Because of this, parallel versions of many important algorithms have been successfully sought, and clever techniques have been found for improving the speed of the algebraic simplification process. In addition, some attention has been given to the issue of restructuring large expressions, or transforming them into ``minimal forms.`` By ``minimal form,`` we mean that form of an expression that involves a minimum number of operations in the sense that no simple transformation on the expressionmore » 
An extended flowbased formulation for the capacitated minimal spanning tree problem
The capacitated minimal spanning tree problem (CMST) is directly related to network design and appears as an important problem, e.g., in the design of local access networks. Previous results with a multicommodity flow formulation indicate that {open_quotes}information{close_quotes} used from a related hop model might be used to design stronger formulations for the CMST. In this talk we present several formulations for the CMST which involve arc variables with a hop index which counts the number of arcs between the root and the corresponding arc. We present an extended singlecommodity flow formulation and use previous results to transform the original formulationmore » 
The design of a parallel, dense linear algebra software library: Reduction to Hessenberg, tridiagonal, and bidiagonal form
This paper discusses issues in the design of ScaLAPACK, a software library for performing dense linear algebra computations on distributed memory concurrent computers. These issues are illustrated using the ScaLAPACK routines for reducing matrices to Hessenberg, tridiagonal, and bidiagonal forms. These routines are important in the solution of eigenproblems. The paper focuses on how building blocks are used to create higherlevel library routines. Results are presented that demonstrate the scalability of the reduction routines. The most commonlyused building blocks used in ScaLAPACK are the sequential BLAS, the Parallel Block BLAS (PBBLAS) and the Basic Linear Algebra Communication Subprograms (BLACS). Eachmore »