• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Common-mode EMI characterization and mitigation in networked power electronics-enabled power systems

Amin, Ashik 10 May 2024 (has links) (PDF)
Rapidly-increasing medium-voltage power electronics applications in emerging industry systems, including electrical ships, more electric aircraft, and microgrids, have emphasized the critical need for highly energy-efficient, reliable, and fast switching devices. As a result, Wide-Bandgap (WBG) devices have gained considerable interest over conventional silicon-based switches in recent years. For example, emerging WBG devices have unlocked new dimensions for modern motor drive systems with increased efficiency, switching frequency, and superior power density. Commercially-developed WBG devices such as Silicon Carbide (SiC) and Gallium Nitride (GaN) offer promising opportunities to meet those pressing requirements. However, the fast switching operation of WBG devices may cause substantially increased EMI emissions in medium-voltage applications, which can decrease the overall system’s performance or merits of power converters. This will be particularly an issue in a system where electric ground is unavailable, such as an electric ship, as a large Electro-Magnetic Interference current will be circulating within the system. The EMI in the WBG switch module will be emitted up to 500 MHz. This is the near radio-frequency (RF) band whose impact had not been clearly understood or properly analyzed in the power electronics field until recently. With new and critical challenges in recent years, to reliably adopt WBG devices in emerging power systems, there has been significant effort to improve electromagnetic compatibility (EMC) with new EMI mitigation techniques that comply with existing standards, including International Special Committee on Radio Interference (CISPR), Federal Communications Commission (FCC), Department of Defense (DOD), International Electro-Technical Commission (IEC), etc. This research investigates the common-mode EMI in networked power electronics-enabled power systems. Common-mode EMI phase information is a vital degree of freedom in EMI study that has not been considered in the state of the art. The EMI phase information reduces EMI without implementing any active or passive filter circuit. An effective and less complex method is introduced to reduce EMI in power electronics network. The work includes developing hybrid filter with passive and virtual filter. Including virtual filter reduces the passive common mode choke weight and volume significantly. Finally, a simplified switching node capacitance characterization technique for packaged WBG SiC has been introduced.
2

Revisiting optimization algorithms for maximum likelihood estimation

Mai, Anh Tien 12 1900 (has links)
Parmi les méthodes d’estimation de paramètres de loi de probabilité en statistique, le maximum de vraisemblance est une des techniques les plus populaires, comme, sous des conditions l´egères, les estimateurs ainsi produits sont consistants et asymptotiquement efficaces. Les problèmes de maximum de vraisemblance peuvent être traités comme des problèmes de programmation non linéaires, éventuellement non convexe, pour lesquels deux grandes classes de méthodes de résolution sont les techniques de région de confiance et les méthodes de recherche linéaire. En outre, il est possible d’exploiter la structure de ces problèmes pour tenter d’accélerer la convergence de ces méthodes, sous certaines hypothèses. Dans ce travail, nous revisitons certaines approches classiques ou récemment d´eveloppées en optimisation non linéaire, dans le contexte particulier de l’estimation de maximum de vraisemblance. Nous développons également de nouveaux algorithmes pour résoudre ce problème, reconsidérant différentes techniques d’approximation de hessiens, et proposons de nouvelles méthodes de calcul de pas, en particulier dans le cadre des algorithmes de recherche linéaire. Il s’agit notamment d’algorithmes nous permettant de changer d’approximation de hessien et d’adapter la longueur du pas dans une direction de recherche fixée. Finalement, nous évaluons l’efficacité numérique des méthodes proposées dans le cadre de l’estimation de modèles de choix discrets, en particulier les modèles logit mélangés. / Maximum likelihood is one of the most popular techniques to estimate the parameters of some given distributions. Under slight conditions, the produced estimators are consistent and asymptotically efficient. Maximum likelihood problems can be handled as non-linear programming problems, possibly non convex, that can be solved for instance using line-search methods and trust-region algorithms. Moreover, under some conditions, it is possible to exploit the structures of such problems in order to speedup convergence. In this work, we consider various non-linear programming techniques, either standard or recently developed, within the maximum likelihood estimation perspective. We also propose new algorithms to solve this estimation problem, capitalizing on Hessian approximation techniques and developing new methods to compute steps, in particular in the context of line-search approaches. More specifically, we investigate methods that allow us switching between Hessian approximations and adapting the step length along the search direction. We finally assess the numerical efficiency of the proposed methods for the estimation of discrete choice models, more precisely mixed logit models.
3

Revisiting optimization algorithms for maximum likelihood estimation

Mai, Anh Tien 12 1900 (has links)
Parmi les méthodes d’estimation de paramètres de loi de probabilité en statistique, le maximum de vraisemblance est une des techniques les plus populaires, comme, sous des conditions l´egères, les estimateurs ainsi produits sont consistants et asymptotiquement efficaces. Les problèmes de maximum de vraisemblance peuvent être traités comme des problèmes de programmation non linéaires, éventuellement non convexe, pour lesquels deux grandes classes de méthodes de résolution sont les techniques de région de confiance et les méthodes de recherche linéaire. En outre, il est possible d’exploiter la structure de ces problèmes pour tenter d’accélerer la convergence de ces méthodes, sous certaines hypothèses. Dans ce travail, nous revisitons certaines approches classiques ou récemment d´eveloppées en optimisation non linéaire, dans le contexte particulier de l’estimation de maximum de vraisemblance. Nous développons également de nouveaux algorithmes pour résoudre ce problème, reconsidérant différentes techniques d’approximation de hessiens, et proposons de nouvelles méthodes de calcul de pas, en particulier dans le cadre des algorithmes de recherche linéaire. Il s’agit notamment d’algorithmes nous permettant de changer d’approximation de hessien et d’adapter la longueur du pas dans une direction de recherche fixée. Finalement, nous évaluons l’efficacité numérique des méthodes proposées dans le cadre de l’estimation de modèles de choix discrets, en particulier les modèles logit mélangés. / Maximum likelihood is one of the most popular techniques to estimate the parameters of some given distributions. Under slight conditions, the produced estimators are consistent and asymptotically efficient. Maximum likelihood problems can be handled as non-linear programming problems, possibly non convex, that can be solved for instance using line-search methods and trust-region algorithms. Moreover, under some conditions, it is possible to exploit the structures of such problems in order to speedup convergence. In this work, we consider various non-linear programming techniques, either standard or recently developed, within the maximum likelihood estimation perspective. We also propose new algorithms to solve this estimation problem, capitalizing on Hessian approximation techniques and developing new methods to compute steps, in particular in the context of line-search approaches. More specifically, we investigate methods that allow us switching between Hessian approximations and adapting the step length along the search direction. We finally assess the numerical efficiency of the proposed methods for the estimation of discrete choice models, more precisely mixed logit models.

Page generated in 0.0447 seconds