Skip to main content Accessibility help
×
Hostname: page-component-65f69f4695-q7d28 Total loading time: 0 Render date: 2025-06-28T08:31:59.059Z Has data issue: false hasContentIssue false

6 - An Algorithm to Make Cuts for Magnetic Scalar Potentials

Published online by Cambridge University Press:  06 July 2010

Paul W. Gross
Affiliation:
Mathematical Sciences Research Institute, Berkeley
P. Robert Kotiuga
Affiliation:
Boston University
Get access

Summary

6A. Introduction and Outline

In this chapter we consider a general finite element-based algorithm to make cuts for magnetic scalar potentials and investigate how the topological complexity of the three-dimensional region, which constitutes the domain of computation, affects the computational complexity of the algorithm. The algorithm is based on standard finite element theory with an added computation required to deal with topological constraints brought on by a scalar potential in a multiply connected region. The process of assembling the finite element matrices is also modified in the sense described at length in the previous chapter.

Regardless of the topology of the region, an algorithm can be implemented with 𝒪 (m30) time complexity and 𝒪 (m20) storage where m0 denotes the number of vertices in the finite element discretization. However, in practice this is not useful since for large meshes the cost of finding cuts would become the dominant factor in the magnetic field computation. In order to make cuts worthwhile for problems such as nonlinear or time-varying magnetostatics, or in cases of complicated topology such as braided, knotted, or linked conductor configurations, an implementation of 𝒪 (m20) time complexity and 𝒪 (m0) storage is regarded as ideal. The obstruction to ideal complexity is related to the structure of the fundamental group This chapter describes an algorithm that can be implemented with 𝒪 (m20) time complexity and 𝒪 (m4/3 0 ) storage complexity given no more topological data than that contained in the finite element connection matrix.

Information

Type
Chapter
Information
Electromagnetic Theory and Computation
A Topological Approach
, pp. 159 - 182
Publisher: Cambridge University Press
Print publication year: 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Book purchase

Temporarily unavailable

Save book to Kindle

To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×