New recursive minor expansion algorithms, a presentation in a comparative context

3. Motices And Equations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 72)


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.


Matrix Entry Expansion Algorithm Ladder Network Recursion Depth Numerical Minor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    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.Google Scholar
  2. [2]
    P.S. Wang, On the expansion of sparse symbolic determinants. Proc. Hawaii International Conference on System Sciences, Honolulu (1977), pp. 173.Google Scholar
  3. [3]
    J. Smit, The efficient calculation of symbolic determinants. Proc. 1976 ACM Symposium on symbolic and algebraïc computations, pp. 105–113.Google Scholar
  4. [4]
    J. Smith, An efficient factoring symbolic determinant expansion algorithm. To be published.Google Scholar
  5. [5]
    A.C. Hearn, Reduce 2, users manual. University of Utah, Salt Lake City, Utah 84112, U.S.A.Google Scholar
  6. [6]
    J. Smit, NETFORM, users manual. Twente University of Technology, Department of Electrical Engineering, P.O.Box 127, 7500 AE Enschede, The Netherlands.Google Scholar
  7. [7]
    J.L. Herrero and G. Willoner, Synthesis of filters. Prentice-Hall, Englewood Cliffs, New Jersey.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • J. Smit
    • 1
  1. 1.Department of Electrical EngineeringTwente University of TechnologyEnschedeThe Netherlands

Personalised recommendations