【24h】

Tearing algebraic loops in bond graphs

机译:消除键图中的代数循环

获取原文
获取原文并翻译 | 示例
           

摘要

For bond graphs with causal paths between resistive ports the mathematical model is a set of Differential Algebraic Equations. Depending on the purpose of the model, and the available software, there are different options to process algebraic constraints. A bond-graph-based approach is proposed that exploits tearing. By inserting special sinks into causal paths, indication is provided to the model processor as to which variables could be used as tearing variables, and which equations for their determination. An algorithm is proposed that identifies suitable locations for those sinks in the bond graph such that the number of tearing variables is small. It is shown how the approach can be applied to bond graphs with causal paths between stores as well.
机译:对于在电阻端口之间具有因果关系的键图,数学模型是一组微分代数方程。根据模型的目的和可用的软件,可以使用不同的选项来处理代数约束。提出了一种基于键图的方法,该方法利用了撕裂。通过将特殊的接收器插入因果路径,可以向模型处理器提供有关哪些变量可以用作撕裂变量以及确定哪些方程的指示。提出了一种算法,该算法标识键图中的那些汇点的合适位置,以使撕裂变量的数量少。它显示了如何将该方法应用于在商店之间具有因果关系的键图。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号