Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mathematics 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,117 records · Page 62
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Solving Unit Commitment Problems with Demand Responsive Loads: Preprint

This paper focuses on using variations of the Frank-Wolfe algorithm for solving unit commitment problems with high volumes of demand responsive loads on the power grid. We present a formulation of the unit commitment problem with demand responsive loads. We then show through reformulation and relaxations of the problem that variations of the Frank-Wolfe algorithm can be used to determine the time series decisions for the demand responsive loads. We show through computational experiments on the RTS-GMLC test system that the time series of demand responsive load decisions obtained through our approach are near optimal and provide details regarding how large scale parallel implementations of our approach can be highly computationally efficient.

demand response↗
DOE OSTI2022

Memory access response merging in a memory hierarchy

A system and method for efficiently processing memory requests are described. A computing system includes multiple compute units, multiple caches of a memory hierarchy and a communication fabric. A compute unit generates a memory access request that misses in a higher level cache, which sends a miss request to a lower level shared cache. During servicing of the miss request, the lower level cache merges identification information of multiple memory access requests targeting a same cache line from multiple compute units into a merged memory access response. The lower level shared cache continues to insert information into the merged memory access response until the lower level shared cache is ready to issue the merged memory access response. An intermediate router in the communication fabric broadcasts the merged memory access response into multiple memory access responses to send to corresponding compute units.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Efficient Interdependent Systems Recovery Modeling with DeepONets

Modeling the recovery of interdependent critical infrastructure is a key component of quantifying and optimizing societal resilience to disruptive events. However, simulating the recovery of large-scale interdependent systems under random disruptive events is computationally expensive. Therefore, we propose the application of Deep Operator Networks (DeepONets) in this paper to accelerate the recovery modeling of interdependent systems. DeepONets are ML architectures which identify mathematical operators from data. The form of governing equations DeepONets identify and the governing equation of interdependent systems recovery model are similar. Therefore, we hypothesize that DeepONets can efficiently model the interdependent systems recovery with little training data. We applied DeepONets to a simple case of four interdependent systems with sixteen states. DeepONets, overall, performed satisfactorily in predicting the recovery of these interdependent systems for out of training sample data when compared to reference results.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Fourier Analyses of High-Order Continuous and Discontinuous Galerkin Methods

In this paper, we present a Fourier analysis of wave propagation problems subject to a class of continuous and discontinuous discretizations using high-degree Lagrange polynomials. This allows us to obtain explicit analytical formulas for the dispersion relation and group velocity and, for the first time to our knowledge, characterize analytically the emergence of gaps in the dispersion relation at specific wavenumbers, when they exist, and compute their specific locations. Wave packets with energy at these wavenumbers will fail to propagate correctly, leading to significant numerical dispersion. We also show that the Fourier analysis generates mathematical artifacts, and we explain how to remove them through a branch selection procedure conducted by analysis of eigenvectors and associated reconstructed solutions. The higher frequency eigenmodes, named erratic in this study, are also investigated analytically and numerically.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A multiscale phase field fracture approach based on the non-affine microsphere model for rubber-like materials

Rubber-like materials have a broad scope of applications due to their unique properties like high stretchability and increased toughness. Hence, computational models for simulating their fracture behavior are paramount for designing them against failures. In this study, the phase field fracture approach is integrated with a multiscale polymer model for predicting the fracture behavior in elastomers. At the microscale, damaged polymer chains are modeled to be made up of a number of elastic chain segments pinned together. Using the phase field approach, the damage in the chains is represented using a continuous variable. Both the bond stretch internal energy and the entropic free energy of the chain are assumed to drive the damage, and the advantages of this assumption are expounded. A framework for utilizing the non-affine microsphere model for damaged systems is proposed here by considering the minimization of a hypothetical undamaged free energy, ultimately connecting the chain stretch to the macroscale deformation gradient. At the macroscale, a thermodynamically consistent formulation is derived in which the total dissipation is assumed to be mainly due to the rupture of molecular bonds. Using a monolithic scheme, the proposed model is numerically implemented and the resulting three-dimensional simulation predictions are compared with existing experimental data. The capability of the model to qualitatively predict the propagation of complex crack paths and quantitatively estimate the overall fracture behavior is verified. Additionally, the effect of the length scale parameter on the predicted fracture behavior is studied for an inhomogeneous system.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Efficient co-solution of time step size and independent state in simulations of fluid-driven fracture propagation with embedded meshes

Here we present an efficient time-continuation scheme for fluid-driven fracture propagation problems in the extended finite element method framework. The approach applies a monolithic solution strategy to a fully coupled and implicit approximation of hydro-mechanical systems in conjunction with simultaneous linear elastic propagation of multiple fractures. At the end of each time step, the process ensures that the weakest fracture tip is in an equilibrium propagation regime. Furthermore, the solution process provides an initialization procedure for the newly created fracture spaces and an a priori estimate of the stress intensity factor growth rate, improving simulation robustness, and efficiency. The solution process is validated using the Kristianovich-Geertsma-de Klerk analytical solution under the toughness- and viscosity-dominated regimes. It is also extended to and demonstrated on problems with multiple fractures undergoing simultaneous propagation with stress shadow interactions. Numerical examples demonstrate that the solution process can reduce the required computational cost by one order of magnitude compared to other existing methods.

42 ENGINEERING↗
DOE OSTI2020

Digital-analog quantum computation

Digital quantum computing paradigm offers highly desirable features such as universality, scalability, and quantum error correction. However, physical resource requirements to implement useful error-corrected quantum algorithms are prohibitive in the current era of NISQ devices. As an alternative path to performing universal quantum computation, within the NISQ era limitations, we propose to merge digital single-qubit operations with analog multiqubit entangling blocks in an approach we call digital-analog quantum computing (DAQC). Along these lines, although the techniques may be extended to any resource, we propose to use unitaries generated by the ubiquitous Ising Hamiltonian for the analog entangling block and we prove its universal character. Here, we construct explicit DAQC protocols for efficient simulations of arbitrary inhomogeneous Ising, two-body, and M-body spin Hamiltonian dynamics by means of single-qubit gates and a fixed homogeneous Ising Hamiltonian. Additionally, we compare a sequential approach where the interactions are switched on and off (stepwise DAQC) with an always-on multiqubit interaction interspersed by fast single-qubit pulses (banged DAQC). Finally, we perform numerical tests comparing purely digital schemes with DAQC protocols, showing a remarkably better performance of the latter. The proposed DAQC approach combines the robustness of analog quantum computing with the flexibility of digital methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Demonstration of Algorithmic Quantum Speedup

Despite the development of increasingly capable quantum computers, an experimental demonstration of a provable algorithmic quantum speedup employing today’s non-fault-tolerant devices has remained elusive. Here, in this study, we unequivocally demonstrate such a speedup within the oracular model, quantified in terms of the scaling with the problem size of the time-to-solution metric. We implement the single-shot Bernstein-Vazirani algorithm, which solves the problem of identifying a hidden bitstring that changes after every oracle query, using two different 27-qubit IBM Quantum superconducting processors. The speedup is observed on only one of the two processors when the quantum computation is protected by dynamical decoupling but not without it. The quantum speedup reported here does not rely on any additional assumptions or complexity-theoretic conjectures and solves a bona fide computational problem in the setting of a game with an oracle and a verifier.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Advanced Shuttle Strategies for Parallel QCCD Architectures

Trapped ions (TIs) are at the forefront of quantum computing implementation, offering unparalleled coherence, fidelity, and connectivity. However, the scalability of TI systems is hampered by the limited capacity of individual ion traps, necessitating intricate ion shuttling for advanced computational tasks. The quantum charge-coupled device (QCCD) framework has emerged as a promising solution, facilitating ion mobility for universal quantum computation. Current QCCD architectures predominantly feature a linear topology, which is increasingly recognized as inefficient for complex quantum operations. Anticipating the shift toward more efficacious designs, this article introduces an innovative quantum scheduling strategy optimized for parallel QCCD topologies. Our strategy proposes a probabilistic formula for ion movement, alongside ingenious methods for local layer generation and layer compression, yielding a significant reduction in ion shuttle times. Through simulations, we demonstrate that our strategy not only substantially outstrips the linear model but also exhibits better performance over other parallel strategies that employ greedy algorithms. This is achieved through our nuanced resolution of complexities, such as traffic blocks and trap capacity limitations. The consequent reduction in shuttle operations leads to lower energy consumption and an enhancement in the quantum computer's fidelity, ultimately accelerating program execution times.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

Multilevel Parareal Algorithm with Averaging for Oscillatory Problems

The present study is an extension of the work done by Peddle, Haut, and Wingate and Haut and Wingate, where a two-level Parareal method with mapping and averaging is examined. The method proposed in this paper is a multilevel Parareal method with arbitrarily many levels, which is not restricted to the two-level case. We give an asymptotic error estimate which reduces to the two-level estimate for the case when only two levels are considered. Introducing more than two levels has important consequences for the averaging procedure, as we choose separate averaging windows for each of the different levels, which is an additional new feature of the present study. The different averaging windows make the proposed method especially appropriate for nonlinear multiscale problems, because we can introduce a level for each intrinsic scale of the problem and adapt the averaging procedure such that we reproduce the behavior of the model on the particular scale resolved by the level. The method is applied to nonlinear differential equations. The nonlinearities can generate a range of frequencies in the problem. The computational cost of the new method is investigated and studied on several examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Accelerating Scientific Computing in the Post-Moore’s Era

Novel uses of graphical processing units for accelerated computation revolutionized the field of high-performance scientific computing by providing specialized workflows tailored to algorithmic requirements. As the era of Moore’s law draws to a close, many new non–von Neumann processors are emerging as potential computational accelerators, including those based on the principles of neuromorphic computing, tensor algebra, and quantum information. While development of these new processors is continuing to mature, the potential impact on accelerated computing is anticipated to be profound. We discuss how different processing models can advance computing in key scientific paradigms: machine learning and constraint satisfaction. Significantly, each of these new processor types utilizes a fundamentally different model of computation, and this raises questions about how to best use such processors in the design and implementation of applications. While many processors are being developed with a specific domain target, the ubiquity of spin-glass models and neural networks provides an avenue for multi-functional applications. Furthermore, this also hints at the infrastructure needed to integrate next-generation processing units into future high-performance computing systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A QUBO formulation for top-τ eigencentrality nodes

The efficient calculation of the centrality or “hierarchy” of nodes in a network has gained great relevance in recent years due to the generation of large amounts of data. The eigenvector centrality (aka eigencentrality) is quickly becoming a good metric for centrality due to both its simplicity and fidelity. In this work we lay the foundations for solving the eigencentrality problem of ranking the importance of the nodes of a network with scores from the eigenvector of the network, using quantum computational paradigms such as quantum annealing and gate-based quantum computing. The problem is reformulated as a quadratic unconstrained binary optimization (QUBO) that can be solved on both quantum architectures. The results focus on correctly identifying a given number of the most important nodes in numerous networks given by the sparse vector solution of our QUBO formulation of the problem of identifying the top- τ highest eigencentrality nodes in a network on both the D-Wave and IBM quantum computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

VC3: Virtual Clusters for Community Computation (Final Technical Report)

A traditional HPC computing facility provides a large amount of computing power but has a fixed environment designed to satisfy local needs. This makes it very challenging for users to deploy complex applications that span multiple sites and require specific application software, scheduling middleware, or sharing policies. This project addressed many of these challenges by making it possible for researchers to easily aggregate and share resources, install custom software environments, and deploy clustering frameworks across multiple HPC facilities through the concept of “virtual clusters”. We designed and implemented a prototype virtual cluster facility that enabled unprivileged users to create dynamic aggregations of computing power across multiple sites, deployed with custom middleware and complex software dependencies.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

The LANL Common Modeling Framework (CMF) [Slides]

The Common Modeling Framework is a modern software repository built and maintained by the LANL Weapons Physics Directorate (ALDX). ALDX’s mission space is to develop and apply cutting-edge theory, computational models, and multi-physics simulation codes, and to design, execute, and analyze complex experiments

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Advanced Simulation and Computing: FY25 Implementation Plan

The DOE National Nuclear Security Administration (NNSA) Stockpile Stewardship Program (SSP) is an integrated technical program for maintaining the safety, security, and reliability of the U.S. nuclear stockpile. The SSP incorporates nuclear test data, computational modeling and simulation, and experimental facilities to advance understanding of nuclear weapons. The suite of data analyzed comes from activities including previous nuclear tests, stockpile surveillance, experimental research, and development and engineering programs. This integrated national program requires the continued use of experimental facilities and the computational capabilities to support the SSP missions. These component parts, in addition to an appropriately scaled production capability, enable NNSA to support stockpile requirements. The ultimate goal of the SSP, and thus of the Advanced Simulation and Computing (ASC) program, is to ensure that the U.S. maintains a safe, secure, and effective strategic deterrent.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Fundamental Algorithmic Research for Quantum Computing (FAR-QC) (Final Technical Report)

Anticipation of the noisy intermediate‐scale quantum (NISQ) era has sparked unprecedented interest in quantum computing, yet we still lack a clear understanding of how NISQ‐era applications will perform relative to the best classical algorithms solving the same problems. The goals of this project include: (1) Developing better tools for characterizing the performance of NISQ devices and for assessing whether such devices can achieve a quantum advantage. (2) Conceiving and analyzing potential applications of quantum computing technology in the NISQ era and beyond.

97 MATHEMATICS AND COMPUTING↗