基于遗传算法的NiZn铁氧体磁导率随频率变化的数值响应
Numerical response of the magnetic permeability as a funcion of the frecuency of NiZn ferrites using Genetic Algorithm
摘要:
铁氧体的磁导率是设计电感器、Transformers和微波吸收材料等设备的重要因素。因此,建议研究铁氧体的磁导率作为频率的函数。当对应于谐波磁场\textbf{H}的激励施加到系统时,该系统以磁通量密度\textbf{B}响应;这两个矢量之间的关系可以表示为\textbf{B} = $μ(ω)$ \textbf{H}。其中,$μ$为磁导率。在本文中,铁氧体被认为是线性的,均匀的,各向同性材料。采用磁导率模型对掺钇的NiZn铁氧体进行了研究。采用遗传算法对模型参数进行了调整。在人工智能的计算机科学领域,遗传算法和机器学习确实依赖于大自然的慷慨,以获得自然和机制的灵感。遗传算法是一种概率搜索过程,它利用自然进化的启发,如遗传、变异、选择和交叉,来生成优化问题的解决方案。由于数值拟合通常采用非线性最小二乘法,该算法是从一组初始变量值出发,以微积分为基础。与穷举或随机搜索相比,这种方法在数学上是优雅的,但容易陷入局部极小值。另一方面,随机方法使用一些概率计算来找到变量集。它们往往较慢,但无论变量的初始值如何,都能更成功地找到全局最小值
英文摘要:
The magnetic permeability of a ferrite is an important factor in designing devices such as inductors, transformers, and microwave absorbing materials among others. Due to this, it is advisable to study the magnetic permeability of a ferrite as a function of frequency. When an excitation that corresponds to a harmonic magnetic field \textbf{H} is applied to the system, this system responds with a magnetic flux density \textbf{B}; the relation between these two vectors can be expressed as \textbf{B}=$μ(ω)$ \textbf{H} . Where $μ$ is the magnetic permeability. In this paper, ferrites were considered linear, homogeneous, and isotropic materials. A magnetic permeability model was applied to NiZn ferrites doped with Yttrium. The parameters of the model were adjusted using the Genetic Algorithm. In the computer science field of artificial intelligence, Genetic Algorithms and Machine Learning does rely upon nature's bounty for both inspiration nature's and mechanisms. Genetic Algorithms are probabilistic search procedures which generate solutions to optimization problems using techniques inspired by natural evolution, such as inheritance, mutation, selection, and crossover. For the numerical fitting usually is used a nonlinear least square method, this algorithm is based on calculus by starting from an initial set of variable values. This approach is mathematically elegant compared to the exhaustive or random searches but tends easily to get stuck in local minima. On the other hand, random methods use some probabilistic calculations to find variable sets. They tend to be slower but have greater success at finding the global minimum regardless of the initial values of the variables
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。