Learning Region of Interest for Bayesian Optimization with Adaptive Level-Set Estimation
Explore the source record for details and available documents.
SEARCH · Engineering Papers
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.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Here G-Equation models represent propagating flame fronts with an implicit two-dimensional surface representation (level-set). Level-set methods are fast, as transport source terms for the implicit surface can be solved with finite-volume operators on the finite-volume domain, without having to build the actual surface. However, they include approximations whose practical effects are not properly understood. In this study, we improved the numerics of the FRESCO CFD code’s G-Equation solver and developed a new method to simulate kernel growth using signed distance functions and the analytical sphere-mesh overlap. We analyzed their role for simulating propane/air flames, using three well-established constant-volume configurations: a one-dimensional, freely propagating laminar flame; a disc-shaped, constant-volume swirl combustor; and torch-jet flame development through an orifice from a two-chamber device. We tested the explicit (sub-cycled) vs. implicit formulation for the standard transport operators (advection, diffusion, compressibility). In addition to the accurate flame swept-volume method for chemistry and species source term, we developed a more accurate estimator for the burnt/unburnt split cell composition. Then, we developed a signed-distance-function (SDF) based method which provides a more stable reinitialization of the level-set field at every time-step. We found that simplifying assumptions common to several G-Equation implementations, for straightforward terms such as compressibility and advection, lead to large errors in predicting the propagation of even laminar flames, with deviations up to ~300% in simulated vs. formulated flame speed. Conversely, the enhanced numerics enabled through the SDF field reinitialization and improved chemistry source term improve simulation stability and smooth flame propagation even with significantly larger solver time-steps.
Threshold Limit Values recommended as allowable air concentrations of a chemical in the workplace are often based upon a no-observable-effect-level (NOEL) determined by experimental inhalation studies using rodents. A 'safe level' for human exposure must then be estimated by the use of generalized safety factors in attempts to extrapolate from experimental rodents to man. The recent development of chemical-specific physiologically-based toxicokinetics makes use of measured physiological, biochemical, and metabolic parameters to construct a validated model that is able to 'scale-up' rodent response data to predict the behavior of the chemical in man. This procedure is made possible by recent advances in personal computer software and the emergence of appropriate biological data, and provides an analytical tool for much more reliable risk evaluation and airborne chemical exposure level setting for humans.
In Light Water Reactor (LWR) cores, the nuclear fuel rods are arranged together as rod bundles in a triangular or square pattern. The fuel rod bundles are supported by the spacer grids with mixing vanes. An understanding of spacer grid and mixing vanes effect is important since it has a direct impact on the turbulence structure in the flow and the heat removal efficiency from the fuel rod surface. Although a considerable amount of literature has been published on the experimental investigation of spacer grid and mixing vanes effect, the measurements were mainly focused on single-phase flow. The influence of spacer grid and mixing vanes on two-phase flow is yet to be fully understood. Some preliminary research efforts have been invested in nuclear community. For example, Wheeler et al. experimentally studied the effects of spacer grid in air-water two-phase flow. Although mixing vanes are not considered, they presented interesting results of time-averaged two-phase flow quantities at upstream and downstream locations of the spacer grid. Over the past decades, the rapid development of High-Performance Computing (HPC) is allowing for the increasingly larger-scale high-fidelity simulations. Thanks to this favorable historical trend, Direct Numerical Simulation (DNS), integrated with Interface Tracking Methods (ITM), has been emerging as a valuable tool to complement and expand our ability to understand the two-phase flow phenomenon. Meanwhile, in order to make best use of the large-scale two-phase flow simulations, advanced data analysis techniques are being developed, as they enable the extraction of detailed parameters about individual bubble behavior. The level set ITM is utilized in our DNS flow solver, which makes use of a signed distance field. The gas-liquid interface is modeled by the zero level set. The level set method can be readily used to distinguish different phases based on the sign of corresponding level set value (e.g. the sign is positive in the liquid phase while negative in the gas phase.). However, the traditional level set approach is not able to collect calculated values and associate with specific bubbles when multiple (even thousands of) bubbles present in the simulations of two-phase flow. This drawback hinders the collection of useful bubble information, which can give us valuable insights about bubbly flows. For example, how the different local fluid conditions could affect bubble interfacial forces, bubble deformation level, and eventually the bubble distribution throughout the whole domain. A bubble tracking methodology has been developed to address the drawbacks and improve the data collection efficiency of level set based two-phase flow simulations. In the present work, a single Pressurized Water Reactor (PWR) subchannel with reduced size spacer grid and mixing vanes is chosen as the computational domain. The springs and dimples of the spacer grid are not represented for simplicity in the present investigation. The bubble tracking methodology is applied to the simulations of two-phase bubbly flow through spacer grid and mixing vanes region. In the intended simulation, the liquid turbulence will be fully resolved by DNS while the two-phase behaviors are captured by level set ITM. Bubble tracking data are to be processed to investigate the spacer grid and mixing vanes effect on two-phase bubbly flow. (authors)
In Silva et al. (2011) and Alidoost et al. (2020), the authors developed an approximation of the energy release rate field associated with a small edge or surface crack at any boundary location and with any orientation using the topological derivative. The approximation is computationally attractive because it requires only a single analysis on the non-cracked domain in contrast with conventional boundary-element and finite-element-based methods, which require a separate and costlier analysis for each crack length-location-orientation combination. Here, a shape optimization scheme for fracture-resistant structures is developed using the energy release rate approximation. In the gradient-based optimization scheme, the domain and its boundary are defined implicitly using level-set functions. The level-set functions of arbitrary geometries are constructed using Boolean operations from the level-set functions of simple primitives. This geometrical representation has the dual advantage of (i) allowing shapes to intersect and/or separate during the optimization and (ii) simplifying the computation of the shape sensitivities.
The full level-set function code, DSD3D, is fully described in LA-14336 (2007) [1]. This ASCI-supported, DSD code project was the last such LANL DSD code project that I was involved with before my retirement in 2007. My part in the project was to design and build the core DSD3D solver, which was to include a robust DSD boundary condition treatment. A robust boundary condition treatment was required, since for an important local “customer,” the only description of the explosives’ boundary was through volume fraction data. Given this requirement, the accuracy issues I had encountered with our “fast-tube,” narrowband, DSD2D solver, and the difficulty we had building an efficient MPI-parallel version of the narrowband DSD2D, I decided DSD3D should be built as a full level-set function code, using a totally local DSD boundary condition algorithm for the level-set function, phi, which did not rely on the gradient of the level-set function being one, |grad(phi)| = 1. The narrowband DSD2D solver was built on the assumption that |grad(phi)| could be driven to one, and near the boundaries of the explosive this condition was not being satisfied. Since the narrowband is typically no more than10*dx wide, narrowband methods are discrete methods with a fixed, non-resolvable error, where the error is related to the thickness of the band: the narrower the band the larger the errors. Such a solution represents a discrete approximation to the true solution and does not limit to the solution of the underlying PDEs under grid resolution.The full level-set function code, DSD3D, is fully described in LA-14336 (2007) [1]. This ASCI-supported, DSD code project was the last such LANL DSD code project that I was involved with before my retirement in 2007. My part in the project was to design and build the core DSD3D solver, which was to include a robust DSD boundary condition treatment. A robust boundary condition treatment was required, since for an important local “customer,” the only description of the explosives’ boundary was through volume fraction data. Given this requirement, the accuracy issues I had encountered with our “fast-tube,” narrowband, DSD2D solver, and the difficulty we had building an efficient MPI-parallel version of the narrowband DSD2D, I decided DSD3D should be built as a full level-set function code, using a totally local DSD boundary condition algorithm for the level-set function, phi, which did not rely on the gradient of the level-set function being one, |grad(phi)| = 1. The narrowband DSD2D solver was built on the assumption that |grad(phi)| could be driven to one, and near the boundaries of the explosive this condition was not being satisfied. Since the narrowband is typically no more than10*dx wide, narrowband methods are discrete methods with a fixed, non-resolvable error, where the error is related to the thickness of the band: the narrower the band the larger the errors. Such a solution represents a discrete approximation to the true solution and does not limit to the solution of the underlying PDEs under grid resolution.
A new mesh smoothing method designed to cluster cells near a dynamically evolving interface is presented. The method is based on weighted condition number mesh relaxation with the weight function computed from a level set representation of the interface. The weight function is expressed as a Taylor series based discontinuous Galerkin projection, which makes the computation of the derivatives of the weight function needed during the condition number optimization process a trivial matter. For cases when a level set is not available, a fast method for generating a low-order level set from discrete cell-centered fields, such as a volume fraction or index function, is provided. Results show that the low-order level set works equally well as the actual level set for mesh smoothing. Meshes generated for a number of interface geometries are presented, including cases with multiple level sets. Lastly, dynamic cases with moving interfaces show the new method is capable of maintaining a desired resolution near the interface with an acceptable number of relaxation iterations per time step, which demonstrates the method's potential to be used as a mesh relaxer for arbitrary Lagrangian Eulerian (ALE) methods.
A new mesh smoothing method designed to cluster mesh cells near a dynamically evolving interface is presented. The method is based on weighted condition number mesh relaxation with the weight function being computed from a level set representation of the interface. The weight function is expressed as a Taylor series based discontinuous Galerkin projection, which makes the computation of the derivatives of the weight function needed during the condition number optimization process a trivial matter. For cases when a level set is not available, a fast method for generating a low-order level set from discrete cell-centered elds, such as a volume fraction or index function, is provided. Results show that the low-order level set works equally well for the weight function as the actual level set. Meshes generated for a number of interface geometries are presented, including cases with multiple level sets. Dynamic cases for moving interfaces are presented to demonstrate the method's potential usefulness to arbitrary Lagrangian Eulerian (ALE) methods.
Simulations of the pinch-off of an inviscid fluid column are carried out based upon a potential flow model with capillary forces. The interface location and the time evolution of the free surface boundary condition are both approximated by means of level set techniques on a fixed domain. The interface velocity is obtained via a Galerkin boundary integral solution of the 3D axisymmetric Laplace equation. A short-time analytical solution of the Raleigh-Taylor instability in a liquid column is available, and this result is compared with our numerical experiments to validate the algorithm. The method is capable of handling pinch-off and after pinch-off events, and simulations showing the time evolution of the fluid tube are presented.
The development and utilization of computational fluid dynamics (CFD) models for large, high-temperature electric melters in the Waste Treatment and Immobilization Plant (WTP) in eastern Washington State have proven to be valuable for various purposes. These models allow for a better understanding of the physio-chemical processes occurring within the melter vessels and can contribute to improving operational efficiency, throughput, and addressing operational issues related to vitrification. The CFD models employed for these melter vessels incorporate multiphase fluid flow and heat transfer simulations in different regions, including the plenum, cold cap, and molten glass regions. As the tank waste and glass formers are introduced into the melter, a reacting batch layer known as the cold cap forms on top of the molten glass. To enhance the melt rate, forced convection bubblers located at the bottom of the melters generate convection currents that help homogenize the molten glass and provide heat to the cold cap. As the bubbles rise through the highly viscous glass, they adopt a spherical-cap shape [1]. Meanwhile, the conversion of the batch to glass generates significant amounts of gases (such as water vapor, carbon dioxide, sulfur dioxide, and NOx) due to thermal decomposition [2]. These gases become trapped between the cold cap and molten glass, forming a foam layer [3]. For modeling multiphase flow in CFD and heat transfer simulations of waste glass melters at different scales, efforts are underway to augment the capabilities of the Nek5000 [4] and NekRS [5] open-source codes [6]. Nek5000/NekRS is a scalable and efficient spectral element code that has been successfully applied to a wide range of fluid dynamics problems. By leveraging the Nek5000/NekRS software, it becomes possible to model the melter systems more affordably and with lower computational requirements compared to currently utilized commercial CFD software. The specific objectives of this ongoing effort include: 1. Implementation of a level set method in Nek5000/NekRS: The level set method is a numerical technique commonly employed in CFD simulations to track and represent the interface between different phases or materials accurately. By incorporating this method into Nek5000/NekRS, the ability to simulate multiphase flows in waste glass melters at a high level of fidelity can be achieved. 2. Demonstration of capability for air bubbling through molten glass: As part of the development process, a specific case of air bubbling through molten glass will be simulated using the augmented Nek5000/NekRS code. This demonstration aims to showcase the ability of the software to accurately capture and analyze the complex phenomena involved in the multiphase flow within waste glass melters. By achieving these objectives, the improved Nek5000/NekRS code will offer a powerful computational tool for simulating and analyzing waste glass melter systems, enabling better understanding, optimization, and troubleshooting of these vitrification processes. The ability to accurately model and simulate multiphase flows has broad relevance across many industries and scientific domains, and the improved functionality can contribute to advancements in various fields beyond waste glass melter simulations.
The present disclosure relates to a system for optimizing an additive manufacturing (AM) process. The system may use a printing component for using a material to form a component in a layer-by-layer process. An electronic controller may control movement of one of the printing component or a substrate on which the component is being formed, in a manner to optimize a toolpath for the printing component as each layer of the component is formed. Optimization operations are performed using an optimization subsystem which enables manufacturability constraints, as well as optimized toolpaths for each layer of the component, to be defined using contours of a level-set function. The level-set function may be used to define the optimized toolpaths within a fixed, predetermined grid, and the optimized toolpaths then used to generate suitable code for controlling movement of the printing component relative to the substrate to create the part or structure in a layer-by-layer process, using the optimized toolpaths.
Visualizing the uncertainty of ensemble simulations is challenging due to the large size and multivariate and temporal features of en-semble data sets. One popular approach to studying the uncertainty of ensembles is analyzing the positional uncertainty of the level sets. Probabilistic marching cubes is a technique that performs Monte Carlo sampling of multivariate Gaussian noise distributions for positional uncertainty visualization of level sets. However, the technique suffers from high computational time, making interactive visualization and analysis impossible to achieve. This paper introduces a deep-learning-based approach to learning the level-set uncertainty for two-dimensional ensemble data with a multivariate Gaussian noise assumption. We train the model using the first few time steps from time-varying ensemble data in our workflow. We demonstrate that our trained model accurately infers uncertainty in level sets for new time steps and is up to 170X faster than that of the original probabilistic model with serial computation and 10X faster than that of the original parallel computation.
Highlights: • Demonstration of 3D curvature level set methods for APT simulations • Demonstration of non-rotationally symmetric tip shape simulations • Optimised speed for simulations, calculations achievable on minute timescales This work describes extensions to existing level-set algorithms developed for application within the field of atom probe tomography (APT). We present a new simulation tool for the simulation of 3D tomographic volumes, using advanced level set methods. By combining narrow-band, B-Tree and particle-tracing approaches from level-set methods, we demonstrate a practical tool for simulating shape changes to APT samples under applied electrostatic fields, in three dimensions. This work builds upon our previous studies by allowing for non-axially symmetric solutions, with minimal loss in computational speed, whilst retaining numerical accuracy.
A hybrid of the Front-Tracking (FT) and the Level-Set (LS) methods is introduced, combining advantages and removing drawbacks of both methods. The kinematics of the interface is treated in a Lagrangian (FT) manner, by tracking markers placed at the interface. The markers are not connected – instead, the interface topology is resolved in an Eulerian (LS) framework, by wrapping a signed distance function around Lagrangian markers each time the markers move. For accuracy and efficiency, we have developed a high-order “anchoring” algorithm and an implicit PDE-based re-distancing. We have demonstrated that the method is 3rd-order accurate in space, near the markers, and therefore 1st-order convergent in curvature; in contrast to traditional PDE-based re-initialization algorithms, which tend to slightly relocate the zero Level Set and can be shown to be non-convergent in curvature. The implicit pseudo-time discretization of the re-distancing equation is implemented within the Jacobian-Free Newton Krylov (JFNK) framework combined with ILU(k) preconditioning. We have demonstrated that the steady-state solutions in pseudo-time can be achieved very efficiently, with iterations (CFL ), in contrast to the explicit re-distancing which requires 100s of iterations with CFL . The most cost-effective algorithm is found to be a hybrid of explicit and implicit discretizations, in which we apply first 10-15 iterations with explicit discretization (to bring the initial guess to the ball of convergence for the Newton’s method) and then finishing with 2-3 implicit steps, bringing the re-distancing equation to a complete steady-state. The eigenscopy of the JFNK-ILU(k) demonstrates the efficiency of the ILU(k) preconditioner, which effectively cluster eigenvalues of the otherwise extremely ill-conditioned Jacobian matrices, thereby enabling the Krylov (GMRES) method to converge with iterations, with only a few levels of ILU fill-ins. Importantly, due to the Level Set localization, the bandwidth of the Jacobian matrix is nearly constant, and the ILU preconditioning scales as , which implies efficiency and good scalability of the overall algorithm. The numerical examples include the well-established tests for interface kinematics under translational, rotational and tearing/stretching motion. We have shown that the mass conservation is not an issue anymore, as demonstrated using the Rider&Kothe’s time-reversed tests with extreme deformation. We are able to stretch interface structures to the under-resolved/subgrid (on the chosen Eulerian mesh) scales, and recover them back without any change in shape/loss of mass.
Purpose: MRI guided radiotherapy is particularly attractive for abdominal targets with low CT contrast. To fully utilize this modality for pancreas tracking, automated segmentation tools are needed. A hybrid gradient, region growth and shape constraint (hGReS) method to segment 2D upper abdominal dynamic MRI is developed for this purpose. Methods: 2D coronal dynamic MR images of 2 healthy volunteers were acquired with a frame rate of 5 f/second. The regions of interest (ROIs) included the liver, pancreas and stomach. The first frame was used as the source where the centers of the ROIs were annotated. These center locations were propagated to the next dynamic MRI frame. 4-neighborhood region transfer growth was performed from these initial seeds for rough segmentation. To improve the results, gradient, edge and shape constraints were applied to the ROIs before final refinement using morphological operations. Results from hGReS and 3 other automated segmentation methods using edge detection, region growth and level set were compared to manual contouring. Results: For the first patient, hGReS resulted in the organ segmentation accuracy as measure by the Dices index (0.77) for the pancreas. The accuracy was slightly superior to the level set method (0.72), and both are significantly more accurate than the edge detection (0.53) and region growth methods (0.42). For the second healthy volunteer, hGReS reliably segmented the pancreatic region, achieving a Dices index of 0.82, 0.92 and 0.93 for the pancreas, stomach and liver, respectively, comparing to manual segmentation. Motion trajectories derived from the hGReS, level set and manual segmentation methods showed high correlation to respiratory motion calculated using a lung blood vessel as the reference while the other two methods showed substantial motion tracking errors. hGReS was 10 times faster than level set. Conclusion: We have shown the feasibility of automated segmentation of the pancreas anatomy based on dynamic MRI.