Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Adaptive mesh method.
Дисертації з теми "Adaptive mesh method"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Adaptive mesh method".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
1
Antepara, Zambrano Oscar Luis. "Adaptive mesh refinement method for CFD applications." Doctoral thesis, Universitat Politècnica de Catalunya, 2019. http://hdl.handle.net/10803/664931.
Повний текст джерелаАнотація:
The main objective of this thesis is the development of an adaptive mesh refinement (AMR) algorithm for computational fluid dynamics simulations using hexahedral and tetrahedral meshes. This numerical methodology is applied in the context of large-eddy simulations (LES) of turbulent flows and direct numerical simulations (DNS) of interfacial flows, to bring new numerical research and physical insight.
For the fluid dynamics simulations, the governing equations, the spatial discretization on unstructured grids and the numerical schemes for solving Navier-Stokes equations are presented. The equations follow a discretization by conservative finite-volume on collocated meshes. For the turbulent flows formulation, the spatial discretization preserves symmetry properties of the continuous differential operators and the time integration follows a self-adaptive strategy, which has been well tested on unstructured grids. Moreover, LES model consisting of a wall adapting local-eddy-viscosity within a variational multi-scale formulation is used for the applications showed in this thesis. For the two-phase flow formulation, a conservative level-set method is applied for capturing the interface between two fluids and is implemented with a variable density projection scheme to simulate incompressible two-phase flows on unstructured meshes.
The AMR algorithm developed in this thesis is based on a quad/octree data structure and keeps a relation of 1:2 between levels of refinement. In the case of tetrahedral meshes, a geometrical criterion is followed to keep the quality metric of the mesh on a reasonable basis. The parallelization strategy consists mainly in the creation of mesh elements in each sub-domain and establishes a unique global identification number, to avoid duplicate elements. Load balance is assured at each AMR iteration to keep the parallel performance of the CFD code. Moreover, a mesh multiplication algorithm (MM) is reported to create large meshes, with different kind of mesh elements, but preserving the topology from a coarser original mesh.
This thesis focuses on the study of turbulent flows and two-phase flows using an AMR framework. The cases studied for LES of turbulent flows applications are the flow around one and two separated square cylinders, and the flow around a simplified car model. In this context, a physics-based refinement criterion is developed, consisting of the residual velocity calculated from a multi-scale decomposition of the instantaneous velocity. This criteria ensures grid adaptation following the main vortical structures and giving enough mesh resolution on the zones of interest, i.e., flow separation, turbulent wakes, and vortex shedding.
The cases studied for the two-phase flows are the DNS of 2D and 3D gravity-driven bubble, with a particular focus on the wobbling regime. A study of rising bubbles in the wobbling regime and the effect of dimensionless numbers on the dynamic behavior of the bubbles are presented. Moreover, the use of tetrahedral AMR is applied for the numerical simulation of gravity-driven bubbles in complex domains. On this topic, the methodology is validated on bubbles rising in cylindrical channels with different topology, where the study of these cases contributed to having new numerical research and physical insight in the development of a rising bubble with wall effects.El objetivo principal de esta tesis es el desarrollo de un algoritmo adaptativo de refinamiento de malla (AMR) para simulaciones de dinámica de fluidos computacional utilizando mallas hexaédricas y tetraédricas. Esta metodología numérica se aplica en el contexto de simulaciones Large-eddie (LES) de flujos turbulentos y simulaciones numéricas directas (DNS) de flujos interfaciales, para traer nuevas investigaciones numéricas y entendimiento físicas. Para las simulaciones de dinámica de fluidos, se presentan las ecuaciones governantes, la discretización espacial en mallas no estructuradas y los esquemas numéricos para resolver las ecuaciones de Navier-Stokes. Las ecuaciones siguen una discretización conservativa por volumenes finitos en mallas colocadas. Para la formulación de flujos turbulentos, la discretización espacial preserva las propiedades de simetría de los operadores diferenciales continuos y la integración de tiempo sigue una estrategia autoadaptativa, que ha sido bien probada en mallas no estructuradas. Además, para las aplicaciones que se muestran en esta tesis, se utiliza el modelo LES que consiste en una viscosidad local que se adapta a la pared dentro de una formulación multiescala variable. Para la formulación de flujo de dos fases, se aplica un método de conjunto de niveles conservador para capturar la interfaz entre dos fluidos y se implementa con un esquema de proyección de densidad variable para simular flujos de dos fases incompresibles en mallas no estructuradas. El algoritmo AMR desarrollado en esta tesis se basa en una estructura de datos de quad / octree y mantiene una relación de 1: 2 entre los niveles de refinamiento. En el caso de las mallas tetraédricas, se sigue un criterio geométrico para mantener la calidad de la malla en una base razonable. La estrategia de paralelización consiste principalmente en la creación de elementos de malla en cada subdominio y establece un número de identificación global único, para evitar elementos duplicados. El equilibrio de carga está asegurado en cada iteración de AMR para mantener el rendimiento paralelo del código CFD. Además, se ha desarrollado un algoritmo de multiplicación de malla (MM) para crear mallas grandes, con diferentes tipos de elementos de malla, pero preservando la topología de una malla original más pequeña. Esta tesis se centra en el estudio de flujos turbulentos y flujos de dos fases utilizando un marco AMR. Los casos estudiados para aplicaciones de LES de flujos turbulentos son el flujo alrededor de uno y dos cilindros separados de sección cuadrada, y el flujo alrededor de un modelo de automóvil simplificado. En este contexto, se desarrolla un criterio de refinamiento basado en la física, que consiste en la velocidad residual calculada a partir de una descomposición de escala múltiple de la velocidad instantánea. Este criterio garantiza la adaptación de la malla siguiendo las estructuras vorticales principales y proporcionando una resolución de malla suficiente en las zonas de interés, es decir, separación de flujo, estelas turbulentas y desprendimiento de vórtices. Los casos estudiados para los flujos de dos fases son el DNS de la burbuja impulsada por la gravedad en 2D y 3D, con un enfoque particular en el régimen de oscilación. Además, el uso de AMR tetraédrico se aplica para la simulación numérica de burbujas impulsadas por la gravedad en dominios complejos. En este tema, la metodología se valida en burbujas que ascienden en canales cilíndricos con topología diferente, donde el estudio de estos casos contribuyó a tener una nueva investigación numérica y una visión física en el desarrollo de una burbuja con efectos de pared.
2
Offermans, Nicolas. "Towards adaptive mesh refinement in Nek5000." Licentiate thesis, KTH, Mekanik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-217501.
Повний текст джерелаАнотація:
The development of adaptive mesh refinement capabilities in the field of computational fluid dynamics is an essential tool for enabling the simulation of larger and more complex physical problems. While such techniques have been known for a long time, most simulations do not make use of them because of the lack of a robust implementation. In this work, we present recent progresses that have been made to develop adaptive mesh refinement features in Nek5000, a code based on the spectral element method. These developments are driven by the algorithmic challenges posed by future exascale supercomputers. First, we perform the study of the strong scaling of Nek5000 on three petascale machines in order to assess the scalability of the code and identify the current bottlenecks. It is found that strong scaling limit ranges between 5, 000 and 220, 000 degrees of freedom per core depending on the machine and the case. The need for synchronized and low latency communication for efficient computational fluid dynamics simulation is also confirmed. Additionally, we present how Hypre, a library for linear algebra, is used to develop a new and efficient code for performing the setup step required prior to the use of an algebraic multigrid solver for preconditioning the pressure equation in Nek5000. Finally, the main objective of this work is to develop new methods for estimating the error on a numerical solution of the Navier–Stokes equations via the resolution of an adjoint problem. These new estimators are compared to existing ones, which are based on the decay of the spectral coefficients. Then, the estimators are combined with newly implemented capabilities in Nek5000 for automatic grid refinement and adaptive mesh adaptation is carried out. The applications considered so far are steady and two-dimensional, namely the lid-driven cavity at Re = 7, 500 and the flow past a cylinder at Re = 40. The use of adaptive mesh refinement techniques makes mesh generation easier and it is shown that a similar accuracy as with a static mesh can be reached with a significant reduction in the number of degrees of freedom.QC 20171114
3
Morgenstern, Philipp [Verfasser]. "Mesh Refinement Strategies for the Adaptive Isogeometric Method / Philipp Morgenstern." Bonn : Universitäts- und Landesbibliothek Bonn, 2017. http://d-nb.info/1140525948/34.
Повний текст джерела
4
Pinchuk, Amy Ruth. "Automatic adaptive finite element mesh generation and error estimation." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63269.
Повний текст джерела
5
Prinja, Gaurav Kant. "Adaptive solvers for elliptic and parabolic partial differential equations." Thesis, University of Manchester, 2010. https://www.research.manchester.ac.uk/portal/en/theses/adaptive-solvers-for-elliptic-and-parabolic-partial-differential-equations(f0894eb2-9e06-41ff-82fd-a7bde36c816c).html.
Повний текст джерелаАнотація:
In this thesis our primary interest is in developing adaptive solution methods for parabolic and elliptic partial differential equations. The convection-diffusion equation is used as a representative test problem. Investigations are made into adaptive temporal solvers implementing only a few changes to existing software. This includes a comparison of commercial code against some more academic releases. A novel way to select step sizes for an adaptive BDF2 code is introduced. A chapter is included introducing some functional analysis that is required to understand aspects of the finite element method and error estimation. Two error estimators are derived and proofs of their error bounds are covered. A new finite element package is written, implementing a rather interesting error estimator in one dimension to drive a rather standard refinement/coarsening type of adaptivity. This is compared to a commercially available partial differential equation solver and an investigation into the properties of the two inspires the development of a new method designed to very quickly and directly equidistribute the errors between elements. This new method is not really a refinement technique but doesn't quite fit the traditional description of a moving mesh either. We show that this method is far more effective at equidistribution of errors than a simple moving mesh method and the original simple adaptive method. A simple extension of the new method is proposed that would be a mesh reconstruction method. Finally the new code is extended to solve steady-state problems in two dimensions. The mesh refinement method from one dimension does not offer a simple extension, so the error estimator is used to supply an impression of the local topology of the error on each element. This in turn allows us to develop a new anisotropic refinement algorithm, which is more in tune with the nature of the error on the parent element. Whilst the benefits observed in one dimension are not directly transferred into the two-dimensional case, the obtained meshes seem to better capture the topology of the solution.
6
Sombra, Tiago GuimarÃes. "An adaptive parametric surface mesh generation parallel method guided by curvatures." Universidade Federal do CearÃ, 2016. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=16628.
Повний текст джерелаАнотація:
CoordenaÃÃo de AperfeÃoamento de Pessoal de NÃvel SuperiorThis work describes a technique for generating parametric surfaces meshes using parallel computing, with distributed memory processors. The input for the algorithm is a set of parametric patches that model the surface of a given object. A structure for spatial partitioning is proposed to decompose the domain in as many subdomains as processes in the parallel system. Each subdomain consists of a set of patches and the division of its load is guided following an estimate. This decomposition attempts to balance the amount of work in all the subdomains. The amount of work, known as load, of any mesh generator is usually given as a function of its output size, i.e., the size of the generated mesh. Therefore, a technique to estimate the size of this mesh, the total load of the domain, is needed beforehand. This work makes use of an analytical average curvature calculated for each patch, which in turn is input data to estimate this load and the decomposition is made from this analytical mean curvature. Once the domain is decomposed, each process generates the mesh on that subdomain or set of patches by a quad tree technique for inner regions, advancing front technique for border regions and is finally applied an improvement to mesh generated. This technique presented good speed-up results, keeping the quality of the mesh comparable to the quality of the serially generated mesh.
Este trabalho descreve uma tÃcnica para gerar malhas de superfÃcies paramÃtricas utilizando computaÃÃo paralela, com processadores de memÃria compartilhada. A entrada para o algoritmo à um conjunto de patches paramÃtricos que modela a superfÃcie de um determinado objeto. Uma estrutura de partiÃÃo espacial à proposta para decompor o domÃnio em tantos subdomÃnios quantos forem os processos no sistema paralelo. Cada subdomÃnio à formado por um conjunto de patches e a divisÃo de sua carga à guiada seguindo uma estimativa de carga. Esta decomposiÃÃo tenta equilibrar a quantidade de trabalho em todos os subdomÃnios. A quantidade de trabalho, conhecida como carga, de qualquer gerador de malha à geralmente dada em funÃÃo do tamanho da saÃda do algoritmo, ou seja, do tamanho da malha gerada. Assim, faz-se necessÃria uma tÃcnica para estimar previamente o tamanho dessa malha, que à a carga total do domÃnio. Este trabalho utiliza-se de um cÃlculo de curvatura analÃtica mÃdia para cada patch, que por sua vez, à dado de entrada para estimar esta carga e a decomposiÃÃo à feita a partir dessa curvatura analÃtica mÃdia. Uma vez decomposto o domÃnio, cada processo gera a malha em seu subdomÃnio ou conjunto de patches pela tÃcnica de quadtree para regiÃes internas, avanÃo de fronteira para regiÃes de fronteira e por fim à aplicado um melhoramento na malha gerada. Esta tÃcnica apresentou bons resultados de speed-up, mantendo a qualidade da malha comparÃvel à qualidade da malha gerada de forma sequencial.
7
Ferreira, Vitor Maciel Vilela. "A hybrid les / lagrangian fdf method on adaptive, block-structured mesh." Universidade Federal de Uberlândia, 2015. https://repositorio.ufu.br/handle/123456789/14982.
Повний текст джерелаАнотація:
Fundação de Amparo a Pesquisa do Estado de Minas GeraisEsta dissertação é parte de um amplo projeto de pesquisa, que visa ao desenvolvimento de uma plataforma computacional de dinâmica dos fluidos (CFD) capaz de simular a física de escoamentos que envolvem mistura de várias espécies químicas, com reação e combustão, utilizando um método hibrido Simulação de Grandes Escalas (LES) / Função Densidade Filtrada (FDF) Lagrangiana em malha adaptativa, bloco-estruturada. Uma vez que escoamentos com mistura proporcionam fenômenos que podem ser correlacionados com a combustão em escoamentos turbulentos, uma visão global da fenomenologia de mistura foi apresentada e escoamentos fechados, laminar e turbulento, que envolvem mistura de duas espécies químicas inicialmente segregadas foram simulados utilizando o código de desenvolvimento interno AMR3D e o código recentemente desenvolvido FDF Lagrangiana de composição. A primeira etapa deste trabalho consistiu na criação de um modelo computacional de partículas estocásticas em ambiente de processamento distribuído. Isto foi alcançado com a construção de um mapa Lagrangiano paralelo, que pode gerenciar diferentes tipos de elementos lagrangianos, incluindo partículas estocásticas, particulados, sensores e nós computacionais intrínsecos dos métodos Fronteira Imersa e Acompanhamento de Interface. O mapa conecta informações Lagrangianas com a plataforma Euleriana do código AMR3D, no qual equações de trans- porte são resolvidas. O método FDF Lagrangiana de composição realiza cálculos algébricos sobre partículas estocásticas e provê campos de composição estatisticamente equivalentes aos obtidos quando se utiliza o método de Diferenças Finitas para solução de equações diferenciais parciais; a técnica de Monte Carlo foi utilizada para resolver um sistema derivado de equações diferenciais estocásticas (SDE). Os resultados concordaram com os benchmarks, que são simulações baseadas em plataforma de Diferenças Finitas para solução de uma equação de transporte de composição filtrada.
This master thesis is part of a wide research project, which aims at developing a com- putational fluid dynamics (CFD) framework able to simulate the physics of multiple-species mixing flows, with chemical reaction and combustion, using a hybrid Large Eddy Simulation (LES) / Lagrangian Filtered Density Function (FDF) method on adaptive, block-structured mesh. Since mixing flows provide phenomena that may be correlated with combustion in turbulent flows, we expose an overview of mixing phenomenology and simulated enclosed, ini- tially segregated two-species mixing flows, at laminar and turbulent states, using the in-house built AMR3D and the developed Lagrangian composition FDF codes. The first step towards this objective consisted of building a computational model of notional particles transport on distributed processing environment. We achieved it constructing a parallel Lagrangian map, which can hold different types of Lagrangian elements, including notional particles, particu- lates, sensors and computational nodes intrinsic to Immersed Boundary and Front Tracking methods. The map connects Lagrangian information with the Eulerian framework of the AMR3D code, in which transport equations are solved. The Lagrangian composition FDF method performs algebraic calculations over an ensemble of notional particles and provides composition fields statistically equivalent to those obtained by Finite Differences numerical solution of partially differential equations (PDE); we applied the Monte Carlo technique to solve a derived system of stochastic differential equations (SDE). The results agreed with the benchmarks, which are simulations based on Finite Differences framework to solve a filtered composition transport equation.
Mestre em Engenharia Mecânica
8
Maddison, James R. "Adaptive mesh modelling of the thermally driven annulus." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:4b95031b-4517-4aaf-9bb2-4d6d4a145499.
Повний текст джерелаАнотація:
Numerical simulations of atmospheric and oceanic flows are fundamentally limited by a lack of model resolution. This thesis describes the application of unstructured mesh finite element methods to geophysical fluid dynamics simulations. These methods permit the mesh resolution to be concentrated in regions of relatively increased dynamical importance. Dynamic mesh adaptivity can further be used to maintain an optimised mesh even as the flow develops. Hence unstructured dynamic mesh adaptive methods have the potential to enable efficient simulations of high Reynolds number flows in complex geometries. In this thesis, the thermally driven rotating annulus is used to test these numerical methods. This system is a classic laboratory scale analogue for large scale geophysical flows. The thermally driven rotating annulus has a long history of experimental and numerical research, and hence it is ideally suited for the validation of new numerical methods. For geophysical systems there is a leading order balance between the Coriolis and buoyancy accelerations and the pressure gradient acceleration: geostrophic and hydrostatic balance. It is essential that any numerical model for these systems is able to represent these balances accurately. In this thesis a balanced pressure decomposition method is described, whereby the pressure is decomposed into a ``balanced'' component associated with the Coriolis and buoyancy accelerations, and a ``residual'' component associated with other forcings and that enforces incompressibility. It is demonstrated that this method can be used to enable a more accurate representation of geostrophic and hydrostatic balance in finite element modelling. Furthermore, when applying dynamic mesh adaptivity, there is a further potential for imbalance injection by the mesh optimisation procedure. This issue is tested in the context of shallow-water ocean modelling. For the linearised system on an $f$-plane, and with a steady balance permitting numerical discretisation, an interpolant is formulated that guarantees that a steady and balanced state remains steady and in balance after interpolation onto an arbitrary target mesh. The application of unstructured dynamic mesh adaptive methods to the thermally driven rotating annulus is presented. Fixed structured mesh finite element simulations are conducted, and compared against a finite difference model and against experiment. Further dynamic mesh adaptive simulations are then conducted, and compared against the structured mesh simulations. These tests are used to identify weaknesses in the application of dynamic mesh adaptivity to geophysical systems. The simulations are extended to a more challenging system: the thermally driven rotating annulus at high Taylor number and with sloping base and lid topography. Analysis of the high Taylor number simulations reveals a direct energy transfer from the eddies to the mean flow, confirming the results of previous experimental work.
9
McDill, Jennifer Moyra Jeane Carleton University Dissertation Engineering Mechanical. "An adaptive mesh-management algorithm for three-dimensional finite element analysis." Ottawa, 1988.
Знайти повний текст джерела
10
Kunert, Gerd. "Anisotropic mesh construction and error estimation in the finite element method." Universitätsbibliothek Chemnitz, 2000. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200000033.
Повний текст джерелаАнотація:
In an anisotropic adaptive finite element algorithm one usually needs an error estimator that yields the error size but also the stretching directions and stretching ratios of the elements of a (quasi) optimal anisotropic mesh.
However the last two ingredients can not be extracted from any of the known anisotropic a posteriori error estimators.
Therefore a heuristic approach is pursued here, namely, the desired information is provided by the so-called Hessian strategy. This strategy produces favourable anisotropic meshes which result in a small discretization error.
The focus of this paper is on error estimation on anisotropic meshes.
It is known that such error estimation is reliable and efficient only
if the anisotropic mesh is aligned with the anisotropic solution.
The main result here is that the Hessian strategy produces anisotropic meshes that show the required alignment with the anisotropic solution.
The corresponding inequalities are proven, and the underlying heuristic assumptions are given in a stringent yet general form.
Hence the analysis provides further inside into a particular aspect of anisotropic error estimation.
11
Karlsson, Christian. "A comparison of two multilevel Schur preconditioners for adaptive FEM." Thesis, Uppsala universitet, Avdelningen för beräkningsvetenskap, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-219939.
Повний текст джерелаАнотація:
There are several algorithms for solving the linear system of equations that arise from the finite element method with linear or near-linear computational complexity. One way is to find an approximation of the stiffness matrix that is such that it can be used in a preconditioned conjugate residual method, that is, a preconditioner to the stiffness matrix. We have studied two preconditioners for the conjugate residual method, both based on writing the stiffness matrix in block form, factorising it and then approximating the Schur complement block to get a preconditioner. We have studied the stationary reaction-diffusion-advection equation in two dimensions. The mesh is refined adaptively, giving a hierarchy of meshes. In the first method the Schur complement is approximated by the stiffness matrix at one coarser level of the mesh, in the second method it is approximated as the assembly of local Schur complements corresponding to macro triangles. For two levels the theoretical bound of the condition number is 1/(1-C²) for either method, where C is the Cauchy-Bunyakovsky-Schwarz constant. For multiple levels there is less theory. For the first method it is known that the condition number of the preconditioned stiffness matrix is O(l²), where l is the number of levels of the preconditioner, or, equivalently, the number mesh refinements. For the second method the asymptotic behaviour is not known theoretically. In neither case is the dependency of the condition number of C known. We have tested both methods on several problems and found the first method to always give a better condition number, except for very few levels. For all tested problems, using the first method it seems that the condition number is O(l), in fact it is typically not larger than Cl. For the second method the growth seems to be superlinear.
12
Shanazari, Kamal. "Application of adaptive mesh and domain composition techniques to a generalized boundary element method." Thesis, University of Liverpool, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.288232.
Повний текст джерела
13
Gagnon, Michael Anthony. "An adaptive mixed finite element method using the Lagrange multiplier technique." Worcester, Mass. : Worcester Polytechnic Institute, 2009. http://www.wpi.edu/Pubs/ETD/Available/etd-050409-115850/.
Повний текст джерелаАнотація:
Thesis (M.S.)--Worcester Polytechnic Institute.Keywords: a posteriori error estimate; adaptive; mesh refinement; lagrange multiplier; finite element method. Includes bibliographical references (leaf 26).
14
Alizada, Alaskar [Verfasser]. "The eXtended Finite Element Method (XFEM) with Adaptive Mesh Refinement for Fracture Mechanics / Alaskar Alizada." Aachen : Shaker, 2012. http://d-nb.info/1052408818/34.
Повний текст джерела
15
Carette, Jean-Christophe. "Adaptive unstructured mesh algorithms and SUPG finite element method for compressible high reynolds number flows." Doctoral thesis, Universite Libre de Bruxelles, 1997. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/212161.
Повний текст джерела
16
Alexe, Mihai. "Adjoint-based space-time adaptive solution algorithms for sensitivity analysis and inverse problems." Diss., Virginia Tech, 2011. http://hdl.handle.net/10919/37515.
Повний текст джерелаАнотація:
Adaptivity in both space and time has become the norm for solving problems modeled by partial differential equations. The size of the discretized problem makes uniformly refined grids computationally prohibitive. Adaptive refinement of meshes and time steps allows to capture the phenomena of interest while keeping the cost of a simulation tractable on the current hardware. Many fields in science and engineering require the
solution of inverse problems where parameters for a given model are estimated based on available measurement information. In contrast to forward (regular) simulations, inverse problems have not extensively benefited from the adaptive solver technology. Previous research in inverse problems has focused mainly on the continuous approach to calculate sensitivities, and has typically employed fixed time and space meshes in the solution process. Inverse problem solvers that make exclusive use of uniform or static meshes avoid complications such as the differentiation of mesh motion equations, or inconsistencies in the sensitivity equations between subdomains with different refinement levels. However, this comes at the cost of low computational efficiency. More efficient computations are possible through judicious use of adaptive mesh refinement, adaptive time steps, and the discrete adjoint method. This dissertation develops a complete framework for fully discrete adjoint sensitivity analysis and inverse problem solutions, in the context of time dependent, adaptive mesh, and adaptive step models. The discrete framework addresses all the necessary ingredients
of a stateâ ofâ theâ art adaptive inverse solution algorithm: adaptive mesh and time step refinement, solution grid transfer operators, a priori and a posteriori error analysis and estimation, and discrete adjoints for sensitivity analysis of fluxâ limited numerical algorithms.Ph. D.
17
Akargun, Yigit Hayri. "Least-squares Finite Element Solution Of Euler Equations With Adaptive Mesh Refinement." Master's thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614138/index.pdf.
Повний текст джерелаАнотація:
Least-squares finite element method (LSFEM) is employed to simulate 2-D and axisymmetric flows governed by the compressible Euler equations. Least-squares formulation brings many advantages over classical Galerkin finite element methods. For non-self-adjoint systems, LSFEM result in symmetric positive-definite matrices which can be solved efficiently by iterative methods. Additionally, with a unified formulation it can work in all flight regimes from subsonic to supersonic. Another advantage is that, the method does not require artificial viscosity since it is naturally diffusive which also appears as a difficulty for sharply resolving high gradients in the flow field such as shock waves. This problem is dealt by employing adaptive mesh refinement (AMR) on triangular meshes. LSFEM with AMR technique is numerically tested with various flow problems and good agreement with the available data in literature is seen.
18
Williams, Todd Andrew. "Development and Evaluation of Dimensionally Adaptive Techniques for Improving Computational Efficiency of Radiative Heat Transfer Calculations in Cylindrical Combustors." BYU ScholarsArchive, 2020. https://scholarsarchive.byu.edu/etd/9038.
Повний текст джерелаАнотація:
Computational time to model radiative heat transfer in a cylindrical Pressurized Oxy-Coal (POC) combustor was reduced by incorporating the multi-dimensional characteristics of the combustion field. The Discrete Transfer Method (DTM) and the Discrete Ordinates Method (DOM) were modified to work with a computational mesh that transitions from 3D cells to axisymmetric and then 1D cells, also known as a dimensionally adaptive mesh. For the DTM, three methods were developed for selecting so-called transdimensional rays, the Single Unweighted Ray (SUR) technique, the Multiple Unweighted Ray (MUR) technique, and the Single Weighted Ray (SWR) technique. For the DOM, averaging methods for handling radiative intensity at dimensional boundaries were developed. Limitations of both solvers with adaptive meshes were identified by comparison with fully 3D results. For the DTM, the primary limit was numerical error associated with view factor calculations. For the DOM, treatment of dimensional boundaries led to step changes that created numerical oscillations, the severity of which was lessened by both increased angular resolution and increased optical thickness. Performance of dimensionally adaptive radiation calculations, uncoupled to any other physical calculation, was evaluated with a series of sensitivity studies including sensitivity to spatial and angular resolution, dimensional boundary placement, and reactor scaling. Runtime was most impacted by boundary layer placement. For the upstream case which had 3D cells over 40% of the reactor length, the speedup versus the fully 3D calculations were 743%, 18%, 220%, and 76% for the SUR, MUR, SWR, and DOM calculations, respectively. The downstream case which had 3D cells over the first 60% of the reactor length, had speedups of 209%, 3%, 109%, and 37%, respectively. For the DTM, accuracy was most sensitive to optical thickness, with the average percent difference in incident heat flux for SUR, MUR, and SWR calculations versus fully 3D calculations being 0.93%, 0.86%, and 1.18%, respectively, for a reactor half the size of the baseline case. The case with four times the reactor size had average percent differences of 0.28%, 0.41%, and 0.39% for the SUR, MUR, and SWR, respectively. Accuracy of the DOM was comparatively insensitive to the different changes studied. Performance of dimensionally adaptive radiation calculations coupled with thermochemistry was also investigated for both pilot and industrial scale systems. For pilot scale systems, flux and temperature differences from either solver were less than 5% and 6%, respectively, with speedups being between 200% - 600%. For industrial systems, temperature differences as high as 15% - 20% and flux differences as high as 50% - 75% were seen. In the case of the DTM, these differences between fully 3D and adaptive results come from a combination of high property gradients and comparatively few rays being drawn and could therefore be improved, at the cost of additional computation time, by using a more sophisticated ray selection method. For the DOM, these issues stem from poor performance of the 1D portion of the solver and could therefore be improved by using a more sophisticated equation to model the radiative transfer in the 1D region.
19
Bhutani, Gaurav. "Numerical modelling of polydispersed flows using an adaptive-mesh finite element method with application to froth flotation." Thesis, Imperial College London, 2016. http://hdl.handle.net/10044/1/39046.
Повний текст джерелаАнотація:
An efficient numerical framework for the macroscale simulation of three-phase polydispersed flows is presented in this thesis. The primary focus of this research is on modelling the polydispersity in multiphase flows ensuring the tractability of the solution framework. Fluidity, an open-source adaptive-mesh finite element code, has been used for solving the coupled equations efficiently. Froth flotation is one of the most widely used mineral processing operations. The multiphase, turbulent and polydispersed nature of flow in the pulp phase in froth flotation makes it all the more challenging to model this process. Considering that two of the three phases in froth flotation are polydispersed, modelling this polydispersity is particularly important for an accurate prediction of the overall process. The direct quadrature method of moments (DQMOM) is implemented in the Fluidity code to solve the population balance equation (PBE) for modelling the polydispersity of the gas bubbles. The PBE is coupled to the Eulerian--Eulerian flow equations for the liquid and gas phases. Polydispersed solids are modelled using separate transport equations for the free and attached mineral particles for each size class. The PBE has been solved using DQMOM in a finite element framework for the first time in this work. The behaviour of various finite element and control volume discretisation schemes in the solution of the PBE is analysed. Rigorous verification and benchmarking is presented along with model validation on turbulent gravity-driven flow in a bubble column. This research also establishes the importance of modelling the polydispersity of solids in flotation columns, which is undertaken for the first time, for an accurate prediction of the flotation rate. The application of fully-unstructured anisotropic mesh adaptivity to the polydispersed framework is also analysed for the first time. Significant improvement in the solution efficiency is reported through its use.
20
Morrelll, J. M. "A cell by cell anisotropic adaptive mesh Arbitrary Lagrangian Eulerian method for the numerical solution of the Euler equations." Thesis, University of Reading, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.440088.
Повний текст джерела
21
Yucel, Hamdullah. "Adaptive Discontinuous Galerkin Methods For Convectiondominated Optimal Control Problems." Phd thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614523/index.pdf.
Повний текст джерелаАнотація:
Many real-life applications such as the shape optimization of technological devices, the identification
of parameters in environmental processes and flow control problems lead to optimization
problems governed by systems of convection diusion partial dierential equations
(PDEs). When convection dominates diusion, the solutions of these PDEs typically exhibit
layers on small regions where the solution has large gradients. Hence, it requires special numerical
techniques, which take into account the structure of the convection. The integration
of discretization and optimization is important for the overall eciency of the solution process.
Discontinuous Galerkin (DG) methods became recently as an alternative to the finite
dierence, finite volume and continuous finite element methods for solving wave dominated
problems like convection diusion equations since they possess higher accuracy.
This thesis will focus on analysis and application of DG methods for linear-quadratic convection
dominated optimal control problems. Because of the inconsistencies of the standard stabilized
methods such as streamline upwind Petrov Galerkin (SUPG) on convection diusion
optimal control problems, the discretize-then-optimize and the optimize-then-discretize do not commute. However, the upwind symmetric interior penalty Galerkin (SIPG) method leads to
the same discrete optimality systems. The other DG methods such as nonsymmetric interior
penalty Galerkin (NIPG) and incomplete interior penalty Galerkin (IIPG) method also yield
the same discrete optimality systems when penalization constant is taken large enough. We
will study a posteriori error estimates of the upwind SIPG method for the distributed unconstrained
and control constrained optimal control problems. In convection dominated optimal
control problems with boundary and/or interior layers, the oscillations are propagated downwind
and upwind direction in the interior domain, due the opposite sign of convection terms in
state and adjoint equations. Hence, we will use residual based a posteriori error estimators to
reduce these oscillations around the boundary and/or interior layers. Finally, theoretical analysis
will be confirmed by several numerical examples with and without control constraints
22
Yang, Fangtao. "Simulation of continuous damage and fracture in metal-forming processes with 3D mesh adaptive methodology." Thesis, Compiègne, 2017. http://www.theses.fr/2017COMP2385/document.
Повний текст джерелаАнотація:
Ces travaux s'inscrivent dans le cadre des recherches menées dans le cadre d'une collaboration entre le laboratoire Roberval de l'Université de Technologie de Compiègne et l'équipe dans le cadre du projet ANR-14-CE07-0035 LASMIS de l'Institut Charles Delaunay de l'Université de Technologie de Troyes. Nous présentons dans ces travaux une h-méthodologie adaptative tridimensionnelle des éléments finis afin de représenter l'initiation et la propagation des fissures dans des matériaux ductiles. Un modèle élasto-plastique couplé à l'endommagement isotrope proposé par l'équipe du LASMIS/UTT est utilisé. Les applications visées à terme concernent principalement la mise en forme des métaux. Dans ce contexte, une formulation Lagrangienne actualisée est employée et des remaillages fréquents s'avèrent essentiels afin d'une part d'éviter les fortes distorsions d'éléments dues aux grandes déformations plastiques et d'autre part de suivre les modifications de la topologie résultant de la création de fissures. La taille du nouveau maillage doit permettre à moindre coût représenter avec précision l'évolution des gradients des quantités physiques représentatives des phénomènes étudiées (plasticité, endommagement...). Nous proposons des indicateurs empiriques de taille d'éléments basés sur la déformation plastique ainsi que sur l'endommagement. Une courbe définie par morceau représente l'évolution de la taille d'élément suivant la sévérité de la plasticité et le cas échéant de l'endommagement. Les fissures sont représentées par une méthode de destruction d'éléments qui permet une description aisée de la géométrie de ces dernières et une gestion simplifiée de la fissuration sans nul besoin de critères additionnels. En revanche, pour permettre une description réaliste des fissures, ces dernières doivent être représentées par l'érosion des éléments de plus petite taille. Un solveur ABAQUS/Explicit® est utilisé avec des éléments tétraédriques quadratiques (C3D10M) évitant notamment les problèmes de verrouillage numérique survenant lors de l'analyse de structures en matériau compressible ou quasi-incompressible. Le contrôle de la plus petite taille du maillage est important dans un contexte explicite. De surcroît, pour les phénomènes adoucissant, la solution dépend de la taille de maille considérée alors comme un paramètre intrinsèque. Une étude nous a permis de constater que lorsque le maillage est suffisamment raffiné, les effets de la dépendance au maillage se réduisaient. Dans la littérature, les coûts de maillage ou de remaillage fréquents sont souvent considérés comme prohibitifs et de nombreux auteurs s'appuient sur cet argument pour introduire, avec succès certes, des méthodes alternatives qui limitent le coût des opérations de remaillage sans toutefois les éliminer (XFEM par exemple). Nos travaux montrent que le coût d'un remaillage local est négligeable par rapport au calcul. Compte tenu de la complexité de la géométrie et de la nécessité de raffiner le maillage, la seule alternative à ce jour est d'utiliser un mailleur en tétraèdres. La stratégie de remaillage local en tétraèdre s'appuie sur une méthode de bisection suivie si nécessaire d'une optimisation locale du maillage proposé par A. Rassineux en 2003. Le remaillage, même local, doit s'accompagner de procédures de transfert de champ des variables nodales et aux points d'intégration. Les variables nodales sont, comme le fait la plupart des auteurs, transférées en utilisant les fonctions de forme éléments finis. Le transfert de champ en 3D aux points de Gauss et les nombreux problèmes sous-jacents ont été relativement peu abordés dans la littératureThis work is part of the research carried out in the framework of a collaboration between the Roberval laboratory of the Compiègne University of Technology and the team within the framework of the project ANR-14-CE07-0035 LASMIS of the Charles Delaunay Institute of Technology University of Troyes. In this work, we present a three-dimensional adaptive Pi-methodology of finite elements to represent the initiation and propagation of cracks in ductile materials. An elastoplastic model coupled with the isotropic damage proposed by the LASMIS / UTT team is used. The targeted applications will mainly concern the metal forming. In this context, an updated Lagrangian formulation is used and frequent remeshing is essential in order to avoid the strong distortion of elements due to large plastic deformations and to follow the modifications of the topology resulting in the creation of cracks. The size of the new mesh must allow at a lower cost to accurately represent the evolution of the gradients of the physical quantities representative of the studied phenomena (plasticity, damage ...). We propose empirical indicators of size of elements based on the plastic deformation as well as on the damage. A piecewise defined curve represents the evolution of the element size according to the severity of the plasticity and, if appropriate, the damage. The cracks are represented by a method of destruction of elements which allows an easy description of the geometry and a simplified treatment of the cracking without any need for additional criteria. On the other hand, to allow a realistic description of the cracks, the latter must be represented by erosion smaller elements. An ABAQUS / Explicit@ solver is used with quadratic tetrahedral elements (C3DIOM), avoiding in particular the problems of numerical locking occurring during the analysis of structures in compressible or quasi-incompressible material. The control of the smaller mesh size is important in an explicit context. In addition, for softening phenomena, the solution depends on the mesh size considered as an intrinsic parameter. A study has shown that when the mesh is sufficiently refined, the effects of mesh dependence are reduced. In the literature, the costs of frequent meshing or remeshing are often considered prohibitive and many authors rely on this argument to introduce, with success, alternative methods that limit the cost of remeshing operations without eliminating them ( XFEM for example). Our work shows that the cost of local remeshing is negligible compared to the calculation. Given the complexity of the geometry and the need to refine the mesh, the only alternative to date is to use a mesh in tetrahedra. The strategy of local remeshing tetrahedron is based on a bisection method followed if necessary by a local optimization of the grid proposed by A. Rassineux in 2003. The remeshing, even local, must be accompanied by field transfer procedures on both nodal variables and integration points. Node variables are, as most authors do, transferred using finite element shape functions. The 3D field transfer at Gauss points and the many underlying problems have been relatively untouched in the literature. The main difficulties to be solved in order to ensure the "quality" of the transfer concern the limitation of numerical diffusion, the lack of information near borders, the respect of boundary conditions, the equilibrium, the calculation costs, the filtering of the information points, crucial problems in 3D where the number of Gauss points used is several hundred. We propose a so-called "hybrid" method which consists, initially, in extrapolating the data at the Gauss points, in the nodes by diffuse interpolation and then in using the finite element form functions to obtain the value at the point considered
23
Gokhale, Nandan Bhushan. "A dimensionally split Cartesian cut cell method for Computational Fluid Dynamics." Thesis, University of Cambridge, 2019. https://www.repository.cam.ac.uk/handle/1810/289732.
Повний текст джерелаАнотація:
We present a novel dimensionally split Cartesian cut cell method to compute inviscid, viscous and turbulent flows around rigid geometries. On a cut cell mesh, the existence of arbitrarily small boundary cells severely restricts the stable time step for an explicit numerical scheme. We solve this `small cell problem' when computing solutions for hyperbolic conservation laws by combining wave speed and geometric information to develop a novel stabilised cut cell flux. The convergence and stability of the developed technique are proved for the one-dimensional linear advection equation, while its multi-dimensional numerical performance is investigated through the computation of solutions to a number of test problems for the linear advection and Euler equations. This work was recently published in the Journal of Computational Physics (Gokhale et al., 2018). Subsequently, we develop the method further to be able to compute solutions for the compressible Navier-Stokes equations. The method is globally second order accurate in the L1 norm, fully conservative, and allows the use of time steps determined by the regular grid spacing. We provide a full description of the three-dimensional implementation of the method and evaluate its numerical performance by computing solutions to a wide range of test problems ranging from the nearly incompressible to the highly compressible flow regimes. This work was recently published in the Journal of Computational Physics (Gokhale et al., 2018). It is the first presentation of a dimensionally split cut cell method for the compressible Navier-Stokes equations in the literature. Finally, we also present an extension of the cut cell method to solve high Reynolds number turbulent automotive flows using a wall-modelled Large Eddy Simulation (WMLES) approach. A full description is provided of the coupling between the (implicit) LES solution and an equilibrium wall function on the cut cell mesh. The combined methodology is used to compute results for the turbulent flow over a square cylinder, and for flow over the SAE Notchback and DrivAer reference automotive geometries. We intend to publish the promising results as part of a future publication, which would be the first assessment of a WMLES Cartesian cut cell approach for computing automotive flows to be presented in the literature.
24
Acikgoz, Nazmiye. "Adaptive and Dynamic Meshing Methods for Numerical Simulations." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/14521.
Повний текст джерелаАнотація:
For the numerical simulation of many problems of engineering interest, it is desirable to have an automated mesh adaption tool. This is important especially for problems characterized by anisotropic features and require mesh clustering in the direction of high gradients. Another significant issue in meshing emerges in unsteady simulations with moving boundaries, where the boundary motion has to be accommodated by deforming the computational grid. Similarly, there exist problems where current mesh needs to be adapted to get more accurate solutions. To solve these problems, we propose three novel procedures.
In the first part of this work, we present an optimization procedure for three-dimensional anisotropic tetrahedral grids based on metric-driven h-adaptation. Through the use of topological and geometrical operators, the mesh is iteratively adapted until the final mesh minimizes a given objective function. We propose an optimization process based on an ad-hoc application of the simulated annealing technique, which improves the likelihood of removing poor elements from the grid. Moreover, a local implementation of the simulated annealing is proposed to reduce the computational cost.
Many challenging unsteady multi-physics problems are characterized by moving boundaries and/or interfaces. When the boundary displacements are large, degenerate elements are easily formed in the grid such that frequent remeshing is required. We propose a new r-adaptation technique that is valid for all types of elements (e.g., triangle, tet, quad, hex, hybrid) and deforms grids that undergo large imposed displacements at their boundaries. A grid is deformed using a network of linear springs composed of edge springs and a set of virtual springs. The virtual springs are constructed in such a way as to oppose element collapsing.
Both frequent remeshing, and exact-pinpointing of clustering locations are great challenges of numerical simulations, which can be overcome by adaptive meshing algorithms. Therefore, we conclude this work by defining a novel mesh adaptation technique where the entire mesh is adapted upon application of a force field in order to comply with the target mesh or to get more accurate solutions. The method has been tested for two-dimensional problems of a-priori metric definitions as well as for oblique shock clusterings.
25
Günnel, Andreas. "Adaptive Netzverfeinerung in der Formoptimierung mit der Methode der Diskreten Adjungierten." Master's thesis, Universitätsbibliothek Chemnitz, 2010. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-201000390.
Повний текст джерелаАнотація:
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 untersuchenShape 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
26
Bringmann, Philipp. "Adaptive least-squares finite element method with optimal convergence rates." Doctoral thesis, Humboldt-Universität zu Berlin, 2021. http://dx.doi.org/10.18452/22350.
Повний текст джерелаАнотація:
Die Least-Squares Finite-Elemente-Methoden (LSFEMn) basieren auf der Minimierung des Least-Squares-Funktionals, das aus quadrierten Normen der Residuen eines Systems von partiellen Differentialgleichungen erster Ordnung besteht. Dieses Funktional liefert einen a posteriori Fehlerschätzer und ermöglicht die adaptive Verfeinerung des zugrundeliegenden Netzes. Aus zwei Gründen versagen die gängigen Methoden zum Beweis optimaler Konvergenzraten, wie sie in Carstensen, Feischl, Page und Praetorius (Comp. Math. Appl., 67(6), 2014) zusammengefasst werden. Erstens scheinen fehlende Vorfaktoren proportional zur Netzweite den Beweis einer schrittweisen Reduktion der Least-Squares-Schätzerterme zu verhindern. Zweitens kontrolliert das Least-Squares-Funktional den Fehler der Fluss- beziehungsweise Spannungsvariablen in der H(div)-Norm, wodurch ein Datenapproximationsfehler der rechten Seite f auftritt. Diese Schwierigkeiten führten zu einem zweifachen Paradigmenwechsel in der Konvergenzanalyse adaptiver LSFEMn in Carstensen und Park (SIAM J. Numer. Anal., 53(1), 2015) für das 2D-Poisson-Modellproblem mit Diskretisierung niedrigster Ordnung und homogenen Dirichlet-Randdaten. Ein neuartiger expliziter residuenbasierter Fehlerschätzer ermöglicht den Beweis der Reduktionseigenschaft. Durch separiertes Markieren im adaptiven Algorithmus wird zudem der Datenapproximationsfehler reduziert.
Die vorliegende Arbeit verallgemeinert diese Techniken auf die drei linearen Modellprobleme das Poisson-Problem, die Stokes-Gleichungen und das lineare Elastizitätsproblem. Die Axiome der Adaptivität mit separiertem Markieren nach Carstensen und Rabus (SIAM J. Numer. Anal., 55(6), 2017) werden in drei Raumdimensionen nachgewiesen. Die Analysis umfasst Diskretisierungen mit beliebigem Polynomgrad sowie inhomogene Dirichlet- und Neumann-Randbedingungen. Abschließend bestätigen numerische Experimente mit dem h-adaptiven Algorithmus die theoretisch bewiesenen optimalen Konvergenzraten.The least-squares finite element methods (LSFEMs) base on the minimisation of the least-squares functional consisting of the squared norms of the residuals of first-order systems of partial differential equations. This functional provides a reliable and efficient built-in a posteriori error estimator and allows for adaptive mesh-refinement. The established convergence analysis with rates for adaptive algorithms, as summarised in the axiomatic framework by Carstensen, Feischl, Page, and Praetorius (Comp. Math. Appl., 67(6), 2014), fails for two reasons. First, the least-squares estimator lacks prefactors in terms of the mesh-size, what seemingly prevents a reduction under mesh-refinement. Second, the first-order divergence LSFEMs measure the flux or stress errors in the H(div) norm and, thus, involve a data resolution error of the right-hand side f. These difficulties led to a twofold paradigm shift in the convergence analysis with rates for adaptive LSFEMs in Carstensen and Park (SIAM J. Numer. Anal., 53(1), 2015) for the lowest-order discretisation of the 2D Poisson model problem with homogeneous Dirichlet boundary conditions. Accordingly, some novel explicit residual-based a posteriori error estimator accomplishes the reduction property. Furthermore, a separate marking strategy in the adaptive algorithm ensures the sufficient data resolution. This thesis presents the generalisation of these techniques to three linear model problems, namely, the Poisson problem, the Stokes equations, and the linear elasticity problem. It verifies the axioms of adaptivity with separate marking by Carstensen and Rabus (SIAM J. Numer. Anal., 55(6), 2017) in three spatial dimensions. The analysis covers discretisations with arbitrary polynomial degree and inhomogeneous Dirichlet and Neumann boundary conditions. Numerical experiments confirm the theoretically proven optimal convergence rates of the h-adaptive algorithm.
27
Akdag, Osman. "Incompressible Flow Simulations Using Least Squares Spectral Element Method On Adaptively Refined Triangular Grids." Master's thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614944/index.pdf.
Повний текст джерелаАнотація:
The main purpose of this study is to develop a flow solver that employs triangular grids to solve two-dimensional, viscous, laminar, steady, incompressible flows. The flow solver is based on Least Squares Spectral Element Method (LSSEM). It has p-type adaptive mesh refinement/coarsening capability and supports p-type nonconforming element interfaces. To validate the developed flow solver several benchmark problems are studied and successful results are obtained. The performances of two different triangular nodal distributions, namely Lobatto distribution and Fekete distribution, are compared in terms of accuracy and implementation complexity. Accuracies provided by triangular and quadrilateral grids of equal computational size are compared. Adaptive mesh refinement studies are conducted using three different error indicators, including a novel one based on elemental mass loss. Effect of modifying the least-squares functional by multiplying the continuity equation by a weight factor is investigated in regards to mass conservation.
28
Hellwig, Friederike. "Adaptive Discontinuous Petrov-Galerkin Finite-Element-Methods." Doctoral thesis, Humboldt-Universität zu Berlin, 2019. http://dx.doi.org/10.18452/20034.
Повний текст джерелаАнотація:
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.
29
Claudino, Marco Alexandre. "O uso do estimador residual no refinamento adaptativo de malhas em elementos finitos." Universidade de São Paulo, 2015. http://www.teses.usp.br/teses/disponiveis/45/45132/tde-25052015-230057/.
Повний текст джерелаАнотація:
Na obtenção de aproximações numéricas para Equações Diferenciais Parciais Elípticas utilizando o Método dos Elementos Finitos (MEF) alguns problemas apresentam valores maiores para o erro somente em algumas determinadas regiões do domínio como, por exemplo, regiões onde existam singularidades na solução contínua do problema. Uma possível alternativa para reduzir o erro cometido nestas regiões é aumentar o número de elementos nos trechos onde o erro cometido foi considerado grande. A questão principal é como identificar essas regiões, dado que a solução do problema contínuo é desconhecida. Neste trabalho iremos apresentar a chamada estimativa residual, que fornece um estimador do erro cometido na aproximação utilizando apenas os valores conhecidos dos contornos e a aproximação obtida sobre uma dada partição de elementos. Vamos discutir a relação entre a estimativa residual e o erro cometido na aproximação, além de utilizar as estimativas na construção de um algoritmo adaptativo para as malhas em estudo. Utilizando o software FreeFem++ serão obtidas aproximações para a Equação de Poisson e para o sistema de equações associado à Elasticidade Linear e por meio do estimador residual será analisado o erro cometido nas aproximações e a necessidade do refinamento adaptativo das malhas.In obtaining numerical approximations for solutions to Elliptic Partial Differential Equations using the Finite Element Method (FEM) one sees that some problems have higher values for the error only in certain domain regions such as, for example, regions where the solution of the continous problem is singular. A possible alternative to reduce the error in these regions is to increase the number of elements in the partions where the error was considered large. The main issue is how to identify these regions, since the solution of the continuous problem is unknown. In this work we present the so-called residual estimate, which provides an error estimation approach which uses only the known values on the contours and the obtained approximation on a given discretization. We will discuss the relationship between the residual estimate and the error, and how to use the estimate for adaptively refining the mesh. Solutions for the Poisson equation and the Linear elasticity system of equations, and the residual estimates for the analysis of mesh refinement will be computed using the FreeFem++ software.
30
Quinto, Michele Arcangelo. "Méthode de reconstruction adaptive en tomographie par rayons X : optimisation sur architectures parallèles de type GPU." Thesis, Grenoble, 2013. http://www.theses.fr/2013GRENT109/document.
Повний текст джерелаАнотація:
La reconstruction tomographique à partir de données de projections est un problème inverse largement utilisé en imagerie médicale et de façon plus modeste pour le contrôle nondestructif. Avec un nombre suffisant de projections, les algorithmes analytiques permettentdes reconstructions rapides et précises. Toutefois, dans le cas d’un faible nombre de vues(imagerie faible dose) et/ou d’angle limité (contraintes spécifiques liées à l’installation), lesdonnées disponibles pour l’inversion ne sont pas complètes, le mauvais conditionnementdu problème s’accentue, et les résultats montrent des artefacts importants. Pour aborderces situations, une approche alternative consiste à discrétiser le problème de reconstruction,et à utiliser des algorithmes itératifs ou une formulation statistique du problème afinde calculer une estimation de l’objet inconnu. Ces méthodes sont classiquement basées surune discrétisation du volume en un ensemble de voxels, et fournissent des cartes 3D de ladensité de l’objet étudié. Les temps de calcul et la ressource mémoire de ces méthodesitératives sont leurs principaux points faibles. Par ailleurs, quelle que soit l’application, lesvolumes sont ensuite segmentés pour une analyse quantitative. Devant le large éventaild’outils de segmentation existant, basés sur différentes interprétations des contours et defonctionnelles à minimiser, les choix sont multiples et les résultats en dépendent.Ce travail de thèse présente une nouvelle approche de reconstruction simultanée àla segmentation des différents matériaux qui composent le volume. Le processus dereconstruction n’est plus basé sur une grille régulière de pixels (resp. voxels), mais sur unmaillage composé de triangles (resp. tétraèdres) non réguliers qui s’adaptent à la formede l’objet. Après une phase d’initialisation, la méthode se décompose en trois étapesprincipales que sont la reconstruction, la segmentation et l’adaptation du maillage, quialternent de façon itérative jusqu’à convergence. Des algorithmes itératifs de reconstructioncommunément utilisés avec une représentation conventionnelle de l’image ont étéadaptés et optimisés pour être exécutés sur des grilles irrégulières composées d’élémentstriangulaires ou tétraédriques. Pour l’étape de segmentation, deux méthodes basées surune approche paramétrique (snake) et l’autre sur une approche géométrique (level set)ont été mises en oeuvre afin de considérer des objets de différentes natures (mono- etmulti- matériaux). L’adaptation du maillage au contenu de l’image estimée est basée surles contours segmentés précédemment, pour affiner la maille au niveau des détails del’objet et la rendre plus grossière dans les zones contenant peu d’information. En finde processus, le résultat est une image classique de reconstruction tomographique enniveaux de gris, mais dont la représentation par un maillage adapté au contenu proposeidirectement une segmentation associée. Les résultats montrent que la partie adaptative dela méthode permet de représenter efficacement les objets et conduit à diminuer drastiquementla mémoire nécessaire au stockage. Dans ce contexte, une version 2D du calcul desopérateurs de reconstruction sur une architecture parallèle type GPU montre la faisabilitédu processus dans son ensemble. Une version optimisée des opérateurs 3D permet descalculs encore plus efficacesTomography reconstruction from projections data is an inverse problem widely used inthe medical imaging field. With sufficiently large number of projections over the requiredangle, the FBP (filtered backprojection) algorithms allow fast and accurate reconstructions.However in the cases of limited views (lose dose imaging) and/or limited angle (specificconstrains of the setup), the data available for inversion are not complete, the problembecomes more ill-conditioned, and the results show significant artifacts. In these situations,an alternative approach of reconstruction, based on a discrete model of the problem,consists in using an iterative algorithm or a statistical modelisation of the problem to computean estimate of the unknown object. These methods are classicaly based on a volumediscretization into a set of voxels and provide 3D maps of densities. Computation time andmemory storage are their main disadvantages. Moreover, whatever the application, thevolumes are segmented for a quantitative analysis. Numerous methods of segmentationwith different interpretations of the contours and various minimized energy functionalare offered, and the results can depend on their use.This thesis presents a novel approach of tomographic reconstruction simultaneouslyto segmentation of the different materials of the object. The process of reconstruction isno more based on a regular grid of pixels (resp. voxel) but on a mesh composed of nonregular triangles (resp. tetraedra) adapted to the shape of the studied object. After aninitialization step, the method runs into three main steps: reconstruction, segmentationand adaptation of the mesh, that iteratively alternate until convergence. Iterative algorithmsof reconstruction used in a conventionnal way have been adapted and optimizedto be performed on irregular grids of triangular or tetraedric elements. For segmentation,two methods, one based on a parametric approach (snake) and the other on a geometricapproach (level set) have been implemented to consider mono and multi materials objects.The adaptation of the mesh to the content of the estimated image is based on the previoussegmented contours that makes the mesh progressively coarse from the edges to thelimits of the domain of reconstruction. At the end of the process, the result is a classicaltomographic image in gray levels, but whose representation by an adaptive mesh toits content provide a correspoonding segmentation. The results show that the methodprovides reliable reconstruction and leads to drastically decrease the memory storage. Inthis context, the operators of projection have been implemented on parallel archituecturecalled GPU. A first 2D version shows the feasability of the full process, and an optimizedversion of the 3D operators provides more efficent compoutations
31
Grosman, Sergey. "Adaptivity in anisotropic finite element calculations." Doctoral thesis, Universitätsbibliothek Chemnitz, 2006. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200600815.
Повний текст джерелаАнотація:
When the finite element method is used to solve boundary value problems, the
corresponding finite element mesh is appropriate if it is reflects the behavior of the true solution. A posteriori error estimators are suited to construct adequate meshes. They are useful to measure the quality of an approximate solution and to design adaptive solution algorithms. Singularly perturbed problems yield in general solutions with anisotropic features, e.g. strong boundary or interior layers. For such problems it is useful to use anisotropic meshes in order to reach maximal order of convergence. Moreover, the quality of the numerical solution rests on the robustness of the a posteriori error estimation with respect to both the anisotropy of the mesh and the perturbation parameters.
There exist different possibilities to measure the a posteriori error in the energy norm for the singularly perturbed reaction-diffusion equation. One of them is the equilibrated residual method which is known to be robust as long as one solves auxiliary local Neumann problems exactly on each element. We provide a basis for an approximate solution of the aforementioned auxiliary problem and show that this approximation does not affect the quality of the error estimation.
Another approach that we develope for the a posteriori error estimation is the hierarchical error estimator. The robustness proof for this estimator involves some stages including the strengthened Cauchy-Schwarz inequality and the error reduction property for the chosen space enrichment.
In the rest of the work we deal with adaptive algorithms. We provide an overview of the existing methods for the isotropic meshes and then generalize the ideas for the anisotropic case. For the resulting algorithm the error reduction estimates are proven for the Poisson equation and for the singularly perturbed reaction-difussion equation. The convergence for the Poisson equation is also shown.
Numerical experiments for the equilibrated residual method, for the hierarchical
error estimator and for the adaptive algorithm confirm the theory. The adaptive
algorithm shows its potential by creating the anisotropic mesh for the problem
with the boundary layer starting with a very coarse isotropic mesh.
32
Madugula, Sashi Kiran. "Development of a Numerical Tool to Optimise the Infill Structure of Part Produced by Fused Deposition Modeling." Thesis, Troyes, 2022. http://www.theses.fr/2022TROY0002.
Повний текст джерелаАнотація:
L'objectif de cette thèse est de développer un outil numérique pour optimiser la structure interne des pièces imprimées en 3D produites par le procédé dépôt de fil fondu (DFF). En impression 3D, le terme remplissage fait référence à la structure interne de la pièce. Pour créer la conception de remplissage, un logiciel de tranchage est utilisé, qui crée généralement le remplissage uniformément dans toute la pièce. Lorsqu'une telle pièce est soumise à une charge externe, toutes les régions de remplissage ne subiront pas la même quantité de contrainte. Par conséquent, l'utilisation d'un remplissage uniforme dans toute la pièce n'est pas la solution la plus optimisée en termes d'utilisation des matériaux. Nous visons à développer un outil numérique pour faire évoluer la conception du remplissage par rapport aux contraintes mécaniques générées par les charges externes. Pour y parvenir, nous proposons deux méthodologies différentes basées sur un processus itératif utilisant des techniques de raffinement et de remaillage couplées à la simulation par éléments finis (simulation EF) pour contrôler la structure interne de la pièce sans modifier le contour. Ces méthodologies visent à renforcer le remplissage de la pièce sans modifier le contour, dans la zone où la résistance mécanique doit être améliorée pour renforcer la structure, mais aussi à diminuer la quantité de matière pour réduire le temps d'impressionThe objective of this thesis is to develop a numerical tool to optimise the internal structure of 3D printed parts produced by the Fused Deposition Modelling (FDM) process. In 3D printing, the term infill refers to the internal structure of the part. To create the infill design, slicing software is used, which generally creates the infill uniformly throughout the part. When such a part is subjected to external loading, not all the infill regions will experience the same amount of stress. Therefore, using uniform infill throughout the part is not the most optimised solution in terms of material usage. We aim to develop a numerical tool to evolve the infill design with respect to the mechanical stresses generated by the external loads. To achieve this, we propose two different methodologies based on an iterative process using refinement technique and remeshing techniques coupled to Finite Element simulation (FE simulation) to control the internal structure of the part without changing the contour. These methodologies aim to reinforce the infill of the part without changing the contour, in the area where the mechanical strength must be improved to strengthen the structure, but also to decrease the amount of material to reduce the printing time
33
Galland, Florent. "An adaptive model reduction approach for 3D fatigue crack growth in small scale yielding conditions." Phd thesis, INSA de Lyon, 2011. http://tel.archives-ouvertes.fr/tel-00596397.
Повний текст джерелаАнотація:
It has been known for decades that fatigue crack propagation in elastic-plastic media is very sensitive to load history since the nonlinear behavior of the material can have a great influence on propagation rates. However, the raw computation of millions of fatigue cycles with nonlinear material behavior on tridimensional structures would lead to prohibitive calculation times. In this respect, we propose a global model reduction strategy, mixing both the a posteriori and a priori approaches in order to drastically decrease the computational cost of these types of problems. First, the small scale yielding hypothesis is assumed, and an a posteriori model reduction of the plastic behavior of the cracked structure is performed. This reduced model provides incrementally the plastic state in the vicinity of the crack front, from which the instantaneous crack growth rate is inferred. Then an additional a priori model reduction technique is used to accelerate even more the time to solution of the whole problem. This a priori approach consists in building incrementally and without any previous calculations a reduced basis specific to the considered test-case, by extracting information from the evolving displacement field of the structure. Then the displacement solutions of the updated crack geometries are sought as linear combinations of those few basis vectors. The numerical method chosen for this work is the finite element method. Hence, during the propagation the spatial discretization of the model has to be updated to be consistent with the evolving crack front. For this purpose, a specific mesh morphing technique is used, that enables to discretize the evolving model geometry with meshes of the same topology. This morphing method appears to be a key component of the model reduction strategy. Finally, the whole strategy introduced above is embedded inside an adaptive approach, in order to ensure the quality of the results with respect to a given accuracy. The accuracy and the efficiency of this global strategy have been shown through several examples; either in bidimensional and tridimensional cases for model crack propagation, including the industrial example of a helicopter structure.
34
Itta, Francesca. "Biomechanical modeling of parotid glands morphing in head & neck radiation therapy treatments." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2016. http://amslaurea.unibo.it/11221/.
Повний текст джерелаАнотація:
Durante i trattamenti radioterapici dei pazienti oncologici testa-collo, le ghiandole parotidee (PGs) possono essere indebitamente irradiate a seguito di modificazioni volumetriche-spaziali inter/intra-frazione causate da fattori quali il dimagrimento, l’esposizione a radiazioni ionizzanti ed il morphing anatomico degli organi coinvolti nelle aree d’irraggiamento. Il presente lavoro svolto presso la struttura di Fisica Medica e di Radioterapia Oncologica dell’A.O.U di Modena, quale parte del progetto di ricerca del Ministero della Salute (MoH2010, GR-2010-2318757) “ Dose warping methods for IGRT and Adaptive RT: dose accumulation based on organ motion and anatomical variations of the patients during radiation therapy treatments ”, sviluppa un modello biomeccanico in grado di rappresentare il processo di deformazione delle PGs, considerandone la geometria, le proprietà elastiche e l'evoluzione durante il ciclo terapeutico. Il modello di deformazione d’organo è stato realizzato attraverso l’utilizzo di un software agli elementi finiti (FEM). Molteplici superfici mesh, rappresentanti la geometria e l’evoluzione delle parotidi durante le sedute di trattamento, sono state create a partire dai contorni dell’organo definiti dal medico radioterapista sull’immagine tomografica di pianificazione e generati automaticamente sulle immagini di setup e re-positioning giornaliere mediante algoritmi di registrazione rigida/deformabile. I constraints anatomici e il campo di forze del modello sono stati definiti sulla base di ipotesi semplificative considerando l’alterazione strutturale (perdita di cellule acinari) e le barriere anatomiche dovute a strutture circostanti. L’analisi delle mesh ha consentito di studiare la dinamica della deformazione e di individuare le regioni maggiormente soggette a cambiamento. Le previsioni di morphing prodotte dal modello proposto potrebbero essere integrate in un treatment planning system per metodiche di Adaptive Radiation Therapy.
35
Cook, Stephen. "Adaptive mesh methods for numerical weather prediction." Thesis, University of Bath, 2016. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.707591.
Повний текст джерелаАнотація:
This thesis considers one-dimensional moving mesh (MM) methods coupled with semi-Lagrangian (SL) discretisations of partial differential equations (PDEs) for meteorological applications. We analyse a semi-Lagrangian numerical solution to the viscous Burgers’ equation when using linear interpolation. This gives expressions for the phase and shape errors of travelling wave solutions which decay slowly with increasing spatial and temporal resolution. These results are verified numerically and demonstrate qualitative agreement for high order interpolants. The semi-Lagrangian discretisation is coupled with a 1D moving mesh, resulting in a moving mesh semi-Lagrangian (MMSL) method. This is compared against two moving mesh Eulerian methods, a two-step remeshing approach, solved with the theta-method, and a coupled moving mesh PDE approach, which is solved using the MATLAB solver ODE45. At each time step of the SL method, the mesh is updated using a curvature based monitor function in order to reduce the interpolation error, and hence numerical viscosity. This MMSL method exhibits good stability properties, and captures the shape and speed of the travelling wave well. A meteorologically based 1D vertical column model is described with its SL solution procedure. Some potential benefits of adaptivity are demonstrated, with static meshes adapted to initial conditions. A moisture species is introduced into the model, although the effects are limited.
36
Collins, Gordon. "Invariant adaptive domain methods." Thesis, University of Bristol, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.245511.
Повний текст джерела
37
Dabonneville, Felix. "Développement d'une méthode numérique multi-échelle et multi-approche appliquée à l'atomisation." Thesis, Normandie, 2018. http://www.theses.fr/2018NORMR018/document.
Повний текст джерелаАнотація:
L’objet de cette thèse a été de développer une méthode numérique multi-approche et multiéchelle appliquée à la simulation d’écoulements diphasiques de fluides non miscibles, incompressibles et isothermiques et plus particulièrement à l’atomisation primaire. Cette méthode repose sur une approche couplée entre un maillage local raffiné et un maillage global plus large. Le couplage est explicite avec raffinement en temps, c’est-à-dire que chaque domaine évolue selon son propre pas de temps. Afin de prendre en compte les différentes échelles en temps et en espace dans le processus d’atomisation, cette méthode numérique couple deux méthodes numériques diphasiques différentes : une méthode de capture de l’interface dans le domaine local raffiné près de l’injecteur et une méthode de sous-maille dans le domaine global grossier et la région du spray dispersé. Le code développé et parallélisé dans le logiciel OpenFOAMR s’avère capable de réduire de manière significative le temps de calcul d’une simulation aux grandes échelles de l’atomisation dans un injecteur coaxial, tout en prédisant de manière fiable les données expérimentalesThe purpose of this work has been to develop a multi-approach and multi-scale numerical method applied to the simulation of two-phase flows involving non miscible, incompressible and isothermal fluids, and more specifically primary atomization. This method is based on a coupled approach between a refined local mesh and a coarser global mesh. The coupling is explicit with refinement in time, i.e. each domain evolves following its own time-step. In order to account for the different scales in space and time of the atomization process, this numerical method couples two different two-phase numerical methods: an interface capturing method in the refined local domain near the injector and a sub-grid method in the coarser global domain in the dispersed spray region. The code has been developed and parallelized in the OpenFOAMR software. It is able to reduce significantly the computational cost of a large eddy simulation of a coaxial atomization, while predicting with accuracy the experimental data
38
Alvarez, Catalina Maria Rua. "Simulação computacional adaptativa de escoamentos bifásicos viscoelásticos." Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/45/45132/tde-07082013-112937/.
Повний текст джерелаАнотація:
A simulação computacional de escoamentos incompressíveis multifásicos tem avançado continuamente e é uma área extremamente importante em Dinâmica de Fluidos Computacional (DFC) por suas várias aplicações na indústria, em medicina e em biologia, apenas para citar alguns exemplos. Apresentamos modelos matemáticos e métodos numéricos tendo em vista simulações computacionais de fluidos bifásicos newtonianos e viscoelásticos (não newtonianos), em seus regimes transiente e estacionário de escoamento. Os ingredientes principais requeridos são o Modelo de Um Fluido e o Método da Fronteira Imersa em malhas adaptativas, usados em conjunto com os métodos da Projeção de Chorin-Temam e de Uzawa. Tais metodologias são obtidas a partir de equações a derivadas parciais simples as quais, naturalmente, são resolvidas em malhas adaptativas empregando métodos multinível-multigrid. Em certas ocasiões, entretanto, para escoamentos modelados pelas equações de Navier-Stokes (e.g. em problemas onde temos altos saltos de massa específica), tem-se problemas de convergência no escopo destes métodos. Além disso, no caso de escoamentos estacionários, resolver as equações de Stokes em sua forma discreta por tais métodos não é uma tarefa fácil. Verificamos que zeros na diagonal do sistema linear resultante impedem que métodos de relaxação usuais sejam empregados. As dificuldades mencionadas acima motivaram-nos a pesquisar por, a propor e a desenvolver alternativas à metodologia multinível-multigrid. No presente trabalho, propomos métodos para obter explicitamente as matrizes que representam os sistemas lineares oriundos da discretização daquelas equações a derivadas parciais simples que são a base dos métodos de Projeção e de Uzawa. Ter em mãos estas representações matriciais é vantajoso pois com elas podemos caracterizar tais sistemas lineares em termos das propriedades de seus raios espectrais, suas definições e simetria. Muito pouco (ou nada) se sabe efetivamente sobre estes sistemas lineares associados a discretizações em malhas compostas bloco-estruturadas. É importante salientarmos que, além disso, ganhamos acesso ao uso de bibliotecas numéricas externas, como o PETSc, com seus pré-condicionadores e métodos numéricos, seriais e paralelos, para resolver sistemas lineares. Infraestrutura para nossos desenvolvimentos foi propiciada pelo código denominado ``AMR2D\'\', um código doméstico para problemas em DFC que vem sendo cuidado ao longo dos anos pelos grupos de pesquisa em DFC do IME-USP e da FEMEC-UFU. Estendemos este código, adicionando módulos para escoamentos viscoelásticos e para escoamentos estacionários modelados pelas equações de Stokes. Além disso, melhoramos de maneira notável as rotinas de cálculo de valores fantasmas. Tais melhorias permitiram a implementação do Método dos Gradientes Bi-Conjugados, baseada em visitas retalho-a-retalho e varreduras da estrutura hierárquica nível-a-nível, essencial à implementação do Método de Uzawa.Numerical simulation of incompressible multiphase flows has continuously of advanced and is an extremely important area in Computational Fluid Dynamics (CFD) because its several applications in industry, in medicine, and in biology, just to mention a few of them. We present mathematical models and numerical methods having in sight the computational simulation of two-phase Newtonian and viscoelastic fluids (non-Newtonian fluids), in the transient and stationary flow regimes. The main ingredients required are the One-fluid Model and the Immersed Boundary Method on dynamic, adaptive meshes, in concert with Chorin-Temam Projection and the Uzawa methods. These methodologies are built from simple linear partial differential equations which, most naturally, are solved on adaptive grids employing mutilevel-multigrid methods. On certain occasions, however, for transient flows modeled by the Navier-Stokes equations (e.g. in problems where we have high density jumps), one has convergence problems within the scope of these methods. Also, in the case of stationary flows, solving the discrete Stokes equations by those methods represents no straight forward task. It turns out that zeros in the diagonal of the resulting linear systems coming from the discrete equations prevent the usual relaxation methods from being used. Those difficulties, mentioned above, motivated us to search for, to propose, and to develop alternatives to the multilevel-multigrid methodology. In the present work, we propose methods to explicitly obtain the matrices that represent the linear systems arising from the discretization of those simple linear partial differential equations which form the basis of the Projection and Uzawa methods. Possessing these matrix representations is on our advantage to perform a characterization of those linear systems in terms of their spectral, definition, and symmetry properties. Very little is known about those for adaptive mesh discretizations. We highlight also that we gain access to the use of external numerical libraries, such as PETSc, with their preconditioners and numerical methods, both in serial and parallel versions, to solve linear systems. Infrastructure for our developments was offered by the code named ``AMR2D\'\' - an in-house CFD code, nurtured through the years by IME-USP and FEMEC-UFU CFD research groups. We were able to extend that code by adding a viscoelastic and a stationary Stokes solver modules, and improving remarkably the patchwise-based algorithm for computing ghost values. Those improvements proved to be essential to allow for the implementation of a patchwise Bi-Conjugate Gradient Method which ``powers\'\' Uzawa Method.
39
Wang, Peng. "New methods and astrophysical applications of adaptive mesh fluid simulations /." May be available electronically:, 2009. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.
Повний текст джерела
40
Nós, Rudimar Luiz. "\"Simulações de escoamentos tridimensionais bifásicos empregando métodos adaptativos e modelos de campo fase\"." Universidade de São Paulo, 2007. http://www.teses.usp.br/teses/disponiveis/45/45132/tde-08052007-143200/.
Повний текст джерелаАнотація:
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.
41
Green, Andrew David. "Cosmological applications of multi-grid methods." Thesis, University of Oxford, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.365825.
Повний текст джерела
42
Thompson, Ross Anthony. "Galerkin Projections Between Finite Element Spaces." Thesis, Virginia Tech, 2015. http://hdl.handle.net/10919/52968.
Повний текст джерелаАнотація:
Adaptive mesh refinement schemes are used to find accurate low-dimensional approximating spaces when solving elliptic PDEs with Galerkin finite element methods. For nonlinear PDEs, solving the nonlinear problem with Newton's method requires an initial guess of the solution on a refined space, which can be found by interpolating the solution from a previous refinement. Improving the accuracy of the representation of the converged solution computed on a coarse mesh for use as an initial guess on the refined mesh may reduce the number of Newton iterations required for convergence. In this thesis, we present an algorithm to compute an orthogonal L^2 projection between two dimensional finite element spaces constructed from a triangulation of the domain. Furthermore, we present numerical studies that investigate the efficiency of using this algorithm to solve various nonlinear elliptic boundary value problems.Master of Science
43
Arpaia, Luca. "Adaptive techniques for free surface flow simulations : Application to the study of the 2011 Tohoku Tsunami." Thesis, Bordeaux, 2017. http://www.theses.fr/2017BORD0666.
Повний текст джерелаАнотація:
Dans cette thèse, nous implémentons les équations de Saint Venant (SV), ou de Shallow Water, sur des grilles non structurées afin de simuler des écoulements de surface libre sur des bathymétries irrégulières, incluant inondation et d'autres phénomènes complexes qui se produisent généralement dans des applications hydrodynamiques. En particulier, nous voudrions simuler avec précision les tsunamis, la propagation d'onde à grande échelle jusqu'à l'inondation très localisé. À cette fin, nous utilisons deux méthodes qui sont comparées en profondeur le long du manuscrit: la méthode des volumes finis, très populaire dans la communauté hydrodynamique et hydraulique et une technique plus récente appelée Distribution du Résidu appartenant à la classe des schémas upwind multidimensionnels. Pour améliorer la résolution de certaines caractéristiques de l'écoulement telles que le développement du déferlement et les inondations à petite échelle, nous utilisons une adaptation de maillage dynamique basée sur une redistribution des noeuds de maillage, aussi appelé adaptation de type r (r signifiant "relocalisation"). La combinaison appropriée de cette méthode avec le solveur SV est généralement appelée Méthode de Maillage Mobile. Parmi les nombreux algorithmes de maillage mobile disponibles, nous proposons une forme Arbitrary Lagrangian Eulerian (ALE) des équation SV qui permettent de faire évoluer les variables de flux d'une maille à l'autre de manière élégante. Dans ce contexte, nous soulignons les principales contributions de la thèse: Nous montrons l'importance de conserver toutes les propriétés standards d'un solveur Eulérien SWE tel que la préservation du lac au repos et la conservation de la masse également sur des maillages en mouvement. Notre couplage ALE est comparé à l'approche de rezoning, avec une légère augmentation de la performance globale de l'algorithme en termes de précision et de temps CPU. Nous étendons l'approche ALE sur la sphère afin d'inclure l'effet de la courbure terrestre dans la dynamique de propagation des ondes à grande échelle du tsunami. La simulation du tsunami 2011 de Tohoku-Honsu devrait prouver que la méthode de maillage mobile étudiée dans la thèse, bien que simple, pourrait être un bon candidat pour réduire le coût de calcul des simulations de tsunamiIn this thesis we implement the Shallow Water equations (SWEs) on unstructured grids in order to simulate free surface flow over irregular bathymetries, wetting/drying and other complex phenomena that typically occurs in hydrodynamic applications. In particular we would to accurately simulate tsunami events, from large scale wave propagation up to localized runup. To this aim we use two methods that are extensively compared along the manuscript: the Finite Volume method, which is very popular in the hydrodynamics and hydraulic community and a more recent technique called Residual Distribution which belongs to the class of multidimensional upwind schemes. To enhance the resolution of important flow feature such as bore development or small scale flooding, we use a dynamic mesh adaptation based on a redistribution of mesh nodes or r-adaptation (r stands for "relocation"). The proper combination of this method with the flow solver is usually referred to as Moving Mesh Method. Among the many different moving mesh algorithms available we propose an Arbitrary Lagrangian Eulerian (ALE) form of the SWEs which elegantly permit to evolve the flow variables from one mesh to the updated one
44
Limare, Alexandre. "Raffinement adaptatif de maillages intersectants, en Volumes Finis d’ordre élevé, pour l’aéropropulsion." Thesis, Troyes, 2017. http://www.theses.fr/2017TROY0028.
Повний текст джерелаАнотація:
Cette thèse concerne le développement d'outils industriels de simulation d'écoulements instationnaires compressibles autour de corps en mouvements relatifs pour des lanceurs spatiaux. Le code FLUSEPA, développé par ArianeGroup, s'appuie sur une formulation Volumes Finis d'ordre élevé et utilise un chevauchement de maillage conservatif par intersections géométriques. Les faces d'intersection autorisent le calcul des flux entre mailles chevauchantes et mailles coupées, permettant le traitement correct des chocs et de l'ensemble des structures instationnaires dans les zones de recouvrement. Au cours de cette thèse, une technique de raffinement de maillage adaptatif (AMR) par création d'arbres « octree » par maille a été implémentée pour des maillages non-structurés hexaédriques. Elle permet de simplifier la création des maillages et de garantir une résolution locale en adéquation avec la physique captée. Le module AMR s’intègre avec cohérence aux schémas de discrétisation spatio-temporels existants afin d’assurer la conservativité et la précision, de plus, il dégrade peu les performances algorithmiques. Ainsi, l’exécution du programme s'effectue sur plusieurs processus avec un équilibrage de charge spécifique au schéma explicite temporel adaptatif et comporte une procédure assurant une projection conservative d’ordre élevé des variables de calcul sur les mailles raffinées. Ces deux propriétés assurent la cohérence avec la stratégie numérique existante. La simulation de plusieurs cas tests montre le potentiel de ce module et permet de valider son implémentationThis thesis is part of an effort to develop numerical industrial tools for the simulation of unsteady compressible flows about bodies in relation motion often encountered in the context of space launchers. FLUSEPA, a code developed by ArianeGroup, relies on a high-order Finite Volume formulation and a conservative overlapping of meshes using geometric intersections. In the overlapping regions, geometric faces allow the calculation of fluxes and the advection of shocks and unsteady structures. This manuscript describes the implementation of a cell-based Adaptive Mesh Refinement (AMR) technique for unstructured meshes composed of hexahedra. This new method eases the mesh construction process and ensures a local resolution adapted to the physical properties captured. In order to be functional, the AMR module must be consistent with the pre-existing spatio-temporal numerical schemes (i.e. be conservative and precise) and also keep the algorithmic performance. Thus, the obtained solution is divided between several processes with a load balancing specific to the explicit temporal adaptive numerical scheme was devised and includes a high-order conservative projection of the variables for the refined cells. These two properties compose a consistant global numerical strategy. Several test cases are run using this module and validate its implementation
45
Alharbi, Abdulghani Ragaa. "Numerical solution of thin-film flow equations using adaptive moving mesh methods." Thesis, Keele University, 2016. http://eprints.keele.ac.uk/2356/.
Повний текст джерелаАнотація:
Thin liquid films are found everywhere in nature. Their flows play a fundamental role in a wide range of applications and processes. They are central to a number of biological, industrial, chemical, geophysical and environmental applications. Thin films driven by external forces are susceptible to instabilities leading to the break-up of the film into fingering-type patterns. These fingering-type patterns are usually undesirable as they lead to imperfections and dry spots. This behaviour has motivated theoreticians to try to understand the behaviour of the flow and the mechanisms by which these instabilities occur. In the physically relevant case when surface tension is large, the film’s free surface exhibits internal layers where there is rapid spatial variation in the film’s curvature over very short lengthscales and away from these internal layers the film’s curvature is almost negligible. This provides the main motivation for this thesis which is to develop adaptive numerical solution techniques for thin film flow equations that fully resolve such internal layers in order to obtain accurate numerical solutions. We consider two thin film flow problems in one and two-dimensions to test the adaptive numerical solution techniques developed in this thesis. The first problem we consider is related to a liquid sheet or drop spreading down an inclined pre-wetted plane due to influence of gravity. The second problem we consider is also related to the spreading of a liquid sheet or drop down an inclined pre-wetted plane including surfactant-related effects in addition to gravity. We follow the r-adaptive moving mesh technique which uses moving mesh partial differential equations (MMPDEs) to adapt and move the mesh coupled to the underlying PDE(s). We show how this technique can accurately resolve the various one and two-dimensional structures observed in the above test problems as well as reduce the computational effort in comparison to numerical solutions using a uniform mesh.
46
Eibner, Tino, and Jens Markus Melenk. "An adaptive strategy for hp-FEM based on testing for analyticity." Universitätsbibliothek Chemnitz, 2006. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200601484.
Повний текст джерелаАнотація:
We present an $hp$-adaptive strategy that is based
on estimating the decay of the expansion coefficients
when a function is expanded in $L^2$-orthogonal
polynomails on a triangle or a tetrahedron.
This method is justified by showing that the decay
of the coefficients is exponential if and only if
the function is analytic.
Numerical examples illustrate the performance of
this approach, and we compare it with two other
$hp$-adaptive strategies.
47
Dion-Dallaire, Andrée-Anne. "A Framework for Mesh Refinement Suitable for Finite-Volume and Discontinuous-Galerkin Schemes with Application to Multiphase Flow Prediction." Thesis, Université d'Ottawa / University of Ottawa, 2021. http://hdl.handle.net/10393/42204.
Повний текст джерелаАнотація:
Modelling multiphase flow, more specifically particle-laden flow, poses multiple challenges. These difficulties are heightened when the particles are differentiated by a set of “internal” variables, such as size or temperature. Traditional treatments of such flows can be classified in two main categories, Lagrangian and Eulerian methods. The former approaches are highly accurate but can also lead to extremely expensive computations and challenges to load balancing on parallel machines. In contrast, the Eulerian models offer the promise of less expensive computations but often introduce modelling artifacts and can become more complicated and expensive when a large number of internal variables are treated. Recently, a new model was proposed to treat such situations. It extends the ten-moment Gaussian model for viscous gases to the treatment of a dilute particle phase with an arbitrary number of internal variables. In its initial application, the only internal variable chosen for the particle phase was the particle diameter. This new polydisperse Gaussian model (PGM) comprises 15 equations, has an eigensystem that can be expressed in closed form and also possesses a convex entropy. Previously, this model has been tested in one dimension. The PGM was developed with the detonation of radiological dispersal devices (RDD) as an immediate application. The detonation of RDDs poses many numerical challenges, namely the wide range of spatial and temporal scales as well as the high computational costs to accurately resolve solutions. In order to address these issues, the goal of this current project is to develop a block-based adaptive mesh refinement (AMR) implementation that can be used in conjunction with a parallel computer. Another goal of this project is to obtain the first three-dimensional results for the PGM. In this thesis, the kinetic theory of gases underlying the development of the PGM is studied. Different numerical schemes and adaptive mesh refinement methods are described. The new block-based adaptive mesh refinement algorithm is presented. Finally, results for different flow problems using the new AMR algorithm are shown, as well as the first three-dimensional results for the PGM.
48
Jeffers, Rebecca Siân. "Spatial goal-based error estimation and adaptive mesh refinement (AMR) for diamond difference discrete ordinate (DD-SN) methods." Thesis, Imperial College London, 2016. http://hdl.handle.net/10044/1/44551.
Повний текст джерелаАнотація:
A derivation of the dual weighted residual (DWR) goal-based error estimator is given for the 1-D DD-SN discretisation of the fixed source and eigenvalue neutron transport equations. The quantity of interest (QoI) is linear and non-linear respectively. Isotropic scattering is assumed. Error correction and adaptive mesh refinement (AMR) were implemented for the 1-D code to reduce the error in the QoI as a function of the number of degrees of freedom (DoF) required for the forward solution. Higher order DD methods in the 1-D code allowed for h, p and hp AMR. Cell-wise DWRs were used to select cells for refinement. In the hp case, a merit function was used to choose between h or p refinement for a given cell. The extension of the weighted residual (WR) view of the traditional 1-D DD-SN equations to multidimensions results in a bilinear/trilinear approximation within the cell and cell vertex values as unknowns. However, traditional DD codes express the unknowns as cell-average and cell-edge average fluxes. The bilinear and trilinear components of the flux within a cell cannot be recovered from these values for use in the DWR calculation. Two 2-D codes were written, one keeping the cell-vertex values as unknowns and the other implementing the traditional DD scheme. In the former the DWR is calculated as in the 1-D case. The flux result of the latter is mapped into a discontinuous finite element space with a zero bilinear term before calculating the DWR. The vertex code provided the best error estimates. The DWR error estimate had, in general, the same convergence rate as the reference error, though the effectivity index tended towards unity only for fixed source problems with high scatter ratios. The equivalence between the vertex method and the traditional DD method means that the SPN acceleration scheme used by EDF can still be applied.
49
Krishnan, Sreedevi. "An Adaptively refined Cartesian grid method for moving boundary problems applied to biomedical systems." Diss., University of Iowa, 2006. https://ir.uiowa.edu/etd/87.
Повний текст джерелаАнотація:
A major drawback in the operation of mechanical heart valve prostheses is thrombus formation in the near valve region potentially due to the high shear stresses present in the leakage jet flows through small gaps between leaflets and the valve housing. Detailed flow analysis in this region during the valve closure phase is of interest in understanding the relationship between shear stress and platelet activation.
An efficient Cartesian grid method is developed for the simulation of incompressible flows around stationary and moving three-dimensional immersed solid bodies as well as fluid-fluid interfaces. The embedded boundaries are represented using Levelsets and treated in a sharp manner without the use of source terms to represent boundary effects. The resulting algorithm is implemented in a straightforward manner in three dimensions and retains global second-order accuracy. When dealing with problems of disparate length scales encountered in many applications, it is necessary to resolve the physically important length scales adequately to ensure accuracy of the solution. Fixed grid methods often have the disadvantage of heavy mesh requirement for well resolved calculations. A quadtree based adaptive local mesh refinement scheme is developed to complement the sharp interface Cartesian grid method scheme for efficient and optimized calculations. Detailed timing and accuracy data is presented for a variety of benchmark problems involving moving boundaries.
The above method is then applied to modeling heart valve closure and predicting thrombus formation. Leaflet motion is calculated dynamically based on the fluid forces acting on it employing a fluid-structure interaction algorithm. Platelets are modeled and tracked as point particles by a Lagrangian particle tracking method which incorporates the hemodynamic forces on the particles. Leaflet closure dynamics including rebound is analyzed and validated against previous studies. Vortex shedding and formation of recirculation regions are observed downstream of the valve, particularly in the gap between the valve and the housing. Particle exposure to high shear and entrapment in recirculation regions with high residence time in the vicinity of the valve are observed corresponding to regions prone to thrombus formation.
50
Apel, T., and F. Milde. "Realization and comparison of various mesh refinement strategies near edges." Universitätsbibliothek Chemnitz, 1998. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199800531.
Повний текст джерелаАнотація:
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.