Order Reduction of General Nonlinear DAE Systems by Automatic Tearing

Mathematical and Computer Modelling of Dynamical Systems

Volumn 6, Issue 2, 2000, Pages 145-168

  Carpanzano, Emanuele ^a  

^a POLITECNICO DI MILANO   (Italy)

Author keywords

Graph theory; Model reduction; Multibody systems; Nonlinear DAE systems; Object oriented modelling

Indexed keywords

EID: 0034409458     PISSN: 13873954     EISSN: None     Source Type: Journal    
DOI: 10.1076/1387-3954(200006)6:2;1-M;FT145     Document Type: Article

References (19)

1. Carpanzano, E. and Formenti, F.: Symbolic Manipulation of DAE Systems. Thesis. Politecnico di Milano, April 1995.
2. Carpanzano, E. and Formenti, F.: Solution of Symbolic Linear Systems in Omsim using Cramer's Rule. Internal report, number ISRN LUTFD2/TFRT-7524-SE, Department of Automatic Control, Lund Institute of Technology, October 1994.
3. Carpanzano, E. and Girelli, R.: The Tearing Problem: Definition, Algorithm and Application to Generate Efficient Computational Code from DAE Systems. 2nd MATH-MOD, IMACS Symposium on MATHEMATICAL MODELLING, Technical University Vienna, Austria. February 5-7, 1997, pp. 1039-1046.
4. Cellier, F.E. and Elmqvist, H.: Automated Formula Manipulation Supports Object-Oriented Continuous System Modelling. IEEE Control System, April 1993, pp. 28-38.
5. Cheung, L.K. and Kuh, E.S.: The Bordered Triangular Matrix and Minimum Essential Sets of a Digraph. IEEE Transactions on Circuits and Systems, vol. cas.-21, number 5, September 1974, pp. 633-639.
6. Duff, I.S., Erisman, A.M. and Reid, J.: Direct Methods for Sparse Matrices. Clarendon Press, Oxford, 1986, pp. 252-260.
7. Elmqvist, H. and Otter, M.: Methods for Tearing Systems of Equations in Object-Oriented Modelling. Proceedings of the Conference on Modelling and Simulation, eds. Guasch and Huber, 1994, pp. 326-332.
8. Even, G., Naor, J., Schieber, B. and Sudan, M.:Approximating Feedback Sets and Multi Cuts in Directed Graphs. IPCO, 1995, pp. 14-28.
9. Ferretti G.: Systematic Dynamic Modelling of Mechanical Systems Containing Kinematic Loops. MMoS, vol. 2, number 3, September 1996, pp. 212-235.
10. Garey, M.R. and Johnson, D.S.: Computers and Intractability. A guide to the Theory of NP-completeness. W.H. Freeman and Company, San Francisco, 1979.
11. Hassin, R. and Rubinstein, S.: Approximations for the Maximum Acyclic Subgraph Problem. Information Processing Letters 51, 1994, pp. 133-140.
12. Kaas, R.: A Branch and Bound Algorithm for the Acyclic Subgraph Problem. European Journal of Operational Research 8, 1981, pp. 355-362.
13. Karp, R.M.: Reducibility among Combinatorial Problems, in R.E. Miller and J.W. Thatcher, Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85-104.
14. Maffezzoni, C. and Girelli, R.: MOSES: modular modelling in an Object-Oriented database. To appear in MMoS, 1998.
15. Maffezzoni, C., Girelli, R. and Lluka, P.: Generating Efficient Computational Procedures from Declarative Models. Simulation Practice and Theory 4, 1996, pp. 303-317.
16. Mah, R.S.: Chemical Process Structures and Information Flow. Butterworths Series in Chemical Engineering, 1993, pp. 151-180.
17. Mattsson, S.E., Andersson, M. and Aström, K.J.: Object-Oriented Modelling and Simulation. In Linkens D.A., editor, CAD for Control Systems. Marcel Decker, 1993, pp. 56-66.
18. Otter, M., Elmqvist, H. and Cellier, F.E.: "Relaxing" - A Symbolic Sparse Matrix Method Exploiting the Model Structure in Generating Efficient Simulation Code. Proc. Symposium on Modelling, Analysis, and Simulation, CESA'96, IMACS MultiConference on Computational Engineering in Systems Applications, Lille, France, 1996, vol. 1, pp. 1-12.
19. Tarjan, R.E.: Depth-First Search and Linear Graph Algorithms. SIAM J. Computing, vol. 1, number 2, June 1972, pp. 146-160.