Abstract
A number of recently developed recursive minor expansion algorithms is presented. A recursion count with respect to the recursion depth shows the behaviour of the algorithms under various typical conditions.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M.L. Griss, The algebraīc solution of sparse linear systems via minor expansion. University of Utah, Computational Physics Group, Report no UCP-32, Oct. 1975.
P.S. Wang, On the expansion of sparse symbolic determinants. Proc. Hawaii International Conference on System Sciences, Honolulu (1977), pp. 173.
J. Smit, The efficient calculation of symbolic determinants. Proc. 1976 ACM Symposium on symbolic and algebraïc computations, pp. 105–113.
J. Smith, An efficient factoring symbolic determinant expansion algorithm. To be published.
A.C. Hearn, Reduce 2, users manual. University of Utah, Salt Lake City, Utah 84112, U.S.A.
J. Smit, NETFORM, users manual. Twente University of Technology, Department of Electrical Engineering, P.O.Box 127, 7500 AE Enschede, The Netherlands.
J.L. Herrero and G. Willoner, Synthesis of filters. Prentice-Hall, Englewood Cliffs, New Jersey.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smit, J. (1979). New recursive minor expansion algorithms, a presentation in a comparative context. In: Ng, E.W. (eds) Symbolic and Algebraic Computation. EUROSAM 1979. Lecture Notes in Computer Science, vol 72. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09519-5_61
Download citation
DOI: https://doi.org/10.1007/3-540-09519-5_61
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09519-4
Online ISBN: 978-3-540-35128-3
eBook Packages: Springer Book Archive