# On the Generalization Capabilities of the Ten-Parameter Jiles-Atherton Model

Authors: Gabriele Maria Lozito; Francesco Riganti Fulginei; Alessandro Salvini
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

This work proposes an analysis on the generalization capabilities for the modified version of the classic Jiles-Atherton model for magnetic hysteresis. The modified model takes into account the use of dynamic parameterization, as opposed to the classic model where the parameters are constant. Two different dynamic parameterizations are taken into account: a dependence on the excitation and a dependence on the response. The identification process is performed by using a novel nonlinear optimization technique called Continuous Flock-of-Starling Optimization Cube (CFSO3), an algorithm belonging to the class of swarm intelligence. The algorithm exploits parallel architecture and uses a supervised strategy to alternate between exploration and exploitation capabilities. Comparisons between the obtained results are presented at the end of the paper.


---

## Body

## 1. Introduction

Hysteretic behavior of magnetic materials is a common topic found in literature [1–7] especially in the numerical modeling field [8–19]. Presently, multiple phenomenological models exist to represent this behavior. The lack of a physical model suggested the use of advanced numerical techniques to represent it, like, for instance, Neural Networks [20–30]. Among the phenomenological models, one that is based on physical considerations and that is very common model in literature is the one proposed by Jiles-Atherton in 1983 [31–34]. After being proposed, the model was later refined through the physical explanation on some details concerning the reversible component and the main equation to give a physically sensible result for minor loops. The model is parametric and is defined by five coefficients that describe different physical aspects. The identification process of the model is numerical and is approached through solving a least squares (LSQ) problem against some reference data that can be either experimental or simulated [35, 36]. The use of this model for practical applications has been favored by the development of new optimization techniques, which allowed a finer identification of the model parameters [16, 37–49]. On the other hand, the core of the model was widely revised in the years. An approach that is commonly found in literature imposes some dynamic dependence for the parameters on the model excitation [50, 51]. These modified models feature a higher number of degrees of freedom and thus are able to represent complex dynamics. Indeed, this comes with the drawback that the identification procedure is more difficult. The identification problem for the classic model is nonconvex [52] and different solutions exist for the same material. The different solutions provide different generalization capabilities. Once the model has been identified for a particular set of excitations/responses, the goal is to use it to represent the material for any generic excitation. However, it has been seen that complex waveforms that feature minor loops are poorly reproduced unless particular care has been taken in the choice of the identification waveform. Nevertheless, using a complex waveform for identification makes the identification problem more difficult to solve. For this reason, a powerful optimization algorithm is needed, to solve both the problem of a difficult convergence and the risk of being trapped into the local minima of a nonconvex problem. For such a task, in this work, we propose the use of the Continuous Flock-of-Starling Optimization Cube (CFSO3) algorithm, described in [53–55]. This algorithm belongs to the swarm intelligence class of metaheuristics algorithms and is an analytic evolution of the Flock-of-Starlings (FSO) algorithm found in literature and already applied with success on different problems [56, 57]. The main difference between the FSO and the CFSO3 lies in the criterion for position update of the particles: the FSO updates the positions according to a discrete law; the CFSO computes analytical trajectories for each particle. Since the trajectories are computed analytically, it is possible to supervise the optimization behavior: it is possible to modify the algorithm parameters to exhibit convergence, divergence, or local oscillations of the particles. The proposed algorithm runs natively on master-slave parallel architecture. The main idea is to have a master process performing the exploration of the solution space and to refine the solutions into the candidate areas through local exploitations performed by slave processes. The purpose of this work is to investigate the generalization capabilities of a modified Jiles-Atherton model, featuring five additional parameters. This new ten-parameter model will be shortly addressed as J10P. The additional parameters are not constants (like the classic ones) but are rather scaled according to the model state. In particular, two different dependences are going to be investigated: a dependence on the excitation and a dependence on the response. In both cases, the model will be identified on a wide set of reference materials, and the results will be validated against random waveforms on the same materials. In the first part of this paper, the derivation of the J10P model from the classic one will be shortly reviewed. In the second part, the CFSO3 algorithm will be analyzed, remarking its parallel capabilities. In the third part, the identification and validation benchmark will be described, along with the results obtained in terms of convergence and generalization. Conclusions and final considerations will follow.


## 2. The Dynamic Parameterization of the Jiles-Atherton Model

Several models are available in literature to represent the magnetic hysteresis phenomenon [1]. Models span from representing the phenomenon at microscopic level [2] through domain analysis to less physical and more application oriented approaches [7, 13]. Among the different models, the most commonly used in literature are the one from Preisach and the one from Jiles-Atherton. The former is widely used in both scalar [5, 8–11, 15] and vector [3, 19] forms. A recent work extended the hysteresis representation of the Preisach vector model in 3D domain [12]. The original model proposed by Jiles-Atherton [31–34] for the hysteretic response of ferromagnetic material is a differential model that expresses the derivative of the magnetization with respect to the magnetic field, through a nonlinear relation. The model is composed of two equations (1) and (2), which express, respectively, the differential relation and the nonlinear component of the anhysteretic magnetization M
an:(1)
d
M
d
H
=
1
-
c
M
an
-
M
k
δ
-
α
M
an
-
M
+
c
d
M
an
d
H
,
(2)
M
an
=
M
s
coth
⁡
H
+
α
M
a
-
a
H
+
α
M
.There are five parameters involved: M
s, the magnetization saturation; a, the shape parameter; α, the mean field parameter; k, the domain wall pinning constant; and c, the domain flexing constant. The δ term takes into account whether the integration is taking place in the ascending or the descending part of the loop. It is calleddirectional factor, and its value is either +1 or −1, respectively. The strong advantage presented by the classic Jiles-Atherton parameter lies in the reduced number of parameters and the physical interpretation that was attributed to each parameter. The identification process for these parameters can be solved in several ways as proposed by the same author of the model [35, 36] and other notable examples that can be found in literature [16, 43]. Still, the most common approach is to identify it by solving a least squares problem. Different algorithm can be used to solve the inverse problem: classic Particle Swarm Optimization [14, 45], Simulated Annealing [48], Differential Evolution [51], and hybrid approaches based on Genetic Algorithms [47, 52]. The goal of the identification procedure is to identify the set of five parameters that describes the material under study. In the classic model, the five parameters are constant. The model used in this work deviates from the physical nature of the original J-A model, introducing a phenomenological approach where each generic parameter p is expressed by(3)
p
=
p
0
+
p
1
×
e
-
γ
/
σ
2
,where γ can be either the current excitation (i.e., the magnetic field H) or the last computed value for the response of the model (i.e., the flux density B). Introducing a dependency on the excitation/response of the model is a strategy already used in other modeling approaches where the hysteretic phenomenon is modeled through Neural Networks [20, 22, 24, 27, 30]. Representation of the ferromagnetic material under distorted excitation [23, 25] of a multifrequency domain [28] is a difficult generalization problem for an ANN that must be solved by introducing some sort of memory in the neural estimator. This approach is not mandatory in this model, since its differential nature naturally takes into account the memory effect. However, the representation of minor loops can be enhanced by applying this paradigm to model parameterization. The dynamic part of the parameter is distributed according to a Gaussian distribution, with the width of the curve proportional to σ. The value of σ is related to the saturation values for either the magnetic field or the flux density, according to the model used. It is defined during the identification procedure and is equal to 0.2–0.8 times the H
SAT or the B
SAT value. Indeed, the dynamic expansion for all the five parameters may be redundant for some simple problems. An incremental analysis from the J5P model to the J10P model can be found in Appendix B. The degrees of freedom introduced by the J10P model, in terms of flexibility in representing a hysteresis phenomenon, can be seen by operating alternatively on the two components of the same parameter. For example, the M
s parameter is basically a vertical scaling factor for the whole hysteresis loop: larger M
s will give a taller loop, whereas smaller M
s will give a shorter one. By modifying alternatively the M
s
0 component and the M
s
1 components, it is apparent how the two changes affect the hysteresis curve. In Figure 1, two sets of hysteresis curves are shown. On Figure 1(a), the M
s
0 parameter assumes the values of 8
e
5
,
9
e
5,1
e
6,1.1
e
6,1.2
e
6, and the M
s
1 parameter is kept at 0. In Figure 1(b), the M
s
0 parameter is set to 1
e
6, and the M
s
1 parameter assumes the values of {
-
2
e
5
,
-
1
e
5,0
,
1
e
5,2
e
5
}.Figure 1
Different behaviors obtained by modifying theM
s
0 (a) and M
s
1 (b) parameters. In both cases, γ
=
H and σ
=
0.3
×
Max
⁡
γ.
(a)
(b)In both cases, the dynamic part of the parameter was dependent on the excitation of the model (thus,γ
=
H). In the first case, the scaling of the hysteresis curve is the same on the whole domain of the cycle. In the second case, the hysteresis curve is scaled near the origin but is not affected near the saturation points.


## 3. The CFSO3 Algorithm: From the Formulation to the Parallel Strategy

The problem of parameter identification for both the classic and the modified J-A models is a nonlinear problem that features several local minima and instable points [52]. For this reason, the approach followed in literature for model identification tends to favor highly explorative algorithms [14, 45, 51]. Still, the solution found by these algorithms by themselves is seldom an optimal one due to the lack of exploitation capabilities. For this reason, hybrid techniques based on the combination of explorative and exploiting algorithms [47, 52] have been proposed as a valid alternative to single algorithms. The choice of the exploitation algorithm can go from simple gradient descent based techniques [47] to complex metaheuristics like the Bacterial Chemotaxis Algorithm often used in electromagnetic inverse problems [44]. Hybrid strategies are well versed to be implemented on parallel architecture, distributing the tasks of exploration and exploitation on the master and the slaves [18, 49]. In this work, the identification problem is solved through a novel algorithm that features both exploration and exploitation capabilities and runs natively on parallel architecture. The CFSO3 algorithm belongs to the family of global optimization methods that are based on swarm intelligence. It is a very versatile algorithm that is able to exhibit both exploitation and exploration capabilities, according to the configuration of the algorithm itself. The core of the method is based on a modification of the well-known Particle Swarm Optimization (PSO) that features a “topological” component, called the Flock-of-Starling Optimization (FSO). The topological component is responsible for particle-to-particle interaction. Indeed, in the classic PSO algorithms, the only interaction between the particles is by the common attraction to theglobal best. In this algorithm, however, every particle adds to its velocity vector an average of the velocities of a number of other particles in the swarm. The update equation for the particles is given in the following:(4)
v
k
j
t
+
1
=
ω
v
k
j
t
+
λ
p
bes
t
k
j
t
-
x
k
j
t
+
γ
g
best
j
t
-
x
k
j
t
+
∑
m
=
1
N
h
k
m
v
m
j
t
,
x
k
j
t
+
1
=
x
k
j
t
+
v
k
j
t
+
1
.Given that j
=
1
,
…
,
Δ, where Δ is the dimension of the solution, ω, λ, and γ express the inertial (tendency to maintain the direction), cognitive (tendency to follow thepersonal best
p
best), and social (tendency to follow theglobal best
g
best) coefficients. Without the last term (the sum), this is the equation expressing the classic PSO update law. The term in the sum ∑
m
=
1
N
h
k
m
v
m
j is the one accounting for the particle-to-particle interaction. Compared to the PSO, the FSO presents better exploration capabilities for very large solution spaces. The FSO however is still a discrete algorithm whose behavior is controlled by coefficients in a way that is not directly apparent. Indeed, by modifying the {
ω
,
λ
,
γ
,
h
} parameters, it is possible to influence the algorithm general conduct, but strict control of convergence, divergence, and oscillation is impossible. A big novelty on this behalf was introduced with the CFSO algorithm [54, 55]. In this algorithm, the update equations for the FSO were considered as state equations for a dynamic system and were integrated in the Laplace domain:(5)
s
V
s
X
s
=
A
1,1
A
1,2
1
0
V
s
X
s
+
F
s
0
+
v
0
x
0
,
(6)
X
s
=
s
2
·
1
-
A
1,1
s
-
A
1,2
-
1
·
s
·
1
-
A
1,1
·
x
+
v
+
F
,
A
1,1
=
ω
·
1
+
H
,
A
1,2
=
-
μ
·
1
,
(7)
I
k
j
t
=
λ
·
p
best
k
j
t
+
γ
·
g
best
j
t
.In (5), V and X are two vectors expressing the velocities and positions for the different members of the flock. F is a forcing term that takes into account both the personal and the global bests. The submatrix A
1,1 is expressed in (6) and combines the contribution for both inertia (ω) and the particle-to-particle interaction (
H
). The submatrix A
1,2 accounts for the cognitive and social coefficients (given that μ
=
λ
+
γ). The integration in Laplace domain for this system can be done under some assumptions for the H matrix. However, expressing the vector F as a Laplace transform can be rather tricky. Indeed, in (7), we can see the forcing vector in the time domain. The p
best
t and g
best
(
t
) functions are not known a priori, since they change according to the different points found by the algorithm during the exploration. For this reason, it is not possible to express them as Laplace transform. To solve this problem, the approach proposed in the algorithm suggests evaluating these two functions on a time-window (TW) reference. Each time window has a τ length. Inside the time window, it is possible to assume that the value assumed by theglobalandpersonal best for each particle does not change and is equal to the one evaluated at the beginning of the time window. Under this assumption, it is possible to perform the Laplace integration on a time-window basis, thus effectively tracing the trajectory for the particles in closed form for each TW. Updating the particle position by using closed forms for trajectories has major advantages in terms of supervising the algorithm global behavior. Indeed, the set of particles is now a dynamic system completely defined in the Laplace domain. It is then possible to analyse the poles of the system to understand its stability conditions. Equations (8) express the poles for X
(
s
) for a particular case of H where all the birds are connected (Fully Connected CFSO): (8)
s
1,2
=
1
2
ω
~
-
h
~
±
ω
~
-
h
~
2
-
4
μ
~
,
s
3,4
=
1
2
ω
~
+
N
-
1
h
~
±
ω
~
+
N
-
1
h
~
2
-
4
μ
~
.The symbol ~ on the ω, μ, and h parameters expresses a parameter that is valid only under the current time window. Under the assumption of ω
~
-
h
~
2
-
4
μ
~
≠
0, ω
~
+
N
+
1
h
~
2
-
4
μ
~
≠
0, all poles are simple (either complex or real) with single multiplicity. We can thus apply the inverse Laplace transform and obtain the following expression for the single particle trajectory:(9)
x
k
t
=
x
k
∑
j
=
1
2
-
1
j
s
j
s
2
-
s
1
·
e
s
j
t
+
a
k
∑
j
=
1
2
-
1
j
s
2
-
s
1
·
e
s
j
t
+
∑
j
=
1
4
h
~
∑
n
=
1
N
x
n
s
j
2
∏
n
=
1
,
n
≠
j
4
s
j
-
s
n
·
e
s
j
t
+
∑
j
=
1
4
h
~
∑
n
=
1
N
a
n
s
j
∏
n
=
1
,
n
≠
j
4
s
j
-
s
n
·
e
s
j
t
+
∑
j
=
1
4
h
~
λ
~
∑
n
=
1
N
p
best
n
1
∏
n
=
1
,
i
≠
j
4
s
j
-
s
n
·
e
s
j
t
+
λ
~
·
p
best
k
∑
j
=
1
2
-
1
j
s
2
-
s
1
·
e
s
j
t
+
g
best
∑
j
=
1
2
γ
~
-
1
j
s
j
+
2
s
4
-
s
3
·
e
s
j
+
2
t
.Stability analysis can be performed by observing the real and imaginary parts of the poles: asymptotical stability can be obtained by condition (10), whereas oscillation can be obtained by condition (11). Consider(10)
ω
~
<
h
~
<
-
ω
~
N
-
1
or
μ
~
>
0
,
(11)
-
2
μ
~
+
ω
~
<
h
~
<
2
μ
~
+
ω
~
or
h
~
<
2
μ
~
-
ω
~
N
-
1
.Indeed, if the poles are real part negative, the resulting trajectories in the time domain will tend to a convergence towards an equilibrium point. If poles are real part positive, a fast divergence will occur. In both cases, if the poles are complex conjugates, the behaviors will be combined with oscillations. Each of these behaviors can be used to create a hybrid strategy, similar to the one seen in [18, 49, 52], that features both exploration and exploitation capabilities. This strategy is thought to run on parallel architecture by the algorithm called CFSO3 [53] depicted in Figure 2.Figure 2
Conceptual representation of the CFSO3 algorithm: the original domain for the solution space (yellow) is explored by the master using a CFSOpialgorithm. Once a candidate area is found by a particle, a slave is dispatched to explore the subdomain (light blue) using CFSOas algorithm.The CFSO3 algorithm runs on master-slave parallel cluster. The master runs the CFSO configured to exhibit oscillating behaviors (CFSOpi). Its purpose is to explore the solution space and find candidate areas where a further investigation can be performed by the slaves. They run the CFSO with asymptotically convergent particles (CFSOas) that is initialized near the candidate area identified by the master. Each time the master identifies a new area, a slave is assigned to explore it. In the meantime, to increase the exploration capabilities of the master algorithm further, the poles are temporarily switched to an unstable configuration (CFSOus) to escape from the local minimum (the found candidate area). More details on the algorithm can be obtained in [53–57]. As a final remark, it should be pointed out that the hybrid approach proposed was thoroughly compared with other swarm intelligence based algorithms, outperforming them in several different benchmark problems. In Table 1, a summary of the parametric configuration for the CFSO used in this work is reported.Table 1
CFSO configuration.
Cluster configuration
Number of masters
1
Number of slaves
6
CFSOpi
ω
−0.8147
λ
0.4210
γ
0.5790
h
0.0950
τ
0.2000
CFSOas
ω
−2.1260
λ
0.4820
γ
0.9130
h
−0.6680
τ
0.0500
CFSOas
ω
0.1260
λ
0.4820
γ
0.4130
h
−0.668
τ
0.0200


## 4. Assessment of the Generalization Capabilities of the J10P Model

The purpose of this section is to investigate the generalization capabilities of the modified Jiles-Atherton model that features dynamic parameters by comparing two approaches. The first one adjusts the dynamic parameters according to the excitation of the system and the second one according to the response of the system. The former will be shortly addressed asJ
10
P
H and the latter as J
10
P
B. Assessing the generalization capabilities of the model is a process composed of four steps. First, a reference dataset representing the magnetic behavior for a particular material should be created, featuring excitation and response {
H
REF
,
B
REF
}. Second, all the models under study (J
10
P
H and J
10
P
B) must be identified on this reference dataset. Theconvergence error for this stage expresses theflexibility of the models, which is their ability to follow a particular trend of the input. Third, for the same material used to create the reference, a new validation dataset featuring a different excitation and response should be created {
H
VAL
,
B
VAL
}. Fourth, the identified models must be tested for accuracy on the validation dataset. Theperformance error expresses thegeneralization capabilities of the model, which is their ability to represent the material behavior regardless of the particular waveform. It is important to emphasize that the capability to generalize the material behavior is the most important feature for a model representing magnetic hysteresis in real applications. Indeed, in that case, it will maintain its accuracy also under distorted excitations, which is a common problem in power applications due to harmonic pollution due to the nonlinear loads. In fact, the upper limit in generalization capabilities for complex waveforms for the classic Jiles-Atherton (five parameters) model was the main reason for the implementation of the modified model [52]. The previous studies analysed the generalization capabilities of the classic model through an investigation that involved several different magnetic materials and different kind of excitation waveforms. An example of J5P shortcomings for these problems can be found in Appendix A. Nevertheless, a model identified on simple {
H
REF
,
B
REF
} datasets (e.g., just a saturating waveform) is a poorly identified model, unable to correctly represent the material under distorted excitations. On the other hand, increasing the complexity of {
H
REF
,
B
REF
} makes the identification problem more difficult to solve but provides a model more reliable when complex waveforms are involved. This behavior however is not indefinitely monotonic, since very complex waveforms for {
H
REF
,
B
REF
} go beyond theflexibility capabilities of the classic Jiles-Atherton model. This is the reason for the creation of the modified model: removing as more as possible the limits imposed by the few degrees of freedom of the classic model. The workbench implemented in this paper is composed of three main elements: a set of excitations for both reference and validation, an optimization tool used for model identification (CFSO3), and a set of virtual magnetic materials generated through the Preisach model (see Figure 3). The use of the Preisach model as reference “virtual” material is a technique already used in other works in literature on the generalization properties of the Jiles-Atherton model. Indeed, using a virtual material comes with the added benefit of simplifying the expansion of the investigation on several different materials, overcoming the need for samples preparation. Preisach model can be implemented simply in its scalar form [9, 15], and the present analysis can be expanded for vector fields since both the Preisach [12, 19] and the J-A [3, 40, 46] models have been implemented in vector form. For this work, 200 different magnetic materials were used, each corresponding to a different hysteron distribution in the Preisach model. The hysteron distribution used for all materials was a 2D Gaussian distribution on the {
α
,
β
} plane, defined by a 1
×
2
μ
¯ vector for the mean value, and a 2
×
2
σ
¯ covariance matrix. A set of four waveforms was used as excitations for each of the 200 materials to generate the {
H
REF
,
B
REF
} dataset. The four waveforms are shown in Figures 4–7. In Figure 4, the major loop, usually found in literature as the main identification waveform, is shown. This set will be addressed as MAJ.Figure 3
Preisach model for magnetic hysteresis implemented in Matlab environment. The hysteron distribution in the{
α
,
β
} plane can be seen on (b) (distribution is assumed null for β
>
α), resulting in hysteresis cycle on (a).
(a)
(b)Figure 4
MAJ reference dataset: major loop.Figure 5
REV reference dataset: major loop and FORCS.Figure 6
MIN reference dataset: major and minor loops.Figure 7
FULL reference dataset: major loop, minor loop, and FORCS.In Figure5, the major loop with added First-Order Reversal Curves (FORCs) is shown. This waveform is often used to identify the Preisach Model, and the richness of information contained in the curves near the saturation points is well known in literature. This set will be addressed as REV. In Figure 6, a major loop and a minor loop, connected through the First Magnetization Curve (FMC), are shown. FMC gives information on the shape of minor loops (indeed, all symmetric minor loops are aligned on the First Magnetization Curve). This set will be addressed as MIN. The last reference dataset, shown in Figure 7, is a complex waveform created by using major loop, minor loop, and FORCs, aimed at pushing to the limits of the flexibility of the modified model and evaluating its generalization capabilities. This set will be addressed as FULL.Each material is identified using the four waveforms{
MAJ
,
REV
,
MIN
,
FULL
}. Identification is performed for both the J
10
P
H and the J
10
P
B models. This gives 800 different solutions (200 materials for 4 waveforms) for each of the two models. The error related to these solutions expresses theconvergence error of the model on the identification process and is given in the following:(12)
E
CONV
=
1
N
∑
i
=
1
N
B
i
-
B
REF
i
2
,where N is the number of samples of the reference set, B
[
i
] and B
REF
[
i
] are, respectively, ith samples generated by the model and from the reference dataset. Since the real goal of the analysis is to test the generalization capabilities of the model, and this must be done against a validation dataset, a set of 25 new waveforms, featuring along the major loop a random composition of minor loops and FORCs, was created. This set of 25 waveforms (an example can be seen in Figure 8) was used on the same 200 magnetic materials. The error, given in the following, is theperformance error and expresses the generalization capabilities of the modified model:(13)
E
PERF
=
1
N
∑
i
=
1
N
B
i
-
B
VAL
i
2
.The results obtained from the analysis are reported in the following. In Table 2, the flexibility results on the identification process are reported. In Table 3, the generalization results are reported. In both tables, the results are obtained by averaging the performances on the 200 different materials. As it can be seen, from the first table, as long as the waveform is simple, the J
10
P
H and J
10
P
B model performances on MAJ, REV, and MIN are comparable. On the other hand, on a very complex waveform (FULL), the dynamic dependence of the J
10
P
B (i.e., relative to B) provides a double accuracy on the identification procedure. It can be concluded that, for simple waveforms, using a dependence on the excitation H or on the response B brings to the same results, but to identify more complex waveforms, a response dependence is needed. In Table 3, the generalization capabilities of the models are compared. As it was expected, simpler waveforms yield worse generalization capabilities than more complex ones. The MAJ results are not very meaningful, since if model generalization is the goal, identifying a model on the major loop is the worst strategy possible. This is confirmed by the high error for both models. The error, as expected, goes down for more complex waveforms (REV and MIN) and gets a minimum using the most complex one (FULL). The best generalization results are obtained with the J
10
P
B using the FULL identification dataset.Table 2
Flexibility of the two models for the four waveforms used during identification.
Dataset
AVG.E
CONV (J10P
H)
AVG.E
CONV (J10P
B)
MAJ
3.15
e
-
06
2.31
e
-
06
REV
5.70
e
-
06
3.47
e
-
05
MIN
1.56
e
-
06
1.90
e
-
05
FULL
3.04
e
-
04
1.53
e
-
04Table 3
Generalization of the two models for the four waveforms used during identification.
Dataset
AVG.E
PERF (J10P
H)
AVG.E
PERF (J10P
B)
MAJ
2.66
e
-
01
1.35
e
-
01
REV
3.90
e
-
02
2.89
e
-
02
MIN
6.25
e
-
02
1.33
e
-
01
FULL
3.51
e
-
02
2.30
e
-
02Figure 8
An example of validation dataset, featuring two minor cycles, two topside FORCs, two botside FORCs, and the major loop.


## 5. Conclusions

A performance analysis on the ten-parameter model for the representation of the magnetic behavior of a ferromagnetic material was presented. The analysis focused on characterizing two key aspects of model performance: its capabilities to fit a set of experimental data from a material (flexibility) and the ability, once identified, to represent any behavior from the same material (generalization). The analysis compared two configurations of the same model, one featuring an excitation-dependent parameterization of the model and one featuring a response-dependent parameterization of the model. Both configurations were tested through identification and validation on a wide set of virtual magnetic materials. The faced identification problem was rather complex, being a nonlinear and multimodal optimization problem, with a large solution space. In light of that, a powerful algorithm based on swarm intelligence, featuring a hybrid configuration that exhibits both exploration and exploitation capabilities on parallel architecture, was used to identify the model. The results of the analysis confirm that the use of complex waveforms for the model identification, despite making the identification procedure more complex, pays off in terms of generalization. The most complex waveforms used in this work are better identified, also in terms of generalization, by the response-dependent modelJ
10
P
B. This is the most suitable configuration to achieve a model that can give a considerable response when complex and distorted waveforms must be simulated. However, for simpler waveforms, good results (especially in terms of flexibility) have been obtained by the J
10
P
B model.



---

*Source: 715018-2015-12-13.xml*