Engineering topics
Publications and source records attributed to Ray, Navamita.
This is a Python library that provides infrastructure for users to train gradient-free (neural network) machine learning models in a variety of problem domains. The avoidance of gradients/backpropagation is achieved by the randomization and fixing of a subset of neural network weights and biases during training.
Abstract The problem of hexahedral mesh generation of general CAD models has vexed researchers for over 3 decades and analysts often spend more than 50% of the design-analysis cycle time decomposing complex models into simpler blocks meshable by existing techniques. The decomposed blocks are required for generating good quality meshes (tilings of quadrilaterals or hexahedra) suitable for numerical simulations of physical systems governed by conservation laws. We present a novel AI-assisted method for decomposing (segmenting) planar CAD (computer-aided design) models into well shaped rectangular blocks. Even though the simple examples presented here can also be meshed using many conventional methods, we believe this work is proof-of-principle of a AI-based decomposition method that can eventually be generalized to complex 2D and 3D CAD models. Our method uses reinforcement learning to train an agent to perform a series of optimal cuts on the CAD model that result in a good quality block decomposition. We show that the agent quickly learns an effective strategy for picking the location and direction of the cuts and maximizing its rewards. This paper is the first successful demonstration of an agent autonomously learning how to perform this block decomposition task effectively, thereby holding the promise of a viable method to automate this challenging process for more complex cases.
In this report we present two approaches to data remapping between one-dimensional meshes implemented with the c++ programming language. Our goal was to test the performance of two search algorithms, linear and binary, and verify the accuracy of our implementations of the two methods. We first introduce the concept of data remap and meshing components, as well as their various uses. We then delve into the differences between point-wise and conservative remap, the algorithms used in the implementations, and lastly confirm the implementations work as intended when given various inputs. We expect that, after profiling, the binary search algorithm will be more efficient than the linear algorithm for sorted sets of data, the point-wise remap implementation to accurately approximate the data transfer between two meshes, and the conservative remap implementation to conserve the area underneath the curve of two distinct meshes.
In this report, we describe two approaches to the problem of remapping data from a source mesh (on which data is available) onto a target mesh. We consider two separate methods to solve the problem: Pointwise and Conservative remap, and determine why one is more advantageous when considering different physics applications and elements. We utilize C++ functionalities to derive our findings along with the C++ ”Chronos” library for timing measurements of our studies.
Remapping involves two meshes (source and target), where a discrete set of field values (data) is available on only one of the meshes (source mesh). Since the source and target mesh can be different, we need to find an approximation of the field on the target mesh using the data available on the source mesh. We will consider two algorithms for this problem: point-wise remap and conservative remap.
Two different remapping algorithms were implemented: point wise (node-to-node date remapping) and conservative (conserves the area under the curve. The performance of both linear and binary searches were studied and it was found that the binary search was more efficient.
Explore the source record for details and available documents.
Remapping is a conservative interpolation of a discretized intensive quantity between two meshes. In this article, we propose a novel multi-material flux remapping method that avoids the geometric computation of mesh-mesh intersections needed for an accurate intersection based remap. The flux remap is applicable to scalar quantities such as material density describing the multi-material flow between meshes with the same connectivity but small mesh displacements. Herein, the method is described for two- and three-dimensional polygonal/polyhedral meshes as it is implemented in Portage. Another open source library, Tangram, is used to calculate material interfaces in cells containing more than one material. Performance and accuracy of the flux remap are discussed with respect to Arbitrary Lagrangian-Eulerian simulations and compared to an accurate intersection based remap. In particular, cyclic remapping shows that the accuracy of the flux remap is limited to first order on material boundaries while maintaining second order accuracy in pure material regions.
We aim to use machine learning to teach a computer to decompose models into meshable sub-shapes.
Abstract not provided.
Abstract not provided.
This paper explores the suitability of upcoming novel computing technologies, particularly adiabatic annealing based quantum computers, to solve fluid dynamics problems that form a critical component of several science and engineering applications. For our experiments, we start with a well-studied one-dimensional simple flow problem, and provide a framework to convert such problems in continuum to a form amenable for deployment on such quantum annealers. Since the DWave annealer returns multiple states sampling the energy landscape of the problem, we explore multiple solution selection strategies to approximate the solution of the problem. We analyze the continuum solutions obtained both qualitatively and quantitatively as well as their sensitivities to the particular solution selection scheme.
In this work, we propose an interpolation or remapping algorithm of material-dependent fields on polyhedral meshes where any source or target cell contains only one material. It is conservative and it preserves sharp material boundaries on the target mesh, even if the source and target regions delineating the same material are slightly misaligned. If those material regions are aligned, then the algorithm is also linearity-preserving and bounds-preserving. For a given material, it consists of a conservative field reconstruction on a target mesh part from a source mesh part associated with that material, followed by a repair step in case of misaligned boundaries. No assumption is made regarding the topology of the input meshes
Portage is a scalable and extensible remap library for numerical simulations. It supports state-of-the-art remap schemes for meshes and particles in 2D and 3D up to a second-order accuracy. Portage ensures critical properties such as local/global conservation and bounds preservation for mesh remap. It enables multi-material field remap through a dedicated plugin, and leverages the hybrid parallelism exposed by advanced architectures using multi-processing and multi-threading.
The ASC Advanced Technology Development and Mitigation (ATDM) sub-program was established in 2014 to develop new simulation tools operating on exascale-class computers to serve NNSA (see Appendix B). Over the course of ATDM, LANL management have set a strategy for exascale-class application codes that follows two supportive and mutually risk-mitigating paths: evolution for established production integrated design codes (IDCs) – with a strong pedigree within the user community – based upon existing programming paradigms(MPI+X); and a new start ATDM project, Ristra, a high-risk/high-reward push for a next-generation multi-physics, multi-scale simulation toolkit based on emerging advanced programming systems(with an initial focus on data-flow task-based models exemplified by Legion). The role of Ristra as the high-risk/high-reward path for LANL’s codes was fully consistent with the goals of ATDM as described in Appendix B, in particular its emphasis on evolving ASC capabilities through novel computing programming models and computing technologies.
We represent a selection of early career staff at LANL with backgrounds in mathematics. There are many possible paths to a position at LANL. The lab has very active graduate research and postdoctoral programs, and it is not uncommon for graduate students to become postdocs, who can then be “converted” to staff. Conversion from being a postdoc is not the only route to a position at LANL, nor is it a guarantee, but most of us did postdocs here before becoming staff. Being a postdoc here also gives you an idea of whether you’d like living in northern New Mexico, a rugged, beautiful, and somewhat remote area. It is important to say here that citizenship is not a requirement for many of the positions at the lab. The lab historically and currently welcomes investigators from all over the world. LANL offers a broad spectrum of mathematical challenges that are largely problem driven. Particularly to those who feel that academic mathematics can be stove-piped, with a focus on deep but not necessarily broad expertise, the LANL environment gives the flexibility to move and grow in many different directions. The lab encourages a team-based approach to problems, which not only enhances the breadth of our approach to solving problems, but also gives team members access to new fields. From the outside (academia), however, it can be difficult to see how fields map between academia and the lab. This is one of the reasons that having interaction with the lab as a graduate student or postdoc can be helpful in understanding if the environment would be a good match for you. An important advantage of working at the lab is our high visibility both in academia, as well as in industry and the government. Because of its mission-driven projects, LANL, and more broadly the Department of Energy Laboratories, help set research directions that are picked up by researchers in academia. For this reason, many lab staff have worked at LANL for a number of years, then have transferred into academia after having set the agenda for their field of expertise. Below, we will share some of our experiences, opinions, and reflections in order to give the reader a feel for our own early career experiences.
Explore the source record for details and available documents.