Search NASA⌕ Search

SEARCH · Search NASA

Results for “applied computing”

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 1,495 records · Page 83

DiaMonD: An Integrated Multifaceted Approach to Mathematics at the Interfaces of Data, Models, and Decisions

The major goal of the project was to invent, analyze, implement, and apply new algorithms to speed up the computational simulation of complex systems in settings in which multiple simulations are needed. The main efforts we undertook are as follows: 1. Develop novel reduced order methods to reduce the costs of simulations, especially in settings (e.g., UQ, inference, optimization and control) for which numerous simulation are needed and also for nonlocal problems (e.g., fractional derivative, anomalous diffusion, nonlocal mechanics) for which lack of sparsity results in more expensive full-order simulation than encountered in partial differential equations settings; rigorous analyses as well as computational tests were carried out, 2. Develop multifidelity methods based on the usage of a variety of models having different fidelities and different costs to accelerate simulations again in settings where numerous simulations are needed or are especially expensive; rigorous analyses as well as computational tests were carried out, 3. Develop ensemble methods to reduced the costs of simulations again in settings where numerous simulations are needed or are especially expensive; rigorous analyses as well as computational tests were carried out, and 4. Analyze a model for Richardson pair dispersion in turbulent flows and develop discretization methods for the efficient and accurate approximations of the solution of the model; rigorous analyses as well as computational tests were carried out.

97 MATHEMATICS AND COMPUTING↗

Learning to Predict and Improve Build Successes in Package Ecosystems

Software has become increasingly complex, with a typical application depending on tens or hundreds of packages. Finding compatible versions and build configurations of these packages is challenging. This paper presents a method to learn the likelihood of software build success, and techniques for leveraging this information to guide dependency solvers to better software configurations. We leverage the heavily parameterized package recipes from the Spack package manager to produce a training data set of builds, and we use Graph Neural Networks to learn whether a given package configuration will build successfully or not. We apply our tool to the U.S. Exascale Computing Project’s software stack. We demonstrate its effectiveness in predicting whether a given package will build successfully. We show that our technique can be used to improve the solutions generated by dependency solvers, reducing the need for developers to find working builds by trial and error.

97 MATHEMATICS AND COMPUTING↗

Understanding and Controlling Photoexcited Molecules in Complex Environments (Final Technical Report)

Predicting the outcome of a photochemical reaction is complicated by factors outside the scope of tradition theoretical chemistry. On such small scales, fluctuations of the environment render outcomes stochastic, nonadiabatic dynamics blur the separation between nuclear and electronic motion, and ultrafast relaxation renders typical assumptions of equilibrium inappropriate. This project aimed to elucidate and control nonadiabatic molecular dynamics in condensed phases. We developed accurate, efficient simulation tools to study irreversible molecular processes computational across a range of scales. We applied these methodological advances to study electron transfer under exotic conditions where spin and topology opened new pathways for reactivity. We also brought these ideas to bare on light harvesting systems, where energy and charge transport are coupled, and where long lifetimes can be deleterious to function. These advances helped to establish general principles for chemical efficiency and guide the design of nanoscale energy materials, molecular machines, and related technologies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

REVIEW OF MECHANISTIC UNDERSTANDING AND MODELING AND UNCERTAINTY ANALYSIS METHODS FOR PREDICTING CEMENTITIOUS BARRIER PERFORMANCE

Cementitious barriers for nuclear applications are one of the primary controls for preventing or limiting radionuclide release into the environment. At the present time, performance and risk assessments do not fully incorporate the effectiveness of engineered barriers because the processes that influence performance are coupled and complicated. Better understanding the behavior of cementitious barriers is necessary to evaluate and improve the design of materials and structures used for radioactive waste containment, life extension of current nuclear facilities, and design of future nuclear facilities, including those needed for nuclear fuel storage and processing, nuclear power production and waste management. The focus of the Cementitious Barriers Partnership (CBP) literature review is to document the current level of knowledge with respect to: (1) mechanisms and processes that directly influence the performance of cementitious materials (2) methodologies for modeling the performance of these mechanisms and processes and (3) approaches to addressing and quantifying uncertainties associated with performance predictions. This will serve as an important reference document for the professional community responsible for the design and performance assessment of cementitious materials in nuclear applications. This review also provides a multi-disciplinary foundation for identification, research, development and demonstration of improvements in conceptual understanding, measurements and performance modeling that would be lead to significant reductions in the uncertainties and improved confidence in the estimating the long-term performance of cementitious materials in nuclear applications. This report identifies: (1) technology gaps that may be filled by the CBP project and also (2) information and computational methods that are in currently being applied in related fields but have not yet been incorporated into performance assessments of cementitious barriers. The various chapters contain both a description of the mechanism or and a discussion of the current approaches to modeling the phenomena.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

User-Centered Evaluation of Visual Analytics

Visual analytics systems are becoming very popular. More domains now use interactive visualizations to analyze the ever-increasing amount and heterogeneity of data. More novel visualizations are being developed for more tasks and users. We need to ensure that these systems can be evaluated to determine that they are both useful and usable. A user-centered evaluation for visual analytics needs to be developed for these systems. While many of the typical human-computer interaction (HCI) evaluation methodologies can be applied as is, others will need modification. Additionally, new functionality in visual analytics systems needs new evaluation methodologies. There is a difference between usability evaluations and user-centered evaluations. Usability looks at the efficiency, effectiveness, and user satisfaction of users carrying out tasks with software applications. User-centered evaluation looks more specifically at the utility provided to the users by the software. This is reflected in the evaluations done and in the metrics used. In the visual analytics domain this is very challenging as users are most likely experts in a particular domain, the tasks they do are often not well defined, the software they use needs to support large amounts of different kinds of data, and often the tasks last for months. These difficulties are discussed more in the section on User-centered Evaluation. Our goal is to provide a discussion of user-centered evaluation practices for visual analytics, including existing practices that can be carried out and new methodologies and metrics that need to be developed and agreed upon by the visual analytics community. The material provided here should be of use for both researchers and practitioners in the field of visual analytics. Researchers and practitioners in HCI and interested in visual analytics will find this information useful as well as a discussion on changes that need to be made to current HCI practices to make them more suitable to visual analytics. A history of analysis and analysis techniques and problems is provided as well as an introduction to user-centered evaluation and various evaluation techniques for readers from different disciplines. The understanding of these techniques is imperative if we wish to support analysis in the visual analytics software we develop. Currently the evaluations that are conducted and published for visual analytics software are very informal and consist mainly of comments from users or potential users. Our goal is to help researchers in visual analytics to conduct more formal user-centered evaluations. While these are time-consuming and expensive to carryout, the outcomes of these studies will have a defining impact on the field of visual analytics and help point the direction for future features and visualizations to incorporate. While many researchers view work in user-centered evaluation as a less-than-exciting area to work, the opposite is true. First of all, the goal is user-centered evaluation is to help visual analytics software developers, researchers, and designers improve their solutions and discover creative ways to better accommodate their users. Working with the users is extremely rewarding as well. While we use the term “users” in almost all situations there are a wide variety of users that all need to be accommodated. Moreover, the domains that use visual analytics are varied and expanding. Just understanding the complexities of a number of these domains is exciting. Researchers are trying out different visualizations and interactions as well. And of course, the size and variety of data are expanding rapidly. User-centered evaluation in this context is rapidly changing. There are no standard processes and metrics and thus those of us working on user-centered evaluation must be creative in our work with both the users and with the researchers and developers.

intelligence analysis↗

Control and Room Temperature Optimization of Energy Efficient Buildings

The building sector consumes a large part of the energy used in the United States and is responsible for nearly 40% of greenhouse gas emissions. It is therefore economically and environmentally important to reduce the building energy consumption to realize massive energy savings. In this paper, a method to control room temperature in buildings is proposed. The approach is based on a distributed parameter model represented by a three dimensional (3D) heat equation in a room with heater/cooler located at ceiling. The latter is resolved using finite element methods, and results in a model for room temperature with thousands of states. The latter is not amenable to control design. A reduced order model of only few states is then derived using Proper Orthogonal Decomposition (POD). A Linear Quadratic Regulator (LQR) is computed based on the reduced model, and applied to the full order model to control room temperature.

Djouadi, Seddik M↗

Cyber-Physical Correlations for Infrastructure Resilience: A Game-Theoretic Approach

In several critical infrastructures, the cyber and physical parts are correlated so that disruptions to one affect the other and hence the whole system. These correlations may be exploited to strategically launch components attacks, and hence must be accounted for ensuring the infrastructure resilience, specified by its survival probability. We characterize the cyber-physical interactions at two levels: (i) the failure correlation function specifies the conditional survival probability of cyber sub-infrastructure given the physical sub-infrastructure as a function of their marginal probabilities, and (ii) the individual survival probabilities of both sub-infrastructures are characterized by first-order differential conditions. We formulate a resilience problem for infrastructures composed of discrete components as a game between the provider and attacker, wherein their utility functions consist of an infrastructure survival probability term and a cost term expressed in terms of the number of components attacked and reinforced. We derive Nash Equilibrium conditions and sensitivity functions that highlight the dependence of infrastructure resilience on the cost term, correlation function and sub-infrastructure survival probabilities. These results generalize earlier ones based on linear failure correlation functions and independent component failures. We apply the results to models of cloud computing infrastructures and energy grids.

cyber-physical infrastructures↗

Low Mach Code with Particle Transport Version 1.0

Computational technique is based on the firect numerical simulation of the particulate flows using distributed Lagrange multiplier technique (Kanarska et al. 2010 submitted to Computers and Fluids journal). Each particle is explicitly resolved on the Eulerian grid as a separate domain, using solid volume of fractions. The fluid equations are solved through the entire computational domain, and, Lagrange multiplier constrains are applied inside the solid domain to satisfy rigidity contrains.

Kanarska, Y.↗

Comparison of the generalized Riemann solver and the gas-kinetic scheme for inviscid compressible flow simulations

The generalized Riemann problem (GRP) scheme for the Euler equations and gas-kinetic scheme (GKS) for the Boltzmann equation are two high resolution shock capturing schemes for fluid simulations. The difference is that one is based on the characteristics of the inviscid Euler equations and their wave interactions, and the other is based on the particle transport and collisions. The similarity between them is that both methods can use identical MUSCL-type initial reconstructions around a cell interface, and the spatial slopes on both sides of a cell interface involve in the gas evolution process and the construction of a time-dependent flux function. Although both methods have been applied successfully to the inviscid compressible flow computations, their performances have never been compared. Since both methods use the same initial reconstruction, any difference is solely coming from different underlying mechanism in their flux evaluation. Therefore, such a comparison is important to help us to understand the correspondence between physical modeling and numerical performances. Since GRP is so faithfully solving the inviscid Euler equations, the comparison can be also used to show the validity of solving the Euler equations itself. The numerical comparison shows that the GRP exhibits a slightly better computational efficiency, and has comparable accuracy with GKS for the Euler solutions in 1D case, but the GKS is more robust than GRP. For the 2D high Mach number flow simulations, the GKS is absent from the shock instability and converges to the steady state solutions faster than the GRP. The GRP has carbuncle phenomena, likes a cloud hanging over exact Riemann solvers. The GRP and GKS use different physical processes to describe the flow motion starting from a discontinuity. One is based on the assumption of equilibrium state with infinite number of particle collisions, and the other starts from the non-equilibrium free transport process to evolve into an equilibrium one through particle collisions. The different mechanism in the flux evaluation deviates their numerical performance. Through this study, we may conclude scientifically that it may NOT be valid to use the Euler equations as governing equations to construct numerical fluxes in a discretized space with limited cell resolution. To adapt the Navier-Stokes (NS) equations is NOT valid either because the NS equations describe the flow behavior on the hydrodynamic scale and have no any corresponding physics starting from a discontinuity. This fact alludes to the consistency of the Euler and Navier-Stokes equations with the continuum assumption and the necessity of a direct modeling of the physical process in the discretized space in the construction of numerical scheme when modeling very high Mach number flows. The development of numerical algorithm is similar to the modeling process in deriving the governing equations, but the control volume here cannot be shrunk to zero.

97 MATHEMATICS AND COMPUTING↗

Radioactive Source Localization via Bayesian Particle Filter

In the event of a misplaced radioactive source or other emergency situation, measuring a radiation field, mapping its distribution, and determining a source location are essential tasks to ameliorating the situation. However, radiation fields may be extremely hazardous to human surveyors and minimizing received radiation doses is just as essential. Robots appear to be a potential solution to these problems. Beyond simply measuring radiation, the robot's computer processing capabilities offer a way to apply complex data analysis methods to radiation measurements in real-time. Methods which predict likely source locations can then feed this information into other processes, potentially improving path planning and enabling more efficient measurements. Given a robot mounted with a gamma-ray detector, can we: develop a methodology to account for detector performance across a wide range of source angles, distances, and photon energies? operate an autonomously navigating robot to effectively survey and characterize an area of interest? implement a data analysis method, conventionally used in measurements of motion, for source localization purposes? An open-source TurtleBot 3 robot, running Robot Operating System (ROS) on Ubuntu 16.04 LTS, was fitted with a Kromek GR1{sup R} Cadmium Zinc Telluride (CZT) solid-state gamma-ray detector. As a part of ROS, the packages OpenSlam, gmapping, and amcl were used to perform Simultaneous Localization and Mapping (SLAM), determining the robot's position and mapping the surrounding area. Data was acquired via Lidar mounted on top the TurtleBot 3. Detector Calibration Fit: The equation was fit to 365 counts of various energies, distances, and angles. A MATLAB{sup R} program was written to simulate measurements taken a robot on a random walk, with count data and positions discretized into finite element pixels. Using this program, a sample of 100 runs was performed on a map with a simulated source at the center, with a total of 200 of 2 pixels each. Similarly, multiple runs of the filter were performed on recorded robot measurement data. In both simulation and real tests, when corrected for errors (particles placed outside of bounds or on the robot, and simulation-specific errors), corresponding t-tests of predicted x and y-coordinates were within a 95% confidence interval of the actual position. For the real trial, these positions are slightly skewed right in the x-axis as the robot remained mainly to the left side of the source within the sample area. These simulations demonstrate potential validity for the usage of a particle filter as method of radioactive source localization. In the future, true real-time implementation and data fusion may further augment the performance of the robot to localize lost sources. Additionally, identification of multiple sources, determination of source types, and usage of a collimator are areas to potentially be explored.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Growth of Native Oxides of Niobium Thin Films for Superconducting Qubits with Etching Chemistry

Niobium thin films have been broadly applied in building superconducting qubits for quantum computing hardware. While improvements have been made by device engineering efforts, scaling the energy-sensitive quantum system requires materials study for further improvements. In this study, we performed XPS and ToF-SIMS analysis for Nb thin films across samples with different manufacturing techniques. By varying the air exposure time of the samples, this research comparatively investigates the chemical and depth profile of native oxides before and after the etching process. We observe a rapid logarithmic growth of oxide thickness across all samples and the dominant presence and growth of Niobium pentoxide in atomic percentage concentration on the surface. This comparative study provides insight into oxides mitigation strategies and correlation with qubits performance.

Lei, Zhicheng↗

Dynamic Learning of Correlation Potentials for a Time-Dependent Kohn-Sham System

We develop methods to learn the correlation potential for a time-dependent Kohn-Sham (TDKS) system in one spatial dimension. We start from a low-dimensional two-electron system for which we can numerically solve the time-dependent Schr¨odinger equation; this yields electron densities suitable for training models of the correlation potential. We frame the learning problem as one of optimizing a least-squares objective subject to the constraint that the dynamics obey the TDKS equation. Applying adjoints, we develop efficient methods to compute gradients and thereby learn models of the correlation potential. Our results show that it is possible to learn values of the correlation potential such that the resulting electron densities match ground truth densities. We also show how to learn correlation potential functionals with memory, demonstrating one such model that yields reasonable results for trajectories outside the training set.

97 MATHEMATICS AND COMPUTING↗

Two-Tower Quantum Matrix Chain Multiplication: Trading Qubits for Depth

Matrix chain multiplication -- computing $\mathcal{W} = M^{(0)}\cdots M^{(K-1)}$ where $M^{(k)} \in \mathbb{R}^{P_k \times P_{k+1}}$-- arises in scientific computing, machine learning, and graph analysis. Despite the importance of this problem, for chains of distinct matrices, the classical number of operations grows linearly with the chain length $K$ and polynomially in the matrix dimensions. We present \emph{Two-Tower Matrix Multiplication}, a quantum subroutine that encodes the product $\mathcal{W}$ of the $K$ matrices into a quantum state in circuit depth $\mathcal{O}(\max_{k} \mathrm{polylog} (P_k P_{k+1}))$, which is independent of~$K$ within the QRAM-based state-preparation model, whereas the qubit count is $\mathcal{O}\bigl(\sum_{k} \log P_k \bigr)$; the total gate count remains linear in $K$, so the gain is in the circuit depth. The construction interleaves state-preparation operators across two layers; within each layer, all operators act on disjoint registers and execute in parallel. This subroutine can be specialized for the chain-vector case, which computes the product of $K-1$ matrices applied to a vector. We prove the correctness of the subroutine for all $K$ and provide two implementations using the Qiskit and QCLAB frameworks. The subroutine is applicable to any downstream quantum algorithm that operates on a matrix encoded in the statevector, including norm estimation, graph-matrix powers, linear system solving, and quantum machine learning kernels.

Antonioli, Giacomo [Pisa U.] (ORCID:00090000668703↗

CLPNets: Coupled Lie–Poisson neural networks for multi-part Hamiltonian systems with symmetries

To accurately compute data-based prediction of Hamiltonian systems, it is essential to utilize methods that preserve the structure of the equations over time. We consider a particularly challenging case of systems with interacting parts that do not reduce to pure momentum evolution. Such systems are essential in scientific computations, such as discretization of a continuum elastic rod, which can be viewed as the group of rotations and translations $SE(3)$. The evolution involves not only the momenta but also the relative positions and orientations of the particles. The presence of Lie group-valued elements, such as relative positions and orientations, poses a problem for applying previously derived methods for data-based computing. We develop a novel method of data-based computation and complete phase space learning of such systems. We follow the original framework of SympNets (Jin et al., 2020) and LPNets (Eldred et al., 2024), building the neural network from phase space mappings that preserve the Lie–Poisson structure. We derive a novel system of mappings that are built into neural networks describing the evolution of such systems. We call such networks Coupled Lie–Poisson Neural Networks, or CLPNets. We consider increasingly complex examples for the applications of CLPNets, starting with the rotation of two rigid bodies about a common axis, progressing to the free rotation of two rigid bodies, and finally to the evolution of two connected and interacting $SE(3)$ components, describing the discretization of an elastic rod into two elements. Our method preserves all Casimir invariants to machine precision, preserves energy to high accuracy, and shows good resistance to the curse of dimensionality, requiring only a few thousand data points for all cases studied (three to eighteen dimensions). Additionally, the method is highly economical in memory requirements, requiring only about 200 parameters for the most complex case considered.

Data-based modeling↗

An Advanced Actuator Line Method for Wind Energy Applications and Beyond: Preprint

The actuator line method to represent rotor aerodynamics within computational fluid dynamics has been in use for over a decade. This method applies a body force to the flow field along rotating lines corresponding to the individual rotor blades and employs tabular airfoil data to compute the force distribution. The actuator line method is attractive because compared to blade-resolved simulations, the required mesh is much simpler and the computational cost is lower. This work proposes a higher fidelity variant of the actuator line method meant to fill the space between current actuator line and blade-resolved simulations. It contains modifications in two key areas. The first is that of freestream velocity vector estimation along the line, which is necessary to compute the lift and drag along the line using tabular airfoil data. Most current methods rely on point sampling in which the location of sampling is ambiguous. Here we test a velocity sampling method that uses a properly weighted integral over space, removing this ambiguity. The second area of improvement is the function used to project the one-dimensional actuator line force onto the three-dimensional fluid mesh as a body force. We propose and test a projection function that spreads the force over a region that looks something like a real blade with the hope that it will produce the blade local and near wake flow features with more accuracy and higher fidelity. Our goal is that between these two improvements, not only will the flow field predictions be enhanced, but also the spanwise loading will be made more accurate. We refer to this combination of improvements as the advanced actuator line method. We apply these improvements to two different wind turbine cases. Although there is a strong wind energy motivation in our work, there is no reason these advanced actuator line ideas cannot be used in other applications, such as helicopter rotors.

17 WIND ENERGY↗

A numerical homogenization method for heterogeneous, anisotropic elastic media based on multiscale theory

The development of reliable methods for upscaling fine scale models of elastic media has long been an important topic for rock physics and applied seismology. Several effective medium theories have been developed to provide elastic parameters for materials such as finely layered media or randomly oriented or aligned fractures. In such cases, the analytic solutions for upscaled properties can be used for accurate prediction of wave propagation. However, such theories cannot be applied directly to homogenize elastic media with more complex, arbitrary spatial heterogeneity. We therefore propose a numerical homogenization algorithm based on multiscale finite element methods for simulating elastic wave propagation in heterogeneous, anisotropic elastic media. Specifically, our method used multiscale basis functions obtained from a local linear elasticity problem with appropriately defined boundary conditions. Homogenized, effective medium parameters were then computed using these basis functions, and the approach applied a numerical discretization that is similar to the rotated staggered-grid finite difference scheme. Comparisons of the results from our method and from conventional, analytical approaches for finely layered media showed that the homogenization reliably estimated elastic parameters for this simple geometry. Additional tests examined anisotropic models with arbitrary spatial heterogeneity where the average size of the heterogeneities ranged from several centimeters to several meters, and the ratio between the dominant wavelength and the average size of the arbitrary heterogeneities ranged from 10 to 100. Comparisons to finite-difference simulations proved that the numerical homogenization was equally accurate for these complex cases.

58 GEOSCIENCES↗

Monte Carlo-based treatment planning system calculation engine for microbeam radiation therapy

Purpose: Microbeam radiation therapy (MRT) is a synchrotron radiotherapy technique that explores the limits of the dose-volume effect. Preclinical studies have shown that MRT irradiations (arrays of 25-75-{mu}m-wide microbeams spaced by 200-400 {mu}m) are able to eradicate highly aggressive animal tumor models while healthy tissue is preserved. These promising results have provided the basis for the forthcoming clinical trials at the ID17 Biomedical Beamline of the European Synchrotron Radiation Facility (ESRF). The first step includes irradiation of pets (cats and dogs) as a milestone before treatment of human patients. Within this context, accurate dose calculations are required. The distinct features of both beam generation and irradiation geometry in MRT with respect to conventional techniques require the development of a specific MRT treatment planning system (TPS). In particular, a Monte Carlo (MC)-based calculation engine for the MRT TPS has been developed in this work. Experimental verification in heterogeneous phantoms and optimization of the computation time have also been performed. Methods: The penelope/penEasy MC code was used to compute dose distributions from a realistic beam source model. Experimental verification was carried out by means of radiochromic films placed within heterogeneous slab-phantoms. Once validation was completed, dose computations in a virtual model of a patient, reconstructed from computed tomography (CT) images, were performed. To this end, decoupling of the CT image voxel grid (a few cubic millimeter volume) to the dose bin grid, which has micrometer dimensions in the transversal direction of the microbeams, was performed. Optimization of the simulation parameters, the use of variance-reduction (VR) techniques, and other methods, such as the parallelization of the simulations, were applied in order to speed up the dose computation. Results: Good agreement between MC simulations and experimental results was achieved, even at the interfaces between two different media. Optimization of the simulation parameters and the use of VR techniques saved a significant amount of computation time. Finally, parallelization of the simulations improved even further the calculation time, which reached 1 day for a typical irradiation case envisaged in the forthcoming clinical trials in MRT. An example of MRT treatment in a dog's head is presented, showing the performance of the calculation engine. Conclusions: The development of the first MC-based calculation engine for the future TPS devoted to MRT has been accomplished. This will constitute an essential tool for the future clinical trials on pets at the ESRF. The MC engine is able to calculate dose distributions in micrometer-sized bins in complex voxelized CT structures in a reasonable amount of time. Minimization of the computation time by using several approaches has led to timings that are adequate for pet radiotherapy at synchrotron facilities. The next step will consist in its integration into a user-friendly graphical front-end.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Exact signed distance fields using parallel Fast Sweeping Method

Signed distance fields are often used in multiphysics simulations to track material interfaces. We present a simple methodology based on the fast sweeping method to generate the exact signed distance from triangular meshes and linear paths on Cartesian grids. The methodology propagates the closest primitive to the boundary to the rest of the domain following the characteristics. A local upwind criterion is used to decide between the new and existing closest primitive at each grid point while capturing the correct sign of the global function. The methodology has optimal computational complexity and runs efficiently in distributed-memory architectures. We include 2D and 3D test cases along with a resolution study up to 0.512 trillion zones and 1,000 computer cores. The solution strategy can also be applied to other types of meshes or collections of primitives.

97 MATHEMATICS AND COMPUTING↗