Tensor networks for solving the time-independent Boltzmann neutron transport equation
Not Available
97 MATHEMATICS AND COMPUTING↗
SEARCH · Engineering Papers
Results for “solve time”
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.
An Efficient Numerical Algorithm for Solving Coupled Time-Dependent Ginzburg-Landau Equation for Superconductivity and Elasticity
A decoupled finite element algorithm is developed for simulating the vortex dynamics on an elastic superconductor which couples the time-dependent Ginzburg- Landau equation with the complex-valued superconducting order parameter and the vector-valued magnetic potential, and the elasticity equation. We present an iterative algorithm for the decoupled system arising from the time and spatial discretization using a combination of preconditioner, algebraic multigrid method (AMG) and preconditioned conjugate gradient method (PCG). The iterative algorithm allows us to perform large-scale three-dimensional simulations of mesoscale pattern formation during superconducting phase transitions with arbitrary elastic boundary conditions. Here, the performance and efficiency of the algorithm are numerically verified by several benchmark problems, exhibiting up to two orders of magnitude improvement depending on the scale of discrete system compared to the exact solver.
Efficiency↗
Performance Evaluation of hypre Solvers
This report compares GPU and CPU performance of structured and unstructured hypre solvers on Lassen and Summit. We applied the solvers to various problems of different sizes varying the number of nodes and processes. We provide the individual results for setup phase and solve phase, since preconditioned solvers are often used in different settings. While for a single system solve the total time is determined by the sum of setup and solve time, this can change for different scenarios. For example, in time dependent problems the preconditioner might have to be setup only occasionally or possibly even only once. In that situation solve times will dominate. Thus, since often better GPU speedups can be attained in the solve phase, this will lead to generally better speedups.
97 MATHEMATICS AND COMPUTING↗
Higher-order LaSDI: Reduced order modeling with multiple time derivatives
Solving complex partial differential equations (PDEs) is essential across scientific disciplines but often requires numerical models that can be prohibitively expensive in time-sensitive applications. Reduced-order models (ROMs) address this challenge by exploiting low-dimensional structure to create fast approximations. The Latent Space Dynamics Identification (LaSDI) framework has demonstrated success in learning ROMs for parameterized PDE families, but remains limited to first-order systems. Here, in this paper, we propose Higher-Order LaSDI (HLaSDI), which extends the LaSDI framework to PDEs with arbitrary order of time derivatives. This generalization significantly expands the applicability of LaSDI-based methods to systems previously outside their scope, including hyperbolic PDEs. We demonstrate HLaSDI’s accuracy and efficiency on several linear and nonlinear benchmark problems.
97 MATHEMATICS AND COMPUTING↗
Cost of emulating a small quantum annealing problem in the circuit model
Demonstrations of quantum advantage for certain sampling problems have generated considerable excitement for quantum computing and have further spurred the development of circuit-model quantum computers, which represent quantum programs as a sequence of quantum gates acting on a finite number of qubits. Amongst this excitement, analog quantum computation has become less prominent, with the expectation that circuit-model quantum computers will eventually be sufficient for emulating analog quantum computation and thus rendering analog quantum computation obsolete. In this work we explore the basic requirements for emulating a specific analog quantum computation in the circuit model: the preparation of a biased superposition of degenerate ground states of an Ising Hamiltonian using an adiabatic evolution. We show that the overhead of emulation is substantial even for this simple problem. This supports using analog quantum computation for solving time-dependent Hamiltonian dynamics in the short term and midterm, assuming analog errors can be made low enough and coherence times long enough to solve problems of practical interest.
Quantum algorithms & computation↗
Solving MaxCut with quantum imaginary time evolution
We introduce a method to solve the MaxCut problem efficiently based on quantum imaginary time evolution (QITE). We employ a linear Ansatz for unitary updates and an initial state involving no entanglement, as well as an imaginary-time-dependent Hamiltonian interpolating between a given graph and a subgraph with two edges excised. We apply the method to thousands of randomly selected graphs with up to fifty vertices. We show that our algorithm exhibits a 93% and above performance converging to the maximum solution of the MaxCut problem for all considered graphs. Our results compare favorably with the performance of classical algorithms, such as the greedy and Goemans–Williamson algorithms. We also discuss the overlap of the final state of the QITE algorithm with the ground state as a performance metric, which is a quantum feature not shared by other classical algorithms.
97 MATHEMATICS AND COMPUTING↗
DECA: Discrete Event inspired Cellular Automata for grain structure prediction in additive manufacturing
Microstructure largely dictates macroscopic material properties and is strongly affected by processing. Therefore, the simulation of microstructure evolution in response to thermal fields during processing is of significant interest within the computational materials science community. Additive manufacturing (AM) has emerged as a technique for producing complex geometries and unique microstructures. Yet, complex and rapid thermal cycles in AM pose computational challenges for existing microstructure models. This work proposes a discrete event inspired cellular automata (CA) approach, titled DECA, to accelerate simulation of grain structure evolution in AM. In contrast to conventional time-stepped CA models, this model directly solves the times capture events would take place allowing for stepping in events rather than time (a technique also found in the field of discrete-event simulation). In comparison to purely serial discrete-event models, DECA allows for temporary violation of the causality constraint, but detects and corrects these violations, leading to an emergent phenomenon dubbed causality rippling, in which previously calculated capture events are overwritten. The amount of repeated calculations, defined by the capture ratio, is taken as a measure of computational inefficiency, and the model parameters that affect this ratio are evaluated. The new DECA approach was found to be more computationally efficient than conventional time-stepped CA models while guaranteeing an accurate solution, which can only be achieved in the conventional models for vanishingly small time steps. Finally, opportunities for parallelization and scaling of the new approach are discussed.
36 MATERIALS SCIENCE↗
An unconditionally stable, time-implicit algorithm for solving the one-dimensional Vlasov–Poisson system
The development of an implicit, unconditionally stable, numerical method for solving the Vlasov–Poisson system in one dimension using a phase-space grid is presented. The algorithm uses the Crank–Nicolson discretization scheme and operator splitting allowing for direct solution of the finite difference equations. This method exactly conserves particle number, enstrophy and momentum. A variant of the algorithm which does not use splitting also exactly conserves energy but requires the use of iterative solvers. This algorithm has no dissipation and thus fine-scale variations can lead to oscillations and the production of negative values of the distribution function. We find that overall, the effects of negative values of the distribution function are relatively benign. We consider a variety of test cases that have been used extensively in the literature where numerical results can be compared with analytical solutions or growth rates. We examine higher-order differencing and construct higher-order temporal updates using standard composition methods.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
A Current-Mode Discrete-Time Analog Computer for Solving Maxwell's Equations in 2D
Explore the source record for details and available documents.
47 OTHER INSTRUMENTATION↗
Limitations of Fault-Tolerant Quantum Linear System Solvers for Quantum Power Flow
Quantum computers hold promise for solving problems intractable for classical computers, especially those with high time or space complexity. Practical quantum advantage can be said to exist for such problems when the end-to-end time for solving such a problem using a classical algorithm exceeds that required by a quantum algorithm. Reducing the power flow (PF) problem into a linear system of equations allows for the formulation of quantum PF (QPF) algorithms, which are based on solving methods for quantum linear systems such as the Harrow-Hassidim-Lloyd (HHL) algorithm. Speedup from using QPF algorithms is often claimed to be exponential when compared to classical PF solved by state-of-the-art algorithms. Here, we investigate the potential for practical quantum advantage in solving QPF compared to classical methods on gate-based quantum computers. Notably, this paper does not present a new QPF solving algorithm but scrutinizes the end-to-end complexity of the QPF approach, providing a nuanced evaluation of the purported quantum speedup in this problem. Our analysis establishes a best-case bound for the HHL-based quantum power flow complexity, conclusively demonstrating that the HHL-based method has higher runtime complexity compared to the classical algorithm for solving the direct current power flow (DCPF) and fast decoupled load flow (FDLF) problem. Notably, our analysis and conclusions can be extended to any quantum linear system solver with rigorous performance guarantees, based on the known complexity lower bounds for this problem. Additionally, we establish that for potential practical quantum advantage (PQA) to exist it is necessary to consider DCPF-type problems with a very narrow range of condition number values and readout requirements.
29 ENERGY PLANNING, POLICY, AND ECONOMY↗
A time-dependent momentum-resolved scattering approach to core-level spectroscopies
While new light sources allow for unprecedented resolution in experiments with X-rays, a theoretical understanding of the scattering cross-section is lacking. In the particular case of strongly correlated electron systems, numerical techniques are quite limited, since conventional approaches rely on calculating a response function (Kramers-Heisenberg formula) that is obtained from a perturbative analysis of scattering processes in the frequency domain. This requires a knowledge of a full set of eigenstates in order to account for all intermediate processes away from equilibrium, limiting the applicability to small tractable systems. In this work, we present an alternative paradigm, recasting the problem in the time domain and explicitly solving the time-dependent Schrödinger equation without the limitations of perturbation theory: a faithful simulation of the scattering processes taking place in actual experiments, including photons and core electrons. We show how this approach can yield the full time and momentum resolved Resonant Inelastic X-Ray Scattering (RIXS) spectrum of strongly interacting many-body systems. We demonstrate the formalism with an application to Mott insulating Hubbard chains using the time-dependent density matrix renormalization group method, which does not require a priory knowledge of the eigenstates and can solve very large systems with dozens of orbitals. This approach can readily be applied to systems out of equilibrium without modification and generalized to other spectroscopies.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
Efficient and flexible multirate temporal adaptivity
In this work we present two new families of multirate time step adaptivity controllers, that are designed to work with embedded multirate infinitesimal (MRI) time integration methods for adapting time steps when solving problems with multiple time scales. We compare these controllers against competing approaches on two benchmark problems, showing that the proposed methods offer dramatically improved performance and flexibility. The combination of embedded MRI methods and the proposed controllers enable adaptive simulations of problems with a potentially arbitrary number of time scales, achieving high accuracy while maintaining low computational cost. Additionally, we introduce a new set of embeddings for the family of explicit multirate exponential Runge–Kutta (MERK) methods of orders 2 through 5, resulting in the first-ever fifth-order embedded MRI method. Finally, we compare the performance of a wide range of embedded MRI methods on our benchmark problems to provide guidance on how to select an appropriate MRI method and multirate controller.
97 MATHEMATICS AND COMPUTING↗
Real-time inference and extrapolation with Time-Conditioned UNet: Applications in hypersonic flows, incompressible flows, and global temperature forecasting
Neural Operators are fast and accurate surrogates for nonlinear mappings between functional spaces within training domains. Extrapolation beyond the training domain remains a grand challenge across all application areas. We present Time-Conditioned UNet (TC-UNet) as an operator learning method to solve time-dependent PDEs continuously in time without any temporal discretization, including in extrapolation scenarios. TC-UNet incorporates the temporal evolution of the PDE into its architecture by combining a parameter conditioning approach with the attention mechanism from the Transformer architecture. After training, TC-UNet makes real-time inferences on an arbitrary temporal grid. We demonstrate its extrapolation capability on a climate problem by estimating the global temperature for several years and also for inviscid hypersonic flow around a double cone. We propose different training strategies involving temporal bundling and sub-sampling. We demonstrate performance improvements for several benchmarks, performing extrapolation for long time intervals and zero-shot super-resolution time.
Deep learning↗
Derivation of the Future Time Equation for Analog, Non-Multiplying Monte Carlo Simulation
The expected computational time required to simulate a particle from a point in phase space through a Monte Carlo history, termed the expected future time, is found by solving the Future Time Equation (FTE). The expected future time may be useful when generating variance reduction parameters for a Monte Carlo simulation with a method such as Consistent Adjoint Driven Importance Sampling (CADIS). This report presents a detailed derivation of the Future Time Probability Density Function (FTPDF) and FTE for neutral particle Monte Carlo transport to aid future researchers. For simplicity, this derivation only considers analog transport in non-multiplying media.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
Development of a Microwave Quantum Sensing Capability
The geopolitical world is at the beginning of a quantum renaissance. Technology has reached a level of sophistication that allows the probing of a new world that operates using a different set of rules marked by quantum entanglement, superposition, and the no-cloning theorem. If we can explore this new world and its counterintuitive rules, we may be able to leverage them to build powerful tools for a wide range of applications, including enhanced encryption, computation, and sensing. Some entities have invested early and heavily in exploring this frontier: China has demonstrated quantum teleportation between a ground station and an orbiting satellite; Google recently met a computational milestone known as quantum supremacy, in which a quantum computer solves a problem that would take a classical computer an infeasible amount of time to solve. While great strides have been made, the early progress has caught many entities off guard. The scope of this project leverages an existing investment in a dilution refrigerator strategically chosen to position Pacific Northwest National Laboratory (PNNL) for a future in low-temperature microwave quantum sensing.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Parallel-in-Time Solution of Allen-Cahn Equations by Integrating Operator Learning into the Parareal Method
While recent advances in deep learning have shown promising efficiency gains in solving time-dependent partial differential equations (PDEs), matching the accuracy of conventional numerical solvers still remains a challenge. One strategy to improve the accuracy of deep learning-based solutions for time-dependent PDEs is to use the learned model as the coarse propagator in the Parareal method and a traditional numerical method as the fine solver. However, successful integration of deep learning into the Parareal method requires consistency between the coarse and fine solvers, particularly for PDEs exhibiting rapid changes such as sharp transitions. Here, to ensure this consistency, we propose using convolutional neural networks (CNNs) to learn the fully discrete time-stepping operator defined by the same numerical scheme employed as the fine solver. We demonstrate the effectiveness of the proposed method in solving the classical and mass-conservative Allen–Cahn (AC) equations. Through iterative updates in the Parareal algorithm, our approach achieves a significant computational speedup compared to traditional fine solvers while converging to high-accuracy solutions. Our results highlight that the proposed hybrid Parareal algorithm effectively accelerates simulations, particularly when implemented on multiple GPUs, and converges to the desired accuracy in only a few iterations. Another advantage of our method is that the CNN model is trained on trajectory-based data generated from random initial conditions, such that the trained model can be used to solve the AC equations with various initial conditions without retraining. This work demonstrates the potential of integrating neural network methods into parallel-in-time frameworks for efficient and accurate simulations of time-dependent PDEs.
97 MATHEMATICS AND COMPUTING↗
Time-dependent dynamical Bragg diffraction in deformed crystals by the beam propagation method
Herein, this paper describes how to efficiently solve time-dependent X-ray dynamic diffraction problems in distorted crystals with a fast Fourier transform based beam propagation method. Examples are given of using the technique to simulate the propagation of X-ray beams in deformed crystals in space and time domains relevant to the cavity-based X-ray free-electron lasers and X-ray free-electron laser self-seeding systems.
36 MATERIALS SCIENCE↗
Hermes-3: Multi-component plasma simulations with BOUT++
A new open source tool for fluid simulation of multi-component plasmas is presented, based on a flexible software design that is applicable to scientific simulations in a wide range of fields. Hermes-3 is built on plasma simulation framework BOUT++, consolidating earlier SD1D and Hermes models into a single code that can be configured at run-time to solve plasma models in 1D, 2D or 3D, either for transport (steady-state) or turbulent (time-evolving) problems, with an arbitrary number of ion and neutral species. Here, we describe the improved numerical algorithms and software design that have been implemented in Hermes-3. To demonstrate the capabilities of this tool, applications relevant to the boundary of tokamak plasmas are presented: 1D simulations of diveror plasmas evolving equations for all charge states of neon and deuterium; 2D transport simulations of tokamak equilibria in single-null X-point geometry with plasma ion and neutral atom species; and simulations of the time-dependent propagation of plasma filaments (blobs). Hermes-3 is publicly available on Github under the GPL-3 open source license. The repository includes documentation and a suite of unit, integrated and convergence tests.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗