Frederic Guyomarc'H
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Frederic Guyomarc'H has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Antonio Wendell de Oliveira Rodrigues
IFCE
4 shared publications - Yvonnick Le Menach
Univ. Lille, Arts et Metiers Institute of Technology, Centrale Lille, Junia, ULR2697-L2EP, Lille, France
4 shared publications Jean-Luc Dekeyser
University of Lille
3 shared publications- Reda El Bechari
Univ. Lille, Arts et Métiers Institute of Technology, Centrale Lille, Junia, ULR 2697 - L2EP, Lille, France
3 shared publications - Stéphane Brisset
University of Lille, Arts et Metiers Institute of Technology
3 shared publications - Loic Chevallier
Arts et Metiers Institute of Technology, Centrale Lille, Junia, ULR 2697-L2EP, University of Lille, Lille, France
2 shared publications
Latest Publications
- 9 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Magnetics
- Vol. 59 (5) , 1-4
From Topology Optimization to 3-D Printing of an Electromagnetic Core
This paper presents a bridge between topology optimization and additive manufacturing. On the one hand, it presents an algorithm that considers the design variables as binary and then solves the problem by binary linear programming to optimize a ferromagnetic core. On the other hand, a 3D printing process is developed to manufacture the shapes obtained by topology optimization. Finally, these magnetic parts are characterized through electrical measurements.
- 9 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Magnetics
- Vol. 59 (5) , 1-4
From Topology Optimization to 3-D Printing of an Electromagnetic Core
This paper presents a bridge between topology optimization and additive manufacturing. On the one hand, it presents an algorithm that considers the design variables as binary and then solves the problem by binary linear programming to optimize a ferromagnetic core. On the other hand, a 3D printing process is developed to manufacture the shapes obtained by topology optimization. Finally, these magnetic parts are characterized through electrical measurements.
- Open Access
- 10 March 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (6) , 885
The Adjoint Variable Method for Computational Electromagnetics
Optimization using finite element analysis and the adjoint variable method to solve engineering problems appears in various application areas. However, to the best of the authors’ knowledge, there is a lack of detailed explanation on the implementation of the adjoint variable method in the context of electromagnetic modeling. This paper aimed to provide a detailed explanation of the method in the simplest possible general framework. Then, an extended explanation is offered in the context of electromagnetism. A discrete design methodology based on adjoint variables for magnetostatics was formulated, implemented, and verified. This comprehensive methodology supports both linear and nonlinear problems. The framework provides a general approach for performing a very efficient and discretely consistent sensitivity analysis for problems involving geometric and physical variables or any combination of the two. The accuracy of the implementation is demonstrated by independent verification based on an analytical test case and using the finite-difference method. The methodology was used to optimize the parameters of a superconducting energy storage device and a magnet press and the optimization of the topology of an electromagnet. The objective function of each problem was successfully decreased, and all constraints stipulated were met.
- 10 March 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (6) , 885
Open AccessThe Adjoint Variable Method for Computational Electromagnetics
Optimization using finite element analysis and the adjoint variable method to solve engineering problems appears in various application areas. However, to the best of the authors’ knowledge, there is a lack of detailed explanation on the implementation of the adjoint variable method in the context of electromagnetic modeling. This paper aimed to provide a detailed explanation of the method in the simplest possible general framework. Then, an extended explanation is offered in the context of electromagnetism. A discrete design methodology based on adjoint variables for magnetostatics was formulated, implemented, and verified. This comprehensive methodology supports both linear and nonlinear problems. The framework provides a general approach for performing a very efficient and discretely consistent sensitivity analysis for problems involving geometric and physical variables or any combination of the two. The accuracy of the implementation is demonstrated by independent verification based on an analytical test case and using the finite-difference method. The methodology was used to optimize the parameters of a superconducting energy storage device and a magnet press and the optimization of the topology of an electromagnet. The objective function of each problem was successfully decreased, and all constraints stipulated were met.
- Open Access
Branch and Bound Algorithm Based on Prediction Error of Metamodel for Computational Electromagnetics
Metamodels proved to be a very efficient strategy for optimizing expensive black-box models, e.g., Finite Element simulation for electromagnetic devices. It enables the reduction of the computational burden for optimization purposes. However, the conventional approach of using metamodels presents limitations such as the cost of metamodel fitting and infill criteria problem-solving. This paper proposes a new algorithm that combines metamodels with a branch and bound (B&B) strategy. However, the efficiency of the B&B algorithm relies on the estimation of the bounds; therefore, we investigated the prediction error given by metamodels to predict the bounds. This combination leads to high fidelity global solutions. We propose a comparison protocol to assess the approach’s performances with respect to those of other algorithms of different categories. Then, two electromagnetic optimization benchmarks are treated. This paper gives practical insights into algorithms that can be used when optimizing electromagnetic devices.
Open AccessBranch and Bound Algorithm Based on Prediction Error of Metamodel for Computational Electromagnetics
Metamodels proved to be a very efficient strategy for optimizing expensive black-box models, e.g., Finite Element simulation for electromagnetic devices. It enables the reduction of the computational burden for optimization purposes. However, the conventional approach of using metamodels presents limitations such as the cost of metamodel fitting and infill criteria problem-solving. This paper proposes a new algorithm that combines metamodels with a branch and bound (B&B) strategy. However, the efficiency of the B&B algorithm relies on the estimation of the bounds; therefore, we investigated the prediction error given by metamodels to predict the bounds. This combination leads to high fidelity global solutions. We propose a comparison protocol to assess the approach’s performances with respect to those of other algorithms of different categories. Then, two electromagnetic optimization benchmarks are treated. This paper gives practical insights into algorithms that can be used when optimizing electromagnetic devices.
- 4 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Magnetics
- Vol. 55 (6) , 1-4
An Improved Newton Method Based on Choosing Initial Guess Applied to Scalar Formulation in Nonlinear Magnetostatics
An improved starting point Newton method applied to 3-D scalar formulation in magnetostatics is proposed in this paper. Compared with the classical Newton method, the inexact-Newton and quasi-Newton methods are reported by testing on a benchmark problem as well as an industrial example. Remarkable convergence acceleration using the proposed strategy is observed, and thus, it significantly reduces the computational time.
- 4 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Magnetics
- Vol. 55 (6) , 1-4
An Improved Newton Method Based on Choosing Initial Guess Applied to Scalar Formulation in Nonlinear Magnetostatics
An improved starting point Newton method applied to 3-D scalar formulation in magnetostatics is proposed in this paper. Compared with the classical Newton method, the inexact-Newton and quasi-Newton methods are reported by testing on a benchmark problem as well as an industrial example. Remarkable convergence acceleration using the proposed strategy is observed, and thus, it significantly reduces the computational time.
- Open Access
- 7 May 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Magnetics
- Vol. 49 (5) , 1729-1732
Test Harness on a Preconditioned Conjugate Gradient Solver on GPUs: An Efficiency Analysis
The parallelization of numerical simulation algorithms, i.e., their adaptation to parallel processing architectures, is an aim to reach in order to hinder exorbitant execution times. The parallelism has been imposed at the level of processor architectures and graphics cards are now used for general-purpose calculation, also known as “General-Purpose computation on Graphics Processing Unit (GPGPU)”. The clear benefit is the excellent performance over price ratio. Besides hiding the low level programming, software engineering leads to a faster and more secure application development. This paper presents the real interest of using GPU processors to increase performance of larger problems which concern electrical machines simulation. Indeed, we show that our auto-generated code applied to several models allows achieving speedups of the order of 10 ×.
- 7 May 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Magnetics
- Vol. 49 (5) , 1729-1732
Open AccessTest Harness on a Preconditioned Conjugate Gradient Solver on GPUs: An Efficiency Analysis
The parallelization of numerical simulation algorithms, i.e., their adaptation to parallel processing architectures, is an aim to reach in order to hinder exorbitant execution times. The parallelism has been imposed at the level of processor architectures and graphics cards are now used for general-purpose calculation, also known as “General-Purpose computation on Graphics Processing Unit (GPGPU)”. The clear benefit is the excellent performance over price ratio. Besides hiding the low level programming, software engineering leads to a faster and more secure application development. This paper presents the real interest of using GPU processors to increase performance of larger problems which concern electrical machines simulation. Indeed, we show that our auto-generated code applied to several models allows achieving speedups of the order of 10 ×.
- 1 January 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computing in Science & Engineering
- Vol. 15 (1) , 46-55
An MDE Approach for Automatic Code Generation from UML/MARTE to OpenCL
To reduce the design complexity of OpenCL programming, the approach proposed here generates application code automatically, based on model-driven engineering (MDE) and modeling and analysis of real-time and embedded (MARTE) systems. The aim is to provide application-development resources for nonspecialists in parallel programming, exploiting concepts such as reuse and platform independence.
- 1 January 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computing in Science & Engineering
- Vol. 15 (1) , 46-55
An MDE Approach for Automatic Code Generation from UML/MARTE to OpenCL
To reduce the design complexity of OpenCL programming, the approach proposed here generates application code automatically, based on model-driven engineering (MDE) and modeling and analysis of real-time and embedded (MARTE) systems. The aim is to provide application-development resources for nonspecialists in parallel programming, exploiting concepts such as reuse and platform independence.
- 23 January 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Magnetics
- Vol. 48 (2) , 831-834
Automatic Multi-GPU Code Generation Applied to Simulation of Electrical Machines
The electrical and electronic engineerings have used parallel programming to solve their large scale complex problems for performance reasons. However, as parallel programming requires a non-trivial distribution of tasks and data, developers find it hard to implement their applications effectively. Thus, in order to reduce design complexity, we propose an approach to generate code for hybrid architectures (e.g., CPU + GPU) using OpenCL, an open standard for parallel programming of heterogeneous systems. This approach is based on Model Driven Engineering (MDE) and the MARTE profile, standard proposed by Object Management Group (OMG). The aim is to provide resources to non-specialists in parallel programming to implement their applications. Moreover, thanks to model reuse ability, we can add/change functionalities and the target architecture. Consequently, this approach helps industries to achieve their time-to-market constraints which are confirmed here by experimental tests. Besides the software development at high-level abstractions, this approach aims to improve performance by using multi-GPU environments. A case study based on the Conjugate Gradient method gives clarity to our methodology.
- 23 January 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Magnetics
- Vol. 48 (2) , 831-834
Automatic Multi-GPU Code Generation Applied to Simulation of Electrical Machines
The electrical and electronic engineerings have used parallel programming to solve their large scale complex problems for performance reasons. However, as parallel programming requires a non-trivial distribution of tasks and data, developers find it hard to implement their applications effectively. Thus, in order to reduce design complexity, we propose an approach to generate code for hybrid architectures (e.g., CPU + GPU) using OpenCL, an open standard for parallel programming of heterogeneous systems. This approach is based on Model Driven Engineering (MDE) and the MARTE profile, standard proposed by Object Management Group (OMG). The aim is to provide resources to non-specialists in parallel programming to implement their applications. Moreover, thanks to model reuse ability, we can add/change functionalities and the target architecture. Consequently, this approach helps industries to achieve their time-to-market constraints which are confirmed here by experimental tests. Besides the software development at high-level abstractions, this approach aims to improve performance by using multi-GPU environments. A case study based on the Conjugate Gradient method gives clarity to our methodology.
- 1 May 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 1183-1190
Harnessing the Power of GPUs without Losing Abstractions in SAC and ArrayOL: A Comparative Study
Over recent years, using Graphics Processing Units (GPUs) has become as an effective method for increasing the performance of many applications. However, these performance benefits from GPUs come at a price. Firstly extensive programming expertise and intimate knowledge of the underlying hardware are essential for gaining good speedups. Secondly, the expressibility of GPU-based programs are not powerful enough to retain the high-level abstractions of the solutions. Although the programming experience has been significantly improved by existing frameworks like CUDA and OpenCL, it is still a challenge to effectively utilise these devices while still retaining the programming abstractions. To this end, performing a source-to-source transformation, whereby a high-level language is mapped to CUDA or OpenCL, is an attractive option. In particular, it enables one to retain high-level abstractions and to harness the power of GPUs without any expertise on the GPGPU programming. In this paper, we compare and analyse two such schemes. One of them is a transformation mechanism for mapping a image/signal processing domain-specific language, ArrayOL, to OpenCL. The other one is a transformation route for mapping a high-level general purpose array processing language, Single Assignment C (SaC) to CUDA. Using a real-world image processing application as a running example, we demonstrate that albeit the fact of being general purpose, the array processing language be used to specify complex array access patterns generically. Performance of the generated CUDA code is comparable to the OpenCL code created from domain-specific language.
- 1 May 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 1183-1190
Harnessing the Power of GPUs without Losing Abstractions in SAC and ArrayOL: A Comparative Study
Over recent years, using Graphics Processing Units (GPUs) has become as an effective method for increasing the performance of many applications. However, these performance benefits from GPUs come at a price. Firstly extensive programming expertise and intimate knowledge of the underlying hardware are essential for gaining good speedups. Secondly, the expressibility of GPU-based programs are not powerful enough to retain the high-level abstractions of the solutions. Although the programming experience has been significantly improved by existing frameworks like CUDA and OpenCL, it is still a challenge to effectively utilise these devices while still retaining the programming abstractions. To this end, performing a source-to-source transformation, whereby a high-level language is mapped to CUDA or OpenCL, is an attractive option. In particular, it enables one to retain high-level abstractions and to harness the power of GPUs without any expertise on the GPGPU programming. In this paper, we compare and analyse two such schemes. One of them is a transformation mechanism for mapping a image/signal processing domain-specific language, ArrayOL, to OpenCL. The other one is a transformation route for mapping a high-level general purpose array processing language, Single Assignment C (SaC) to CUDA. Using a real-world image processing application as a running example, we demonstrate that albeit the fact of being general purpose, the array processing language be used to specify complex array access patterns generically. Performance of the generated CUDA code is comparable to the OpenCL code created from domain-specific language.
- 19 July 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Magnetics
- Vol. 46 (8) , 3269-3272
Parallel Direct Solver for the Finite Integration Technique in Electrokinetic Problems
The finite integration technique allows the simulation of real-world electromagnetic field problems with complex geometries. It provides a discrete reformulation of Maxwell's equations in their integral form suitable for numerical computing. The resulting matrix equations of the discretized fields can be used for efficient numerical simulations on modern computers and can be exploited to use a parallel computing. In fact, by reordering the unknowns by the nested dissection method, it is possible to directly construct the lower triangular matrix of the Cholesky factorization with many processors without assembling the matrix system. In this paper, a parallel algorithm is proposed for the direct solution of large sparse linear systems with the finite integration technique. This direct solver has the advantage of handling singularities in the matrix of linear systems. The computational effort for these linear systems, often encountered in numerical simulation of electromagnetic phenomena by finite integration technique, is very significant in terms of run-time and memory requirements. Many numerical tests have been carried out to evaluate the performance of the parallel direct solver.
- 19 July 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Magnetics
- Vol. 46 (8) , 3269-3272
Parallel Direct Solver for the Finite Integration Technique in Electrokinetic Problems
The finite integration technique allows the simulation of real-world electromagnetic field problems with complex geometries. It provides a discrete reformulation of Maxwell's equations in their integral form suitable for numerical computing. The resulting matrix equations of the discretized fields can be used for efficient numerical simulations on modern computers and can be exploited to use a parallel computing. In fact, by reordering the unknowns by the nested dissection method, it is possible to directly construct the lower triangular matrix of the Cholesky factorization with many processors without assembling the matrix system. In this paper, a parallel algorithm is proposed for the direct solution of large sparse linear systems with the finite integration technique. This direct solver has the advantage of handling singularities in the matrix of linear systems. The computational effort for these linear systems, often encountered in numerical simulation of electromagnetic phenomena by finite integration technique, is very significant in terms of run-time and memory requirements. Many numerical tests have been carried out to evaluate the performance of the parallel direct solver.
- 24 February 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Magnetics
- Vol. 45 (3) , 1432-1435
Speeding Up SSFEM Computation Using Kronecker Tensor Products
The spectral stochastic finite-element method makes it possible to convey some random aspects of input data to the output data. However, the system size dramatically increases with the number of input random variables. Using matrix Kronecker tensor products for system solving noticeably reduces the computation time and the storage requirements.
- 24 February 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Magnetics
- Vol. 45 (3) , 1432-1435
Speeding Up SSFEM Computation Using Kronecker Tensor Products
The spectral stochastic finite-element method makes it possible to convey some random aspects of input data to the output data. However, the system size dramatically increases with the number of input random variables. Using matrix Kronecker tensor products for system solving noticeably reduces the computation time and the storage requirements.