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 145 records · Page 8

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↗

The Effects of Grain Refinement and Rare Earth Intermetallics on Mechanical Properties of As-Cast and Wrought Magnesium Alloys

The effects of rare earth intermetallics and grain refinement by alloying and hot extrusion on the mechanical properties of Mg-Gd-Al-Zn alloys have been studied to elucidate some useful ways to enhance the mechanical properties of magnesium alloys. It was revealed that aluminum as an alloying element is a much better grain refining agent compared with gadolinium, but the simultaneous presence of Al and Gd can refine the as-cast grain size more efficiently. The presence of fine and widely dispersed rare earth intermetallics was found to be favorable to achieve finer recrystallized grains during hot deformation by extrusion. The presence of coarse dendritic structure in the GZ61 alloy, grain boundary eutectic containing Mg{sub 17}Al{sub 12} phase in the AZ61 alloy, and rare earth intermetallics with unfavorable morphology in the Mg-4Gd-2Al-1Zn alloy was found to be detrimental to mechanical properties of the alloy in the as-cast condition. As a result, the microstructural refinement induced by hot extrusion process resulted in a significant enhancement in strength and ductility of the alloys. The presence of intermetallic compounds in the extruded Mg-4Gd-2Al-1Zn and Mg-2Gd-4Al-1Zn alloys deteriorated tensile properties, which was related to the fact that such intermetallic compounds act as stress risers and microvoid initiation sites.

36 MATERIALS SCIENCE↗

Nonlinear Multiobjective MPC-Based Optimal Operation of a High Consistency Refining System in Papermaking

As one of the most important unit in the papermaking industry, the high consistency (HC) refining system is confronted with challenges such as improving pulp quality, energy saving, and emissions reduction in its operation processes. Here in this correspondence, an optimal operation of HC refining system is presented using nonlinear multiobjective model predictive control strategies that aim at set-point tracking objective of pulp quality, economic objective, and specific energy (SE) consumption objective, respectively. First, a set of input and output data at different times are employed to construct the subprocess model of the state process model for the HC refining system, and then the Wiener-type model can be obtained through combining the mechanism model of Canadian Standard Freeness and the state process model that determines their structures based on Akaike information criterion. Second, the multiobjective optimization strategy that optimizes both the set-point tracking objective of pulp quality and SE consumption is proposed simultaneously, which uses NSGA-II approach to obtain the Pareto optimal set. Furthermore, targeting at the set-point tracking objective of pulp quality, economic objective, and SE consumption objective, the sequential quadratic programming method is utilized to produce the optimal predictive controllers. In conclusion, the simulation results demonstrate that the proposed methods can make the HC refining system provide a better performance of set-point tracking of pulp quality when these predictive controllers are employed. In addition, while the optimal predictive controllers orienting with comprehensive economic objective and SE consumption objective, it has been shown that they have significantly reduced the energy consumption.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Uniform Subspace Correction Preconditioners for Discontinuous Galerkin Methods with hp-Refinement

In this paper, we develop subspace correction preconditioners for discontinuous Galerkin (DG) discretizations of elliptic problems with hp-refinement. These preconditioners are based on the decomposition of the DG finite element space into a conforming subspace, and a set of small nonconforming edge spaces. The conforming subspace is preconditioned using a matrix-free low-order refined technique, which in this work, we extend to the hp-refinement context using a variational restriction approach. The condition number of the resulting linear system is independent of the granularity of the mesh h, and the degree of the polynomial approximation p. The method is amenable to use with meshes of any degree of irregularity and arbitrary distribution of polynomial degrees. Furthermore, numerical examples are shown on several test cases involving adaptively and randomly refined meshes, using both the symmetric interior penalty method and the second method of Bassi and Rebay (BR2).

97 MATHEMATICS AND COMPUTING↗

Causality-respecting adaptive refinement for PINNs: enabling precise interface evolution in phase field modeling

Physics-informed neural networks (PINNs) have emerged as a powerful tool for solving physical systems described by partial differential equations (PDEs). However, their accuracy in dynamical systems, particularly those involving sharp moving boundaries with complex initial morphologies, remains a challenge. Here, this study introduces an approach combining residual-based adaptive refinement (RBAR) with causality-informed training to enhance the performance of PINNs in solving spatio-temporal PDEs. Our method employs a three-step iterative process: initial causality-based training, RBAR-guided domain refinement, and subsequent causality training on the refined mesh. Applied to the Allen-Cahn equation, a widely-used model in phase field simulations, our approach demonstrates significant improvements in solution accuracy and computational efficiency over traditional PINNs. Notably, we observe an ‘overshoot and relocate’ phenomenon in dynamic cases with complex morphologies, showcasing the method’s adaptive error correction capabilities. This synergistic interaction between RBAR and causality training enables accurate capture of interface evolution, even in challenging scenarios where traditional PINNs fail. Our framework not only resolves the limitations of uniform refinement strategies but also provides a generalizable methodology for solving a broad range of spatio-temporal PDEs. The enhanced performance of the RBAR–causality combined framework demonstrates its strong potential for advancing PINN-based modeling of physical systems characterized by complex, evolving interfaces.

Allen-Cahn equations↗

$χ$-$MeRA$: Computationally efficient adaptive mesh refinement of Monte Carlo mesh based tallies

Here, the reactor physics community is always focused on reducing the computational time and memory required for simulations. $χ$-$MeRA$, which stands for flux-based-($χ$)-Mesh tally Refinement Adaptively, was built to reduce the computational time and memory required to solve the neutronics side of a multiphysics problem when compared to traditional methods for mesh based tallies in Monte Carlo (MC) simulations. $χ$-$MeRA$ couples a MC code with an adaptive mesh refinement (AMR) algorithm to take advantage of the accuracy of a MC code and the efficiency of an AMR algorithm. Also developed within $χ$-$MeRA$ was a set of metrics to assess the effects of the refinement on various parameters in the simulation space. For a plutonium sphere, $χ$-$MeRA$ shows a reduction in memory usage and computation time when compared to a fully refined mesh by a factor of 14.7 and 6.7, respectively. When compared to an unstructured mesh, improvement of 1.3 and 4.8 was achieved for memory usage and computation time. The development of $χ$-$MeRA$ helps solve the neutronics side of a multiphysics problem in a faster, more computationally efficient manner than traditional methods, and the final mesh created contains accurate results that can be passed onto the next physics code.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Array-based, parallel hierarchical mesh refinement algorithms for unstructured meshes

In this paper, we describe an array-based hierarchical mesh refinement capability through uniform refinement of unstructured meshes for efficient solution of PDE's using finite element methods and multigrid solvers. A multi-degree, multi-dimensional and multi-level framework is designed to generate the nested hierarchies from an initial coarse mesh that can be used for a variety of purposes such as in multigrid solvers/preconditioners, to do solution convergence and verification studies and to improve overall parallel efficiency by decreasing I/O bandwidth requirements (by loading smaller meshes and in memory refinement). We also describe a high-order boundary reconstruction capability that can be used to project the new points after refinement using high-order approximations instead of linear projection in order to minimize and provide more control on geometrical errors introduced by curved boundaries.The capability is developed under the parallel unstructured mesh framework "Mesh Oriented dAtaBase" (MOAB Tautges et al. (2004)). We describe the underlying data structures and algorithms to generate such hierarchies in parallel and present numerical results for computational efficiency and effect on mesh quality. Furthermore, we also present results to demonstrate the applicability of the developed capability to study convergence properties of different point projection schemes for various mesh hierarchies and to a multigrid finite-element solver for elliptic problems.

97 MATHEMATICS AND COMPUTING↗

Efficiency improvement and CO 2 emission reduction potentials in the United States petroleum refining industry

The U.S. EPA is in the final stages of promulgating regulations to reduce CO 2 emissions from the electricity generating industry. A major component of EPA's regulatory strategy targets improvements to power plant operating efficiencies. As the EPA expands regulatory requirements to other industries, including petroleum refining, it is likely that plant efficiency improvements will be critical to achieving CO 2 emission reductions. This paper identifies efficiency improvement measures applicable to refining, and quantifies potential cost of conserved energy for these measures. Analysis is at the U.S. petroleum refining sector national-level employing an aggregated notional refinery model (NRM), with the aim of estimating the efficacy of efficiency improvements for reducing emissions. Using this method, roughly 1500 petajoules per year (PJ/yr) of plant fuel savings and 650 gigawatt-hour per year (GWh/yr) of electricity savings (representing 54% and 2% of U.S. refining industry consumption, respectively) are potentially cost-effective. This equates to a potential 85 Mt-CO 2 /yr reduction. An additional 458 PJ/yr fuel reduction and close to 2750 GWh/yr of electricity reduction (27 Mt-CO 2 /yr) are not cost-effective at prevailing natural gas market prices. Furthermore, results are presented as a supply-curve ordering measures from low to high cost of fuel savings versus cumulative energy reduction.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗