Driving a coupled field‐circuit problem
Saku Suuriniemi, Jari Kangas, Lauri Kettunen · COMPEL The International Journal for Computation and Mathematics in Electrical and Electronic Engineering · 2007
Purpose The paper addresses various ways of driving a magneto‐quasi‐static coupled field‐circuit problems, starting with the underlying assumptions of this problem class. It focuses on problem consistency, supporting both conceptual understanding, and translation into software. Design/methodology/approach The paper proceeds from a precisely defined problem class and analyze its consistency with homology theory. Findings Precise notion of “driving a problem,” extensive discussion of modeling assumptions and decisions, and classification and consistency analysis of various driving methods. Practical implications Helps modelers systematically pose consistent coupled field‐circuit problems. The computation of homology groups can be automated to help pose problems and detect consistency problems. Originality/value Starting from the basic underlying assumptions, the paper summarizes logically the application of homology to consistency analysis. The style is tutorial for modelers, with numerous particular cases.