Fast Computation of Cuts With Reduced Support by Solving Maximum Circulation Problems

We present a technique to efficiently compute optimal cuts required to solve 3-D eddy current problems by magnetic scalar potential formulations. By optimal cuts, we mean the representatives of (co)homology generators with minimum support among the ones with a prescribed boundary. In this paper, we obtain them by starting from the minimal (co)homology generators of the combinatorial two-manifold representing the interface between conducting and insulating regions. Optimal generators are useful because they reduce the fill-in of the sparse matrix and ease human-guided basis selection. In addition, provided that the mesh is refined enough to allow it, they are not self-intersecting. The proposed technique is based on a novel graph-theoretic algorithm to solve a maximum circulation network flow problem in unweighted graphs that typically runs in linear time.

[1]  S. Gortler,et al.  A Discrete Global Minimization Algorithm for Continuous Variational Problems , 2004 .

[2]  P. R. Kotiuga.  An algorithm to make cuts for magnetic scalar potentials in tetrahedral meshes based on the finite element method , 1989 .

[3]  P. R. Kotiuga.  On making cuts for magnetic scalar potentials in multiply connected regions , 1987 .

[4]  R. Specogna.  Optimal Cohomology Generators for 2-D Eddy-Current Problems in Linear Time , 2013, IEEE Transactions on Magnetics.

[5]  J. P. Webb,et al.  A single scalar potential method for 3D magnetostatics using edge elements , 1989, International Magnetics Conference.

[6]  Ruben Specogna,et al.  Lazy Cohomology Generators: A Breakthrough in (Co)homology Computations for CEM , 2014, IEEE Transactions on Magnetics.

[7]  M Pellikka,et al.  Powerful Heuristics and Basis Selection Bring Computational Homology to Engineers , 2011, IEEE Transactions on Magnetics.

[8]  Ruben Specogna,et al.  Efficient generalized source field computation for h-oriented magnetostatic formulations , 2011 .

[9]  R. Specogna,et al.  Efficient Cohomology Computation for Electromagnetic Modeling , 2010 .

[10]  Enzo Tonti,et al.  The Mathematical Structure of Classical and Relativistic Physics: A General Classification Diagram , 2013 .

[11]  E. Felten,et al.  A Crystalline Approximation Theorem for Hypersurfaces , 1990 .

[12]  Paul W. Gross,et al.  Electromagnetic Theory and Computation: A Topological Approach , 2004 .

[13]  Zhuoxiang Ren,et al.  T-/spl Omega/ formulation for eddy-current problems in multiply connected regions , 2002 .

[14]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[15]  Ruben Specogna,et al.  Physics inspired algorithms for (co)homology computations of three-dimensional combinatorial manifolds with boundary , 2013, Comput. Phys. Commun..

[16]  Christophe Geuzaine,et al.  Homology and Cohomology Computation in Finite Element Modeling , 2013, SIAM J. Sci. Comput..

[17]  P. Dlotko,et al.  Automatic generation of cuts on large-sized meshes for the T–Ω geometric eddy-current formulation , 2009 .

[18]  Ruben Specogna,et al.  Cohomology in 3D Magneto-Quasistatics Modeling , 2013 .

[19]  Ronald L. Rivest,et al.  Introduction to Algorithms, 3rd Edition , 2009 .

[20]  Ruben Specogna,et al.  Geometric T–Ω approach to solve eddy currents coupled to electric circuits , 2008 .

[21]  Enrico Bertolazzi,et al.  Efficient construction of homological Seifert surfaces , 2014 .