论文信息 - An algorithm to construct the discrete cohomology basis functions required for magnetic scalar potential formulations without cuts

An algorithm to construct the discrete cohomology basis functions required for magnetic scalar potential formulations without cuts

Magnetic scalar potential formulations without cuts require the definition of a set of basis functions for the cohomology structure of the magnetic field function space. This paper presents an algorithm to construct such a basis in the general case thanks to a properly chosen spanning tree. The algorithm is based on the topological properties of the discrete Whitney complex. It applies to static and dynamic problems.

Kay Hameyer | François Henrotte

[1] Lauri Kettunen,et al. Generalization of the spanning-tree technique , 2002 .

[2] Lauri Kettunen,et al. Fields and circuits in computational electromagnetism , 2001 .

[3] Z. Cendes,et al. TREE-COTREE DECOMPOSITIONS FOR FIRST-ORDER COMPLETE TANGENTIAL VECTOR FINITE ELEMENTS , 1997 .

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

[5] François Henrotte,et al. A generalized source magnetic field calculation method for inductors of any shape , 1997 .

[6] Lauri Kettunen,et al. Discrete spaces for div and curl-free fields , 1998 .

[7] Lauri Kettunen,et al. Gauging in Whitney spaces , 1999 .

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

[9] Lauri Kettunen,et al. Formulation of the eddy current problem in multiply connected regions in terms of h , 1998 .

[10] P. R. Kotiuga,et al. A Challenge for Magnetic Scalar Potential Formulations of 3-D Eddy Current Problems: Multiply Connected Cuts in Multiply Connected Regions which Necessarily Leave the Cut Complement Multiply Connected , 1995 .