Abstract
We describe a method for managing large expressions in symbolic computations which combines a hierarchical representation with signature calculations. As a case study, the problem of factoring matrices with non-polynomial entries is studied. Gaussian Elimination is used. Results on the complexity of the approach together with benchmark calculations are given.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Schwartz, J.T.: Fast Probabilistic Algorithms for Verification of Polynomial Identities. J. ACM 27(4), 701–717 (1980)
Zippel, R.: Probabilistic Algorithms for Sparse Polynomials. In: Ng, K.W. (ed.) EUROSAM 1979 and ISSAC 1979. LNCS, vol. 72, pp. 216–226. Springer, Heidelberg (1979)
Gonnet, G.H.: Determining Equivalence of Expressions in Random Polynomial Time. In: Proc. of ACM on Theory of computing, pp. 334–341 (1984) (extended abstract)
Gonnet, G.H.: New results for random determination of equivalence of expressions. In: Proc. of ACM on Symbolic and algebraic comp., pp. 127–131 (1986)
Monagan, M.B.: Signatures + Abstract Types = Computer Algebra − Intermediate Expression Swell. PhD Thesis, University of Waterloo (1990)
Monagan, M.B.: Gauss: a Parameterized Domain of Computation System with Support for Signature Functions. In: Miola, A. (ed.) DISCO 1993. LNCS, vol. 722, pp. 81–94. Springer, Heidelberg (1993)
Freeman, T.S., Imirzian, G., Kaltofen, E., Yagati, L.: DAGWOOD: A system for manipulating polynomials given by straight-line programs. ACM Trans. Math. Software 14(3), 218–240 (1988)
Corless, R.M., Jeffrey, D.J., Monagan, M.B., Pratibha: Two Perturbation Calculation in Fluid Mechanics Using Large-Expression Management. J. Symbolic Computation 11, 1–17 (1996)
Zippel, R.: Effective Polynomial computation. Kluwer, Dordrecht (1993)
Kaltofen, E.: Greatest Common Divisors of Polynomials Given by Straight-Line Programs. J. of the Association for Computing Machinery 35(1), 231–264 (1988)
Giusti, M., Hägele, K., Lecerf, G., Marchand, J., Salvy, B.: The projective Noether Maple package: computing the dimension of a projective variety. J. Symbolic Computation 30(3), 291–307 (2000)
Kaltofen, E.: Computing with polynomials given by straight-line programs I: greatest common divisors. In: Proceedings of ACM on Theory of computing, pp. 131–142 (1985)
Monagan, M.B., Gonnet, G.H.: Signature Functions for Algebraic Numbers. In: ISSAC, pp. 291–296 (1994)
Monagan, M.B., Monagan, G.: A toolbox for program manipulation and efficient code generation with an application to a problem in computer vision. In: ISSAC, pp. 257–264 (1997)
Sasaki, T., Murao, H.: Efficient Gaussian elimination method for symbolic determinants and linear systems (Extended Abstract). In: ISSAC, pp. 155–159 (1981)
Nicholson, W.K.: Linear Algebra with Applications, 4th edn. McGraw-Hill Ryerson, New York (2003)
Bareiss, E.H.: Sylvester’s Identity and Multistep Integer-Preserving Gaussian Elimination. Mathematics of Computation 22(103), 565–578 (1968)
Bareiss, E.H.: Computational Solutions of Matrix Problems Over an Integral Domain. J. Inst. Maths Applics. 10, 68–104 (1972)
Heintz, J., Schnorr, C.P.: Testing polynomials which are easy to compute (Extended Abstract). In: Proceedings of ACM on Theory of computing, pp. 262–272 (1980)
Martin, W.A.: Determining the equivalence of algebraic expressions by hash coding. In: Proceedings of ACM on symbolic and algebraic manipulation, pp. 305–310 (1971)
Ibarra, O.H., Leininger, B.S.: On the Simplification and Equivalence Problems for Straight-Line Programs. J. ACM 30(3), 641–656 (1983)
Ibarra, O.H., Moran, S.: Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs. J. ACM 30(1), 217–228 (1983)
Ibarra, O.H., Moran, S., Rosier, L.E.: Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems. Infor. Proc. Lett. 12(5), 227–232 (1981)
Shoup, V.: A Computational Introduction to Number Theory and Algebra. Cambridge University Press, Cambridge (2005)
Kaltofen, E.: On computing determinants of matrices without divisions. In: ISSAC, pp. 342–349 (1992)
von zur, G.J., Gerhard, J.: Modern computer algebra. Cambridge University Press, Cambridge (1999)
Carette, J.: Understanding Expression Simplification. In: ISSAC, pp. 72–79 (2004)
Carette, J., Kiselyov, O.: Multi-stage Programming with Functors and Monads: Eliminating Abstraction Overhead from Generic Code. In: Glück, R., Lowry, M. (eds.) GPCE 2005. LNCS, vol. 3676, pp. 256–274. Springer, Heidelberg (2005)
Steinberg, S., Roach, P.: Symbolic manipulation and computational fluid dynamics. Journal of Computational Physics 57, 251–284 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, W., Carette, J., Jeffrey, D.J., Monagan, M.B. (2006). Hierarchical Representations with Signatures for Large Expression Management. In: Calmet, J., Ida, T., Wang, D. (eds) Artificial Intelligence and Symbolic Computation. AISC 2006. Lecture Notes in Computer Science(), vol 4120. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11856290_22
Download citation
DOI: https://doi.org/10.1007/11856290_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39728-1
Online ISBN: 978-3-540-39730-4
eBook Packages: Computer ScienceComputer Science (R0)