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 55 records · Page 3

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↗

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↗

Application of mesh refinement to relativistic magnetic reconnection

During relativistic magnetic reconnection, antiparallel magnetic fields undergo a rapid change in topology, releasing a large amount of energy in the form of non-thermal particle acceleration. This work explores the application of mesh refinement to 2D reconnection simulations to efficiently model the inherent disparity in length-scales. We have systematically investigated the effects of mesh refinement and determined necessary modifications to the algorithm required to mitigate non-physical artifacts at the coarse–fine interface. We have used the ultrahigh-order pseudo-spectral analytical time-domain Maxwell solver to analyze how its use can mitigate the numerical dispersion that occurs with the finite-difference time-domain (or “Yee”) method. Absorbing layers are introduced at the coarse–fine interface to eliminate spurious effects that occur with mesh refinement. We also study how damping the electromagnetic fields and current density in the absorbing layer can help prevent the non-physical accumulation of charge and current density at the coarse–fine interface. Using a mesh refinement ratio of 8 for two-dimensional magnetic reconnection simulations, we obtained good agreement with the high-resolution baseline simulation, using only 36% of the macroparticles and 71% of the node-hours needed for the baseline. The methods presented here are especially applicable to 3D systems where higher memory savings are expected than in 2D, enabling comprehensive, computationally efficient 3D reconnection studies in the future.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Data-informed grid refinement to improve traveltime accuracy in the regional seismic traveltime (RSTT) model

The regional seismic traveltime (RSTT) model predicts traveltimes of regional seismic phases accounting for 3-D structure of the crust and the upper mantle on a global scale. Previous versions of the RSTT model have been implemented using nodes separated by ∼1° spacing across the globe. A regional-scale study using regional Pn and Pg traveltimes across Israel and the Middle East demonstrated that data driven, systematic grid refinement reduces traveltime residuals and enhances resolution of smaller tectonic features in regions having dense ray coverage. High density Pn ray coverage in the western US, Europe, Middle East and East Asia can likewise provide the resolution that allows systematic global grid refinement of the RSTT model. In this study, we use a large number of Pn ray paths originating from events located with an epicentral location uncertainty of 25 km (GT25) or better. We conduct targeted grid refinements at 1.0°, 0.5°, 0.25° and 0.125° on a global scale, producing a refined RSTT model that yields a 21.6 per cent reduction in median event location error in Europe and the Middle East, when compared with the original global RSTT model presented in Begnaud et al. The new model also resolves finer tectonic structures in regions with high Pn ray density.

58 GEOSCIENCES↗

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↗