Clustering Technique for Rearranging ODE Systems

  • S. Lei
  • A. Y. Allidina
  • K. Malinowski
Part of the Applied Information Technology book series (AITE)


This report presents a technique which makes use of the concept of single and double connected clusters to rearrange a large system of ODEs into a ‘nearly’ block-diagonal form. The eventual aim is to partition the large system of ODEs into subsystems with few interactions between them. This is useful, for example, when employing parallel processing together with decomposition techniques for simulating large dynamic systems. Based on the analysis presented, an algorithm has been implemented which provides an automatic procedure for clustering system variables in a desired form.


Gaussian Elimination Automatic Procedure Connected Cluster Independent Subsystem Power Apparatus 
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.
    A.Y. Allidina, S. Lei and L. Wang, Hierarchical simulation techniques for ODE systems, Distributed Simulation 85, San Diego, USA. Simulation Series, vol. 15, No. 2 (A Society for Computer Simulation publication), (1985).Google Scholar
  2. 2.
    B.A. Care, Solutions of load-flow problems by partitioning systems into trees, IEEE Trans, on Power Apparatus and Systems, (1968).Google Scholar
  3. 3.
    L. Himmelblau (ed.), “Decomposition of Large Scale Problems”, North Holland, Amsterdam, (1972).Google Scholar
  4. 4.
    L.S. Lasdon, “Optimization Theory for Large Systems”, MacMillan, London, (1970).MATHGoogle Scholar
  5. 5.
    Malinowski, K., A.Y. Allidina, M.G. Singh and W. Crorlein, Decomposition-coordination techniques for parallel simulation -Part I, Control Systems Centre Report No. 599, UMIST. To appear in Journal of Large Scale Systems.Google Scholar
  6. 6.
    E.C. Ogbuobiri, M.F. Tinney, and J.W. Walker, Sparsity-directed decomposition for Gaussian elimination on matrices, IEEE Trans. on Power Apparatus and Systems, 141–150, vol. PAS-89, No. 1, January 1970.Google Scholar
  7. 7.
    D.F. Robinson and L.R. Foulds, “Digraphs, Theory and Techniques”, Gordon and Breach, New York.Google Scholar
  8. 8.
    M.E. Seser and D.D. Siljak, Nested e-decompositions of complex systems, Proceedings of the 9th IFAC Congress, Budapest, Hungary, (1984).Google Scholar
  9. 9.
    Siljak, D.D., V. Pichai and M.E. Seser, Graph-theoretic analysis of dynamic systems, Report DE-AC037ET29138–35, University of Santa Clara, Santa Clara, USA.Google Scholar
  10. 10.
    M.G. Singh, A.Y. Allidina and K. Malinowski, Hierarchical simulation techniques, Proc. of MECO 83, Athens, Greece, (1985).Google Scholar
  11. 11.
    M.G. Singh, A.Y. Allidina and K. Malinowski, Parallel simulation methods for dynamical systems: issues and challenges, Proc. of 2nd International Symposium on Systems Analysis and Simulation, Berlin, GDR, August 1985.Google Scholar
  12. 12.
    A. Vanelli and M. Vidyasagar, Three approximate solution techniques for the optimal K-decomposition problem, Proc. of the International Conference for Systems, Man and Cybernetics, Delhi, India, (1984).Google Scholar

Copyright information

© Plenum Press, New York 1986

Authors and Affiliations

  • S. Lei
    • 1
  • A. Y. Allidina
    • 1
  • K. Malinowski
    • 1
  1. 1.Control Systems CentreUniversity of Manchester Institute of Science and TechnologyManchesterUK

Personalised recommendations