Powerful Heuristics and Basis Selection Bring Computational Homology to Engineers

被引：9

作者：

Pellikka, Matti ^{[1
]}

Suuriniemi, Saku ^{[1
]}

Kettunen, Lauri ^{[1
]}

机构：

[1] Tampere Univ Technol, FIN-33101 Tampere, Finland

来源：

IEEE TRANSACTIONS ON MAGNETICS | 2011年 / 47卷 / 05期

关键词：

Boundary value problems; complexity theory; homology; matrix decomposition; user interfaces;

D O I：

10.1109/TMAG.2010.2091109

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

With heuristics, computational homology is able to extract the bases of homology spaces of a domain covered with a cellular mesh with an acceptable efficiency. In this paper, methods for homology basis selection within the modeling software are discussed. A good basis should be as clear and informative to the user as possible and to indicate basis elements' relation to the boundary conditions.

引用

页码：1226 / 1229

页数：4

共 9 条

[1]

Bossavit A., 1998, Computational Electromagnetism: Variational Formulations, Complementarity, Edge Elements

[2] Automatic generation of cuts on large-sized meshes for the T-Ω geometric eddy-current formulation [J].

Dlotko, Pawel ;

Specogna, Ruben ;

Trevisan, Francesco .

COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2009, 198 (47-48) :3765-3781

[3]

Gross P. W., 2004, Electromagnetic Theory and Computation: A Topological Approach

[4]

Hatcher A., 2002, Algebraic topology

[5]

Kaczynski T, 2004, Computational homology, V3

[6]

Munkres J., 1984, Elements of algebraic topology, V1

[7] Consistency of quasi-static boundary value problems in electromagnetic modelling [J].

Suuriniemi, S. ;

Kettunen, L. .

INTERNATIONAL JOURNAL OF NUMERICAL MODELLING-ELECTRONIC NETWORKS DEVICES AND FIELDS, 2006, 19 (06) :491-506

[8]

SUURINIEMI S, 2004, THESIS TAMPERE U TEC

[9]

Yap C.K., 2000, Fundamental Problems of Algorithmic Algebra

← 1 →