Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematics of 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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Predicting Critical Transitions in Multiscale Data

Predicting the dynamics of complex nonlinear systems remains a challenging problem both in dynamical systems theory as well as real world science and engineering applications. Data-driven methods utilizing the latest advances in machine learning (ML) provide a promising new paradigm for this task. Our work centered on Reservoir Computing (RC), which has shown itself to be capable of skillfully predicting chaotic dynamics in multiscale systems. In the first part of the work, the focus is on how to improve predictions of critical transitions in a class of slow-fast metastable systems in which the equations are known. An additional goal was to determine whether a relationship exists between RC and Koopman operator theory, to improve the efficiency and broaden the applicability of the approach. In the second part of this work, a variation on the RC model known as Reconstructive Reservoir Computing (RRC) is applied to real-world data to identify anomalies.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Stable low diffusion flux splitting schemes on unstructured meshes

Shock instabilities are shown to manifest in modern low-diffusion flux-vector splitting (FVS) schemes when used on unstructured meshes, or situations where shocks do not align with the mesh lines. These instabilities occur irrespective of the Mach number of the shock. Three types of dissipative mechanisms that suppress these instabilities are presented. These mechanisms are carefully designed in order to affect only problematic regions of the flux-splittings. The AUSM + and LDFSS schemes are stabilized using the proposed modifications. It is shown that the added dissipation improves the shock behavior of AUSM and LDFSS on unstructured meshes. It is also shown that the AUSM + -up scheme is prone to the “carbuncle” instability, a specific type of shock instability, when used on unstructured meshes. The modifications proposed in this work do not lead to carbuncle instabilities for the problems considered here. Furthermore, the modified schemes are shown to satisfy certain properties that are crucial for accurate shear layer computations, such as stationary contact preservation. Using benchmark problems, it is demonstrated that despite the diffusion added for stabilization, these schemes are not overly diffusive. Furthermore, due to these advantages, the modified FVS schemes presented here are promising candidates for high-speed compressible flow computations on unstructured meshes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

IMPACT 2025-2026 Internship Poster

At Sandia National Laboratories, I developed a C++ program that converts printed circuit boards(PCB) and integrated circuits(IC) design files to be compatible for computed tomography (CT) simulations through Monte Carlo methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Defining quantum-ready primitives for hybrid HPC-QC supercomputing: a case study in Hamiltonian simulation

As computational demands in scientific applications continue to rise, hybrid high-performance computing (HPC) systems integrating classical and quantum computers (HPC-QC) are emerging as a promising approach to tackling complex computational challenges. One critical area of application is Hamiltonian simulation, a fundamental task in quantum physics and other large-scale scientific domains. This paper investigates strategies for quantum-classical integration to enhance Hamiltonian simulation within hybrid supercomputing environments. By analyzing computational primitives in HPC allocations dedicated to these tasks, we identify key components in Hamiltonian simulation workflows that stand to benefit from quantum acceleration. To this end, we systematically break down the Hamiltonian simulation process into discrete computational phases, highlighting specific primitives that could be effectively offloaded to quantum processors for improved efficiency. Our empirical findings provide insights into system integration, potential offloading techniques, and the challenges of achieving seamless quantum-classical interoperability. We assess the feasibility of quantum-ready primitives within HPC workflows and discuss key barriers such as synchronization, data transfer latency, and algorithmic adaptability. These results contribute to the ongoing development of optimized hybrid solutions, advancing the role of quantum-enhanced computing in scientific research.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Exact closed-form unitary transformations of fermionic operators

Unitary transformations play a fundamental role in many-body physics, and except for special cases, they are not expressible in closed form. We present closed-form expressions for unitary transformations generated by a single fermionic operator for Hermitian and anti-Hermitian generators. We demonstrate the usefulness of these expressions in formal analyses of unitary transformations and numerical applications to Hamiltonian downfolding in quantum computing and Heisenberg dynamics. Furthermore, this work paves the way for new analytical treatments of unitary transformations and numerical many-body methods for fermions.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2024

A splice method for local-to–nonlocal coupling of weak forms

Here, we propose a method to couple local and nonlocal diffusion models. By inheriting desirable properties such as patch tests, asymptotic compatibility and unintrusiveness from related splice and optimization-based coupling schemes, it enables the use of weak (or variational) formulations, is computationally efficient and straightforward to implement. We prove well-posedness of the coupling scheme and demonstrate its properties and effectiveness in a variety of numerical examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

DIRAC current, upcoming and planned capabilities and technologies

DIRAC is the interware for building and operating large scale distributed computing systems. It is adopted by multiple collaborations from various scientific domains for implementing their computing models. DIRAC provides a framework and a rich set of ready-to-use services for Workload, Data and Production Management tasks of small, medium and large scientific communities having different computing requirements. The base functionality can be easily extended by custom components supporting community specific workflows. DIRAC is at the same time an aging project, and a new DiracX project is taking shape for replacing DIRAC in the long term. This contribution will highlight DIRAC’s current, upcoming and planned capabilities and technologies, and how the transition to DiracX will take place. Examples include, but are not limited to, adoption of security tokens and interactions with Identity Provider services, integration of Clouds and High Performance Computers, interface with Rucio, improved monitoring and deployment procedures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Fixed Source Sensitivity Calculations for Inertial Confinement Fusion Applications

A numerical code library was developed for the radiation transport code MCNP6.3 to calculate generalized response sensitivity coefficients for fixed source neutron transport problems with applications to inertial confinement fusion (ICF) experiments. The new MCNP6.3 dependency is used to generate a novel time convolution response that represents a neutron time-of-flight (nToF) signal. The traditional suite of macroscopic cross-section sensitivities and constrained fixed source probability distribution sensitivities are available for both the standard and the new response tallies in this library. However, novel sensitivity coefficients for the constrained hyperparameters of analytic fixed source probability distributions are emphasized in this work for their connection to ICF neutron transport models. Particularly, advanced Monte Carlo methods are developed for calculating the sensitivity of a nToF signal to perturbations in an ICF plasma’s ion temperature and burn history as well as perturbations in the target liner mass density and the shape parameters of the nToF detector’s impulse response function. Together, these capabilities form an advanced suite of computational tools that can be used to analyze and extract information from any ICF experimental platform.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

HPC and Cloud Convergence Beyond Technical Boundaries: Strategies for Economic Sustainability, Standardization, and Data Accessibility

At the IEEE/ACM International Conference for High-Performance Computing, Networking, Storage, and Analysis (SC23), held in Denver, experts discussed the convergence of high-performance computing and cloud computing. Experts explored how this integration could address current scientific computing limitations, enhance computational capabilities, and foster global collaboration while focusing on economic, security, technical, and community challenges and opportunities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Medial axis and local thickness computation using the Fast Sweeping Method

This report describes an efficient and robust voxel-based methodology for computing the medial axis, local thickness, and distance-to-skeleton of arbitrary three-dimensional geometries. It is assumed that the object can be represented by an exact or approximate signed distance function on a discrete grid. The gradient of such function is used to formulate a hyperbolic partial differential equation (PDE) that models the collapse of the position vector in space. By exploiting the causality property of the PDE, the Fast Sweeping Method is able to obtain the solution in a finite number of sweeps independent of the mesh resolution. The intersection of characteristic lines leads to the formation of shocks and a discrete bisector function is used to identify the medial axis. The same PDE approach is used to compute the local thickness inside the object and obtain the distance-to-skeleton field. Multiple examples are given in two and three dimensions along with a resolution study. The methodology has optimal complexity and yields subsecond computational times for geometries with over a million zones on a single core. The methodology is also capable of parallelization across shared and distributed memory architectures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Efficient Scalable Contact Network Generation from Population Data

Modeling the contacts among a population is critical to understanding the dynamics of a disease outbreak. Contact networks, where nodes are individuals and edges are contacts among them, are used to represent these complex individual-level interactions. In this work, we are given the daily activity schedules of an urban population that represent the activity location and time of individuals in a population during a single twenty four hour period over multiple days. Using collocation to determine contact between individuals, our goal is to extract hourly contact networks from large-scale activity data. We improve upon the existing adjacency matrix-based method by implementing our custom sparse matrix multiplication algorithm. Starting with a Python implementation, we achieve a 1600x speed up in the computation with a fast custom designed sparse matrix multiplier algorithm implemented in the C++ language. This work is central to future parallel designs of the problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

HPC Center of the Future: R&D Acquisition Intent

This document contains intended technical requirements for an anticipated future procurement for Lawrence Livermore National Laboratory (LLNL), hereafter referred to as “LLNL” or “the Laboratory”, which seeks to fund a few new and innovative proposals for developing concepts and performing studies that would lead to products available in the 2029-2030 timeframe. Our interest is to incentivize explorations and evaluations of technical capabilities in support of our vision for a High Performance Computing (HPC) center of the future at Livermore Computing (LC), the HPC center at LLNL. To realize this vision a new approach to our approach to acquisition is being considered by LC. The approach is designed to decrease risks for the vendors, while encouraging a broader set of vendors able and we hope willing to partner with LLNL and LC. The future HPC Center vision and acquisition approach was conceived to meet the future mission needs of the Advanced Simulation and Computing (ASC) Program within the National Nuclear Security Administration (NNSA).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Hypercomplex Automatic Differentiation in the Eulerian Hydrocode PAGOSA

Enabling the computation of partial derivatives or sensitivities in production hydrocodes is beneficial for design, optimization, sensitivity analysis, and uncertainty quantification. Traditional finite difference approximations of these sensitivities are inefficient since convergence studies of the step size is required for each parameter of interest. For these reasons, HYPercomplex Automatic Differentiation (HYPAD) was implemented in the Eulerian hydrocode PAGOSA. HYPAD is analogous to forward-mode automatic differentiation except hypercomplex numbers (numbers with multiple imaginary parts) are used instead of dual numbers. Accurate partial derivatives can be computed of all state variables with respect to multiple input variables in a single run. The method was implemented using operator overloading to handle hypercomplex algebra. HYPAD was demonstrated and verified on Sod’s shock tube problem to compute derivatives of the state variables with respect to a material parameter, initial conditions, and geometry.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Yet Another NLA Library: T-LAPACK

In recent years, Randomized numerical linear algebra (RandNLA) proved to be more than a theoretical novelty: projects like RandLAPACK demonstrate its practical value across architectures, and projects like RandBLAS build trust in randomization as a tool for high-performance NLA. This BoF considers two main questions. First, what are the pressing issues in software standards and implementation that need to be resolved for RandNLA to become a core component of HPC? Second, how can we mobilize a community effort to make progress on these issues? The BoF will engage the audience to discuss the idea of growing the role of RandNLA in high-performance computing and what it would take to scale from niche prototypes to robust, production-quality software libraries.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Physics-Reinforced Machine Learning Algorithms for Multiscale Closure Model Discovery

The central objective of this project was to address the challenge of modeling and simulating complex multiscale turbulence phenomena by leveraging physics-guided machine learning (PGML) and hybrid modeling approaches. By integrating physics-based methods with data-driven models, the research focused on achieving robust and scalable solutions for geophysical turbulence, enhancing numerical weather prediction and climate research tools. The project resulted in significant advancements in computational modeling paradigms, predictive tools for reduced-order modeling, and innovative algorithms for fluid dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗