Cuts for 3-D magnetic scalar potentials: Visualizing unintuitive surfaces arising from trivial knots

A wealth of literature exists on computing and visualizing cuts for the magnetic scalar potential of a current carrying conductor via Finite Element Methods (FEM) and harmonic maps to the circle. By a cut we refer to an orientable surface bounded by a given current carrying path (such that the flux through it may be computed) that restricts contour integrals on a curl-zero vector field to those that do not link the current-carrying path, analogous to branch cuts of complex analysis. This work is concerned with a study of a peculiar contour that illustrates topologically unintuitive aspects of cuts obtained from a trivial loop and raises questions about the notion of an optimal cut. Specifically, an unknotted curve that bounds only high genus surfaces in its convex hull is analyzed. The current work considers the geometric realization as a current-carrying wire in order to construct a magnetic scalar potential. Moreover, we consider the problem of choosing an energy functional on the space of maps, suggesting an algorithm for computing cuts via minimizing a conformally invariant functional utilizing Newton iteration.

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

[3]  W. Thurston,et al.  Examples of unknotted curves which bound only surfaces of high genus within their convex hulls , 1977 .

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

[5]  Joel Hass,et al.  3-MANIFOLD KNOT GENUS is NP-complete , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

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

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

[8]  J. Lagarias,et al.  The Minimal Number of Triangles Needed to Span a Polygon Embedded in ℝd , 2003 .

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

[10]  Michael H. Freedman,et al.  Divergence-free fields : energy and asymptotic crossing number , 1991 .

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

[12]  Jari Kangas,et al.  Tools for Visualizing Cuts in Electrical Engineering Education , 2016, IEEE Transactions on Magnetics.

[13]  Anil N. Hirani,et al.  The least spanning area of a knot and the optimal bounding chain problem , 2010, SoCG '11.

[14]  Paul W. Gross,et al.  Electromagnetic Theory and Computation: Introduction , 2004 .

[15]  Antti Stenvall,et al.  A Finite Element Simulation Tool for Predicting Hysteresis Losses in Superconductors Using an H-Oriented Formulation with Cohomology Basis Functions , 2015 .

[16]  R. Felder,et al.  Understanding Student Differences , 2005 .

[17]  Jeffrey C. Lagarias,et al.  The computational complexity of knot and link problems , 1999, JACM.

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

[19]  W. Thurston,et al.  The Computational Complexity of Knot Genus and Spanning Area , 2002, math/0205057.

[20]  N. Steenrod,et al.  Foundations of Algebraic Topology , 1952 .

[21]  Alexandre V. Borovik.  Mathematics under the Microscope , 2009 .

[22]  Jeffrey C. Lagarias,et al.  Area Inequalities for Embedded Disks Spanning Unknotted Curves , 2003, math/0306313.