中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
detecting and correcting the index of dae by the combinatorial relaxation algorithm
Author: Yan Yongxin ; Zhang Xiaolei ; Wu Xuesong ; Cao Jianwen
Source: Proceedings - 2011 10th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2011
Conference Name: 2011 10th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2011
Conference Date: October 14
Issued Date: 2011
Conference Place: Wuxi, Jiangsu, China
Keyword: Algebra ; Algorithms ; Computer simulation ; Computer simulation languages ; Differential equations ; Distributed computer systems ; Indexing (materials working)
Indexed Type: EI
ISBN: 9780769544151
Department: (1) International School Beijing University of Posts and Telecommunications Beijing China; (2) Laboratory of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing China
Abstract: The mathematical modeling and simulation based on the Modelica language usually gets a high-index differential-algebraic equation (DAE) system. The structural index reduction algorithms can serve as a fast method to reduce such high-indexed issues. In order to solve the failure of the structural index reduction algorithms in some cases, the combinatorial relaxation algorithm is analyzed and studied. Finally, the result of an example shows the combinatorial relaxation algorithm is an effective way to improve the stability of the index reduction algorithms based on the structural index of DAE. © 2011 IEEE.
English Abstract: The mathematical modeling and simulation based on the Modelica language usually gets a high-index differential-algebraic equation (DAE) system. The structural index reduction algorithms can serve as a fast method to reduce such high-indexed issues. In order to solve the failure of the structural index reduction algorithms in some cases, the combinatorial relaxation algorithm is analyzed and studied. Finally, the result of an example shows the combinatorial relaxation algorithm is an effective way to improve the stability of the index reduction algorithms based on the structural index of DAE. © 2011 IEEE.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/16245
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Yan Yongxin,Zhang Xiaolei,Wu Xuesong,et al. detecting and correcting the index of dae by the combinatorial relaxation algorithm[C]. 见:2011 10th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2011. Wuxi, Jiangsu, China. October 14.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Yan Yongxin]'s Articles
[Zhang Xiaolei]'s Articles
[Wu Xuesong]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Yan Yongxin]‘s Articles
[Zhang Xiaolei]‘s Articles
[Wu Xuesong]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2020  中国科学院软件研究所 - Feedback
Powered by CSpace