Skip to main content

The decomposition of systems of procedures and algebraic equations

  • Conference paper
  • First Online:
Numerical Analysis

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 630))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 29.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 39.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baker, J.J. "A Note on Multiplying Boolean Matrices", Comm. ACM, 5, 102 (1962)

    Article  Google Scholar 

  2. Barkley, R.W., and Motard, R.L. "Decomposition of Nets", Chem. Eng. J., 3, 265–275 (1972)

    Article  Google Scholar 

  3. Christensen, J.H., and Rudd, D.F. "Structuring Design Computations", AIChE Journal, 15, 94–100 (1969)

    Article  Google Scholar 

  4. Cooper, D.C., and Whitfield, H. "ALP: AN Autocode List-Processing Language", The Computer Journal, 5, 28–32 (1962/3)

    Article  MATH  Google Scholar 

  5. Duff, I.S. "A Survey of Sparse Matrix Research", AERE Harwell Report CSS28 (1976)

    Google Scholar 

  6. Duff, I.S., and Reid, J.K. "An Implementation of Tarjan’s Algorithm for the Block Triangularization of a Matrix", AERE Harwell Report CSS29 (1976)

    Google Scholar 

  7. Edmonds, J. "Paths, Trees and Flowers", Can. J. Math., 17, 449–467 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  8. Edmonds, J., and Johnson, E.L. "Matching: A Well-Solved Class of Integer Linear Programs", in "Combinatorial Structures and Their Applications", pp 88–92, Gordon and Breach, New York (1970)

    Google Scholar 

  9. Garfinkel, R.S., and Nemhauser, G.L. "Integer Programming", J. Wiley and Sons, New York (1972)

    MATH  Google Scholar 

  10. Harary, F. "On the Consistency of Precedence Matrices", JACM, 7, 255–259 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  11. Harary, F. "A Graph Theoretic Approach to Matrix Inversion by Partitioning", Numer. Math. 4, 128–135 (1962a)

    Article  MathSciNet  MATH  Google Scholar 

  12. Harary, F. "The Determinant of the Adjacency Matrix of a Graph", SIAM Rev., 4, 202–210 (1962b)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hopcroft, J.E., and Karp, R.M. "An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs", SIAM J. Comput. 2(4), 225–231 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  14. Jackson, G.D.D. "Interactive Computing in Chemical Plant Design", Ph.D. Thesis, University of London (1976)

    Google Scholar 

  15. Lee, W., and Rudd, D.F. "On the Reordering of Recycle Calculations", AIChE Journal, 12(6), 1184–1190 (1966)

    Article  Google Scholar 

  16. Leigh, M.J. "A Computer Flowsheeting Programme Incorporating Algebraic Analysis of the Problem Structure", Ph.D. Thesis, University of London (1973)

    Google Scholar 

  17. Leigh, M.J., Jackson, G.D.D., and Sargent, R.W.H. "SPEED-UP, a Computer-Based System for the Design of Chemical Processes", CAD 74, Fiche 15 Rows D-E; Int. Conf. and Exhib. on Computers in Engineering and Building Design (1974)

    Google Scholar 

  18. Mah, R.S.H. "A Constructive Algorithm for Computing the Reachability Matrix", AIChE Journal, 20(6), 1227–8 (1974)

    Article  Google Scholar 

  19. Ortega, J.M., and Rheinboldt, W.C. "Iterative Solution of Nonlinear Equations in Several Variables", Academic Press, New York (1970)

    MATH  Google Scholar 

  20. Ponstein, J. "Self-Avoiding Paths and the Adjacency Matrix of a Graph", J. SIAM Appl. Math., 14(3), 600–609 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  21. Sargent, R.W.H., and Westerberg, A.W. "SPEED-UP in Chemical Engineering Design", Trans. Instn. Chem. Engrs., 42, 190–197 (1964)

    Google Scholar 

  22. Steward, D.V. "On an Approach to Techniques for the Analysis of the Structure of Large Systems of Equations", SIAM Rev., 4(4), 321–342 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  23. Steward, D.V. "Partitioning and Tearing Systems of Equations", J. SIAM Numer. Anal., B2(2), 345–365 (1965)

    MathSciNet  MATH  Google Scholar 

  24. Strodiot, J.J., and Toint, P.L. "An Algorithm for Finding a Minimum Essential Arc Set of a Directed Graph and its Application in Solving Nonlinear Systems of Equations", Report 76/5, Dept. Mathematique, Facultés Universitaires de Namur (1976)

    Google Scholar 

  25. Tarjan, R. "Depth-First Search and Linear Graph Algorithms", SIAM J. Comput., 1(2), 146–160 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  26. Upadhye, R.S., and E.A. Grens II. "Selection of Decompositions for Chemical Process Simulation", AIChE Journal, 21(1), 136–143 (1975)

    Article  Google Scholar 

  27. Warshall, S. "A Theorem on Boolean Matrices", JACM 9, 11–12 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  28. Westerberg, A.W., and Edie, F.C. Computer-Aided Design, Part 1, "Enhancing Convergence Properties by the Choice of Output Variable Assignments in the Solution of Sparse Equation Sets", Chem. Eng. J., 2, 9–16. Part 2, "An Approach to Convergence and Tearing in the Solution of Sparse Equation Sets", ibid., 17–24 (1971)

    Google Scholar 

Download references

Authors

Editor information

G. A. Watson

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag

About this paper

Cite this paper

Sargent, R.W.H. (1978). The decomposition of systems of procedures and algebraic equations. In: Watson, G.A. (eds) Numerical Analysis. Lecture Notes in Mathematics, vol 630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0067704

Download citation

  • DOI: https://doi.org/10.1007/BFb0067704

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08538-6

  • Online ISBN: 978-3-540-35972-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics