Le calcul d'écoulements dans les générateurs de vapeur des réacteurs à eau pressurisée est un problème complexe, faisant intervenir différents régimes d'écoulement et plusieurs échelles de temps et d'espace. Un scénario accidentel peut être caractérisé par des variations très rapides pour un nombre de Mach de l'ordre de l'unité. A l'inverse en régime nominal l'écoulement peut être stationnaire, à bas nombre de Mach. De plus quelque soit le régime considéré, la complexité de la géométrie d'un générateur de vapeur conduit à modéliser le faisceau de tubes par un milieu poreux, d'où le problème de couplage à l'interface avec le milieu fluide.Un schéma de correction de pression tout-Mach en volumes finis colocalisés a été introduit pour les équations d'Euler et de Navier-Stokes. L'existence d'une solution discrète, la consistance du schéma au sens de Lax et la positivité de l'énergie interne ont été démontrées. Le schéma a été ensuite étendu aux modèles diphasiques homogènes du code GENEPI développé au CEA. Enfin un algorithme Multigrille-AMR a été adaptée pour permettre de mettre en oeuvre notre schéma sur des maillages adaptatifs.Concernant la seconde problématique, une extension de la loi de Beavers-Joseph a été proposée pour le régime convectif. En introduisant un saut d'énergie cinétique à l'interface, on retrouve une loi de type Beavers-Joseph mais avec un coefficient de glissement non-linéaire, qui dépend de la vitesse fluide à l'interface et de la vitesse Darcy. La validité de cette nouvelle condition d'interface a été évaluée en réalisant des calculs de simulation numérique directe à différents nombres de Reynolds. / The numerical simulation of steam generators of pressurized water reactors is a complex problem, involving different flow regimes and a wide range of length and time scales. An accidental scenario may be associated with very fast variations of the flow with an important Mach number. In contrast in the nominal regime the flow may be stationary, at low Mach number. Moreover whatever the regime under consideration, the array of U-tubes is modelled by a porous medium in order to avoid taking into account the complex geometry of the steam generator, which entails the issue of the coupling conditions at the interface with the free-fluid.We propose a new pressure-correction scheme for cell-centered finite volumes for solving the compressible Navier-Stokes and Euler equations at all Mach number. The existence of a discrete solution, the consistency of the scheme in the Lax sense and the positivity of the internal energy were proved. Then the scheme was extended to the homogeneous two-phase flow models of the GENEPI code developed at CEA. Lastly a multigrid-AMR algorithm was adapted for using our pressure-correction scheme on adaptive grids.Regarding the second issue addressed in this work, an extension to the Beavers-Joseph law was proposed for the convective regime. By introducing a jump in the kinetic energy at the interface, we recover an interface condition close to the Beavers-Joseph law but with a non-linear slip coefficient, which depends on the free-fluid velocity at the interface and on the Darcy velocity. The validity of this new transmission condition was assessed with direct numerical simulations at different Reynolds numbers.

With the rapid increase in available compute power and memory, and bolstered by the advent of efficient formulations and algorithms, the role of 3D full-wave computational methods for accurate modelling of complex electromagnetic (EM) structures has gained in significance. The range of problems includes Radar Cross Section (RCS) computation, analysis and design of antennas and passive microwave circuits, bio-medical non-invasive detection and therapeutics, energy harvesting etc. Further, with the rapid advances in technology trends like System-in-Package (SiP) and System-on-Chip (SoC), the fidelity of chip-to-chip communication and package-board electrical performance parameters like signal integrity (SI), power integrity (PI), electromagnetic interference (EMI) are becoming increasingly critical. Rising pin-counts to satisfy functionality requirements and decreasing layer-counts to maintain cost-effectiveness necessitates 3D full wave electromagnetic solution for accurate system modelling. Method of Moments (MoM) is one such widely used computational technique to solve a 3D electromagnetic problem with full-wave accuracy. Due to lesser number of mesh elements or discretization on the geometry, MoM has an advantage of a smaller matrix size. However, due to Green's Function interactions, the MoM matrix is dense and its solution presents a time and memory challenge. The thesis focuses on formulation and development of novel techniques that aid in fast MoM based electromagnetic solutions. With the recent paradigm shift in computer hardware architectures transitioning from single-core microprocessors to multi-core systems, it is of prime importance to parallelize the serial electromagnetic formulations in order to leverage maximum computational benefits. Therefore, the thesis explores the possibilities to expedite an electromagnetic simulation by scalable parallelization of near-linear complexity algorithms like Fast Multipole Method (FMM) on a multi-core platform. Secondly, with the best of parallelization strategies in place and near-linear complexity algorithms in use, the solution time of a complex EM problem can still be exceedingly large due to over-meshing of the geometry to achieve a desired level of accuracy. Hence, the thesis focuses on judicious placement of mesh elements on the geometry to capture the physics of the problem without compromising on accuracy- a technique called Adaptive Mesh Refinement. This facilitates a reduction in the number of solution variables or degrees of freedom in the system and hence the solution time. For multi-scale structures as encountered in chip-package-board systems, the MoM formulation breaks down for parts of the geometry having dimensions much smaller as compared to the operating wavelength. This phenomenon is popularly known as low-frequency breakdown or low-frequency instability. It results in an ill-conditioned MoM system matrix, and hence higher iteration count to converge when solved using an iterative solver framework. This consequently increases the solution time of simulation. The thesis thus proposes novel formulations to improve the spectral properties of the system matrix for real-world complex conductor and dielectric structures and hence form well-conditioned systems. This reduces the iteration count considerably for convergence and thus results in faster solution. Finally, minor changes in the geometrical design layouts can adversely affect the time-to-market of a commodity or a product. This is because the intermediate design variants, in spite of having similarities between them are treated as separate entities and therefore have to follow the conventional model-mesh-solve workflow for their analysis. This is a missed opportunity especially for design variant problems involving near-identical characteristics when the information from the previous design variant could have been used to expedite the simulation of the present design iteration. A similar problem occurs in the broadband simulation of an electromagnetic structure. The solution at a particular frequency can be expedited manifold if the matrix information from a frequency in its neighbourhood is used, provided the electrical characteristics remain nearly similar. The thesis introduces methods to re-use the subspace or Eigen-space information of a matrix from a previous design or frequency to solve the next incremental problem faster.

Heat transfer and solidification models were developed for use in a numerical model of a continuous caster to provide a means of predicting how the developing shell would react under variable operating conditions. Measurement data of the operating conditions leading up to a breakout occurrence were provided by an industrial collaborator and were used to define the model boundary conditions. Steady-state and transient simulations were conducted, using boundary conditions defined from time-averaged measurement data. The predicted shell profiles demonstrated good agreement with thickness measurements of a breakout shell segment – recovered from the quarter-width location. Further examination of the results with measurement data suggests pseudo-steady assumption may be inadequate for modeling shell and flow field transition period following sudden changes in casting speed. An adaptive mesh refinement procedure was established to increase refinement in areas of predicted shell growth and to remove excess refinement from regions containing only liquid. A control algorithm was developed and employed to automate the refinement procedure in a proof-of-concept simulation. The use of adaptive mesh refinement was found to decrease the total simulation time by approximately 11% from the control simulation – using a static mesh.

This paper is concerned with mesh refinement techniques for treating elliptic boundary value problems in domains with re- entrant edges and corners, and focuses on numerical experiments. After a section about the model problem and discretization strategies, their realization in the experimental code FEMPS3D is described. For two representative examples the numerically determined error norms are recorded, and various mesh refinement strategies are compared.

Dans un contexte industriel, l’utilisation de modèles diphasiques d’ordre réduit est nécessaire pour pouvoir effectuer des simulations numériques prédictives d’injection de combustible liquide dans les chambres de combustion automobiles et aéronautiques, afin de concevoir des équipements plus performants et moins polluants. Le processus d’atomisation du combustible, depuis sa sortie de l’injecteur sous un régime de phases séparées, jusqu’au brouillard de gouttelettes dispersées, est l’un des facteurs clés d’une combustion de bonne qualité. Aujourd’hui cependant, la prise en compte de toutes les échelles physiques impliquées dans ce processus nécessite une avancée majeure en termes de modélisation, de méthodes numériques et de calcul haute performance (HPC). Ces trois aspects sont abordés dans cette thèse. Premièrement, des modèles de mélange, dérivés par le principe variationnel de Hamilton et le second principe de la thermodynamique sont étudiés. Ils sont alors enrichis afin de pouvoir décrire des pulsations des interfaces au niveau de la sous-échelle. Des comparaisons avec des données expérimentales dans un contexte de milieux à bulles permettent de vérifier la cohérence physique des modèles et de valider la méthodologie. Deuxièmement, une stratégie de discrétisation est développée, basée sur une séparation d’opérateur, permettant la résolution indépendante de la partie convective des systèmes à l’aide de solveurs de Riemann approchés standards et les termes sources à l’aide d’intégrateurs d’équations différentielles ordinaires. Ces différentes méthodes répondent aux particularités des systèmes diphasiques compressibles, ainsi qu’au choix de l’utilisation de maillages adaptatifs (AMR). Pour ces derniers, une stratégie spécifique est développée : il s’agit du choix de critères de raffinement et de la projection de la solution d’une grille à une autre (plus fine ou plus grossière). Enfin, l’utilisation de l’AMR dans un cadre HPC est rendue possible grâce à la bibliothèque AMR p4est, laquelle a montré une excellente scalabilité jusqu’à plusieurs milliers de coeurs de calcul. Un code applicatif, CanoP, a été développé et permet de simuler des écoulements fluides avec des méthodes de volumes finis sur des maillages AMR. CanoP pourra être utilisé pour des futures simulations d’atomisation liquide. / In an industrial context, reduced-order two-phase models are used in predictive simulations of the liquid fuel injection in combustion chambers and help designing more efficient and less polluting devices. The combustion quality strongly depends on the atomization process, starting from the separated phase flow at the exit of the nozzle down to the cloud of fuel droplets characterized by a disperse-phase flow. Today, simulating all the physical scales involved in this process requires a major breakthrough in terms of modeling, numerical methods and high performance computing (HPC). These three aspects are addressed in this thesis. First, we are interested in mixture models, derived through Hamilton’s variational principle and the second principle of thermodynamics. We enrich these models, so that they can describe sub-scale pulsations mechanisms. Comparisons with experimental data in a context of bubbly flows enables to assess the models and the methodology. Based on a geometrical study of the interface evolution, new tracks are then proposed for further enriching the mixture models using the same methodology. Second, we propose a numerical strategy based on finite volume methods composed of an operator splitting strategy, approximate Riemann solvers for the resolution of the convective part and specific ODE solvers for the source terms. These methods have been adapted so as to handle several difficulties related to two-phase flows, like the large acoustic impedance ratio, the stiffness of the source terms and low-Mach issues. Moreover, a cell-based Adaptive Mesh Refinement (AMR) strategy is considered. This involves to develop refinement criteria, the setting of the solution values on the new grids and to adapt the standard methods for regular structured grids to non-conforming grids. Finally, the scalability of this AMR tool relies on the p4est AMR library, that shows excellent scalability on several thousands cores. A code named CanoP has been developed and enables to solve fluid dynamics equations on AMR grids. We show that CanoP can be used for future simulations of the liquid atomization.

The effect of building geometry on the wind environment of cities is such that it can cause problems like wind danger, discomfort and poor ventilation of airborne pollutants. Computational fluid dynamics (CFD) can play a role in assessing changes in wind environment caused by building projects before realisation at little cost. However, the current state-of-the-art methods, RANS and LES, force a steep trade-off between accuracy and computational cost, and neither method is truly predictive. Time-resolved adaptive direct finite element simulation (DFS) is a method for CFD that is predictive and automatically optimises the mesh for a goal quantity, making it both efficient and accurate. In this thesis, DFS was implemented in FEniCS and used on basic validation cases to provide a proof of concept for the use of this method in the building aerodynamics, on resources freely available to anyone. The results show that the method is accurate to within 10% of the validation data with respect to the goal quantity. Visually, the expected flow features are clearly identifiable. DFS was successfully applied to a relatively complicated building geometry, with a total computation time of about 120 core-hours. We conclude that DFS has significant potential as a method for evaluating urban wind environments. Furthermore, because of its ease of use and lack of parameters, DFS can play an important role in helping architects, designers and students understand the effect of urban geometries on the wind environment. This report provides a basis for further research on DFS for building aerodynamics, as validation on more diverse urban geometries is still necessary. / Effekten av byggnaders form och geometri är så viktig att den kan ge problem för ventilation av t.ex. föroreningar, för energieffektivitet, och för vindfaror med t.ex. hög vindhastihet som kan vara farligt eller skapa obehag. Beräkningsströmningsdynamik (CFD) kan ha en roll i bedömningen av byggnadsprojekt i ett tidigt skede till liten kostnad. Dock är de etablerade och ledande metodikerna, RANS och LES, inte prediktiva och tvingar fram en kompromiss mellan beräkningskosnad och noggrannhet. Vår metodik “Time-resolved adaptive direct finite element simulation” (DFS) är en metod för CFD som är prediktiv och automatiskt optimerar beräkningsnätet (och därmed beräkningskostnaden) för en given målkvantitet, som ger både effektivitet och noggrannhet. I denna avhandling implementerades DFS i FEniCS och användes i grundläggande valideringsfall för att ge ett proof of conceptför användning av denna metod i byggnadsaerodynamik, på resurser som är fritt tillgängliga för alla. Resultaten visar att metoden är korrekt inom 10% av valideringsdata med avseende på målkvantiteten. Visuellt är de förväntade flödesfunktionerna tydligt identifierbara. DFS applicerades framgångsrikt på en relativt komplicerad byggnadsgeometri med en total beräkningstid på cirka 120 kärntimmar, vilket är en försumbar kostnad. Vi drar slutsatsen att DFS har en betydande potential som metod för utvärdering av stadsvindmiljöer. Dessutom, på grund av dess användarvänlighet och frihet från parametrar, kan DFS spela en viktig roll för att hjälpa arkitekter, designers och studenter att förstå effekterna av stadsgeometrier på vindmiljön. Denna rapport ger en grund för vidare forskning om DFS för aerodynamik, eftersom validering av mer olika stadsgeometrier fortfarande är nödvändig.

Formoptimierung bezeichnet die Bestimmung der Geometrischen Gestalt eines Gebietes auf dem eine partielle Differentialgleichung (PDE) wirkt, sodass bestimmte gegebene Zielgrößen, welche von der Lösung der PDE abhängen, Extrema annehmen. Bei der Diskret Adjungierten Methode wird der Gradient einer Zielgröße bezüglich einer beliebigen Anzahl von Formparametern mit Hilfe der Lösung einer adjungierten Gleichung der diskretisierten PDE effizient ermittelt. Dieser Gradient wird dann in Verfahren der numerischen Optimierung verwendet um eine optimale Lösung zu suchen. Da sowohl die Zielgröße als auch der Gradient für die diskretisierte PDE ermittelt werden, sind beide zunächst vom verwendeten Netz abhängig. Bei groben Netzen sind sogar Unstetigkeiten der diskreten Zielfunktion zu erwarten, wenn bei Änderungen der Formparameter sich das Netz unstetig ändert (z.B. Änderung Anzahl Knoten, Umschalten der Konnektivität). Mit zunehmender Feinheit der Netze verschwinden jedoch diese Unstetigkeiten aufgrund der Konvergenz der Diskretisierung. Da im Zuge der Formoptimierung Zielgröße und Gradient für eine Vielzahl von Iterierten der Lösung bestimmt werden müssen, ist man bestrebt die Kosten einer einzelnen Auswertung möglichst gering zu halten, z.B. indem man mit nur moderat feinen oder adaptiv verfeinerten Netzen arbeitet. Aufgabe dieser Diplomarbeit ist es zu untersuchen, ob mit gängigen Methoden adaptiv verfeinerte Netze hinreichende Genauigkeit der Auswertung von Zielgröße und Gradient erlauben und ob eventuell Anpassungen der Optimierungsstrategie an die adaptive Vernetzung notwendig sind. Für die Untersuchungen sind geeignete Modellprobleme aus der Festigkeitslehre zu wählen und zu untersuchen. / Shape optimization describes the determination of the geometric shape of a domain with a partial differential equation (PDE) with the purpose that a specific given performance function is minimized, its values depending on the solution of the PDE. The Discrete Adjoint Method can be used to evaluate the gradient of a performance function with respect to an arbitrary number of shape parameters by solving an adjoint equation of the discretized PDE. This gradient is used in the numerical optimization algorithm to search for the optimal solution. As both function value and gradient are computed for the discretized PDE, they both fundamentally depend on the discretization. In using the coarse meshes, discontinuities in the discretized objective function can be expected if the changes in the shape parameters cause discontinuous changes in the mesh (e.g. change in the number of nodes, switching of connectivity). Due to the convergence of the discretization these discontinuities vanish with increasing fineness of the mesh. In the course of shape optimization, function value and gradient require evaluation for a large number of iterations of the solution, therefore minimizing the costs of a single computation is desirable (e.g. using moderately or adaptively refined meshes). Overall, the task of the diploma thesis is to investigate if adaptively refined meshes with established methods offer sufficient accuracy of the objective value and gradient, and if the optimization strategy requires readjustment to the adaptive mesh design. For the investigation, applicable model problems from the science of the strength of materials will be chosen and studied.

Die vorliegende Arbeit "Adaptive Discontinuous Petrov-Galerkin Finite-Element-Methods" beweist optimale Konvergenzraten für vier diskontinuierliche Petrov-Galerkin (dPG) Finite-Elemente-Methoden für das Poisson-Modell-Problem für genügend feine Anfangstriangulierung. Sie zeigt dazu die Äquivalenz dieser vier Methoden zu zwei anderen Klassen von Methoden, den reduzierten gemischten Methoden und den verallgemeinerten Least-Squares-Methoden. Die erste Klasse benutzt ein gemischtes System aus konformen Courant- und nichtkonformen Crouzeix-Raviart-Finite-Elemente-Funktionen. Die zweite Klasse verallgemeinert die Standard-Least-Squares-Methoden durch eine Mittelpunktsquadratur und Gewichtsfunktionen. Diese Arbeit verallgemeinert ein Resultat aus [Carstensen, Bringmann, Hellwig, Wriggers 2018], indem die vier dPG-Methoden simultan als Spezialfälle dieser zwei Klassen charakterisiert werden. Sie entwickelt alternative Fehlerschätzer für beide Methoden und beweist deren Zuverlässigkeit und Effizienz. Ein Hauptresultat der Arbeit ist der Beweis optimaler Konvergenzraten der adaptiven Methoden durch Beweis der Axiome aus [Carstensen, Feischl, Page, Praetorius 2014]. Daraus folgen dann insbesondere die optimalen Konvergenzraten der vier dPG-Methoden. Numerische Experimente bestätigen diese optimalen Konvergenzraten für beide Klassen von Methoden. Außerdem ergänzen sie die Theorie durch ausführliche Vergleiche beider Methoden untereinander und mit den äquivalenten dPG-Methoden. / The thesis "Adaptive Discontinuous Petrov-Galerkin Finite-Element-Methods" proves optimal convergence rates for four lowest-order discontinuous Petrov-Galerkin methods for the Poisson model problem for a sufficiently small initial mesh-size in two different ways by equivalences to two other non-standard classes of finite element methods, the reduced mixed and the weighted Least-Squares method. The first is a mixed system of equations with first-order conforming Courant and nonconforming Crouzeix-Raviart functions. The second is a generalized Least-Squares formulation with a midpoint quadrature rule and weight functions. The thesis generalizes a result on the primal discontinuous Petrov-Galerkin method from [Carstensen, Bringmann, Hellwig, Wriggers 2018] and characterizes all four discontinuous Petrov-Galerkin methods simultaneously as particular instances of these methods. It establishes alternative reliable and efficient error estimators for both methods. A main accomplishment of this thesis is the proof of optimal convergence rates of the adaptive schemes in the axiomatic framework [Carstensen, Feischl, Page, Praetorius 2014]. The optimal convergence rates of the four discontinuous Petrov-Galerkin methods then follow as special cases from this rate-optimality. Numerical experiments verify the optimal convergence rates of both types of methods for different choices of parameters. Moreover, they complement the theory by a thorough comparison of both methods among each other and with their equivalent discontinuous Petrov-Galerkin schemes.

L’objectif de ce travail de thèse est de proposer la Méthodes des éléments finis de Galerkin discontinus (DGFEM) à la discrétisation des équations compressibles de Navier-Stokes. Plusieurs challenges font l’objet de ce travail. Le premier aspect a consisté à montrer l’ordre de convergence optimal de la méthode DGFEM en utilisant les polynômes d’interpolation d’ordre élevé. Le deuxième aspect concerne l’implémentation de méthodes de ‘‘shock-catpuring’’ comme les limiteurs de pentes et les méthodes de viscosité artificielle pour supprimer les oscillations numériques engendrées par l’ordre élevé (lorsque des polynômes d’interpolation de degré p>0 sont utilisés) dans les écoulements transsoniques et supersoniques. Ensuite nous avons implémenté des estimateurs d’erreur a posteriori et des procédures d ’adaptation de maillages qui permettent d’augmenter la précision de la solution et la vitesse de convergence afin d’obtenir un gain de temps considérable. Finalement, nous avons montré la capacité de la méthode DG à donner des résultats corrects à faibles nombres de Mach. Lorsque le nombre de Mach est petit pour les écoulements compressibles à la limite de l’incompressible, la solution souffre généralement de convergence et de précision. Pour pallier ce problème généralement on procède au préconditionnement qui modifie les équations d’Euler. Dans notre cas, les équations ne sont pas modifiées. Dans ce travail, nous montrons la précision et la robustesse de méthode DG proposée avec un schéma en temps implicite de second ordre et des conditions de bords adéquats. / The aim of this thesis is to deal with compressible Navier-Stokes flows discretized by Discontinuous Galerkin Finite Elements Methods. Several aspects has been considered. One is to show the optimal convergence of the DGFEM method when using high order polynomial. Second is to design shock-capturing methods such as slope limiters and artificial viscosity to suppress numerical oscillation occurring when p>0 schemes are used. Third aspect is to design an a posteriori error estimator for adaptive mesh refinement in order to optimize the mesh in the computational domain. And finally, we want to show the accuracy and the robustness of the DG method implemented when we reach very low mach numbers. Usually when simulating compressible flows at very low mach numbers at the limit of incompressible flows, there occurs many kind of problems such as accuracy and convergence of the solution. To be able to run low Mach number problems, there exists solution like preconditioning. This method usually modifies the Euler. Here the Euler equations are not modified and with a robust time scheme and good boundary conditions imposed one can have efficient and accurate results.

Garantierte untere Eigenwertschranken (GLB) für elliptische Eigenwertprobleme partieller Differentialgleichungen sind in der Theorie sowie in praktischen Anwendungen relevant. Auf Grund des Rayleigh-Ritz- (oder) min-max-Prinzips berechnen alle konformen Finite-Elemente-Methoden (FEM) garantierte obere Schranken. Ein Postprocessing nichtkonformer Methoden von Carstensen und Gedicke (Math. Comp., 83.290, 2014) sowie Carstensen und Gallistl (Numer. Math., 126.1, 2014) berechnet GLB. In diesen Schranken ist die maximale Netzweite ein globaler Parameter, das kann bei adaptiver Netzverfeinerung zu deutlichen Unterschätzungen führen. In einigen numerischen Beispielen versagt dieses Postprocessing für lokal verfeinerte Netze komplett. Diese Dissertation präsentiert, inspiriert von einer neuen skeletal-Methode von Carstensen, Zhai und Zhang (SIAM J. Numer. Anal., 58.1, 2020), einerseits eine modifizierte hybrid-high-order Methode (m=1) und andererseits ein allgemeines Framework für extra-stabilisierte nichtkonforme Crouzeix-Raviart (m=1) bzw. Morley (m=2) FEM. Diese neuen Methoden berechnen direkte GLB für den m-Laplace-Operator, bei denen eine leicht überprüfbare Bedingung an die maximale Netzweite garantiert, dass der k-te diskrete Eigenwert eine untere Schranke für den k-ten Dirichlet-Eigenwert ist. Diese GLB-Eigenschaft und a priori Konvergenzraten werden für jede Raumdimension etabliert. Der neu entwickelte Ansatz erlaubt adaptive Netzverfeinerung, die für optimale Konvergenzraten auch bei nichtglatten Eigenfunktionen erforderlich ist. Die Überlegenheit der neuen adaptiven FEM wird durch eine Vielzahl repräsentativer numerischer Beispiele illustriert. Für die extra-stabilisierte GLB wird bewiesen, dass sie mit optimalen Raten gegen einen einfachen Eigenwert konvergiert, indem die Axiome der Adaptivität von Carstensen, Feischl, Page und Praetorius (Comput. Math. Appl., 67.6, 2014) sowie Carstensen und Rabus (SIAM J. Numer. Anal., 55.6, 2017) verallgemeinert werden. / Guaranteed lower eigenvalue bounds (GLB) for elliptic eigenvalue problems of partial differential equation are of high relevance in theory and praxis. Due to the Rayleigh-Ritz (or) min-max principle all conforming finite element methods (FEM) provide guaranteed upper eigenvalue bounds. A post-processing for nonconforming FEM of Carstensen and Gedicke (Math. Comp., 83.290, 2014) as well as Carstensen and Gallistl (Numer. Math., 126.1,2014) computes GLB. However, the maximal mesh-size enters as a global parameter in the eigenvalue bound and may cause significant underestimation for adaptive mesh-refinement. There are numerical examples, where this post-processing on locally refined meshes fails completely. Inspired by a recent skeletal method from Carstensen, Zhai, and Zhang (SIAM J. Numer. Anal., 58.1, 2020) this thesis presents on the one hand a modified hybrid high-order method (m=1) and on the other hand a general framework for an extra-stabilized nonconforming Crouzeix-Raviart (m=1) or Morley (m=2) FEM. These novel methods compute direct GLB for the m-Laplace operator in that a specific smallness assumption on the maximal mesh-size guarantees that the computed k-th discrete eigenvalue is a lower bound for the k-th Dirichlet eigenvalue. This GLB property as well as a priori convergence rates are established in any space dimension. The novel ansatz allows for adaptive mesh-refinement necessary to recover optimal convergence rates for non-smooth eigenfunctions. Striking numerical evidence indicates the superiority of the new adaptive eigensolvers. For the extra-stabilized nonconforming methods (a generalization of) known abstract arguments entitled as the axioms of adaptivity from Carstensen, Feischl, Page, and Praetorius (Comput. Math. Appl., 67.6, 2014) as well as Carstensen and Rabus (SIAM J. Numer. Anal., 55.6, 2017) allow to prove the convergence of the GLB towards a simple eigenvalue with optimal rates.