Search NASA⌕ Search

SEARCH · Search NASA

Results for “structured adaptive mesh refinement”

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 127 records · Page 7

COMET-AR User's Manual: COmputational MEchanics Testbed with Adaptive Refinement

The COMET-AR User's Manual provides a reference manual for the Computational Structural Mechanics Testbed with Adaptive Refinement (COMET-AR), a software system developed jointly by Lockheed Palo Alto Research Laboratory and NASA Langley Research Center under contract NAS1-18444. The COMET-AR system is an extended version of an earlier finite element based structural analysis system called COMET, also developed by Lockheed and NASA. The primary extensions are the adaptive mesh refinement capabilities and a new "object-like" database interface that makes COMET-AR easier to extend further. This User's Manual provides a detailed description of the user interface to COMET-AR from the viewpoint of a structural analyst.

Moas, E.↗

Magnetized interstellar molecular clouds – II. The large-scale structure and dynamics of filamentary molecular clouds

Abstract We perform ideal magnetohydrodynamics high-resolution adaptive mesh refinement simulations with driven turbulence and self-gravity and find that long filamentary molecular clouds are formed at the converging locations of large-scale turbulence flows and the filaments are bounded by gravity. The magnetic field helps shape and reinforce the long filamentary structures. The main filamentary cloud has a length of ∼4.4 pc. Instead of a monolithic cylindrical structure, the main cloud is shown to be a collection of fibre/web-like substructures similar to filamentary clouds such as L1495. Unless the line-of-sight is close to the mean field direction, the large-scale magnetic field and striations in the simulation are found roughly perpendicular to the long axis of the main cloud, similar to L1495. This provides strong support for a large-scale moderately strong magnetic field surrounding L1495. We find that the projection effect from observations can lead to incorrect interpretations of the true three-dimensional physical shape, size, and velocity structure of the clouds. Helical magnetic field structures found around filamentary clouds that are interpreted from Zeeman observations can be explained by a simple bending of the magnetic field that pierces through the cloud. We demonstrate that two dark clouds form a T-shaped configuration that is strikingly similar to the infrared dark cloud SDC13, leading to the interpretation that SDC13 results from a collision of two long filamentary clouds. We show that a moderately strong magnetic field (${{\cal M}_{\rm A}}\sim 1$) is crucial for maintaining a long and slender filamentary cloud for a long period of time ∼0.5 Myr.

79 ASTRONOMY AND ASTROPHYSICS↗

Simulating Atmospheric Boundary Layer Turbulence with Nek5000/RS

We present large-eddy-simulation (LES) modeling approaches for the simulation of atmospheric boundary layer turbulence that are of direct relevance to wind energy production. In this report, we study a GABLS benchmark problem using high-order spectral element code Nek5000/RS, which is supported under the DOE’s Exascale Computing Project (ECP) Center for Efficient Exascale Discretizations (CEED) project, targeting application simulations on various acceleration-device based exascale computing platforms [1, 2]. We demonstrate our newly developed subgrid-scale (SGS) models based on high-pass filter (HPF), mean-field eddy viscosity (MFEV), and Smagorinsky (SMG) with no-slip and traction boundary conditions, provided with low-order statistics, convergence and turbulent structure analysis. The model fidelity and scaling performance of Nek5000/RS on DOE’s leadership computing platforms in comparison to those of AMR-Wind, a block-structured second-order finite-volume code with adaptive-mesh-refinement capabilities, are discussed in [3].

17 WIND ENERGY↗

Adaptively Refined Euler and Navier-Stokes Solutions with a Cartesian-Cell Based Scheme

A Cartesian-cell based scheme with adaptive mesh refinement for solving the Euler and Navier-Stokes equations in two dimensions has been developed and tested. Grids about geometrically complicated bodies were generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells were created using polygon-clipping algorithms. The grid was stored in a binary-tree data structure which provided a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations were solved on the resulting grids using an upwind, finite-volume formulation. The inviscid fluxes were found in an upwinded manner using a linear reconstruction of the cell primitives, providing the input states to an approximate Riemann solver. The viscous fluxes were formed using a Green-Gauss type of reconstruction upon a co-volume surrounding the cell interface. Data at the vertices of this co-volume were found in a linearly K-exact manner, which ensured linear K-exactness of the gradients. Adaptively-refined solutions for the inviscid flow about a four-element airfoil (test case 3) were compared to theory. Laminar, adaptively-refined solutions were compared to accepted computational, experimental and theoretical results.

Coirier, William J.↗

ACTIVE GALACTIC NUCLEUS FEEDBACK AND ENTROPY INJECTION IN GALAXY CLUSTER CORES

We make the first estimate of non-gravitational energy profiles in galaxy cluster cores (and beyond) based on observational data. Comparing the observed entropy profiles within r{sub 500}, from the Representative XMM-Newton Cluster Structure Survey to simulated base entropy profiles without feedback from both adaptive mesh refinement (AMR) and smoothed particle hydrodynamic (SPH) non-radiative simulations, we estimate the amount of additional non-gravitational energy, E{sub ICM}, contained in the intracluster medium (ICM), as well as the total energy feedback, E{sub Feedback}, from active galactic nuclei (AGNs; the central AGNs in most cases) into the clusters. The total feedback energy scales with the mean spectroscopic temperature as E{sub Feedback}∝T{sub sp}{sup 2.52±0.08} and E{sub Feedback}∝T{sub sp}{sup 2.17±0.11} for the SPH and AMR baseline profiles. The mean non-gravitational energy per particle within r{sub 500} remaining in the ICM after energy lost during cooling is ε{sub ICM} = 2.8 ± 0.8 keV for the SPH theoretical relation and ε{sub ICM} = 1.7 ± 0.9 keV for the AMR theoretical relation. We use the NRAO/VLA Sky Survey source catalog to determine the radio luminosity, L{sub R} , at 1.4 GHz of the central source(s) of our sample. For T{sub sp} > 3 keV, the E{sub Feedback} correlates with L{sub R} , although with different normalization for cool-core and non-cool-core clusters. We show that AGNs could provide a significant portion of the feedback.

79 ASTRONOMY AND ASTROPHYSICS↗

The matryoshka run: A Eulerian refinement strategy to study the statistics of turbulence in virialized cosmic structures

We study the statistical properties of turbulence driven by structure formation in a massive merging galaxy cluster at redshift z = 0. The development of turbulence is ensured as the largest eddy turnover time is much shorter than the Hubble time independent of mass and redshift. We achieve a large dynamic range of spatial scales through a novel Eulerian refinement strategy where the cluster volume is refined with progressively finer uniform nested grids during gravitational collapse. This provides an unprecedented resolution of 7.3 h {sup –1} kpc across the virial volume. The probability density functions of various velocity-derived quantities exhibit the features characteristic of fully developed compressible turbulence observed in dedicated periodic-box simulations. Shocks generate only 60% of the total vorticity within the R {sub vir}/3 region and 40% beyond that. We compute second- and third-order longitudinal and transverse structure functions for both solenoidal and compressional components in the cluster core, virial region, and beyond. The structure functions exhibit a well-defined inertial range of turbulent cascade. The injection scale is comparable to the virial radius but increases toward the outskirts. Within R {sub vir}/3, the spectral slope of the solenoidal component is close to Kolmogorov's, but for the compressional component is substantially steeper and close to Burgers's; the flow is mostly solenoidal and statistically rigorously, which is consistent with fully developed homogeneous and isotropic turbulence. Small-scale anisotropy appears due to numerical artifact. Toward the virial region, the flow becomes increasingly compressional, the structure functions become flatter, and modest genuine anisotropy appear particularly close to the injection scale. In comparison, mesh adaptivity based on Lagrangian refinement and the same finest resolution leads to a lack of turbulent power on a small scales, an excess thereof on large scales, and unreliable density-weighted structure functions.

79 ASTRONOMY AND ASTROPHYSICS↗

Dynamic Load Balancing for Adaptive Unstructured Grids

Dynamic mesh adaptation on unstructured grids is a powerful tool for computing unsteady three-dimensional problems that require grid modifications to efficiently resolve solution features. By locally refining and coarsening the mesh to capture phenomena of interest, such procedures make standard computational methods more cost effective. Highly refined meshes are required to accurately capture shock waves, contact discontinuities, vortices, and shear layers in fluid flow problems. Adaptive meshes have also proved to be useful in several other areas of computational science and engineering like computer vision and graphics, semiconductor device modeling, and structural mechanics. Local mesh adaptation provides the opportunity to obtain solutions that are comparable to those obtained on globally-refined grids but at a much lower cost. Additional information is contained in the original extended abstract.

Biswas, Rupak↗

Adaptive Finite Element Methods for Continuum Damage Modeling

The paper presents an application of adaptive finite element methods to the modeling of low-cycle continuum damage and life prediction of high-temperature components. The major objective is to provide automated and accurate modeling of damaged zones through adaptive mesh refinement and adaptive time-stepping methods. The damage modeling methodology is implemented in an usual way by embedding damage evolution in the transient nonlinear solution of elasto-viscoplastic deformation problems. This nonlinear boundary-value problem is discretized by adaptive finite element methods. The automated h-adaptive mesh refinements are driven by error indicators, based on selected principal variables in the problem (stresses, non-elastic strains, damage, etc.). In the time domain, adaptive time-stepping is used, combined with a predictor-corrector time marching algorithm. The time selection is controlled by required time accuracy. In order to take into account strong temperature dependency of material parameters, the nonlinear structural solution a coupled with thermal analyses (one-way coupling). Several test examples illustrate the importance and benefits of adaptive mesh refinements in accurate prediction of damage levels and failure time.

Min, J. B.↗

Direct numerical simulations of agglomeration of circular colloidal particles in two-dimensional shear flow

Colloidal agglomeration of nanoparticles in shear flow is investigated by solving the fluid-particle and particle-particle interactions in a 2D system. We use an extended finite element method in which the dynamics of the particles is solved in a fully coupled manner with the flow, allowing an accurate description of the fluid-particle interfaces without the need of boundary-fitted meshes or of empirical correlations to account for the hydrodynamic interactions between the particles. Adaptive local mesh refinement using a grid deformation method is incorporated with the fluid-structure interaction algorithm, and the particle-particle interaction at the microscopic level is modeled using the Lennard-Jones potential. Motivated by the process used in fabricating fuel cell catalysts from a colloidal ink, the model is applied to investigate agglomeration of colloidal particles under external shear flow in a sliding bi-periodic Lees-Edwards frame with varying shear rates and particle fraction ratios. Both external shear and particle fraction are found to have a crucial impact on the structure formation of colloidal particles in a suspension. Segregation intensity and graph theory are used to analyze the underlying agglomeration patterns and structures, and three agglomeration regimes are identified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solution-Adaptive Program for Computing 2D/Axi Viscous Flow

A computer program solves the Navier- Stokes equations governing the flow of a viscous, compressible fluid in an axisymmetric or two-dimensional (2D) setting. To obtain solutions more accurate than those generated by prior such programs that utilize regular and/or fixed computational meshes, this program utilizes unstructured (that is, irregular triangular) computational meshes that are automatically adapted to solutions. The adaptation can refine to regions of high change in gradient or can be driven by a novel residual minimization technique. Starting from an initial mesh and a corresponding data structure, the adaptation of the mesh is controlled by use of minimization functional. Other improvements over prior such programs include the following: (1) Boundary conditions are imposed weakly; that is, following initial specification of solution values at boundary nodes, these values are relaxed in time by means of the same formulations as those used for interior nodes. (2) Eigenvalues are limited in order to suppress expansion shocks. (3) An upwind fluctuation-splitting distribution scheme applied to inviscid flux requires fewer operations and produces less artificial dissipation than does a finite-volume scheme, leading to greater accuracy of solutions.

Wood, William A.↗

Application of unstructured grid methods to steady and unsteady aerodynamic problems

The purpose is to describe the development of unstructured grid methods which have several advantages when compared to methods which make use of structured grids. Unstructured grids, for example, easily allow the treatment of complex geometries, allow for general mesh movement for realistic motions and structural deformations of complete aircraft configurations which is important for aeroelastic analysis, and enable adaptive mesh refinement to more accurately resolve the physics of the flow. Steady Euler calculations for a supersonic fighter configuration to demonstrate the complex geometry capability; unsteady Euler calculations for the supersonic fighter undergoing harmonic oscillations in a complete-vehicle bending mode to demonstrate the general mesh movement capability; and vortex-dominated conical-flow calculations for highly-swept delta wings to demonstrate the adaptive mesh refinement capability are discussed. The basic solution algorithm is a multi-stage Runge-Kutta time-stepping scheme with a finite-volume spatial discretization based on an unstructured grid of triangles in 2D or tetrahedra in 3D. The moving mesh capability is a general procedure which models each edge of each triangle (2D) or tetrahedra (3D) with a spring. The resulting static equilibrium equations which result from a summation of forces are then used to move the mesh to allow it to continuously conform to the instantaneous position or shape of the aircraft. The adaptive mesh refinement procedure enriches the unstructured mesh locally to more accurately resolve the vortical flow features. These capabilities are described in detail along with representative results which demonstrate several advantages of unstructured grid methods. The applicability of the unstructured grid methodology to steady and unsteady aerodynamic problems and directions for future work are discussed.

Batina, John T.↗

Tetrahedral and Hexahedral Mesh Adaptation for CFD Problems

This paper presents two unstructured mesh adaptation schemes for problems in computational fluid dynamics. The procedures allow localized grid refinement and coarsening to efficiently capture aerodynamic flow features of interest. The first procedure is for purely tetrahedral grids; unfortunately, repeated anisotropic adaptation may significantly deteriorate the quality of the mesh. Hexahedral elements, on the other hand, can be subdivided anisotropically without mesh quality problems. Furthermore, hexahedral meshes yield more accurate solutions than their tetrahedral counterparts for the same number of edges. Both the tetrahedral and hexahedral mesh adaptation procedures use edge-based data structures that facilitate efficient subdivision by allowing individual edges to be marked for refinement or coarsening. However, for hexahedral adaptation, pyramids, prisms, and tetrahedra are used as buffer elements between refined and unrefined regions to eliminate hanging vertices. Computational results indicate that the hexahedral adaptation procedure is a viable alternative to adaptive tetrahedral schemes.

Biswas, Rupak↗

Low-Cost Parallel Algorithms for 2:1 Octree Balance

The logical structure of a forest of octrees can be used to create scalable algorithms for parallel adaptive mesh refinement (AMR), which has recently been demonstrated for several petascale applications. Among various frequently used octree-based mesh operations, including refinement, coarsening, partitioning, and enumerating nodes, ensuring a 2:1 size balance between neighboring elements has historically been the most expensive in terms of CPU time and communication volume. The 2:1 balance operation is thus a primary target to optimize. One important component of a parallel balance algorithm is the ability to determine whether any two given octants have a consistent distance/size relation. Based on new logical concepts we propose fast algorithms for making this decision for all types of 2:1 balance conditions in 2D and 3D. Since we are able to achieve this without constructing any parent nodes in the tree that would otherwise need to be sorted and communicated, we can significantly reduce the required memory and communication volume. In addition, we propose a lightweight collective algorithm for reversing the asymmetric communication pattern induced by non-local octant interactions. We have implemented our improvements as part of the opensource “p4est” software. Benchmarking this code with both synthetic and simulation-driven adapted meshes we are able to demonstrate much reduced runtime and excellent weak and strong scalability. On our largest benchmark problem with 5.13 × 10 11 octants the new 2:1 balance algorithm executes in less than 8 seconds on 112,128 CPU cores of the Jaguar Cray XT5 supercomputer.

Computer Science↗

Cartesian based grid generation/adaptive mesh refinement

Grid adaptation has recently received attention in the computational fluid dynamics (CFD) community as a means to capture the salient features of a flowfield by either moving grid points of a structured or by adding cells in an unstructured manner. An approach based on a background cartesian mesh is investigated from which the geometry is 'cut' out of the mesh. Once the mesh is obtained, a solution on this coarse grid is found, that indicates which cells need to be refined. This process of refining/solving continues until the flow is grid refined in terms of a user specified global parameter (such as drag coefficient etc.). The advantages of this approach are twofold: the generation of the base grid is independent of the topology of the bodies or surfaces around/through which the flow is to be computed, and the resulting grid (in uncut regions) is highly isotropic, so that the truncation error is low. The flow solver (which, along with the grid generation is still under development) uses a completely unstructured data base, and is a finite volume, upwinding scheme. Current and future work will address generating Navier-Stokes suitable grids by using locally aligned and normal face/cell refining. The attached plot shows a simple grid about two turbine blades.

Coirier, William J.↗

Solution-Adaptive Cartesian Cell Approach for Viscous and Inviscid Flows

A Cartesian cell-based approach for adaptively refined solutions of the Euler and Navier-Stokes equations in two dimensions is presented. Grids about geometrically complicated bodies are generated automatically, by the recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, polygonal cut cells are created using modified polygon-clipping algorithms. The grid is stored in a binary tree data structure that provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite volume formulation. The convective terms are upwinded: A linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The results of a study comparing the accuracy and positivity of two classes of cell-centered, viscous gradient reconstruction procedures is briefly summarized. Adaptively refined solutions of the Navier-Stokes equations are shown using the more robust of these gradient reconstruction procedures, where the results computed by the Cartesian approach are compared to theory, experiment, and other accepted computational results for a series of low and moderate Reynolds number flows.

Coirier, William J.↗

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells are created using polygon-clipping algorithms. The grid is stored in a binary-tree structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded: a gradient-limited, linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The more robust of a series of viscous flux functions is used to provide the viscous fluxes at the cell interfaces. Adaptively-refined solutions of the Navier-Stokes equations using the Cartesian, cell-based approach are obtained and compared to theory, experiment, and other accepted computational results for a series of low and moderate Reynolds number flows.

Coirier, William J.↗

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells are created using polygon-clipping algorithms. The grid is stored in a binary-tree data structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded: A gradient-limited, linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The more robust of a series of viscous flux functions is used to provide the viscous fluxes at the cell interfaces. Adaptively-refined solutions of the Navier-Stokes equations using the Cartesian, cell-based approach are obtained and compared to theory, experiment and other accepted computational results for a series of low and moderate Reynolds number flows.

Coirier, William J.↗