Abstract
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.
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
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).
B.A. Care, Solutions of load-flow problems by partitioning systems into trees, IEEE Trans, on Power Apparatus and Systems, (1968).
L. Himmelblau (ed.), “Decomposition of Large Scale Problems”, North Holland, Amsterdam, (1972).
L.S. Lasdon, “Optimization Theory for Large Systems”, MacMillan, London, (1970).
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.
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.
D.F. Robinson and L.R. Foulds, “Digraphs, Theory and Techniques”, Gordon and Breach, New York.
M.E. Seser and D.D. Siljak, Nested e-decompositions of complex systems, Proceedings of the 9th IFAC Congress, Budapest, Hungary, (1984).
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.
M.G. Singh, A.Y. Allidina and K. Malinowski, Hierarchical simulation techniques, Proc. of MECO 83, Athens, Greece, (1985).
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.
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).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Plenum Press, New York
About this chapter
Cite this chapter
Lei, S., Allidina, A.Y., Malinowski, K. (1986). Clustering Technique for Rearranging ODE Systems. In: Singh, M.G., Allidina, A.Y., Daniels, B.K. (eds) Parallel Processing Techniques for Simulation. Applied Information Technology. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-5218-1_3
Download citation
DOI: https://doi.org/10.1007/978-1-4684-5218-1_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-5220-4
Online ISBN: 978-1-4684-5218-1
eBook Packages: Springer Book Archive