講演名 2020-10-23
[招待講演]混合行列を係数とする微分代数方程式の指数減少法
岩田 覚(東大), 大城 泰平(東大), 高松 瑞代(中大),
PDFダウンロードページ PDFダウンロードページへ
抄録(和)
抄録(英) Differential-algebraic equations (DAEs) are widely used for the modeling of dynamical systems. The difficulty in numerically solving a DAE is measured by its differentiation index. For highly accurate simulation of dynamical systems, it is important to convert high-indexDAEs into low-index DAEs. Most of the existing simulation software packages for dynamical systems are equipped with an index-reduction algorithm given by Mattsson and S?derlind. Unfortunately, this algorithm fails if there are numerical cancellations. These numerical cancellations are often caused by accurate constants in structural equations. Distinguishing those accurate constants from generic parameters that represent physical quantities, Murota and Iri introduced the notion of a mixed matrix as a mathematical tool for faithful model description in a structural approach to systems analysis. For DAEs described with the use of mixed matrices, efficient algorithms to compute the index have been developed by exploiting matroid theory. In this talk, we present an index-reduction algorithm for linear DAEs whose coefficient matrices are mixed matrices, i.e., linear DAEs containing physical quantities as parameters. Our algorithm detects numerical cancellations between accurate constants and transforms a DAE into an equivalent DAE to which Mattsson?S?derlind’s index-reduction algorithm is applicable. Our algorithm is based on the combinatorial relaxation approach, which is a framework to solve a linear algebraic problem by iteratively relaxing it into an efficiently solvable combinatorial optimization problem. The algorithm does not rely on symbolic manipulations but on fast combinatorial algorithms on graphs and matroids. Our algorithm is proved to work for any linear DAEs whose coefficient matrices are mixed matrices. Furthermore, we provide an improved algorithm under an assumption based on dimensional analysis of dynamical systems. Through numerical experiments, it is confirmed that our algorithms run sufficiently fast for large-scale DAEs and output DAEs such that physical meanings of coefficients are easy to interpret. Our algorithms can also be appliedto nonlinear DAEs by regarding nonlinear terms as parameters.
キーワード(和) 微分代数方程式 / 指数減少 / 組合せ緩和 / マトロイド理論 / 組合せ的行列理論 / 組合せ的科学計算
キーワード(英) Differential-algebraic equations / index reduction / combinatorial relaxation / matroid theory / combinatorial matrix theory / combinatorial scientific computing
資料番号 COMP2020-12
発行日 2020-10-16 (COMP)

研究会情報
研究会 COMP
開催期間 2020/10/23(から1日開催)
開催地(和) 大阪大学
開催地(英) Osaka Univ.
テーマ(和)
テーマ(英)
委員長氏名(和) 増澤 利光(阪大)
委員長氏名(英) Toshimitsu Masuzawa(Osaka Univ.)
副委員長氏名(和) 小野 廣隆(名大)
副委員長氏名(英) Hirotaka Ono(Nagoya Univ)
幹事氏名(和) 大下 福仁(奈良先端大) / 安藤 映(専修大)
幹事氏名(英) Fukuhito Ooshita(NAIST) / Ei Ando(Senshu Univ.)
幹事補佐氏名(和) 大舘 陽太(名大)
幹事補佐氏名(英) Yota Otachi(Nagoya Univ)

講演論文情報詳細
申込み研究会 Technical Committee on Theoretical Foundations of Computing
本文の言語 JPN
タイトル(和) [招待講演]混合行列を係数とする微分代数方程式の指数減少法
サブタイトル(和)
タイトル(英) [Invited Talk] Index reduction for differential-algebraic equations with mixed matrices
サブタイトル(和)
キーワード(1)(和/英) 微分代数方程式 / Differential-algebraic equations
キーワード(2)(和/英) 指数減少 / index reduction
キーワード(3)(和/英) 組合せ緩和 / combinatorial relaxation
キーワード(4)(和/英) マトロイド理論 / matroid theory
キーワード(5)(和/英) 組合せ的行列理論 / combinatorial matrix theory
キーワード(6)(和/英) 組合せ的科学計算 / combinatorial scientific computing
第 1 著者 氏名(和/英) 岩田 覚 / Satoru Iwata
第 1 著者 所属(和/英) 東京大学(略称:東大)
The University of Tokyo(略称:The Univ. of Tokyo)
第 2 著者 氏名(和/英) 大城 泰平 / Taihei Oki
第 2 著者 所属(和/英) 東京大学(略称:東大)
The University of Tokyo(略称:The Univ. of Tokyo)
第 3 著者 氏名(和/英) 高松 瑞代 / Mizuyo Takamatsu
第 3 著者 所属(和/英) 中央大学(略称:中大)
Chuo University(略称:Chuo Univ.)
発表年月日 2020-10-23
資料番号 COMP2020-12
巻番号(vol) vol.120
号番号(no) COMP-209
ページ範囲 pp.9-9(COMP),
ページ数 1
発行日 2020-10-16 (COMP)