Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational topology”

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 541 records · Page 30

Uncertainty Visualization of Critical Points of 2D Scalar Fields for Parametric and Nonparametric Probabilistic Models

This paper presents a novel end-to-end framework for closed-form computation and visualization of critical point uncertainty in 2D uncertain scalar fields. Critical points are fundamental topological descriptors used in the visualization and analysis of scalar fields. The uncertainty inherent in data (e.g., observational and experimental data, approximations in simulations, and compression), however, creates uncertainty regarding critical point positions. Uncertainty in critical point positions, therefore, cannot be ignored, given their impact on downstream data analysis tasks. Here, in this work, we study uncertainty in critical points as a function of uncertainty in data modeled with probability distributions. Although Monte Carlo (MC) sampling techniques have been used in prior studies to quantify critical point uncertainty, they are often expensive and are infrequently used in production-quality visualization software. We, therefore, propose a new end-to-end framework to address these challenges that comprises a threefold contribution. First, we derive the critical point uncertainty in closed form, which is more accurate and efficient than the conventional MC sampling methods. Specifically, we provide the closed-form and semianalytical (a mix of closed-form and MC methods) solutions for parametric (e.g., uniform, Epanechnikov) and nonparametric models (e.g., histograms) with finite support. Second, we accelerate critical point probability computations using a parallel implementation with the VTK-m library, which is platform portable. Finally, we demonstrate the integration of our implementation with the ParaView software system to demonstrate near-real-time results for real datasets.

97 MATHEMATICS AND COMPUTING↗

Digital quantum magnetism on a trapped-ion quantum computer

Digital quantum matter—realized when discrete quantum gates approximate continuous time evolution—is susceptible to heating into chaotic, structureless states. If digitization errors are adequately suppressed, a long-lived transient regime of approximately energy-conserving dynamics can be observed on gate-based quantum computers. Conservation of energy, in turn, enables the exploration of a wide variety of complex behaviours observed in equilibrium systems, ranging from the non-trivial microscopic origins of thermalization itself to the stabilization of effective models hosting exotic emergent properties. Here we use Quantinuum’s H2 quantum computer to simulate digitized dynamics of the quantum Ising model, suppressing digitization errors well enough to observe thermalization on timescales that severely challenge classical simulation methods. Relaxation of an inhomogeneous state reveals an emergent hydrodynamics owing to approximate energy conservation and we compute the associated diffusion constant. By reprogramming our simulations to take place on a triangular lattice with periodic boundary conditions, we observe thermalization consistent with emergent gauge and topological constraints resulting from lattice frustration. Furthermore, our results were enabled by continued advances in two-qubit gate quality (native partial entangler fidelities of 99.94(1)%) and establish digital quantum computers as powerful tools for studying (effectively) continuous-time dynamics.

Information theory and computation↗

Scheduling Operations for Massive Heterogeneous Clusters

High-performance computing (HPC) programming has become increasingly difficult with the advent of hybrid supercomputers consisting of multicore CPUs and accelerator boards such as the GPU. Manual tuning of software to achieve high performance on this type of machine has been performed by programmers. This is needlessly difficult and prone to being invalidated by new hardware, new software, or changes in the underlying code. A system was developed for task-based representation of programs, which when coupled with a scheduler and runtime system, allows for many benefits, including higher performance and utilization of computational resources, easier programming and porting, and adaptations of code during runtime. The system consists of a method of representing computer algorithms as a series of data-dependent tasks. The series forms a graph, which can be scheduled for execution on many nodes of a supercomputer efficiently by a computer algorithm. The schedule is executed by a dispatch component, which is tailored to understand all of the hardware types that may be available within the system. The scheduler is informed by a cluster mapping tool, which generates a topology of available resources and their strengths and communication costs. Software is decoupled from its hardware, which aids in porting to future architectures. A computer algorithm schedules all operations, which for systems of high complexity (i.e., most NASA codes), cannot be performed optimally by a human. The system aids in reducing repetitive code, such as communication code, and aids in the reduction of redundant code across projects. It adds new features to code automatically, such as recovering from a lost node or the ability to modify the code while running. In this project, the innovators at the time of this reporting intend to develop two distinct technologies that build upon each other and both of which serve as building blocks for more efficient HPC usage. First is the scheduling and dynamic execution framework, and the second is scalable linear algebra libraries that are built directly on the former.

Humphrey, John↗

Aero-thermal numerical characterization of blunt fin-induced shock wave–boundary layer interaction and its control through leading-edge cooling injection

This study represents a novel evaluation of active flow control to alleviate the aerothermal penalties created by the blunt fin-induced shock wave–boundary layer interaction. The manuscript analyzes the effect of flow injection on a blunt fin-induced shock wave–boundary layer interaction via computational fluid dynamics simulations with various degrees of resolution. The impact on the mean flow topology and wall variables was investigated utilizing Reynolds-averaged Navier–Stokes simulations. Detached-eddy simulations revealed the low-frequency shock motion, shock wave–boundary layer, and horseshoe vortex interaction. The test article was exposed to two different incoming boundary layer thicknesses; the thicker boundary layer led to the appearance of larger turbulent scales. The Detached-eddy simulations revealed the time history of the shock wave–boundary layer interaction, focusing on the inception and development of the recirculated flow regions. Ultimately, spectral proper orthogonal decomposition was employed to identify the structures associated with the low-frequency shock motion caused by the shock wave–boundary layer interaction.

Lozano, Francisco (ORCID:0000000277871125)↗

Framework for simulating gauge theories with dipolar spin systems

Gauge theories appear broadly in physics, ranging from the standard model of particle physics to long-wavelength descriptions of topological systems in condensed matter. However, systems with sign problems are largely inaccessible to classical computations and also beyond the current limitations of digital quantum hardware. In this work, we develop an analog approach to simulating gauge theories with an experimental setup that employs dipolar spins (molecules or Rydberg atoms). We consider molecules fixed in space and interacting through dipole-dipole interactions, avoiding the need for itinerant degrees of freedom. Each molecule represents either a site or gauge degree of freedom, and Gauss's law is preserved by a direct and programmatic tuning of positions and internal state energies. This approach can be regarded as a form of analog systems programming and charts a path forward for near-term quantum simulation. As a first step, we numerically validate this scheme in a small-system study of U(1) quantum link models in (1+1) dimensions with link spin S = 1/2 and S =1 and illustrate how dynamical phenomena such as string inversion and string breaking could be observed in near-term experiments. Our work brings together methods from atomic and molecular physics, condensed matter physics, high-energy physics, and quantum information science for the study of nonperturbative processes in gauge theories.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MAPA: Multi-Accelerator Pattern Allocation Policy for Multi-Tenant GPU Servers

Multi-accelerator servers are increasingly being deployed in shared multi-tenant environments (such as in cloud data centers) in order to meet the demands of large-scale compute-intensive workloads. In addition, these accelerators are increasingly being inter-connected in complex topologies and workloads are exhibiting a wider variety of inter-accelerator communication patterns. However, existing al-location policies are ill-suited for these emerging use-cases. Specifically, this work identifies that multi-accelerator workloads are commonly fragmented leading to reduced bandwidth and increased latency for inter-accelerator communication. We propose Multi-Accelerator Pattern Allocation (MAPA), a graph pattern mining approach towards providing generalized allocation support for allocating multi-accelerator workloads on multi-accelerator servers. We demonstrate that MAPA is able to improve the execution time of multi-accelerator workloads and that MAPA is able to provide generalized benefits across various accelerator topologies. Finally, we demonstrate a speedup of 12.4% for75th percentile of jobs with the worst case execution time reduced by up to 35% against baseline policy using MAPA.

Ranganath, Kiran↗

Machine learning models for PDE constrained optimization

Partial differential equation (PDE)-constrained optimization problems arise in a variety of scientific and engineering applications, such as topology optimization, electrodynamics, fluid dynamics, and structural dynamics. However, these problems are often challenging and computationally expensive to solve, due to the need to solve the PDEs within the optimization loop. One approach to reducing the computational cost of these methods while providing convergence guarantees is through inexact trust region methods; this method uses lower fidelity solutions of the PDE at early stages of the optimization and adjusts the required accuracy of inexact PDE solvers as the optimization progresses. In this work, we explore the use of machine learning based surrogate models with these inexact trust region methods. We first demonstrate the potential of this approach by using Gaussian processes as the surrogate model and test this on a simple PDE-constrained optimization problem. We then document explorations into improving the computational costs of evolutional deep neural network / neural Galerkin methods, with the eventual goal of using these methods with the inexact trust region algorithms. We are able to speed up these approaches, albeit at the cost of lower accuracy.

97 MATHEMATICS AND COMPUTING↗

Three-dimensional, time-dependent MHD simulations of interplanetary plasmoids

The paper presents a three-dimensional time-dependent simulation of a solar-ejected diamagnetic plasmoid that retains its closed topology to and beyond earth. It is assumed in this case that, before entering the computational domain, the plasmoid already exists at or near the sun. A simulation is also presented for a plasmoid that is formed in the corona near the sun or in the interplanetary medium as a consequence of the reconnection of opposite-directed IMF lines. The plasma and magnetic properties of the expanding plasmoid as it moves toward an observer at 1 AU are described.

Dryer, M.↗

On the Use of CAD and Cartesian Methods for Aerodynamic Optimization

The objective for this paper is to present the development of an optimization capability for Curt3D, a Cartesian inviscid-flow analysis package. We present the construction of a new optimization framework and we focus on the following issues: 1) Component-based geometry parameterization approach using parametric-CAD models and CAPRI. A novel geometry server is introduced that addresses the issue of parallel efficiency while only sparingly consuming CAD resources; 2) The use of genetic and gradient-based algorithms for three-dimensional aerodynamic design problems. The influence of noise on the optimization methods is studied. Our goal is to create a responsive and automated framework that efficiently identifies design modifications that result in substantial performance improvements. In addition, we examine the architectural issues associated with the deployment of a CAD-based approach in a heterogeneous parallel computing environment that contains both CAD workstations and dedicated compute engines. We demonstrate the effectiveness of the framework for a design problem that features topology changes and complex geometry.

Nemec, M.↗

Relative efficiency and accuracy of two Navier-Stokes codes for simulating attached transonic flow over wings

In the present study, two codes which solve the three-dimensional Thin-Layer Navier-Stokes (TLNS) equations are used to compute the steady-state flow for two test cases representing typical finite wings at transonic conditions. Several grids of C-O topology and varying point densities are used. After a description of each code and test case, standards for determining code efficiency and accuracy are defined and applied to determine the relative performance of the two codes in predicting turbulent transonic wing flows. Comparisons of computed surface pressure distributions with experimental data are made.

Bonhaus, Daryl L.↗

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↗

Scale setting of SU⁡(𝑁) Yang–Mills theory, topology and large-𝑁 volume independence

We set the scale of SU⁡(𝑁) Yang-Mills theories for 𝑁 =3, 5, 8 and in the large-𝑁 limit via gradient flow, as a first step towards the computation of the large-𝑁 Λ-parameter using step scaling. We adopt twisted boundary conditions to achieve large-𝑁 volume reduction and the Parallel Tempering on Boundary Conditions algorithm to tame topological freezing. This setup allows accurate determinations of the gradient-flow scales down to lattice spacings as fine as ∼0.025 fm for all the explored values of 𝑁, a regime that has never been reached with ergodic algorithms. Moreover, we are able to precisely estimate the finite-size systematics related to topological freezing, and to show the suppression of finite-volume effects expected by virtue of large-𝑁 twisted volume reduction.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Alchemy: A Model-Based Approach for 2D to 3D Autonomous Nuclear System Design

Engineering design of nuclear power plant (NPP) piping and equipment systems frequently bypasses crucial 2D system planning, instead moving straight to 3D modeling. This often leads to designs that exceed building envelope constraints, forcing expensive and time-consuming redesigns. When 2D modeling is employed, it typically involves labor-intensive manual workflows that convert 2D drawings into 3D models, resulting in inefficiencies and errors across design iterations. These workflows further suffer from poor software interoperability and dependence on proprietary software ecosystems, thereby contributing to schedule delays and cost overruns. This paper presents Alchemy, an autonomous framework that transforms 2D system definitions into Industry Foundation Classes (IFC)-compliant 3D building information models (BIMs) for expediting nuclear facility design at the conceptual preliminary phase. Using a model-based approach, the framework treats the 2D system diagram as the central reference model employed to automatically generate all subsequent outputs, ensuring consistency between the system definition and the resulting physical design. A web-based interface enables engineers to define hierarchical system topologies including associated equipment, geometric properties, and connectivity requirements. A two-phase equipment layout optimization algorithm automatically computes collision-free spatial configurations within predefined building envelopes. An artificial intelligence (AI)-assisted pipe routing module then generates orthogonal, collision-free routing paths, allowing the user to select either an A* search-based method or an Ant Colony Optimization (ACO)-based method. All outputs are authored natively in IFC format, relying on open-source technologies and standardized formats in order to ensure extensibility and eliminate proprietary software dependencies. The proposed framework is validated on two representative pressurized-water reactor (PWR)-based case studies, for which it autonomously generates IFC-compliant 3D models in minutes, drastically reducing workflows that typically require hours of manual effort. The generated model demonstrates topologically correct equipment placement, physically plausible spatial relationships, and collision-free pipe routing consistent with known PWR loop configurations. This work represents a foundational step toward digital engineering for nuclear facility preliminary design, with future ongoing development targeting design code compliance and expanded system complexity.

97 - MATHEMATICS AND COMPUTING↗

Non-symmetric pinning of topological defects in living liquid crystals

Topological defects, such as vortices and disclinations, play a crucial role in spatiotemporal organization of equilibrium and non-equilibrium systems. The defect immobilization or pinning is a formidable challenge in the context of the out-of-equilibrium system, like a living liquid crystal, a suspension of swimming bacteria in lyotropic liquid crystal. Here we control the emerged topological defects in a living liquid crystal by arrays of 3D-printed microscopic obstacles (pillars). Our studies show that while –1/2 defects may be easily immobilized by the pillars, +1/2 defects remain motile. Due to attraction between oppositely charged defects, positive defects remain in the vicinity of pinned negative defects, and the diffusivity of positive defects is significantly reduced. Experimental findings are rationalized by computational modeling of living liquid crystals. Our results provide insight into the engineering of active systems via targeted immobilization of topological defects.

42 ENGINEERING↗

Relative efficiency and accuracy of two Navier-Stokes codes for simulating attached transonic flow over wings

Two codes which solve the 3-D Thin Layer Navier-Stokes (TLNS) equations are used to compute the steady state flow for two test cases representing typical finite wings at transonic conditions. Several grids of C-O topology and varying point densities are used to determine the effects of grid refinement. After a description of each code and test case, standards for determining code efficiency and accuracy are defined and applied to determine the relative performance of the two codes in predicting turbulent transonic wing flows. Comparisons of computed surface pressure distributions with experimental data are made.

Bonhaus, Daryl L.↗

Optimal Communication Topology Determination and Sensor Selection for Independent Airspace Surveillance

The paper presents an approach to sensors selection and network topology determination for independent airspace surveillance with maximum outcome and minimum cost using ground based distributed sensing, computing and communication network infrastructure. The selection criteria includes minimum estimation error, maximum airspace coverage, minimum communication time and power consumption while guaranteeing the system observability and providing in-time quality information to a monitoring observer. The developed algorithm uses multi-objective optimization strategy taking into account trade-offs between conflicting objectives and relaxations for in time implementation. It is implemented utilizing graph theoretic tools. The approach is validated in a desktop simulation environment using synthetic sensors data generated for a simulated multi-vehicle flight scenario in the selected regional airspace.

Distributed sensing↗

Computational study of runaway electrons in MST tokamak discharges with applied resonant magnetic perturbation

A numerical study of magnetohydrodynamics (MHD) and tracer-particle evolution investigates the effects of resonant magnetic perturbations (RMPs) on the confinement of runaway electrons (REs) in tokamak discharges conducted in the Madison Symmetric Torus. In computational results of applying RMPs having a broad toroidal spectrum but a single poloidal harmonic, m = 1 RMP does not suppress REs, whereas m = 3 RMP achieves significant deconfinement but not the complete suppression obtained in the experiment. MHD simulations with the NIMROD code produce sawtooth oscillations, and the associated magnetic reconnection can affect the trajectory of REs starting in the core region. Simulations with m = 3 RMP produce chaotic magnetic topology over the outer region, but the m = 1 RMP produces negligible changes in field topology, relative to applying no RMP. Using snapshots of the MHD simulation fields, full-orbit relativistic electron test particle computations with KORC show ≈50% loss from the m = 3 RMP compared to the 10%–15% loss from the m = 1 RMP. Here, test particle computations of the m = 3 RMP in the time-evolving MHD simulation fields show correlation between MHD activity and late-time particle losses, but total electron confinement is similar to computations using magnetic-field snapshots.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗