A model order reduction method to recursively compute a Cauer ladder network from static finite-element solutions is extended for use with a double vector potential formulation, which decreases difficulties in… Click to show full abstract
A model order reduction method to recursively compute a Cauer ladder network from static finite-element solutions is extended for use with a double vector potential formulation, which decreases difficulties in solving the finite-element equation system. In addition, the connection between the boundary condition and the viability of the solution is demonstrated. Finally, the method is applied to two examples.
               
Click one of the above tabs to view related content.