Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mesh Adaptation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 379 records · Page 21

Adaptive explicit and implicit finite element methods for transient thermal analysis

The application of adaptive finite element methods to the solution of transient heat conduction problems in two dimensions is investigated. The computational domain is represented by an unstructured assembly of linear triangular elements and the mesh adaptation is achieved by local regeneration of the grid, using an error estimation procedure coupled to an automatic triangular mesh generator. Two alternative solution procedures are considered. In the first procedure, the solution is advanced by explicit timestepping, with domain decomposition being used to improve the computational efficiency of the method. In the second procedure, an algorithm for constructing continuous lines which pass only once through each node of the mesh is employed. The lines are used as the basis of a fully implicit method, in which the equation system is solved by line relaxation using a block tridiagonal equation solver. The numerical performance of the two procedures is compared for the analysis of a problem involving a moving heat source applied to a convectively cooled cylindrical leading edge.

Probert, E. J.↗

Magnetotail Current Sheet Thinning and Magnetic Reconnection Dynamics in Global Modeling of Substorms

Magnetotail current sheet thinning and magnetic reconnection are key elements of magnetospheric substorms. We utilized the global MHD model BATS-R-US with Adaptive Mesh Refinement developed at the University of Michigan to investigate the formation and dynamic evolution of the magnetotail thin current sheet. The BATSRUS adaptive grid structure allows resolving magnetotail regions with increased current density up to ion kinetic scales. We investigated dynamics of magnetotail current sheet thinning in response to southwards IMF turning. Gradual slow current sheet thinning during the early growth phase become exponentially fast during the last few minutes prior to nightside reconnection onset. The later stage of current sheet thinning is accompanied by earthward flows and rapid suppression of normal magnetic field component $B-z$. Current sheet thinning set the stage for near-earth magnetic reconnection. In collisionless magnetospheric plasma, the primary mechanism controlling the dissipation in the vicinity of the reconnection site is non-gyrotropic effects with spatial scales comparable with the particle Larmor radius. One of the major challenges in global MHD modeling of the magnetotail magnetic reconnection is to reproduce fast reconnection rates typically observed in smallscale kinetic simulations. Bursts of fast reconnection cause fast magnetic field reconfiguration typical for magnetospheric substorms. To incorporate nongyritropic effects in diffusion regions we developed an algorithm to search for magnetotail reconnection sites, specifically where the magnetic field components perpendicular to the local current direction approaches zero and form an X-type configuration. Spatial scales of the diffusion region and magnitude of the reconnection electric field are calculated self-consistently using MHD plasma and field parameters in the vicinity of the reconnection site. The location of the reconnection sites and spatial scales of the diffusion region are updated during the simulations. Such an approach allows quantifying the interaction between large-scale global magnetospheric dynamics and microphysical processes in diffusion regions localized near reconnection sites. To clarify the role of smallscale non-MHD effects in diffusion region on the global magnetospheric dynamic and to test different models of dissipation we perform simulations with steady southward IMF driving of the magnetosphere.

Kuznetsova, M. M.↗

Adaptive Numerical Algorithms in Space Weather Modeling

Space weather describes the various processes in the Sun-Earth system that present danger to human health and technology. The goal of space weather forecasting is to provide an opportunity to mitigate these negative effects. Physics-based space weather modeling is characterized by disparate temporal and spatial scales as well as by different physics in different domains. A multi-physics system can be modeled by a software framework comprising of several components. Each component corresponds to a physics domain, and each component is represented by one or more numerical models. The publicly available Space Weather Modeling Framework (SWMF) can execute and couple together several components distributed over a parallel machine in a flexible and efficient manner. The framework also allows resolving disparate spatial and temporal scales with independent spatial and temporal discretizations in the various models. Several of the computationally most expensive domains of the framework are modeled by the Block-Adaptive Tree Solar wind Roe Upwind Scheme (BATS-R-US) code that can solve various forms of the magnetohydrodynamics (MHD) equations, including Hall, semi-relativistic, multi-species and multi-fluid MHD, anisotropic pressure, radiative transport and heat conduction. Modeling disparate scales within BATS-R-US is achieved by a block-adaptive mesh both in Cartesian and generalized coordinates. Most recently we have created a new core for BATS-R-US: the Block-Adaptive Tree Library (BATL) that provides a general toolkit for creating, load balancing and message passing in a 1, 2 or 3 dimensional block-adaptive grid. We describe the algorithms of BATL and demonstrate its efficiency and scaling properties for various problems. BATS-R-US uses several time-integration schemes to address multiple time-scales: explicit time stepping with fixed or local time steps, partially steady-state evolution, point-implicit, semi-implicit, explicit/implicit, and fully implicit numerical schemes. Depending on the application, we find that different time stepping methods are optimal. Several of the time integration schemes exploit the block-based granularity of the grid structure. The framework and the adaptive algorithms enable physics based space weather modeling and even forecasting.

Toth, Gabor↗

Implementation of a Mesh refinement algorithm into the quasi-static PIC code QuickPIC

Plasma-based acceleration (PBA) has emerged as a promising candidate for the accelerator technology used to build a future linear collider and/or an advanced light source. In PBA, a trailing or witness particle beam is accelerated in the plasma wave wakefield (WF) created by a laser or particle beam driver. The WF is often nonlinear and involves the crossing of plasma particle trajectories in real space and thus particle-in-cell methods are used. The distance over which the drive beam evolves is several orders of magnitude larger than the wake wavelength. This large disparity in length scales is amenable to the quasi-static approach. Three-dimensional (3D), quasi-static (QS), particle-in-cell (PIC) codes, e.g., QuickPIC, have been shown to provide high fidelity simulation capability with 2-4 orders of magnitude speedup over 3D fully explicit PIC codes. In PBA, the witness beam needs to be matched to the focusing forces of the WF to reduce the emittance growth. In some linear collider designs, the matched spot size of the witness beam can be 2 to 3 orders of magnitude smaller than the spot size (and wavelength) of the wakefield. Such an additional disparity in length scales is ideal for mesh refinement where the WF within the witness beam is described on a finer mesh than the rest of the WF. A mesh refinement scheme is described that has been implemented into the 3D QS PIC code, QuickPIC. Very fine (high) resolution is used in a small spatial region that includes the witness beam and progressively coarser resolutions in the rest of the simulation domain. A fast multigrid Poisson solver has been implemented for the field solve on the refined meshes and a Fast Fourier Transform (FFT) based Poisson solver is used for the coarse mesh. The code has been parallelized with both MPI and OpenMP, and the parallel scalability has also been improved by using pipelining. A preliminary adaptive mesh refinement technique is described to optimize the computational time for simulations with an evolving witness beam size. Several test problems are used to verify that the mesh refinement algorithm provides accurate results. Additionally, the results are benchmarked against highly resolved simulations exhibiting near-azimuthal symmetry, performed using QPAD—a novel hybrid QS PIC code that uses a PIC description in the coordinates (r, ct – z) and a gridless description in the azimuthal angle, Φ.

Linear collider↗

Comparison of Full-Field and Integrated CFD Convergence Based on Richardson Extrapolation

This work investigated the usefulness of Richardson extrapolation--based discretization error estimates across all points in a solution field to produce a spatial convergence field for a computational fluid dynamics (CFD) simulation. The presented work used previously developed methods for Richardson extrapolation to compute the convergence orders of a CFD simulation at all points of the base (coarsest) mesh solution. Three test cases of increasing complexity were considered: Poiseuille flow, incompressible flow around a sharp corner, and transonic flow over an RAE 2822 airfoil. These test cases highlighted the potential of the proposed method to identify error sources and their relation to the model system-response-quantity convergence orders. However, these test cases also revealed the immaturity of the proposed method stemming from the unreliability of computing observed convergence orders at single points. Nonetheless, the test cases highlighted that the observed convergence orders allow for a more accurate diagnosis of constructive and destructive error transport than mesh pair error estimates. In the long run, the proposed method can be a tool for developing efficient and advanced error management strategies like adaptive mesh refinement.

Weinmeister, Justin↗

A Robust and Scalable Software Library for Parallel Adaptive Refinement on Unstructured Meshes

The design and implementation of Pyramid, a software library for performing parallel adaptive mesh refinement (PAMR) on unstructured meshes, is described. This software library can be easily used in a variety of unstructured parallel computational applications, including parallel finite element, parallel finite volume, and parallel visualization applications using triangular or tetrahedral meshes. The library contains a suite of well-designed and efficiently implemented modules that perform operations in a typical PAMR process. Among these are mesh quality control during successive parallel adaptive refinement (typically guided by a local-error estimator), parallel load-balancing, and parallel mesh partitioning using the ParMeTiS partitioner. The Pyramid library is implemented in Fortran 90 with an interface to the Message-Passing Interface (MPI) library, supporting code efficiency, modularity, and portability. An EM waveguide filter application, adaptively refined using the Pyramid library, is illustrated.

Lou, John Z.↗

A Posteriori Error Estimation for Finite Volume and Finite Element Approximations Using Broken Space Approximation

We consider a posteriori error estimates for finite volume and finite element methods on arbitrary meshes subject to prescribed error functionals. Error estimates of this type are useful in a number of computational settings: (1) quantitative prediction of the numerical solution error, (2) adaptive meshing, and (3) load balancing of work on parallel computing architectures. Our analysis recasts the class of Godunov finite volumes schemes as a particular form of discontinuous Galerkin method utilizing broken space approximation obtained via reconstruction of cell-averaged data. In this general framework, weighted residual error bounds are readily obtained using duality arguments and Galerkin orthogonality. Additional consideration is given to issues such as nonlinearity, efficiency, and the relationship to other existing methods. Numerical examples are given throughout the talk to demonstrate the sharpness of the estimates and efficiency of the techniques. Additional information is contained in the original.

Barth, Timothy J.↗

Euler and Navier-Stokes computations for two-dimensional geometries using unstructured meshes

A general purpose unstructured mesh solver for steady-state two-dimensional inviscid and viscous flows is described. The efficiency and accuracy of the method are enhanced by the simultaneous use of adaptive meshing and an unstructured multigrid technique. A method for generating highly stretched triangulations in regions of viscous flow is outlined, and a procedure for implementing an algebraic turbulence model on unstructured meshes is described. Results are shown for external and internal inviscid flows and for turbulent viscous flow over a multi-element airfoil configuration.

Mavriplis, D. J.↗

Euler and Navier-Stokes computations for airfoil geometries using unstructured meshes

A general purpose unstructured mesh solver for steady-state two-dimensional inviscid and viscous flows is described. The efficiency and accuracy of the method are enhanced by the simultaneous use of adaptive meshing and an unstructured multigrid technique. A method for generating highly stretched triangulations in regions of viscous flow is outlined, and a procedure for implementing an algebraic turbulence model on unstructured meshes is described. Results are shown for external and internal inviscid flows and for turbulent viscous flow over a multi-element airfoil configuration.

Mavriplis, D. J.↗

Resolving the Formation of Protogalaxies: Feedback from the First Stars - 3

The first stars form in dark matter halos of masses 106 M as suggested by an increasing number of numerical simulations. Radiation feedback from these stars expels most of the gas from the shallow potential well of their surrounding dark matter halos.We use cosmological adaptive mesh refinement simulations that include self-consistent Population III star formation and feedback to examine the properties of assembling early dwarf galaxies. Accurate radiative transport is modeled with adaptive ray tracing. We include supernova explosions and follow the metal enrichment of the intergalactic medium. The calculations focus on the formation of several dwarf galaxies and their progenitors. In these halos, baryon fractions in 10(exp 8) Stelar Mass halos decrease by a factor of 2 with stellar feedback and by a factor of 3 with supernova explosions.We find that radiation feedback and supernova explosions increase gaseous spin parameters up to a factor of 4 and vary with time. Stellar feedback, supernova explosions, and H2 cooling create a complex, multiphase interstellar medium whose densities and temperatures can span up to 6 orders of magnitude at a given radius. The pair-instability supernovae of Population III stars alone enrich the halos with virial temperatures of 10(exp 4) K to approximately 10(exp -3) of solar metallicity.We find that 40% of the heavy elements resides in the intergalactic medium (IGM) at the end of our calculations. The highest metallicity gas exists in supernova remnants and very dilute regions of the IGM.

Wise, John H.↗

Heating and Large Scale Dynamics of the Solar Corona

The effort was concentrated in the areas: coronal heating mechanism, unstructured adaptive grid algorithms, numerical modeling of magnetic reconnection in the MRX experiment: effect of toroidal magnetic field and finite pressure, effect of OHMIC heating and vertical magnetic field, effect of dynamic MESH adaption.

Schnack, Dalton D.↗

Mesh quality control for multiply-refined tetrahedral grids

A new algorithm for controlling the quality of multiply-refined tetrahedral meshes is presented in this paper. The basic dynamic mesh adaption procedure allows localized grid refinement and coarsening to efficiently capture aerodynamic flow features in computational fluid dynamics problems; however, repeated application of the procedure may significantly deteriorate the quality of the mesh. Results presented show the effectiveness of this mesh quality algorithm and its potential in the area of helicopter aerodynamics and acoustics.

Biswas, Rupak↗

Multigrid techniques for unstructured meshes

An overview of current multigrid techniques for unstructured meshes is given. The basic principles of the multigrid approach are first outlined. Application of these principles to unstructured mesh problems is then described, illustrating various different approaches, and giving examples of practical applications. Advanced multigrid topics, such as the use of algebraic multigrid methods, and the combination of multigrid techniques with adaptive meshing strategies are dealt with in subsequent sections. These represent current areas of research, and the unresolved issues are discussed. The presentation is organized in an educational manner, for readers familiar with computational fluid dynamics, wishing to learn more about current unstructured mesh techniques.

Mavriplis, D. J.↗

How Very Massive Metal-Free Stars Start Cosmological Reionization

The initial conditions and relevant physics for the formation of the earliest galaxies are well specified in the concordance cosmology. Using ab initio cosmological Eulerian adaptive mesh refinement radiation hydrodynamical calculations, we discuss how very massive stars start the process of cosmological reionization. The models include nonequilibrium primordial gas chemistry and cooling processes and accurate radiation transport in the case B approximation using adaptively ray-traced photon packages, retaining the time derivative in the transport equation. Supernova feedback is modeled by thermal explosions triggered at parsec scales. All calculations resolve the local Jeans length by at least 16 grid cells at all times and as such cover a spatial dynamic range of approx.10(exp 6). These first sources of reionization are highly intermittent and anisotropic and first photoionize the small-scale voids surrounding the halos they form in, rather than the dense filaments they are embedded in. As the merging objects form larger, dwarf-sized galaxies, the escape fraction of UV radiation decreases and the H II regions only break out on some sides of the galaxies, making them even more anisotropic. In three cases, SN blast waves induce star formation in overdense regions that were formed earlier from ionization front instabilities. These stars form tens of parsecs away from the center of their parent DM halo. Approximately five ionizing photons are needed per sustained ionization when star formation in 10(exp 6) stellar Mass halos is dominant in the calculation. As the halos become larger than approx.10(exp 7) Stellar Mass, the ionizing photon escape fraction decreases, which in turn increases the number of photons per ionization to 15-50, in calculations with stellar feedback only. Radiative feedback decreases clumping factors by 25% when compared to simulations without star formation and increases the average temperature of ionized gas to values between 3000 and 10,000 K.

Wise, John H.↗

Sparse-grid discontinuous Galerkin methods for the Vlasov–Poisson–Lenard–Bernstein model

Sparse-grid methods have recently gained interest in reducing the computational cost of solving high-dimensional kinetic equations. In this paper, we construct adaptive and hybrid sparse-grid methods for the Vlasov–Poisson–Lenard–Bernstein (VPLB) model. This model has applications to plasma physics and is simulated in two reduced geometries: a 0x3v space homogeneous geometry and a 1x3v slab geometry. Here we use the discontinuous Galerkin (DG) method as a base discretization due to its high-order accuracy and ability to preserve important structural properties of partial differential equations. We utilize a multiwavelet basis expansion to determine the sparse-grid basis and the adaptive mesh criteria. We analyze the proposed sparse-grid methods on a suite of three test problems by computing the savings afforded by sparse-grids in comparison to standard solutions of the DG method. The results are obtained using the adaptive sparse-grid discretization library ASGarD.

97 MATHEMATICS AND COMPUTING↗

An alternative to unstructured grids for computing gas dynamic flows around arbitrarily complex two-dimensional bodies

In this paper we describe an approach for dealing with arbitrary complex, two dimensional geometries, the so-called cartesian boundary method. Conceptually, the cartesian boundary method is quite simple. Solid bodies blank out areas of a background, cartesian mesh, and the resultant cut cells are singled out for special attention. However, there are several obstacles that must be overcome in order to achieve a practical scheme. We present a general strategy that overcomes these obstacles, together with some details of our successful conversion of an adaptive mesh algorithm from a body-fitted code to a cartesian boundary code.

Quirk, James J.↗

Shape optimization of three-dimensional stamped and solid automotive components

The shape optimization of realistic, 3-D automotive components is discussed. The integration of the major parts of the total process: modeling, mesh generation, finite element and sensitivity analysis, and optimization are stressed. Stamped components and solid components are treated separately. For stamped parts a highly automated capability was developed. The problem description is based upon a parameterized boundary design element concept for the definition of the geometry. Automatic triangulation and adaptive mesh refinement are used to provide an automated analysis capability which requires only boundary data and takes into account sensitivity of the solution accuracy to boundary shape. For solid components a general extension of the 2-D boundary design element concept has not been achieved. In this case, the parameterized surface shape is provided using a generic modeling concept based upon isoparametric mapping patches which also serves as the mesh generator. Emphasis is placed upon the coupling of optimization with a commercially available finite element program. To do this it is necessary to modularize the program architecture and obtain shape design sensitivities using the material derivative approach so that only boundary solution data is needed.

Botkin, M. E.↗