Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mesh optimization”

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 379 records · Page 21

Multigrid preconditioning of linear systems for semi-smooth Newton methods applied to optimization problems constrained by smoothing operators

This article is concerned here with the question of constructing efficient multigrid preconditioners for the linear systems arising when applying semi-smooth Newton methods to large-scale linear-quadratic optimization problems constrained by smoothing operators with box-constraints on the controls. It is shown that, for certain discretizations of the optimization problem, the linear systems to be solved at each semi-smooth Newton iteration reduce to inverting principal minors of the Hessian of the associated unconstrained problem. As in the case when box-constraints on the controls are absent, the multigrid preconditioner introduced here is shown to increase in quality as the mesh-size decreases, resulting in a number of iterations that decreases with mesh-size. However, unlike the unconstrained case, the spectral distance between the preconditioners and the Hessian is shown to be of suboptimal order in general.

97 MATHEMATICS AND COMPUTING↗

Accelerating computational fluid dynamics simulation of post-combustion carbon capture modeling with MeshGraphNets

Packed columns are commonly used in post-combustion processes to capture CO 2 emissions by providing enhanced contact area between a CO 2 -laden gas and CO 2 -absorbing solvent. To study and optimize solvent-based post-combustion carbon capture systems (CCSs), computational fluid dynamics (CFD) can be used to model the liquid–gas countercurrent flow hydrodynamics in these columns and derive key determinants of CO 2 -capture efficiency. However, the large design space of these systems hinders the application of CFD for design optimization due to its high computational cost. In contrast, data-driven modeling approaches can produce fast surrogates to study large-scale physics problems. We build our surrogates using MeshGraphNets (MGN), a graph neural network framework that efficiently learns and produces mesh-based simulations. We apply MGN to a random packed column modeled with over 160K graph nodes and a design space consisting of three key input parameters: solvent surface tension, inlet velocity, and contact angle. Our models can adapt to a wide range of these parameters and accurately predict the complex interactions within the system at rates over 1700 times faster than CFD, affirming its practicality in downstream design optimization tasks. This underscores the robustness and versatility of MGN in modeling complex fluid dynamics for large-scale CCS analyses.

97 MATHEMATICS AND COMPUTING↗

Toplogical optimization of structures using Fourier representations

The minimization of compliance subject to a mass constraint is the topology optimization design problem of interest. The goal is to determine the optimal configuration of material within an allowed volume. Our approach builds upon the well-known density method in which the decision variable is the material density in every cell in a mesh. In it’s most basic form the density method consists of three steps: 1) the problem is convexified by replacing the integer material indicator function with a volume fraction, 2) the problem is regularized by filtering the volume fraction field to impose a minimum length scale; 3) the filtered volume fraction is penalized to steer the material distribution toward binary designs. The filtering step is used to yield a mesh-independent solution and to eliminate checkerboard instabilities. In image processing terms this is a low-pass filter, and a consequence is that the decision variables are not independent and a change of basis could significantly reduce the dimension of the nonlinear programming problem. Based on this observation, we represent the volume fraction field with a truncated Fourier representation. Furthermore, this imposes a minimal length scale on the problem, eliminates checkerboard instabilities, and also reduces the number of decision variables by over 100 × (two dimensions) or 1000 × (three dimensions).

97 MATHEMATICS AND COMPUTING↗

Calibration of ITER Instant Power Neutron Monitors: Recommended Scenario of Experiments at the Reactor

Instant power is a key parameter of the ITER. Its monitoring with an accuracy of a few percent is an urgent and challenging aspect of neutron diagnostics. In a series of works published in Problems of Atomic Science and Technology, Series: Thermonuclear Fusion under a common title, the step-by-step neutronics analysis was given to substantiate a calibration technique for the DT and DD modes of the ITER. A Gauss quadrature scheme, optimal for processing “expensive” experiments, is used for numerical integration of {sup 235}U and {sup 238}U detector responses to the point sources of 14-MeV neutrons. This approach allows controlling the integration accuracy in relation to the number of coordinate mesh points and thus minimizing the number of irradiations at the given uncertainty of the full monitor response. In the previous works, responses of the divertor and blanket monitors to the isotropic point sources of DT and DD neutrons in the plasma profile and to the models of real sources were calculated within the ITER model using the MCNP code. The neutronics analyses have allowed formulating the basic principles of calibration that are optimal for having the maximum accuracy at the minimum duration of in situ experiments at the reactor. In this work, scenarios of the preliminary and basic experimental ITER runs are suggested on the basis of those principles. It is proposed to calibrate the monitors only with DT neutrons and use correction factors to the DT mode calibration for the DD mode. It is reasonable to perform full calibration only with {sup 235}U chambers and calibrate {sup 238}U chambers by responses of the {sup 235}U chambers during reactor operation (cross-calibration). The divertor monitor can be calibrated using both direct measurement of responses at the Gauss positions of a point source and simplified techniques based on the concepts of equivalent ring sources and inverse response distributions, which will considerably reduce the amount of measurements. It is shown that the monitor based on the average responses of the horizontal and vertical neutron chambers remains spatially stable as the source moves and can be used in addition to the staff monitor at neutron fluxes in the detectors four orders of magnitude lower than on the first wall, where staff detectors are located. Owing to low background, detectors of neutron chambers do not need calibration in the reactor because it is actually determination of the absolute detector efficiency for 14-MeV neutrons, which is a routine out-of-reactor procedure.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Learning Distribution Grid Topologies: A Tutorial

Unveiling feeder topologies from data is of paramount importance to advance situational awareness and proper utilization of smart resources in power distribution grids. This tutorial summarizes, contrasts, and establishes useful links between recent works on topology identification and detection schemes that have been proposed for power distribution grids. The primary focus is to highlight methods that overcome the limited availability of measurement devices in distribution grids, while enhancing topology estimates using conservation laws of power-flow physics and structural properties of feeders. Grid data from phasor measurement units or smart meters can be collected either passively in the traditional way, or actively, upon actuating grid resources and measuring the feeder's voltage response. Analytical claims on feeder identifiability and detectability are reviewed under disparate meter placement scenarios. Such topology learning claims can be attained exactly or approximately so via algorithmic solutions with various levels of computational complexity, ranging from least-squares fits to convex optimization problems, and from polynomial-time searches over graphs to mixed-integer programs. Although the emphasis is on radial single-phase feeders, extensions to meshed and/or multiphase circuits are sometimes possible and discussed. Here this tutorial aspires to provide researchers and engineers with knowledge of the current state-of-the-art in tractable distribution grid learning and insights into future directions of work.

24 POWER TRANSMISSION AND DISTRIBUTION↗

The arbitrary-order virtual element method for linear elastodynamics models. Convergence, stability and dispersion-dissipation analysis.

We design the conforming virtual element method for the numerical approximation of the two dimensional elastodynamics problem. We prove stability and convergence of the semi-discrete approximation and derive optimal error estimates under $\textit{h}$-refinement in both the energy and the $L^2$ norms, and optimal error estimates under $\textit{p}$-refinement in the energy norm. The performance of the proposed virtual element method is assessed on a set of different computational meshes, including non-convex cells up to order four in the h-refinement setting. Exponential convergence is also experimentally observed under p-refinement. Finally, we present a dispersion-dissipation analysis for both the semi-discrete and fully-discrete schemes, showing that polygonal meshes behave as classical simplicial/quadrilateral grids in terms of dispersion-dissipation properties.

97 MATHEMATICS AND COMPUTING↗

Performance Validation and Scaling of a Capillary Membrane Solid-Liquid Separation System

Algaeventure Systems (AVS) has previously demonstrated an innovative technology for dewatering algae slurries that dramatically reduces energy consumption by utilizing surface physics and capillary action. Funded by a $6M ARPA-E award, transforming the original Harvesting, Dewatering and Drying (HDD) prototype machine into a commercially viable technology has required significant attention to material performance, integration of sensors and control systems, and especially addressing scaling issues that would allow processing extreme volumes of algal cultivation media/slurry. Decoupling the harvesting, dewatering and drying processes, and addressing the rate limiting steps for each of the individual steps has allowed for the development individual technologies that may be tailored to the specific needs of various cultivation systems. The primary performance metric used by AVS to assess the economic viability of its Solid-Liquid Separation (SLS) dewatering technology is algae mass production rate as a function of power consumption (cost), cake solids/moisture content, and solids capture efficiency. An associated secondary performance metric is algae mass loading rate which is dependent on hydraulic loading rate, area-specific hydraulic processing capacity (gpm/in2), filter:capillary belt contact area, and influent algae concentration. The system is capable of dewatering 4 g/L (0.4%) algae streams to solids concentrations up to 30% with capture efficiencies of 80+%, however mass production is highly dependent on average cell size (which determines filter mesh size and percent open area). This paper will present data detailing the scaling efforts to date. Characterization and performance data for novel membranes, as well as optimization of off-the-shelf filter materials will be examined. Third party validation from Ohio University on performance and operating cost, as well as design modification suggestions will be discussed. Extrapolation of current productivities will be used to suggest a design for integration into commercial-scale production.

09 BIOMASS FUELS↗

Koopman-Based Approach to Nonintrusive Reduced Order Modeling: Application to Aerodynamic Shape Optimization and Uncertainty Propagation

A methodology for nonintrusive projection-based nonlinear model reduction originally presented by Renganathan et al. is further extended here toward parametric systems with a focus on application to aerospace design. Specifically, the method is extended to address static systems with parametric geometry (that deforms the mesh) in addition to parametric freestream boundary conditions. The main idea is to first perform a transformation on the governing equations such that it is lifted to a higher-dimensional but linear underdetermined system. This enables one to extract the system matrices easily as compared to that of the original nonlinear system. The underdetermined system is closed with a set of model-dependent nonlinear constraints upon which the model reduction is finally performed. The methodology is validated on the subsonic and transonic inviscid flows past the NACA0012 and the RAE2822 airfoils with parametrized shapes. The utility of the approach is further demonstrated by applying it to two common problems in aerospace design, namely, derivative-free global optimization and parametric uncertainty quantification with Monte Carlo sampling. Overall, the methodology is shown to achieve accuracy up to 5% and computational speedup of two to three orders of magnitude relative to the full order model. Comparison against another nonintrusive model reduction method revealed that the proposed approach is more robust, accurate, and retains the consistency between the state variables.

97 MATHEMATICS AND COMPUTING↗

Moments-based interface reconstruction, remap and advection

Here, we present a new moment-of-fluid (MOF 2 ) interface reconstruction method. It uses the zeroth, first, and second moments of the fragment of material inside a cell of the mesh to reconstruct a convex material polygon or a union of convex polygons that approximate the respective material fragment. The new method requires information about the material moments only for the cell under consideration. The MOF 2 method allows to exactly reproduce several convex shapes: corners, filaments, and some concave shapes: cell-complements to corners and filaments. Interface reconstruction is formulated as a local (for each cell), non-linear, equality constrained optimization problem, which does not require additional communication and allows for an efficient parallel implementation. We present an extensive set of test problems, both for interface reconstruction on a single cell, and for reconstruction of a variety of shapes on a variety of meshes. We describe how to perform two-material advection using the MOF 2 method and present the results for the classical advection tests. We also show the examples of material interface remapping needed in the framework of multi-material arbitrary Lagrangian-Eulerian methods, and give a brief description of a procedure that can be used to update the material moments on the Lagrangian stage of those methods.

97 MATHEMATICS AND COMPUTING↗

Comparison Of Hybrid Methods For Global Variance Reduction In Shielding Calculations

For Monte Carlo shielding problems that calculate a mesh tally over the entire problem, the relative uncertainties computed for each voxel can vary widely. This can lead to unacceptably long run times in order to reduce the uncertainties in all areas of the problem to a reasonably low level. Hybrid methods using estimates from deterministic calculations to create importance maps for variance reduction in Monte Carlo calculations have been successfully used to optimize the calculation of specific tallies. For the global problem, several methods have been proposed that create importance maps that distribute Monte Carlo particles in such a way as to achieve a more uniform distribution of relative uncertainty across the problem. The goal is to compute a mesh tally with nearly the same relative uncertainties in the low flux/dose areas as in the high flux/dose areas. Methods based on only forward deterministic estimates and methods using both forward and adjoint deterministic methods have been implemented the SCALE/MAVRIC package and have been compared against each other by computing global mesh tallies on several representative shielding problems. Methods using both forward and adjoint estimates provide better performance for computing more uniform relative uncertainties across a global mesh tally.

FW-CADIS↗

Comparison of hybrid methods for global variance reduction in shielding calculations

For Monte Carlo shielding problems that calculate a mesh tally over the entire problem, the statistical uncertainties computed for each voxel can vary widely. This can lead to unacceptably long run times in order to reduce the uncertainties in all areas of the problem to a reasonably low level. Hybrid methods - using estimates from deterministic calculations to create importance maps for variance reduction in Monte Carlo calculations - have been successfully used to optimize the calculation of specific tallies. For the global problem, several methods have been proposed to create importance maps that distribute Monte Carlo particles in such a way as to achieve a more uniform distribution of relative uncertainty across the problem. The goal is to compute a mesh tally with nearly the same relative uncertainties in the low flux/dose areas as in the high flux/dose areas. Methods based on only forward deterministic estimates and methods using both forward and adjoint deterministic methods have been implemented in the SCALE/MAVRIC package and have been compared against each other by computing global mesh tallies on several representative shielding problems. Methods using both forward and adjoint estimates provide better performance for computing more uniform relative uncertainties across a global mesh tally. (authors)

97 MATHEMATICS AND COMPUTING↗

Extended Finite Element Based Approach in Additive Manufacturing Modeling for Optimizing Highly Complex Manifold in Protonic Ceramic Electrochemical Cells

The objective of this project is to develop a novel numerical approach based on the extended finite element method (XFEM) for modeling moving boundaries of material deposited in additive manufacturing (AM) process with improved accuracy and reduced computational cost. One of the major challenges in simulating AM processes is that the boundaries of the computational domain need to change as material is deposited. Previous approaches have achieved this by activating new finite elements, but this requires a high level of mesh refinement to capture small movement of the boundary. XFEM allows the solution boundary to move independently of the mesh, permitting smooth representation of the evolution of the boundary as material is deposited. As a result, this new method will significantly improve the simulation accuracy while reducing the computational cost compared with existing approaches. Furthermore, this project will bring significant improvements for the design and AM process optimization in an iterative fashion among numerical simuation, parameter optimization, and experimental validation. Specifically, this project will support the protonic ceramic electrochemical cells (PCEC) stack development at INL by providing insights into the density, residual stress, thermal and mechanical properties of the PCEC manifold and interconnect, which is critical in enhancing the system lifetime and reducing the overall cost. Upon the success of proposed development and validation of the proposed approach, simulation will be applied to determine an optimal set of AM process parameters for the PCEC manifold production. This project will consolidate Idaho National Laboratory (INL)’s simulation capabilities provided by the MOOSE framework and the Valhalla AM simulation application, with encouraging expansion to emerging PCEC applications and AM technologies at INL and beyond.

97 MATHEMATICS AND COMPUTING↗

Deep learning closure models for large-eddy simulation of flows around bluff bodies

Near-wall flow simulation remains a central challenge in aerodynamics modelling: Reynolds-averaged Navier–Stokes predictions of separated flows are often inaccurate, and large-eddy simulation (LES) can require prohibitively small near-wall mesh sizes. A deep learning (DL) closure model for LES is developed by introducing untrained neural networks into the governing equations and training in situ for incompressible flows around rectangular prisms at moderate Reynolds numbers. The DL-LES models are trained using adjoint partial differential equation (PDE) optimization methods to match, as closely as possible, direct numerical simulation (DNS) data. They are then evaluated out-of-sample – for aspect ratios, Reynolds numbers and bluff-body geometries not included in the training data – and compared with standard LES models. The DL-LES models outperform these models and are able to achieve accurate LES predictions on a relatively coarse mesh (downsampled from the DNS mesh by factors of four or eight in each Cartesian direction). We study the accuracy of the DL-LES model for predicting the drag coefficient, near-wall and far-field mean flow, and resolved Reynolds stress. A crucial challenge is that the LES quantities of interest are the steady-state flow statistics; for example, a time-averaged velocity component $\langle {u}_i\rangle (x) = \lim _{t \rightarrow \infty } ({1}/{t}) \int _0^t u_i(s,x)\, {\rm d}s$ . Calculating the steady-state flow statistics therefore requires simulating the DL-LES equations over a large number of flow times through the domain. It is a non-trivial question whether an unsteady PDE model with a functional form defined by a deep neural network can remain stable and accurate on $t \in [0, \infty )$ , especially when trained over comparatively short time intervals. Our results demonstrate that the DL-LES models are accurate and stable over long time horizons, which enables the estimation of the steady-state mean velocity, fluctuations and drag coefficient of turbulent flows around bluff bodies relevant to aerodynamics applications.

Mechanics↗

The virtual element method for linear elastodynamics models: Design, analysis, and implementation

We design the conforming virtual element method for the numerical simulation of two dimensional time-dependent elastodynamics problems. We investigate the performance of the method both theoretically and numerically. We prove the stability and the convergence of the semi-discrete approximation in the energy norm and derive optimal error estimates. We also show the convergence in the L 2 norm. The performance of the virtual element method is assessed on a set of different computational meshes, including non-convex cells up to order four in the h-refinement setting. Exponential convergence is also experimentally seen in the p-refinement setting.

97 MATHEMATICS AND COMPUTING↗

Fluid-Kinetic Coupling: Advanced Discretizations for Simulations on Emerging Heterogeneous Architectures (LDRD FY20-0643)

Plasma physics simulations are vital for a host of Sandia mission concerns, for fundamental science, and for clean energy in the form of fusion power. Sandia's most mature plasma physics simulation capabilities come in the form of particle-in-cell (PIC) models and magnetohydrodynamics (MHD) models. MHD models for a plasma work well in denser plasma regimes when there is enough material that the plasma approximates a fluid. PIC models, on the other hand, work well in lower-density regimes, in which there is not too much to simulate; error in PIC scales as the square root of the number of particles, making high-accuracy simulations expensive. Real-world applications, however, almost always involve a transition region between the high-density regimes where MHD is appropriate, and the low-density regimes for PIC. In such a transition region, a direct discretization of Vlasov is appropriate. Such discretizations come with their own computational costs, however; the phase-space mesh for Vlasov can involve up to six dimensions (seven if time is included), and to apply appropriate homogeneous boundary conditions in velocity space requires meshing a substantial padding region to ensure that the distribution remains sufficiently close to zero at the velocity boundaries. Moreover, for collisional plasmas, the right-hand side of the Vlasov equation is a collision operator, which is non-local in velocity space, and which may dominate the cost of the Vlasov solver. The present LDRD project endeavors to develop modern, foundational tools for the development of continuum-kinetic Vlasov solvers, using the discontinuous Petrov-Galerkin (DPG) methodology, for discretization of Vlasov, and machine-learning (ML) models to enable efficient evaluation of collision operators. DPG affords several key advantages. First, it has a built-in, robust error indicator, allowing us to adapt the mesh in a very natural way, enabling a coarse velocity-space mesh near the homogeneous boundaries, and a fine mesh where the solution has fine features. Second, it is an inherently high-order, high-intensity method, requiring extra local computations to determine so-called optimal test functions, which makes it particularly suited to modern hardware in which floating-point throughput is increasing at a faster rate than memory bandwidth. Finally, DPG is a residual-minimizing method, which enables high-accuracy computation: in typical cases, the method delivers something very close to the $L^2$ projection of the exact solution. Meanwhile, the ML-based collision model we adopt affords a cost structure that scales as the square root of a standard direct evaluation. Moreover, we design our model to conserve mass, momentum, and energy by construction, and our approach to training is highly flexible, in that it can incorporate not only synthetic data from direct-simulation Monte Carlo (DSMC) codes, but also experimental data. We have developed two DPG formulations for Vlasov-Poisson: a time-marching, backward-Euler discretization and a space-time discretization. We have conducted a number of numerical experiments to verify the approach in a 1D1V setting. In this report, we detail these formulations and experiments. We also summarize some new theoretical results developed as part of this project (published as papers previously): some new analysis of DPG for the convection-reaction problem (of which the Vlasov equation is an instance), a new exponential integrator for DPG, and some numerical exploration of various DPG-based time-marching approaches to the heat equation. As part of this work, we have contributed extensively to the Camellia open-source library; we also describe the new capabilities and their usage. We have also developed a well-documented methodology for single-species collision operators, which we applied to argon and demonstrated with numerical experiments. We summarize those results here, as well as describing at a high level a design extending the methodology to multi-species operators. We have released a new open-source library, MLC, under a BSD license; we include a summary of its capabilities as well.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Meshfree simulation and prediction of recrystallized grain size in friction stir processed 316L stainless steel

Friction stir processing (FSP) is a promising solid-phase microstructural modification technique that can repair and enhance damaged stainless steel surfaces exposed to harsh environments. The quality of the repaired material is closely correlated to the recrystallized grain size in the stir zone (SZ), which is influenced by the thermomechanical conditions dictated by FSP process parameters. Thus, establishing a reliable relationship between these parameters and recrystallized grain size in the SZ is crucial for optimizing repair quality. However, existing experimental approaches often rely on indirect temperatures measured far from the SZ, along with rough strain rate estimations, which are imprecise and time-consuming. Meanwhile, existing mesh-based modeling methods usually face numerical challenges when dealing with the large material deformations inherent in FSP. Here, to address these issues, this study introduces a meshfree process model for FSP based on the smoothed particle hydrodynamics (SPH) method, aimed at predicting process conditions under different parameters. The model is validated using experimental data from 11 combinations of tool traverse and rotation speeds on 316 L stainless steel. Correlations between process parameters, material flow, temperature, strain, strain rate, and recrystallized grain size are revealed through SPH simulations and electron backscatter diffraction (EBSD) imaging. The results show that in situ SZ temperatures range from 1071 to 1322°C, which exceed the tool temperature by over 300°C. Furthermore, SZ temperature, strain rate, and grain size increase monotonically with higher tool temperature and faster traverse speed. A relationship is then established between the model-predicted Zener-Hollomon parameter and the recrystallized grain size based on EBSD data, expressed as ln(d) = -0.364 ln(Z) + 14.673. Finally, this relationship exhibits satisfactory accuracy with errors of less than 26.9% in predicting grain sizes at various SZ locations, which offers valuable insights for optimizing FSP repair processes for 316 L stainless steel.

316L stainless steel↗

Design, analysis and preliminary numerical results for the nonconforming VEM for parabolic problems

The virtual element method (VEM) is a numerical methodology for solving partial differential equations on unstructured polytopal meshes. In this work, we extend the nonconforming high-order formulation suitable to time-dependent diffusion problems with possibly nonlinear forcing terms. Coupling high-order virtual element formulations in space with time-marching schemes based on Backward Differention Formulas (BDFs) makes a fully discrete method with optimal order of convergence in the Method of Lines framework. We investigate and assess the performance of the method through theoretical analysis and a set of numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Optimal Power Flow of Radial Networks and Its Variations: A Sequential Convex Optimization Approach

This paper proposes a sequential convex optimization method to solve broader classes of optimal power flow (OPF) problems over radial networks. The non-convex branch power flow equation is decomposed as a second-order cone inequality and a non-convex constraint involving the difference of two convex functions. Provided with an initial solution offered by an inexact second-order cone programming relaxation model, this approach solves a sequence of convexified penalization problems, where concave terms are approximated by linear functions and updated in each iteration. It could recover a feasible power flow solution, which usually appears to be very close, if not equal, to the global optimal one. Two variations of the OPF problem, in which non-cost related objectives are optimized subject to power flow constraints and the convex relaxation is generally inexact, are elaborated in detail. One is the maximum loadability problem, which is formulated as a special OPF problem that seeks the maximal distance to the boundary of power flow insolvability. The proposed method is shown to outperform commercial nonlinear solvers in terms of robustness and efficiency. The other is the bi-objective OPF problem. A non-parametric scalarization model is suggested, and is further reformulated as an extended OPF problem by convexifying the objective function. It provides a single trade-off solution without any subjective preference. The proposed computation framework also helps retrieve the Pareto front of the bi-objective OPF via the e-constraint method or the normal boundary intersection method. This paper also discusses extensions for OPF problems over meshed networks based on the semidefinite programming relaxation method.

bi-objective optimization↗