Engineering PapersSearch

SEARCH · Engineering Papers

Results for “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 19 records

Adaptive Mesh Refinement for Microelectronic Device Design

Finite element and finite volume methods are used in a variety of design simulations when it is necessary to compute fields throughout regions that contain varying materials or geometry. Convergence of the simulation can be assessed by uniformly increasing the mesh density until an observable quantity stabilizes. Depending on the electrical size of the problem, uniform refinement of the mesh may be computationally infeasible due to memory limitations. Similarly, depending on the geometric complexity of the object being modeled, uniform refinement can be inefficient since regions that do not need refinement add to the computational expense. In either case, convergence to the correct (measured) solution is not guaranteed. Adaptive mesh refinement methods attempt to selectively refine the region of the mesh that is estimated to contain proportionally higher solution errors. The refinement may be obtained by decreasing the element size (h-refinement), by increasing the order of the element (p-refinement) or by a combination of the two (h-p refinement). A successful adaptive strategy refines the mesh to produce an accurate solution measured against the correct fields without undue computational expense. This is accomplished by the use of a) reliable a posteriori error estimates, b) hierarchal elements, and c) automatic adaptive mesh generation. Adaptive methods are also useful when problems with multi-scale field variations are encountered. These occur in active electronic devices that have thin doped layers and also when mixed physics is used in the calculation. The mesh needs to be fine at and near the thin layer to capture rapid field or charge variations, but can coarsen away from these layers where field variations smoothen and charge densities are uniform. This poster will present an adaptive mesh refinement package that runs on parallel computers and is applied to specific microelectronic device simulations. Passive sensors that operate in the infrared portion of the spectrum as well as active device simulations that model charge transport and Maxwell's equations will be presented.

Cwik, Tom

An object-oriented approach for parallel self adaptive mesh refinement on block structured grids

Self-adaptive mesh refinement dynamically matches the computational demands of a solver for partial differential equations to the activity in the application's domain. In this paper we present two C++ class libraries, P++ and AMR++, which significantly simplify the development of sophisticated adaptive mesh refinement codes on (massively) parallel distributed memory architectures. The development is based on our previous research in this area. The C++ class libraries provide abstractions to separate the issues of developing parallel adaptive mesh refinement applications into those of parallelism, abstracted by P++, and adaptive mesh refinement, abstracted by AMR++. P++ is a parallel array class library to permit efficient development of architecture independent codes for structured grid applications, and AMR++ provides support for self-adaptive mesh refinement on block-structured grids of rectangular non-overlapping blocks. Using these libraries, the application programmers' work is greatly simplified to primarily specifying the serial single grid application and obtaining the parallel and self-adaptive mesh refinement code with minimal effort. Initial results for simple singular perturbation problems solved by self-adaptive multilevel techniques (FAC, AFAC), being implemented on the basis of prototypes of the P++/AMR++ environment, are presented. Singular perturbation problems frequently arise in large applications, e.g. in the area of computational fluid dynamics. They usually have solutions with layers which require adaptive mesh refinement and fast basic solvers in order to be resolved efficiently.

Lemke, Max

An adaptive mesh-moving and refinement procedure for one-dimensional conservation laws

We examine the performance of an adaptive mesh-moving and /or local mesh refinement procedure for the finite difference solution of one-dimensional hyperbolic systems of conservation laws. Adaptive motion of a base mesh is designed to isolate spatially distinct phenomena, and recursive local refinement of the time step and cells of the stationary or moving base mesh is performed in regions where a refinement indicator exceeds a prescribed tolerance. These adaptive procedures are incorporated into a computer code that includes a MacCormack finite difference scheme wih Davis' artificial viscosity model and a discretization error estimate based on Richardson's extrapolation. Experiments are conducted on three problems in order to qualify the advantages of adaptive techniques relative to uniform mesh computations and the relative benefits of mesh moving and refinement. Key results indicate that local mesh refinement, with and without mesh moving, can provide reliable solutions at much lower computational cost than possible on uniform meshes; that mesh motion can be used to improve the results of uniform mesh solutions for a modest computational effort; that the cost of managing the tree data structure associated with refinement is small; and that a combination of mesh motion and refinement reliably produces solutions for the least cost per unit accuracy.

Biswas, Rupak

Refinement of a limit cycle oscillator model of the effects of light on the human circadian pacemaker

In 1990, Kronauer proposed a mathematical model of the effects of light on the human circadian pacemaker. Although this model predicted many general features of the response of the human circadian pacemaker to light exposure, additional data now available enable us to refine the original model. We first refined the original model by incorporating the results of a dose response curve to light into the model's predicted relationship between light intensity and the strength of the drive onto the pacemaker. Data from three bright light phase resetting experiments were then used to refine the amplitude recovery characteristics of the model. Finally, the model was tested and further refined using data from an extensive phase resetting experiment in which a 3-cycle bright light stimulus was presented against a background of dim light. In order to describe the results of the four resetting experiments, the following major refinements to the original model were necessary: (i) the relationship between light intensity (I) and drive onto the pacemaker was reduced from I1/3 to I0.23 for light levels between 150 and 10,000 lux; (ii) the van der Pol oscillator from the original model was replaced with a higher-order limit cycle oscillator so that amplitude recovery is slower near the singularity and faster near the limit cycle; (iii) a direct effect of light on circadian period (tau x) was incorporated into the model such that as I increases, tau x decreases, which is in accordance with "Aschoff's rule". This refined model generates the following testable predictions: it should be difficult to enhance normal circadian amplitude via bright light; near the critical point of a type 0 phase response curve (PRC) the slope should be steeper than it is in a type 1 PRC; and circadian period measured during forced desynchrony should be directly affected by ambient light intensity.

NASA Discipline Regulatory Physiology

Adaptive mesh refinement and turbulence modeling

Adaptive mesh refinement is shown to be essential in turbulence modeling. Adaptive Mesh Refinement (AMR) is a more computationally efficient means to obtain a discrete approximation to a continuous boundary value problem of a specified accuracy than classic isotropic grid refinement. Previous application of this methodology in the assessment of turbulence models suggested that the field variable solution on the interior of the domain was more sensitive to grid refinement than would be suggested by the sensitivity to grid refinement of surface quantities. Revisiting challenging high speed flow field revealed that issues believed to be fundamental turbulence model issues appear to be related to an under-resolved boundary layer edge – a flow detail previously considered unimportant.

Hypersonics

Polycrystalline silicon study: Low-cost silicon refining technology prospects and semiconductor-grade polycrystalline silicon availability through 1988

Photovoltaic arrays that convert solar energy into electrical energy can become a cost effective bulk energy generation alternative, provided that an adequate supply of low cost materials is available. One of the key requirements for economic photovoltaic cells is reasonably priced silicon. At present, the photovoltaic industry is dependent upon polycrystalline silicon refined by the Siemens process primarily for integrated circuits, power devices, and discrete semiconductor devices. This dependency is expected to continue until the DOE sponsored low cost silicon refining technology developments have matured to the point where they are in commercial use. The photovoltaic industry can then develop its own source of supply. Silicon material availability and market pricing projections through 1988 are updated based on data collected early in 1984. The silicon refining industry plans to meet the increasing demands of the semiconductor device and photovoltaic product industries are overviewed. In addition, the DOE sponsored technology research for producing low cost polycrystalline silicon, probabilistic cost analysis for the two most promising production processes for achieving the DOE cost goals, and the impacts of the DOE photovoltaics program silicon refining research upon the commercial polycrystalline silicon refining industry are addressed.

Costogue, E. N.

Refinement Of Hexahedral Cells In Euler Flow Computations

Topologically Independent Grid, Euler Refinement (TIGER) computer program solves Euler equations of three-dimensional, unsteady flow of inviscid, compressible fluid by numerical integration on unstructured hexahedral coordinate grid refined where necessary to resolve shocks and other details. Hexahedral cells subdivided, each into eight smaller cells, as needed to refine computational grid in regions of high flow gradients. Grid Interactive Refinement and Flow-Field Examination (GIRAFFE) computer program written in conjunction with TIGER program to display computed flow-field data and to assist researcher in verifying specified boundary conditions and refining grid.

Melton, John E.

Model Refinement Using Eigensystem Assignment

IA novel approach for the refinement of finite-element-based analytical models of flexible structures is presented. The proposed approach models the possible refinements in the mass, damping, and stiffness matrices of the finite element model in the form of a constant gain feedback with acceleration, velocity, and displacement measurements, respectively. Once the free elements of the structural matrices have been defined, the problem of model refinement reduces to obtaining position, velocity, and acceleration gain matrices with appropriate sparsity that reassign a desired subset of the eigenvalues of the model, along with partial mode shapes, from their baseline values to those obtained from system identification test data. A sequential procedure is used to assign one conjugate pair of eigenvalues at each step using symmetric output feedback gain matrices, and the eigenvectors are partially assigned, while ensuring that the eigenvalues assigned in the previous steps are not disturbed. The procedure can also impose that gain matrices be dissipative to guarantee the stability of the refined model. A numerical example, involving finite element model refinement for a structural testbed at NASA Langley Research Center (Controls-Structures-Interaction Evolutionary model) is presented to demonstrate the feasibility of the proposed approach.

Maghami, Peiman G.

Multilevel Error Estimation and Adaptive h-Refinement for Cartesian Meshes with Embedded Boundaries

This paper presents the development of a mesh adaptation module for a multilevel Cartesian solver. While the module allows mesh refinement to be driven by a variety of different refinement parameters, a central feature in its design is the incorporation of a multilevel error estimator based upon direct estimates of the local truncation error using tau-extrapolation. This error indicator exploits the fact that in regions of uniform Cartesian mesh, the spatial operator is exactly the same on the fine and coarse grids, and local truncation error estimates can be constructed by evaluating the residual on the coarse grid of the restricted solution from the fine grid. A new strategy for adaptive h-refinement is also developed to prevent errors in smooth regions of the flow from being masked by shocks and other discontinuous features. For certain classes of error histograms, this strategy is optimal for achieving equidistribution of the refinement parameters on hierarchical meshes, and therefore ensures grid converged solutions will be achieved for appropriately chosen refinement parameters. The robustness and accuracy of the adaptation module is demonstrated using both simple model problems and complex three dimensional examples using meshes with from 10(exp 6), to 10(exp 7) cells.

Aftosmis, M. J.

Software for Refining or Coarsening Computational Grids

A computer program performs calculations for refinement or coarsening of computational grids of the type called 'structured' (signifying that they are geometrically regular and/or are specified by relatively simple algebraic expressions). This program is designed to facilitate analysis of the numerical effects of changing structured grids utilized in computational fluid dynamics (CFD) software. Unlike prior grid-refinement and -coarsening programs, this program is not limited to doubling or halving: the user can specify any refinement or coarsening ratio, which can have a noninteger value. In addition to this ratio, the program accepts, as input, a grid file and the associated restart file, which is basically a file containing the most recent iteration of flow-field variables computed on the grid. The program then refines or coarsens the grid as specified, while maintaining the geometry and the stretching characteristics of the original grid. The program can interpolate from the input restart file to create a restart file for the refined or coarsened grid. The program provides a graphical user interface that facilitates the entry of input data for the grid-generation and restart-interpolation routines.

Daines, Russell

Software for Refining or Coarsening Computational Grids

A computer program performs calculations for refinement or coarsening of computational grids of the type called "structured" (signifying that they are geometrically regular and/or are specified by relatively simple algebraic expressions). This program is designed to facilitate analysis of the numerical effects of changing structured grids utilized in computational fluid dynamics (CFD) software. Unlike prior grid-refinement and -coarsening programs, this program is not limited to doubling or halving: the user can specify any refinement or coarsening ratio, which can have a noninteger value. In addition to this ratio, the program accepts, as input, a grid file and the associated restart file, which is basically a file containing the most recent iteration of flow-field variables computed on the grid. The program then refines or coarsens the grid as specified, while maintaining the geometry and the stretching characteristics of the original grid. The program can interpolate from the input restart file to create a restart file for the refined or coarsened grid. The program provides a graphical user interface that facilitates the entry of input data for the grid-generation and restart-interpolation routines.

Daines, Russell

Model Refinement Using Eigensystem Assignment

This paper presented a novel approach for the refinement of finite-element-based analytical models of flexible structures is presented. The proposed approach models the possible refinements in the mass, damping, and stiffness matrices of the finite element model in the form of a constant gain feedback with acceleration, velocity, and displacement measurements, respectively. Once, the free elements of the structural matrices have been defined, the problem of model refinement reduces to obtaining position, velocity, and acceleration gain matrices, which reassign a desired subset of the eigenvalues of the model, along with partial mode shapes, from their baseline values to those obtained from system identification test data. A sequential procedure is used to assign one self-conjugate pair of closed-loop eigenvalues at each step using symmetric output feedback gain matrices, and the closed-loop eigenvectors are partially assigned, while ensuring that the eigenvalues assigned in the previous steps are not disturbed. The procedure can also impose that gain matrices be dissipative in order to guarantee the stability of the refined model. A numerical example, involving finite element model refinement for a structural testbed at NASA Langley (CSI Evolutionary Model) is presented to demonstrate the feasibility of the proposed approach.

Maghami, Pieman G.

Software for Refining or Coarsening Computational Grids

A computer program performs calculations for refinement or coarsening of computational grids of the type called structured (signifying that they are geometrically regular and/or are specified by relatively simple algebraic expressions). This program is designed to facilitate analysis of the numerical effects of changing structured grids utilized in computational fluid dynamics (CFD) software. Unlike prior grid-refinement and -coarsening programs, this program is not limited to doubling or halving: the user can specify any refinement or coarsening ratio, which can have a noninteger value. In addition to this ratio, the program accepts, as input, a grid file and the associated restart file, which is basically a file containing the most recent iteration of flow-field variables computed on the grid. The program then refines or coarsens the grid as specified, while maintaining the geometry and the stretching characteristics of the original grid. The program can interpolate from the input restart file to create a restart file for the refined or coarsened grid. The program provides a graphical user interface that facilitates the entry of input data for the grid-generation and restart-interpolation routines.

Daines, Russell

Refinement of Vortex Generators in a Streamline-Traced, External-Compression Supersonic Inlet

Computational simulations of the flow within a streamline-traced, external-compression supersonic inlet for Mach 1.664 without and with vortex generators were performed to refine the characterization of the inlet performance as measured by the total pressure recovery and the radial and circumferential total pressure distortion indices at the engine face. The refinement of the simulations concerned two aspects: 1) refinement of the grid for the simulations to evaluate and reduce uncertainty, and 2) refinement of the modeling and design of the vortex generators. The vortex generators studied were rectangular vane-type vortex generators arranged in co-rotating arrays within the subsonic diffuser. The vortex generator geometric factors of interest included the height, circumferential spacing, and angle-of-incidence. The flow through the inlet was simulated numerically through the solution of the steady-state, Reynolds-averaged Navier-Stokes equations on multi-block, structured grids using the Wind-US flow solver. The vortex generators were simulated using either a vortex generator model or with grids generated about each vortex generator. Statistical methods were used to compute confidence intervals and grid convergence indices to establish the uncertainties of the analyses with respect to grid refinement. Design-of-experiments methods were applied to quantify the effects of the geometric factors of the vortex generators. The analyses of the computed results illustrate the complexities of quantifying the uncertainties of the inlet performance and the implications of the uncertainties for the design of a vortex generator array for the STEX inlet.

Slater, John W.

High Fidelity Adaptively Refined CFD and Reduced Order Models of a High Aspect Ratio Aeroelastic Wing Wind Tunnel Model

Robust adaptive mesh refinement for transonic conditions is one of the most difficult challenges to advancing CFD usage for certification by analysis. Transonic fluid-structure interaction cases represent an even more difficult challenge for adaptive mesh refinement. Production aircraft furthermore have structural models that have gaps and discontinuities that make the interdomain transfer of loads and deflections difficult. This adds to the challenge of adaptive mesh refinement. An initial attempt to create an adaptive mesh refinement process that refines regions of high flow gradient based around the HeldenMesh software is presented. The method is applied to the Integrated Adaptive Wing Technology Maturation (IAWTM) configuration. That has developed an aspect ratio 13.5 wing aeroelastic wind-tunnel model for testing in the Transonic Dynamics Tunnel (TDT). The high levels of deformation of this wing make the adaptation of meshes for the static shape difficult and has necessitated some creativity in how to efficiently adapt meshes. A time-domain identification of the unsteady system based on flexible modes using the adapted meshes is performed.

Robert E. Bartels

Grid Refinement Techniques for the 𝜸-Re𝜽𝒕 Transition Model in FUN3D

There has been an increased focus on the overall accuracy and grid convergence of Reynolds-averaged Navier-Stokes (RANS)-based transition models from the recent AIAA and NATO-AVT workshops. Even though satisfactory grid convergence could be achieved for simple two-dimensional flow configurations, it required mesh counts that are substantially larger than those used in typical applications. In this paper, we focus our efforts on understanding how the grid resolution and topology influences the accuracy and convergence of results by studying the Schubauer and Skramstad flat-plate configuration and the NLF-0416 airfoil at an angle of attack equal to five degrees using FUN3D, a second-order finite-volume code. By focusing on these cases, we can analyze both natural and separation-induced transition scenarios. Multiple grid refinement strategies are investigated. First, we determine the relative effectiveness of zonal streamwise refinement in the transition region within structured grids as an alternative to the costly option of globally uniform refinement of a baseline grid. We also complement this zonal technique by globally varying the wall-normal resolution keeping the streamwise resolution fixed. The zonal streamwise refinement can accurately model natural transition in a flat-plate boundary layer and separation-induced transition, but struggles to accurately model natural transition in airfoil flows. A series of unstructured prismatic grids that have similar node counts and viscous wall spacings as the structured hexahedral grids are also tested, and they do not achieve grid convergence until an extremely fine resolution. Last, we employ adjoint-based unstructured grid adaptation in FUN3D to natural and separation-induced transition on the NLF-0416 airfoil. The adjoint-based refinement process converges to the same solution as the baseline family of structured grids, but leads to smaller errors on coarser grids.

Grid Adaptation

Grid Refinement Techniques for the 𝜸-Re 𝜽 𝒕 Transition Model in FUN3D

There has been an increased focus on the overall accuracy and grid convergence of Reynolds-averaged Navier-Stokes (RANS)-based transition models from the recent AIAA and NATO-AVT workshops. Even though satisfactory grid convergence could be achieved for simple two-dimensional flow configurations, it required mesh counts that are substantially larger than those used in typical applications. In this paper, we focus our efforts on understanding how the grid resolution and topology influences the accuracy and convergence of results by studying the Schubauer and Skramstad flat-plate configuration and the NLF-0416 airfoil at an angle of attack equal to five degrees using FUN3D, a second-order finite-volume code. By focusing on these cases, we can analyze both natural and separation-induced transition scenarios. Multiple grid refinement strategies are investigated. First, we determine the relative effectiveness of zonal streamwise refinement in the transition region within structured grids as an alternative to the costly option of globally uniform refinement of a baseline grid. We also complement this zonal technique by globally varying the wall-normal resolution keeping the streamwise resolution fixed. The zonal streamwise refinement can accurately model natural transition in a flat-plate boundary layer and separation-induced transition, but struggles to accurately model natural transition in airfoil flows. A series of unstructured prismatic grids that have similar node counts and viscous wall spacings as the structured hexahedral grids are also tested, and they do not achieve grid convergence until an extremely fine resolution. Last, we employ adjoint-based unstructured grid adaptation in FUN3D to natural and separation-induced transition on the NLF-0416 airfoil. The adjoint-based refinement process converges to the same solution as the baseline family of structured grids, but leads to smaller errors on coarser grids.

Grid Adaptation

Vortex-dominated conical-flow computations using unstructured adaptively-refined meshes

A conical Euler/Navier-Stokes algorithm is presented for the computation of vortex-dominated flows. The flow solver involves a multistage Runge-Kutta time stepping scheme which uses a finite-volume spatial discretization on an unstructured grid made up of triangles. The algorithm also employs an adaptive mesh refinement procedure which enriches the mesh locally to more accurately resolve the vortical flow features. Results are presented for several highly-swept delta wing and circular cone cases at high angles of attack and at supersonic freestream flow conditions. Accurate solutions were obtained more efficiently when adaptive mesh refinement was used in contrast with refining the grid globally. The paper presents descriptions of the conical Euler/Navier-Stokes flow solver and adaptive mesh refinement procedures along with results which demonstrate the capability.

Batina, John T.