Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Refining”

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 73 records · Page 4

Preserving Superconvergence of Spectral Elements for Curved Domains via $h$ and $p$-Geometric Refinement

Spectral element methods (SEM), extensions of finite element methods (FEM), have emerged as significant techniques for solving partial differential equations in physics and engineering. SEM can potentially deliver superior accuracy due to the potential superconvergence in nodal solutions for well-shaped tensor-product elements. However, the accuracy of SEM often degrades in complex geometries due to geometric inaccuracies near curved boundaries and the loss of superconvergence with simplicial or non-tensor-product elements. To overcome the first issue, we propose using h- and p-geometric refinement, which refines the mesh near high-curvature regions and increases the degree of geometric basis functions, respectively. We show that when using mixed-element meshes with tensor-product elements in the interior of the domain, curvature-based geometric refinement near boundaries can improve the accuracy of the interior elements by reducing pollution errors and preserving the superconvergence in nodal solutions. To address the second issue, we introduce a post-processing technique using the adaptive extended stencil finite element method (AES-FEM) to recover the accuracy near the curved boundaries. The combination of curvature-based geometric refinement and accurate post-processing offers an effective and easier-to-implement alternative to methods reliant on exact geometries. We demonstrate our techniques by solving the convection-diffusion equation in 2D and show up to two orders of magnitude of improvement in the solution accuracy, even when the elements are poorly shaped near boundaries.

97 MATHEMATICS AND COMPUTING↗

Deacetylation and Mechanical Refining Pathway for the Bioconversion of Sugarcane Bagasse

Advancing lignocellulose biorefining is imperative for the deployment of cellulosic (2G) biofuels. This work investigates the tailoring of the alkaline deacetylation and mechanical refining (DMR) pathway for the bioconversion of sugarcane bagasse. Experiments are conducted at laboratory and pilot scales, varying the pretreatment conditions (70–92 °C; 48–100 g NaOH /kg) and the mechanical refining technologies (PFI and disk refining). The pretreatments selectively solubilize acetyl groups (> 86%) and lignin (10–63%) while mostly preserving structural carbohydrates in the solid phase. Enzymatic hydrolysis generates hydrolysates of clean sugars (glucose and xylose), with sugar yields increasing up to 81% for glucose and 89% for xylose in response to delignification and mechanical refining. Biochemical methane potential assays reveal specific methane productions of up to 568 NmL CH₄ gVS⁻¹ for alkaline liquor monodigestion and 344 NmL CH₄ gVS⁻¹ for co-digestion with sugarcane vinasse from the conventional (1G) sugarcane ethanol, indicating a strong potential for bioenergy recovery from this process stream. Synergies are identified in integrating 1G ethanol, 2G DMR processing of bagasse, and anaerobic co-digestion of 1G vinasse and 2G DMR alkaline liquor. This technology enables sugarcane biorefineries to enhance the co-production of ethanol, methane, and concentrated streams of CO 2 .

09 BIOMASS FUELS↗

Microstructure-refinement–driven enhanced tensile properties of high-pressure die-cast A380 alloy through friction stir processing

This work employs friction stir processing (FSP), a well-known severe plastic deformation technique, to selectively modify the microstructure of thin-walled, high-pressure die-cast (HPDC) aluminum alloy A380, a major HPDC alloy fabricated in the die casting sector. FSP effectively breaks down Al dendrites and acicular Si particles, creating a homogenized distribution of equiaxed Si particles in the aluminum matrix. After FSP, the refined Si particles (~1.5 µm) are smaller than the eutectic Si particles (3–8 µm) in HPDC condition. In addition, interparticle distance has decreased almost 50% compared to dendritic arm spacing, and FSP has reduced the aspect ratio of Si particles to ~2. Furthermore, FSP eliminates porosity, and breaks down needle-like second-phase Fe-Mn and Cu-rich particles, yielding a refined, homogeneous distribution. The FSP-induced microstructural refinement and porosity reduction improve bulk yield strength and ductility by 23% and 66%. Tensile properties are enhanced beyond those of the die skin of the HPDC plate, and the alloy possesses lower defect density and a highly refined microstructure. This study establishes the viability of FSP as a tool for microstructure modification and mechanical property improvement for HPDC Al alloys for the light-weighting goal of the automotive industries.

36 MATERIALS SCIENCE↗

Improving the QBO Forcing by Resolved Waves With Vertical Grid Refinement in E3SMv2

Abstract The quasi‐biennial oscillation (QBO) is the dominate mode of variability in the tropical stratosphere and plays an important role in stratospheric dynamics and chemistry. The QBO is notably deficient in many climate models, including the Energy Exascale Earth System Model (E3SM) developed by the US Department of Energy. In this work, we refine the lower stratospheric vertical grid spacing from roughly 1 km to 500 m to facilitate more realistic equatorial wave activity in the lower stratosphere in E3SM version 2. The refinement results in a simulated QBO with a reasonable amplitude and easterly‐westerly transition in both directions, but still has a longer period than observed, slower easterly downward propagation speed, and shallower vertical depth. Similar refinement in the multi‐scale modeling framework configuration of E3SM yields similar improvements. By analyzing the forcing contributions from different wave types, we find that most of the QBO forcing still comes from parameterized gravity wave drag from convection. The improved QBO forcing contributions from resolved waves, especially equatorial Kelvin waves and resolved small scale waves, can be attributed to the grid refinement.

E3SM↗

A simple solution to the Rietveld refinement recipe problem

Rietveld refinements are widely used for many purposes in the physical sciences. Conducting a Rietveld refinement typically requires expert input because correct results may require that parameters be added to the fit in the proper order. This order will depend on the nature of the data and the initial parameter values. A mechanism for computing the next parameter to add to the refinement is shown. The fitting function is evaluated with the current parameter value set and each parameter incremented and decremented by a small offset. This provides the partial derivatives with respect to each parameter, along with information to discriminate meaningful values from numerical computational errors. The implementation of this mechanism in the open-source GSAS-II program is discussed. This new method is discussed as an important step towards the development of automated Rietveld refinement technology.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

PRISMA: PARALLEL REFINEMENT AND INTEGRATION SYSTEM FOR MULTI-AZIMUTHAL ANALYSIS

The Parallel Refinement and Integration System for Multi-azimuthal Analysis (PRISMA, version 1.1.0) is a Python application for processing X-ray diffraction (XRD) image data. PRISMA wraps GSAS-II to perform azimuthally-binned peak refinement, computes per-frame strain and d-spacing from those fits, and provides three PyQt5 graphical interfaces: (1) a Recipe Builder for selecting GSAS-II control (.imctrl) files, optional mask (.immask) files or threshold-ased masking, reference and experiment image sets, peaks, zimuthal range and bin size, and an optional ceria-based auto-calibration; (2) a Batch Processor that uses Dask on local workstations and pure MPI (mpi4py.futures.MPICommExecutor) on HPC to distribute GSAS-II refinement across cores or compute nodes and write results to a 4-dimensional (peaks x frames x azimuths x measurements) Zarr dataset; and (3) a Data Analyzer that renders heatmaps of fit parameters, strain, frame-to-frame deltas, and percent-change-vs-reference, and exports user-defined subsections to CSV or Excel. The peak-refinement algorithm is deterministic. Benchmark on ALCF Crux: a 20,000-image set, single-peak fit in frame mode with 44 azimuthal bins on 128 nodes x 128 workers, 48 seconds total wall time.

Lorenzo Martin, Maria De La Cinta [Argonne Nationa↗

Historical review and proof-of-concept future method demonstration of adaptive mesh refinement in nuclear engineering for increased fidelity and computational efficiency

As the nuclear industry's use of computational tool increases, the need for increased fidelity and computational efficiency is well known. While most approaches to increased fidelity rely on applying a fine mesh over the problem domain, a more efficient method is to apply an adaptive mesh refinement (AMR) algorithm to the mesh definition. In the field of nuclear engineering, AMR has previously been used in conjunction with deterministic methods, including: S{sub N} transport methods, Lattice Boltzmann Methods, and COMSOL. The future of AMR in nuclear engineering is to couple it to a Monte Carlo code with the goal of reducing calculation time. A proof-of-concept example yielded positive results for using the gradient of the flux as a refinement criteria. The refinement criteria was varied from 0.01 to 0.10, which yielded a recommended range of 0.01 to 0.04, and the number of refinement iterations was varied from 0 to 7, with diminishing returns seen after 5 iterations. After the success of the proof-of-concept exercise, work began on creating a full program coupling MCNP6.2 and the AMR algorithm in the deal.II library. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

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.↗

Mesh refinement in finite element analysis by minimization of the stiffness matrix trace

Most finite element packages provide means to generate meshes automatically. However, the user is usually confronted with the problem of not knowing whether the mesh generated is appropriate for the problem at hand. Since the accuracy of the finite element results is mesh dependent, mesh selection forms a very important step in the analysis. Indeed, in accurate analyses, meshes need to be refined or rezoned until the solution converges to a value so that the error is below a predetermined tolerance. A-posteriori methods use error indicators, developed by using the theory of interpolation and approximation theory, for mesh refinements. Some use other criterions, such as strain energy density variation and stress contours for example, to obtain near optimal meshes. Although these methods are adaptive, they are expensive. Alternatively, a priori methods, until now available, use geometrical parameters, for example, element aspect ratio. Therefore, they are not adaptive by nature. An adaptive a-priori method is developed. The criterion is that the minimization of the trace of the stiffness matrix with respect to the nodal coordinates, leads to a minimization of the potential energy, and as a consequence provide a good starting mesh. In a few examples the method is shown to provide the optimal mesh. The method is also shown to be relatively simple and amenable to development of computer algorithms. When the procedure is used in conjunction with a-posteriori methods of grid refinement, it is shown that fewer refinement iterations and fewer degrees of freedom are required for convergence as opposed to when the procedure is not used. The mesh obtained is shown to have uniform distribution of stiffness among the nodes and elements which, as a consequence, leads to uniform error distribution. Thus the mesh obtained meets the optimality criterion of uniform error distribution.

Kittur, Madan G.↗

Finite element mesh refinement criteria for stress analysis

This paper discusses procedures for finite-element mesh selection and refinement. The objective is to improve accuracy. The procedures are based on (1) the minimization of the stiffness matrix race (optimizing node location); (2) the use of h-version refinement (rezoning, element size reduction, and increasing the number of elements); and (3) the use of p-version refinement (increasing the order of polynomial approximation of the elements). A step-by-step procedure of mesh selection, improvement, and refinement is presented. The criteria for 'goodness' of a mesh are based on strain energy, displacement, and stress values at selected critical points of a structure. An analysis of an aircraft lug problem is presented as an example.

Kittur, Madan G.↗

Unstructured Euler flow solutions using hexahedral cell refinement

An attempt is made to extend grid refinement into three dimensions by using unstructured hexahedral grids. The flow solver is developed using the TIGER (topologically Independent Grid, Euler Refinement) as the starting point. The program uses an unstructured hexahedral mesh and a modified version of the Jameson four-stage, finite-volume Runge-Kutta algorithm for integration of the Euler equations. The unstructured mesh allows for local refinement appropriate for each freestream condition, thereby concentrating mesh cells in the regions of greatest interest. This increases the computational efficiency because the refinement is not required to extend throughout the entire flow field.

Melton, John E.↗

An adaptively-refined Cartesian mesh solver for the Euler equations

A method for adaptive refinement of a Cartesian mesh for the solution of the steady Euler equations is presented. The algorithm creates an initial uniform mesh and cuts the body out of that mesh. The mesh is then refined based on body curvature. Next, the solution is converged to a steady state using a linear reconstruction and Roe's approximate Riemann solver. Solution-adaptive refinement of the mesh is then applied to resolve high-gradient regions of the flow. The numerical results presented show the flexibility of this approach and the accuracy attainable by solution-based refinement.

De Zeeuw, Darren↗

An Adaptively-Refined, Cartesian, Cell-Based Scheme for the Euler and Navier-Stokes Equations

A Cartesian, cell-based scheme for solving 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, polygonal 'cut' cells are created. The geometry of the cut cells is computed 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 refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded, with a limited linear reconstruction of the primitive variables used to provide input states to an approximate Riemann solver for computing the fluxes between neighboring cells. A multi-stage time-stepping scheme is used to reach a steady-state solution. Validation of the Euler solver with benchmark numerical and exact solutions is presented. An assessment of the accuracy of the approach is made by uniform and adaptive grid refinements for a steady, transonic, exact solution to the Euler equations. The error of the approach is directly compared to a structured solver formulation. A non smooth flow is also assessed for grid convergence, comparing uniform and adaptively refined results. Several formulations of the viscous terms are assessed analytically, both for accuracy and positivity. The two best formulations are used to compute adaptively refined solutions of the Navier-Stokes equations. These solutions are compared to each other, to experimental results and/or theory for a series of low and moderate Reynolds numbers flow fields. The most suitable viscous discretization is demonstrated for geometrically-complicated internal flows. For flows at high Reynolds numbers, both an altered grid-generation procedure and a different formulation of the viscous terms are shown to be necessary. A hybrid Cartesian/body-fitted grid generation approach is demonstrated. In addition, a grid-generation procedure based on body-aligned cell cutting coupled with a viscous stensil-construction procedure based on quadratic programming is presented.

Coirier, William John↗

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.↗

Controlling Reflections from Mesh Refinement Interfaces in Numerical Relativity

A leading approach to improving the accuracy on numerical relativity simulations of black hole systems is through fixed or adaptive mesh refinement techniques. We describe a generic numerical error which manifests as slowly converging, artificial reflections from refinement boundaries in a broad class of mesh-refinement implementations, potentially limiting the effectiveness of mesh- refinement techniques for some numerical relativity applications. We elucidate this numerical effect by presenting a model problem which exhibits the phenomenon, but which is simple enough that its numerical error can be understood analytically. Our analysis shows that the effect is caused by variations in finite differencing error generated across low and high resolution regions, and that its slow convergence is caused by the presence of dramatic speed differences among propagation modes typical of 3+1 relativity. Lastly, we resolve the problem, presenting a class of finite-differencing stencil modifications which eliminate this pathology in both our model problem and in numerical relativity examples.

Baker, John G.↗

Interlaminar Stresses by Refined Beam Theories and the Sinc Method Based on Interpolation of Highest Derivative

Computation of interlaminar stresses from the higher-order shear and normal deformable beam theory and the refined zigzag theory was performed using the Sinc method based on Interpolation of Highest Derivative. The Sinc method based on Interpolation of Highest Derivative was proposed as an efficient method for determining through-the-thickness variations of interlaminar stresses from one- and two-dimensional analysis by integration of the equilibrium equations of three-dimensional elasticity. However, the use of traditional equivalent single layer theories often results in inaccuracies near the boundaries and when the lamina have extremely large differences in material properties. Interlaminar stresses in symmetric cross-ply laminated beams were obtained by solving the higher-order shear and normal deformable beam theory and the refined zigzag theory with the Sinc method based on Interpolation of Highest Derivative. Interlaminar stresses and bending stresses from the present approach were compared with a detailed finite element solution obtained by ABAQUS/Standard. The results illustrate the ease with which the Sinc method based on Interpolation of Highest Derivative can be used to obtain the through-the-thickness distributions of interlaminar stresses from the beam theories. Moreover, the results indicate that the refined zigzag theory is a substantial improvement over the Timoshenko beam theory due to the piecewise continuous displacement field which more accurately represents interlaminar discontinuities in the strain field. The higher-order shear and normal deformable beam theory more accurately captures the interlaminar stresses at the ends of the beam because it allows transverse normal strain. However, the continuous nature of the displacement field requires a large number of monomial terms before the interlaminar stresses are computed as accurately as the refined zigzag theory.

Slemp, Wesley C. H.↗

Go-Around Criteria Refinement for Transport Category Aircraft

Presently, airline pilots are trained to go around if, when lower than 500 ft above the ground, they are outside of a handful of parameters such as airspeed, position, and rate of descent. At times, pilots do not comply with these criteria, perhaps owing to their conservative nature or complexity. This paper examines potential refinements to the continue-to-land decision from the combined results of three flight simulator experiments. Potential refinements include simplifying the number of parameters and lowering the altitude at which pilots make the decision. First, refinements were developed by evaluating pilots’ touchdown performance and qualitative data in a variety of starting and environmental conditions. Second, 30 of those pilots evaluated the refinements under several induced instabilities during the approach. The results showed little difference in touchdown performance when lowering the decision altitude from 500 to 300 ft; however, significant differences arose when the decision altitude was lowered further to 100 ft. The proposed new criteria include assessments of deviations in airspeed and position, no rate-of-descent audio warning, and having an appropriate engine setting at 1000, 500, and 300 ft height above threshold. Additionally, a recommendation is made that if the proposed criteria are not met at the 1000 or 500 ft height above threshold the pilots may make corrections and continue the approach; however, if the criteria are not met at 300 ft, then a go-around should be performed.

stabilized approach criteria↗

Validated ligand geometries for macromolecular refinement restraints and molecular-mechanics force fields

In macromolecular structure refinement, the low observation-to-parameter ratio and the lack of high-resolution data are countered by using a priori information in the form of restraints. Having accurate geometries of the chemical entities in the sample is paramount for generating accurate chemical restraints and, therefore, accurate macromolecular structures. In particular, it is desirable to have accurate restraints for known and novel ligand entities. Quantum mechanics (QM) can minimize the energy of a ligand by adjusting its geometry, and these geometries can be used to generate restraints for macromolecular refinement. This article describes a library of approximately 37 000 small molecules extracted from the Chemical Component Dictionary in the Protein Data Bank and minimized by density-functional QM. The library includes restraint files for use in crystallography or cryo-EM refinement, along with files suitable for molecular-dynamics simulation. Because the geometries are validated using the Cambridge Structural Database, the restraints library provides users with both functional restraints and minimized geometries. This work also provides procedures for generating new and accurate restraints.

Amber↗