• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 10
  • 4
  • 1
  • Tagged with
  • 15
  • 15
  • 5
  • 5
  • 4
  • 4
  • 4
  • 4
  • 4
  • 4
  • 4
  • 4
  • 3
  • 3
  • 3
  • 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.
11

Uma formulação implícita para o método Smoothed Particle Hydrodynamics / An implicit formulation for the Smoothed Particle Hydrodynamics Method

Ricardo Dias dos Santos 17 February 2014 (has links)
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Em uma grande gama de problemas físicos, governados por equações diferenciais, muitas vezes é de interesse obter-se soluções para o regime transiente e, portanto, deve-se empregar técnicas de integração temporal. Uma primeira possibilidade seria a de aplicar-se métodos explícitos, devido à sua simplicidade e eficiência computacional. Entretanto, esses métodos frequentemente são somente condicionalmente estáveis e estão sujeitos a severas restrições na escolha do passo no tempo. Para problemas advectivos, governados por equações hiperbólicas, esta restrição é conhecida como a condição de Courant-Friedrichs-Lewy (CFL). Quando temse a necessidade de obter soluções numéricas para grandes períodos de tempo, ou quando o custo computacional a cada passo é elevado, esta condição torna-se um empecilho. A fim de contornar esta restrição, métodos implícitos, que são geralmente incondicionalmente estáveis, são utilizados. Neste trabalho, foram aplicadas algumas formulações implícitas para a integração temporal no método Smoothed Particle Hydrodynamics (SPH) de modo a possibilitar o uso de maiores incrementos de tempo e uma forte estabilidade no processo de marcha temporal. Devido ao alto custo computacional exigido pela busca das partículas a cada passo no tempo, esta implementação só será viável se forem aplicados algoritmos eficientes para o tipo de estrutura matricial considerada, tais como os métodos do subespaço de Krylov. Portanto, fez-se um estudo para a escolha apropriada dos métodos que mais se adequavam a este problema, sendo os escolhidos os métodos Bi-Conjugate Gradient (BiCG), o Bi-Conjugate Gradient Stabilized (BiCGSTAB) e o Quasi-Minimal Residual (QMR). Alguns problemas testes foram utilizados a fim de validar as soluções numéricas obtidas com a versão implícita do método SPH. / In a wide range of physical problems governed by differential equations, it is often of interest to obtain solutions for the unsteady state and therefore it must be employed temporal integration techniques. One possibility could be the use of an explicit methods due to its simplicity and computational efficiency. However, these methods are often only conditionally stable and are subject to severe restrictions for the time step choice. For advective problems governed by hyperbolic equations, this restriction is known as the Courant-Friedrichs-Lewy (CFL) condition. When there is the need to obtain numerical solutions for long periods of time, or when the computational cost for each time step is high, this condition becomes a handicap. In order to overcome this restriction implicit methods can be used, which are generally unconditionally stable. In this study, some implicit formulations for time integration are used in the Smoothed Particle Hydrodynamics (SPH) method to enable the use of larger time increments and obtain a strong stability in the time evolution process. Due to the high computational cost required by the particles tracking at each time step, the implementation will be feasible only if efficient algorithms were applied for this type of matrix structure such as Krylov subspace methods. Therefore, we carried out a study for the appropriate choice of methods best suited to this problem, and the methods chosen were the Bi-Conjugate Gradient (BiCG), the Bi-Conjugate Gradient Stabilized (BiCGSTAB) and the Quasi-Minimal Residual(QMR). Some test problems were used to validate the numerical solutions obtained with the implicit version of the SPH method.
12

\"Simulações de escoamentos tridimensionais bifásicos empregando métodos adaptativos e modelos de campo fase\" / \"Simulations of 3D two-phase flows using adaptive methods and phase field models\"

Rudimar Luiz Nós 20 March 2007 (has links)
Este é o primeiro trabalho que apresenta simulações tridimensionais completamente adaptativas de um modelo de campo de fase para um fluido incompressível com densidade de massa constante e viscosidade variável, conhecido como Modelo H. Solucionando numericamente as equações desse modelo em malhas refinadas localmente com a técnica AMR, simulamos computacionalmente escoamentos bifásicos tridimensionais. Os modelos de campo de fase oferecem uma aproximação física sistemática para investigar fenômenos que envolvem sistemas multifásicos complexos, tais como fluidos com camadas de mistura, a separação de fases sob forças de cisalhamento e a evolução de micro-estruturas durante processos de solidificação. Como as interfaces são substituídas por delgadas regiões de transição (interfaces difusivas), as simulações de campo de fase requerem muita resolução nessas regiões para capturar corretamente a física do problema em estudo. Porém essa não é uma tarefa fácil de ser executada numericamente. As equações que caracterizam o modelo de campo de fase contêm derivadas de ordem elevada e intrincados termos não lineares, o que exige uma estratégia numérica eficiente capaz de fornecer precisão tanto no tempo quanto no espaço, especialmente em três dimensões. Para obter a resolução exigida no tempo, usamos uma discretização semi-implícita de segunda ordem para solucionar as equações acopladas de Cahn-Hilliard e Navier-Stokes (Modelo H). Para resolver adequadamente as escalas físicas relevantes no espaço, utilizamos malhas refinadas localmente que se adaptam dinamicamente para recobrir as regiões de interesse do escoamento, como por exemplo, as vizinhanças das interfaces do fluido. Demonstramos a eficiência e a robustez de nossa metodologia com simulações que incluem a separação dos componentes de uma mistura bifásica, a deformação de gotas sob cisalhamento e as instabilidades de Kelvin-Helmholtz. / This is the first work that introduces 3D fully adaptive simulations for a phase field model of an incompressible fluid with matched densities and variable viscosity, known as Model H. Solving numerically the equations of this model in meshes locally refined with AMR technique, we simulate computationally tridimensional two-phase flows. Phase field models offer a systematic physical approach to investigate complex multiphase systems phenomena such as fluid mixing layers, phase separation under shear and microstructure evolution during solidification processes. As interfaces are replaced by thin transition regions (diffuse interfaces), phase field simulations need great resolution in these regions to capture correctly the physics of the studied problem. However, this is not an easy task to do numerically. Phase field model equations have high order derivatives and intricate nonlinear terms, which require an efficient numerical strategy that can achieve accuracy both in time and in space, especially in three dimensions. To obtain the required resolution in time, we employ a semi-implicit second order discretization scheme to solve the coupled Cahn-Hilliard/Navier-Stokes equations (Model H). To resolve adequatly the relevant physical scales in space, we use locally refined meshes which adapt dynamically to cover special flow regions, e.g., the vicinity of the fluid interfaces. We demonstrate the efficiency and robustness of our methodology with simulations that include spinodal decomposition, the deformation of drops under shear and Kelvin-Helmholtz instabilities.
13

Calcul parallèle et méthodes numériques pour la simulation de plasmas de bords / Parallel computing and numerical methods for boundary plasma simulations

Kuhn, Matthieu 29 September 2014 (has links)
L'amélioration du code Emedge3D (code de bord électromagnétique) est abordée sous plusieurs axes. Premier axe, des innovations sur les méthodes numériques ont été mises en oeuvre. L'avantage des méthodes de type semi-implicite est décrit, leur stabilité inconditionnelle permet l'augmentation du pas de temps, et donc la diminution du nombre d'itérations temporelles requises pour une simulation. Les avantages de la montée en ordre en espace et en temps sont détaillés. Deuxième axe, des réponses sont proposées pour la parallélisation du code. Le cadre de cette étude est proche du problème général d'advection-diffusion non linéaire. Les parties coûteuses ont tout d'abord été optimisées séquentiellement puis fait l'objet d'une parallélisation OpenMP. Pour la partie du code la plus sensible aux contraintes de bande passante mémoire, une solution parallèle MPI sur machine à mémoire distribuée est décrite et analysée. Une bonne extensibilité est observée jusque 384 cœurs. Cette thèse s'inscrit dans le projet interdisciplinaire ANR E2T2 (CEA/IRFM, Université Aix-Marseille/PIIM, Université Strasbourg/Icube). / The main goal of this work is to significantly reduce the computational cost of the scientific application Emedge3D, simulating the edge of tokamaks. Improvements to this code are made on two axes. First, innovations on numerical methods have been implemented. The advantage of semi-implicit time schemes are described. Their inconditional stability allows to consider larger timestep values, and hence to lower the number of temporal iteration required for a simulation. The benefits of a high order (time and space) are also presented. Second, solutions to the parallelization of the code are proposed. This study addresses the more general non linear advection-diffusion problem. The hot spots of the application have been sequentially optimized and parallelized with OpenMP. Then, a hybrid MPI OpenMP parallel algorithm for the memory bound part of the code is described and analyzed. Good scalings are observed up to 384 cores. This Ph. D. thesis is part of the interdisciplinary project ANR E2T2 (CEA/IRFM, University of Aix-Marseille/PIIM, University of Strasbourg/ICube).
14

Development of a high-order residual distribution method for Navier-Stokes and RANS equations / Schémas d'ordre élevé distribuant le résidu pour la résolution des équations de Navier-Stokes et Navier-Stokes moyennées (RANS)

De Santis, Dante 03 December 2013 (has links)
Cette thèse présente la construction de schémas distribuant le résidu (RD) d'ordre très élevés, pour la discrétisation d'équations d'advection-diffusion multidimensionnelles et stationnaires sur maillages non structurés. Des schémas linéaires ainsi que des schémas non linéaires sont considérés. Une approximation de la solution polynomiale par morceaux et continue sur chaque élément est adoptée, de plus une procédure de reconstruction du gradient que celle de la solution numérique est utilisée afin d'avoir une représentation continue de la solution numérique et de son gradient. Il est montré que le gradient doit être reconstruit avec la même précision de la solution, sans quoi la précision formel du schéma numérique est perdue dans les cas où les effets de diffusion prévalent sur les effets d'advection, et aussi quand l'advection et la diffusion sont également importants. Ensuite, la méthode est étendue à des systèmes d'équations, en particulier aux équations de Navier-Stokes et aux équations RANS. La précision, l'efficacité et la robustesse du solveur RD implicite sont démontrées sur plusieurs cas tests. / The construction of compact high-order Residual Distribution schemes for the discretizationof steady multidimensional advection-diffusion problems on unstructuredgrids is presented. Linear and non-linear scheme are considered. A piecewise continuouspolynomial approximation of the solution is adopted and a gradient reconstructionprocedure is used in order to have a continuous representation of both thenumerical solution and its gradient. It is shown that the gradient must be reconstructedwith the same accuracy of the solution, otherwise the formal accuracy ofthe numerical scheme is lost in applications in which diffusive effects prevail overthe advective ones, and when advection and diffusion are equally important. Thenthe method is extended to systems of equations, with particular emphasis on theNavier-Stokes and RANS equations. The accuracy, efficiency, and robustness of theimplicit RD solver is demonstrated using a variety of challenging aerodynamic testproblems.
15

Numerical Methods for Model Reduction of Time-Varying Descriptor Systems

Hossain, Mohammad Sahadet 07 September 2011 (has links)
This dissertation concerns the model reduction of linear periodic descriptor systems both in continuous and discrete-time case. In this dissertation, mainly the projection based approaches are considered for model order reduction of linear periodic time varying descriptor systems. Krylov based projection method is used for large continuous-time periodic descriptor systems and balancing based projection technique is applied to large sparse discrete-time periodic descriptor systems to generate the reduce systems. For very large dimensional state space systems, both the techniques produce large dimensional solutions. Hence, a recycling technique is used in Krylov based projection methods which helps to compute low rank solutions of the state space systems and also accelerate the computational convergence. The outline of the proposed model order reduction procedure is given with more details. The accuracy and suitability of the proposed method is demonstrated through different examples of different orders. Model reduction techniques based on balance truncation require to solve matrix equations. For periodic time-varying descriptor systems, these matrix equations are projected generalized periodic Lyapunov equations and the solutions are also time-varying. The cyclic lifted representation of the periodic time-varying descriptor systems is considered in this dissertation and the resulting lifted projected Lyapunov equations are solved to achieve the periodic reachability and observability Gramians of the original periodic systems. The main advantage of this solution technique is that the cyclic structures of projected Lyapunov equations can handle the time-varying dimensions as well as the singularity of the period matrix pairs very easily. One can also exploit the theory of time-invariant systems for the control of periodic ones, provided that the results achieved can be easily re-interpreted in the periodic framework. Since the dimension of cyclic lifted system becomes very high for large dimensional periodic systems, one needs to solve the very large scale periodic Lyapunov equations which also generate very large dimensional solutions. Hence iterative techniques, which are the generalization and modification of alternating directions implicit (ADI) method and generalized Smith method, are implemented to obtain low rank Cholesky factors of the solutions of the periodic Lyapunov equations. Also the application of the solvers in balancing-based model reduction of discrete-time periodic descriptor systems is discussed. Numerical results are given to illustrate the effciency and accuracy of the proposed methods.

Page generated in 0.0478 seconds