Order Reduction of General Nonlinear DAE Systems by Automatic Tearing
暂无分享,去创建一个
[1] H. Elmqvist,et al. Automated formula manipulation supports object-oriented continuous-system modeling , 1993, IEEE Control Systems.
[2] Refael Hassin,et al. Approximations for the Maximum Acyclic Subgraph Problem , 1994, Inf. Process. Lett..
[3] Claudio Maffezzoni,et al. Generating efficient computational procedures from declarative models , 1996, Simul. Pract. Theory.
[4] G. Ferrett. Systematic dynamic modelling of mechanical systems containing kinematic loops , 1996 .
[5] I. Duff,et al. Direct Methods for Sparse Matrices , 1987 .
[6] Emanuele Carpanzano,et al. Solution of Symbolic Linear Systems in OmSim Using Cramer's Rule , 1994 .
[7] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[8] Mats Andersson,et al. Object-Oriented Modelling and Simulation , 1993 .
[9] Hilding Elmqvist,et al. Methods for Tearing Systems of Equations in Object-Oriented Modeling , 1994 .
[10] R. Kaas,et al. A branch and bound algorithm for the acyclic subgraph problem , 1981 .
[11] Lap-Kit Cheung,et al. The bordered triangular matrix and minimum essential sets of a digraph , 1974 .
[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .