Computational Aspects of Characteristic Mode Decomposition: An overview
Miloslav Čapek, Kurt Schab
Abstract
Nearly all practical applications of the theory of characteristic modes (CMs) involve the use of computational tools. This article is the second in a series of five on CM <xref ref-type="bibr" rid="ref1" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">[1]</xref> – <xref ref-type="bibr" rid="ref2" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"/> <xref ref-type="bibr" rid="ref3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"/> <xref ref-type="bibr" rid="ref4" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">[4]</xref> . Here, we review the general transformations that move CMs from a continuous theoretical framework to a discrete representation compatible with numerical methods. We also review key concepts encountered across a variety of numerical CM implementations. These include modal tracking, dynamic range, code validation, and techniques related to electrically large problems.