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

The Novel Charfuel® Coal Refining Process 18 TPD Pilot Plant Project for Co- Producing an Upgraded Coal Product, and Commercially Valuable Co- Products: Area of Interest #3 – Coal Beneficiation Pilot Plant Testing (Final Report)

Operation of Carbon Fuels, LLC’s (“CF”) existing, permitted 18 TPD pilot plant located in Golden, Colorado using two individually ranked (ASTM D 388) coal types (two campaigns), employing the novel Charfuel® coal refining process to produce an upgraded coal product and a number of high-valued organic and inorganic coproducts (for which there presently exists large commercial markets) in order to produce engineering and product data which will then be utilized toward the design of a commercial scale integrated facility (pre-feed document). Carbon Fuels, LLC has developed the Charfuel® Coal Refining Process which refines domestically abundant, raw coal (in the same manner as crude oil is refined) to produce the identical, high value co-products that are refined from crude oil. Thus, gasoline, jet fuel, “green diesel”, fuel oil, and marine fuels, as well as petrochemicals such as benzene, toluene, xylene, and methanol are refined from raw coal using this process. The Charfuel® Coal Refining Process is not a coal conversion process, like pyrolysis, or indirect liquefaction. Nor is it an alternative energy system. Rather it is a coal refining process that has the ability to economically produce products traditionally associated with the refining of crude oil but using only abundant, raw coal as the refinery feed stock. The Charfuel® Coal Refining Process is more economical than crude oil refining and is environmentally benign. Therefore, this value added process yields a return on investment well above 50% for a commercial facility. Furthermore, the Charfuel® process, unlike alternatives such as ethanol and hydrogen, can utilize the existing transportation, delivery, and other petroleum based systems. Hence, there is no need for new engines, pipelines, tankers, or product acceptance. As a result, the profitability of the process is increased. Objectives: (1) Operation of the integrated 18 tpd pilot plant, using two coal types (ranks); (2) Demonstration of process flexibility in being able to produce different products (gas, liquid, and char), as well as determination of operating parameters for identifying scale up criteria for two coal types (ranks); (3) Generation of engineering and design information (process specifications) for use in designing a commercial scale plant (scale-up); (4) Determination of important environmental issues surrounding the process and the products such as fate of trace elements (mercury and other heavy metals) and distributions of SO2, NOx, and CO 2 by analysis of effluent streams; (5) Production of sufficient product to allow reliable commercial economic evaluation of both the refined coal product and the coproducts; and, (6) Assessment of longer-term reliability of unit operations. Period 1: reconfiguration of the 18 TPD plant to meet specific FOA requirements and to qualify the facility for operation; and, Period 2: operation of the 18 TPD plant for two campaigns using two coals types (ranks) which are widely commercially used and abundant - the first being a subbituminous (Powder River Basin (“PRB”)) coal, and the second a bituminous (Illinois #6) coal.

01 COAL, LIGNITE, AND PEAT

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

Clarifying the formation of equiaxed grains and microstructural refinement in the additive manufacturing of Ti-Cu

Controlling microstructural evolution in metallic additive manufacturing (AM) is difficult, especially in producing refined as-built grains instead of coarse, directional grains. Traditional solutions involve adding inoculants to AM feedstocks, but titanium (Ti) alloys cannot employ this approach without producing detrimental secondary phases. Ti-Cu (Ti-copper) alloys offer a solution through constitutional supercooling and/or solid state thermal cycling under AM conditions. This work analyzes a compositionally graded directed energy deposition (DED) Ti-Cu build, single-melt laser tracks, and dilatometric heat treatments to evaluate if, when, and by what mechanism(s) microstructural refinement occurs. Refinement by inoculation of unmelted powder particles was also considered. Constitutional supercooling produced no net microstructural refinement as any equiaxed dendrites which form are remelted with new deposition. This finding agreed with solidification modeling of powder bed fusion-laser beam (PBF-LB) and DED builds. Solid state thermal cycling refined microstructures only during ex-situ dilatometric heat treatments, suggesting build parameter optimization is needed to achieve refinement in-situ. Accidental heterogeneous nucleation on unmelted Ti powder, originating from the different thermophysical properties of Ti and Cu, provided the most significant microstructural refinement. This work systematically assesses the microstructural refinement mechanisms of Ti-Cu in AM builds and offers insights into microstructural control in eutectoid alloys.

36 MATERIALS SCIENCE

Comparison Study of Conventional and Adaptive Mesh Refinement in Organic Material Decomposition Models

This study compares conventional mesh refinement techniques, specifically Uniform Mesh Refinement (UMR), with a new Adaptive Mesh Refinement (AMR) method, applied to Organic Material Decomposition (OMD) models. The proposed benefit of AMR is that only areas that require refinement, based on minimizing a specific field gradient, are refined thus decreasing model wall time compared to conventional UMR methods. This work specifically focuses on comparing UMR and AMR methods on decomposing (both No-Flow and Porous-Flow material models) Polymeric Methylene Diisocyanate (PMDI) polyurethane foam. Throughout the work, the geometry increased in complexity to assess the refinement methods performance at varying levels geometric intricacy. While AMR has been shown to work well in a variety of applications, the UMR approach proved to be computationally faster, for many of the geometries and foam decomposition models, than AMR. However, it was observed that at higher levels of refinement, greater than 3 UMR, AMR begins to be computationally better. Additionally, the settings used to perform AMR greatly impact its performance, and lessons learned, in terms of OMD models, are shared. Due to physics involved in material decomposition, specifically the evolution of state variables, these problems don’t fully benefit from the advantages of AMR.

36 MATERIALS SCIENCE

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

Atmospheric-river-induced precipitation in California as simulated by the regionally refined Simple Convective Resolving E3SM Atmosphere Model (SCREAM) Version 0

Abstract. Using the regionally refined mesh (RRM) configuration of the US Department of Energy's Simple Cloud-Resolving Energy Exascale Earth System Model (E3SM) Atmosphere Model (SCREAM), we simulate and evaluate four meteorologically distinct atmospheric river events over California. We test five different RRM configurations, each differing in terms of the areal extent of the refined mesh and the resolution (ranging from 800 m to 3.25 km). We find that SCREAM RRM generally has a good representation of the AR-generated precipitation in CA, even for the control simulation which has a very small 3 km refined patch, and is able to capture the fine-scale regional distributions that are controlled largely by the fine-scale topography of the state. It is found that SCREAM generally has a wet bias over topography, most prominently over the Sierra Nevada mountain range, with a corresponding dry bias on the lee side. We find that refining the resolution beyond 3 km (specifically 1.6 km and 800 m) has virtually no benefit towards reducing systematic precipitation biases but that improvements can be found when increasing the areal extent of the upstream refined mesh. However, these improvements are relatively modest and only realized if the size of the refined mesh is expanded to the scale where employing RRM no longer achieves the substantial cost benefit it was intended for.

54 ENVIRONMENTAL SCIENCES

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

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

Quantum state preparation with resolution refinement

We introduce a method called resolution refinement that allows one to bootstrap eigenstate preparation on a quantum computer. We first prepare an eigenstate of a low-resolution Hamiltonian using any method of choice. The eigenstate is then lifted to higher resolution and adiabatically evolved to produce the corresponding eigenstate of a higher-fidelity Hamiltonian. We give examples of resolution refinement applied to both single-particle basis states as well as a spatial lattice grid. For basis refinement, we compute few-body ground states of the Busch model for interacting particles in a harmonic trap in one dimension. For lattice refinement, we compute Hartree-Fock nuclear states for a central Woods-Saxon potential in three dimensions, and we compute bound states and continuum states in a multi-species Hubbard model of fermions in one dimension. In all cases, the method is efficient and requires an adiabatic evolution time that scales with the inverse of the energy gap times the square root of the system size. We show that this very favorable scaling arises from the fact that resolution refinement does not make large changes to the structure or energies of the low-energy eigenstates.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS

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

Refining Jets for CMS Run 3 using Fast Simulation

As the LHC moves into its high-luminosity phase, the CMS experiment must handle more complex data collected at much higher rates. While the Geant4-based simulation application (FullSim) provides highly accurate simulation to complement real data, FullSim’s intensive consumption of computing resources becomes an increasing liability as the rates increase, while faster tools offer an advantage. The fast MC production application (FastSim) delivers a complete simulation with a factor of 10 speedup over FullSim, but introduces inaccuracies in some observables. A specialized refinement method, Fast Perfekt, employs machine learning to improve the accuracy of FastSim. An initial report of this work focused on the refinement of jet flavor tagging observables. This article presents an update on the refinement, focusing on PUPPI jets with Run 3 data-taking conditions. Refinement is extended to include jet transverse momentum as well as its propagation to missing transverse momentum. A gridbased framework and real-time monitoring system have been developed to facilitate optimization and scaling of the refinement to a large number of target variables.

Güngördü, Açelya Deniz [Istanbul Tech. U.]

Neural refinement of sample weights

Monte Carlo simulations are an essential tool in particle physics data analysis. Events are typically generated alongside weights that redistribute the cross section of the simulated process across the phase space. These weights can be negative, and several post hoc methods have been developed to eliminate or mitigate the negative values. All of these methods share the common strategy of approximating the average weight as a function of phase space. We introduce an alternative approach, which, instead of reweighting to the average, refines the initial weights with a scaling transformation, utilizing a phase space-dependent factor. Since this new refinement method does not need to model the full weight distribution, it can be more accurate. High-dimensional and unbinned phase space is processed using neural networks for the refinement method. In addition to the refinement method, we introduce a new resampling protocol, which can be used in conjunction with any weight transformation to not only preserve the average weight but also the statistical uncertainties of the initial distribution. Using both realistic and synthetic examples, we show that the new neural refinement method is able to match or exceed the accuracy of similar weight transformations and that the new resampling protocol is simpler in implementation than previous methods while exhibiting equivalent statistical properties.

Artificial neural networks

Structure of ice VII with Hirshfeld atom refinement

In the refinement of the crystal structures of ice, the best results obtained so far have been with neutron diffraction because the most troublemaking aspects are the hydrogen atoms. In nine out of twenty ice structures, the hydrogen atoms are disordered, which makes proper refinement more difficult. In our previous paper describing the structure of ice VI we proved that, using Hirshfeld atom refinement (HAR) based on synchrotron X-ray data, it is possible to obtain results comparable with those from neutron experiments. In this work, we investigate another structure of high-pressure disordered ice, cubo-ice (ice VII). Single crystals of cubo-ice were grown under pressure in diamond anvil cells. X-ray diffraction measurements were conducted at a synchrotron source facility (APS, University of Chicago, USA) as well as on our regular in-house laboratory diffractometer with Ag radiation. The data collected were further refined with HAR. Comparison of the structural parameters obtained with those derived from neutron diffraction showed very good agreement in terms of bond lengths and fairly good agreement in terms of hydrogen atom ADPs. We were also able to perform unconstrained refinements with various split-atom models.

Chemistry

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.