Search results

The paper examines the convergence characteristics of the “minimized residual method based on the MRTR (three‐term recurrence formula of CG‐type) method” for solving large linear simultaneous equations.

The paper uses an example of magnetic field analysis of permanent magnet type of MRI taking account of the minor loop and eddy current.

It is shown that the preconditioned MRTR method can get a stable and quick convergence for such a relatively ill‐conditioned problem.

Illustrates that the convergence of the Incomplete Cholesky Conjugate Gradient method is one of the important issues in the practical 3D magnetic field analysis.

Introduces papers from this area of expertise from the ISEF 1999 Proceedings. States the goal herein is one of identifying devices or systems able to provide prescribed performance. Notes that 18 papers from the Symposium are grouped in the area of automated optimal design. Describes the main challenges that condition computational electromagnetism’s future development. Concludes by itemizing the range of applications from small activators to optimization of induction heating systems in this third chapter.

Manifold‐mapping (MM) is an efficient surrogate‐based optimization technique aimed at the acceleration of very time‐consuming design problems. In this paper we present two new variants of the original algorithm that make it applicable to a broader range of optimization scenarios.

The first variant is useful when the optimization constraints are expressed by means of functions that are very expensive to compute. The second variant endows the original scheme with a trust‐region strategy and the result is a much more robust algorithm.

Two practical optimization problems from electromagnetics eventually show that the proposed variants perform efficiently.

The original MM algorithm is extended with two new variants. Therefore, the MM approach is applicable to a much larger set of design situations.

This work aims to present a multilevel optimization strategy based on manifold‐mapping combined with multiquadric interpolation for the coarse model construction.

In the proposed approach the coarse model is obtained by interpolating the fine model using multiquadrics in a small number of points. As the algorithm iterates the response surface model is improved by enriching the set of interpolation points.

This approach allows to accurately solve the TEAM Workshop Problem 25 using as little as 33 finite element simulations. Furthermore, it allows a robust sizing optimization of a cylindrical voice‐coil actuator with seven design variables.

Further analysis is required to gain a better understanding of the role that the initial coarse model accuracy plays in the convergence of the algorithm. The proposed model allows to carry out such analysis by varying the number of points included in the initial response surface model. The effect of the trust‐region stabilization in the presence of manifolds of equivalent solutions is also a topic of further investigations.

Unlike the closely related space‐mapping algorithm, the manifold‐mapping algorithm is guaranteed to converge to a fine model optimal solution. By combining it with multiquadric response surface models, its applicability is extended to problems for which other kinds of coarse model such as lumped parameter approximations for instance are tedious or impossible to construct.

Factors affecting convergence of the simulated annealing method are investigated using an actual model. The convergence characteristics of various optimization methods are examined using the contour line of objective function. Two kinds of combination methods with the simulated annealing method and the Rosenbrock’s method are investigated.

This paper compares three different radial basis function neural networks, as well as the diffuse element method, according to their ability of approximation. This is very useful for the optimization of electromagnetic devices. Tests are done on several analytical functions and on the TEAM workshop problem 25.

The digital down converter (DDC) is a principal component in modern communication systems. The DDC process traditionally entails quadrature down conversion, bandwidth reducing filters and commensurate sample rate reduction. To avoid group delay, distortion linear phase FIR filters are used in the DDC. The filter performance specifications related to deep stopband attenuation, small in-band ripple and narrow transition bandwidth lead to filters with a large number of coefficients. To reduce the computational workload of the filtering process, filtering is often performed as a two-stage process, the first stage being a down sampling Hoegenauer (or cascade-integrated comb) filter and a reduced sample rate FIR filter. An alternative option is an M-Path polyphase partition of a band cantered FIR filter. Even though IIR filters offer reduced workload to implement a specific filtering task, the authors avoid using them because of their poor group delay characteristics. This paper aims to propose the design of M-path, approximately linear phase IIR filters as an alternative option to the M-path FIR filter.

Two filter designs are presented in the paper. The first approach uses linear phase IIR low pass structure to reduce the filter’s coefficient. Whereas the second approach uses multipath polyphase structure to design approximately linear phase IIR filter in DDC.

The authors have compared the performance and workload of the proposed polyphase structured IIR filters with state-of-the-art filter design used in DDC. The proposed design is seen to satisfy tight design specification with a significant reduction in arithmetic operations and required power consumption.

The proposed design is an alternate solution to the M-path polyphase FIR filter offering very less number of coefficients in the filter design. Proposed DDC using polyphase structured IIR filter satisfies the requirement of linear phase with the least number of computation cost in comparison with other DDC structure.

This study aims to focus on the application of the stochastic algorithms for optimal design of electrical machines. Among them, the authors are interested in particle swarm optimization and teaching–learning-based optimization.

The optimization process is realized by the coupling of the above methods to finite element analysis of the electromagnetic field.

To improve the performance of these algorithms and reduce their computation time, a coupling with the artificial neuron network has been realized.

The proposed strategy is applied to solve two optimization problems: Team workshop problem 25 and switched reluctance motor with flux barriers.

Bullying at the school or college level can have much more serious repercussions for students than educators may be aware of. Neuroscience research is suggesting more than ever that traumatic childhood is associated with the theory of vulnerability – in other words, a greater likelihood of psychiatric disorder spanning across a lifetime. This is the heart-wrenching story of the author’s younger sister, for whom racial school bullying at a school in England wreaked havoc. Almost four decades on she is marked by deep, indelible scars. Since the author’s life is inextricably intertwined with hers, this evocative autoethnographic account is the author’s story too.

This study aims to improve the bat algorithm (BA) performance for solving optimization problems in electrical engineering.

For this task, two strategies were investigated. The first one is based on including the crossover technique into classical BA, in the same manner as in the genetic algorithm method. Therefore, the newly generated version of BA is called the crossover–bat algorithm (C-BA). In the second strategy, a hybridization of the BA with the Nelder–Mead (NM) simplex method was performed; it gives the NM-BA algorithm.

First, the proposed strategies were applied to solve a set of two standard benchmark problems; then, they were applied to solve the TEAM workshop problem 25, where an electromagnetic field was computed by use of the 2D non-linear finite element method. Both optimization algorithms and finite element computation tool were implemented under MATLAB.

The two proposed optimization strategies, C-BA and NM-BA, have allowed good improvements of classical BA, generally known for its poor solution quality and slow convergence rate.