Gergely Kovács

Prof. Gergely Kovács

Edutus University

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 February 2021 in Pattern Recognition Letters
Verified
Journal Article
Closed access
GKGergely Kovács
Gergely Kovács
BNBenedek Nagy
Benedek Nagy
NTNeset Deniz Turgay
Neset Deniz Turgay

26 February 2014 in IEEE Transactions on Magnetics
Verified
Journal Article
Closed access
MKMiklos Kuczmann
Miklos Kuczmann
GKGergely Kovács
Gergely Kovács
Iron parts of electrical machines are made of nonoriented isotropic ferromagnetic materials. The finite element method (FEM) is usually applied in the numerical field analysis and design of this equipment. The scalar Preisach hysteresis model has been implemented for the simulation of static and dynamic magnetic effects inside the ferromagnetic parts of motors. The dynamic model is an extension of the static one; an extra magnetic field intensity term is added to the output of the static inverse model. This is a viscosity-type dynamic model. The fixed point method with stable scheme has been realized to take frequency-dependent anomalous losses into account in FEM. This scheme can be used efficiently in the frame of any potential formulations of Maxwell's equations. The comparison between measured and simulated data using a toroidal core shows a good agreement. A modified nonlinear version of T.E.A.M. Problem No. 30.a is also shown to test the hysteresis model in the FEM procedure.

9 April 2016
Verified
Book Chapter
Closed access
PDF file
GKGergely Kovács
Gergely Kovács
BNBenedek Nagy
Benedek Nagy
BVBéla Vizvári
Béla Vizvári

21 April 2021 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
GKGergely Kovács
Gergely Kovács
BNBenedek Nagy
Benedek Nagy
GSGergely Stomfai
Gergely Stomfai
NTNeset Deniz Turgay
Neset Deniz Turgay
BVBéla Vizvári
Béla Vizvári
Linear programming is used to solve optimization problems. Thus, finding a shortest path in a grid is a good target to apply linear programming. In this paper, specific bipartite grids, the square and the body-centered cubic grids are studied. The former is represented as a “diagonal square grid” having points with pairs of either even or pairs of odd coordinates (highlighting the bipartite feature). Therefore, a straightforward generalization of the representation describes the body-centered cubic grid in 3D. We use chamfer paths and chamfer distances in these grids; therefore, weights for the steps between the closest neighbors and steps between the closest same type points are fixed, and depending on the weights, various paths could be the shortest one. The vectors of the various neighbors form a basis if they are independent, and their number is the same as the dimension of the space studied. Depending on the relation of the weights, various bases could give the optimal solution and various steps are used in the shortest paths. This operational research approach determines the optimal paths as basic feasible solutions of a linear programming problem. A directed graph is given containing the feasible bases as nodes and arcs with conditions on the used weights such that the simplex method may step from one feasible basis to another one. Thus, the optimal bases can be determined, and they are summarized in two theorems. If the optimal solution is not integer, then the Gomory cut is applied and the integer optimal solution is reached after only one Gomory iteration. Chamfer distances are frequently used in image processing and analysis as well as graphics-related subjects. The body-centered cubic grid, which is well-known in solid state physics, material science, and crystallography, has various applications in imaging and graphics since less samples are needed to represent the signal in the same quality than on the cubic grid. Moreover, the body-centered cubic grid has also a topological advantage over the cubic grid, namely, the neighbor Voronoi cells always share a full face.

22 August 2017
Verified
Book Chapter
Closed access
PDF file
GKGergely Kovács
Gergely Kovács
BNBenedek Nagy
Benedek Nagy
BVBéla Vizvári
Béla Vizvári

1 June 2019 in Journal of Combinatorial Optimization
Verified
Journal Article
Closed access
PDF file
GKGergely Kovács
Gergely Kovács
BNBenedek Nagy
Benedek Nagy
BVBéla Vizvári
Béla Vizvári