Martin L. Griss
ABSTRACT
This paper discusses some of the problems encountered during the solution of a large system of sparse linear equations with algebraic coefficients, using REDUCE 2. Of particular importance is intermediate expression swell, which ultimately uses up all the available storage, and produces voluminous unreadable output. By optimally ordering the equations (optimal pivoting algorithms), and decomposing the intermediate expressions, so as to share common sub-expressions (“hash coded CONS”), a considerable saving in storage is achieved. By suitably renaming frequently used common sub-expressions, using the table built up above, and outputting these first, followed by the more complex expressions, a simplification in the output occurs. These techniques are general, and may be useful in any problem with large expressions to store and output.
- 1.HUBBELL, S.P., University of Michigan. (Private Communication)Google Scholar
- 2.HEARN, A.C., REDUCE 2 User's Manual, Second Edition, University of Utah Computational Physics Group Report No. UCP-19, March 1973Google Scholar
- 3.BAREISS,E.H, "Sylvester's Identity and Multi-step Integer-Preserving Gaussian Elimination", MATH. COMP. 22 (1968),565-578. 3a. LIPSON, J.D.,"Symbolic Methods for the Solution of Linear Equations with applications to Flowgraphs", Proceedings of the 1968 Summer Institute of Symbolic Computation, IBM Programming Laboratory Report No. FSC 69-0312(1969)Google Scholar
- 4.McCLELLAN, M.T., "A Comparison of Algorithms for the Exact Solution of Linear Equations", University of Maryland Technical Report No. TR-290 (1974)Google Scholar
- 5.TEWARSON, R P., "Sparse Matrices", Vol. 99 of Mathematics in Science and Engineering, Academic Press, 1973Google Scholar
- 6.MOSES, J., "Solution of Systems of Polynomial Equations by Elimination", CACM 9 (1966),634-6376a. HOROWlTZ,E., "The Application of Symbolic Mathematics to a Singular Perturbation Problem", Proc. ACM72, Boston(1972) 816-825. Google ScholarDigital Library
- 7.HEARN, A.C., "REDUCE 2: A System and Language for Algebraic Manipulation", Proceedings of the Second Symposium on Symbolic and Algebraic Manipulation, ACM, New York (1971) 128-133 Google ScholarDigital Library
- 8.. TOBEY, R.G., "Experience with FORMAC Algorithm Design", CACM 9 (1966),589-597 Google ScholarDigital Library
- 9.GRANT, J., UCLA,(private communication)Google Scholar
- 10.HEARN, A.C., (Private communication)Google Scholar
- 11.GENTLEMAN, W.M., "On the Evaluation of Symbolic Determinants", University of Waterloo Preprint (1972). 11a. HOROWITZ,E. and S. SAHNI, "On Computing the Exact Determinant of Matrices with Polynomial Entries", Cornell Tech. Report No. 5-72,(to appear in J.ACM).Google Scholar
- 12.GRISS, M.L., "The Output of Large Expressions in REDUCE", University of Utah Computational Physics Group Operating Note No. 14,(June 1974).Google Scholar
Index Terms
- The algebraic solution of large sparse systems of linear equations using REDUCE 2
Recommendations
Solution of Sparse Underdetermined Systems of Linear Equations
The problem of computing the minimum-norm solution to a sparse, underdetermined system of linear equations is considered. An algorithm is developed which is based on orthogonal factorization. The algorithm is generalized to cope with systems which are ...
On Asymptotics in Case of Linear Index-2 Differential-Algebraic Equations
Asymptotic properties of solutions of general linear differential-algebraic equations (DAEs) and those of their numerical counterparts are discussed. New results on the asymptotic stability in the sense of Lyapunov as well as on contractive index-2 DAEs ...
On the numerical solution of differential-algebraic equations with index-2
In this paper, numerical solution of differential-algebraic equations (DAEs) with index-2 is considered. An index reduction for DAE with index-2 is suggested. First index-2 system is reduced to index-1 system. Then we have applied the method for solving ...
Comments