Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “time discretization”

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 433 records · Page 24

NekRS, a GPU-accelerated spectral element Navier–Stokes solver

The development of NekRS, a GPU-oriented thermal-fluids simulation code based on the spectral element method (SEM) is described. For performance portability, the code is based on the open concurrent compute abstraction and leverages scalable developments in the SEM code Nek5000 and in libParanumal, which is a library of high-performance kernels for high-order discretizations and PDE-based miniapps. Critical performance sections of the Navier–Stokes time advancement are addressed. Performance results on several platforms are presented here, including scaling to 27,648 V100s on OLCF Summit, for calculations of up to 60B gridpoints.

97 MATHEMATICS AND COMPUTING↗

NLML: A Deep Neural Network Emulator for the Exact Nonlinear Interactions in a Wind Wave Model

Nonlinear wave interactions describe the resonant energy transfer between wave components, playing a fundamental role in the evolution of ocean wave spectra. Nonlinear wave interactions significantly influence wave growth and development, making them essential for accurate wave modeling. However, resolving the full six-dimensional Boltzmann integral of the exact nonlinear wave interactions (Webb-Resio-Tracy method, WRT) is computationally expensive, limiting its application in real-time operational wave forecasting and for research purposes. Current approximations, such as the Discrete Interaction Approximation (DIA), prioritize computational speed over accuracy, resulting in significant errors in wave mean parameters. Here, we introduce NLML, a machine learning (ML) emulator designed to approximate the exact nonlinear wave interactions within WAVEWATCH III (WW3), with the goal of achieving the accuracy of WRT while maintaining the stability and computational speed of DIA. By leveraging GPU capabilities such as half precision inference, we achieved substantial speedups, up to 136x mathematical equation faster than the WRT and only a modest 1.04x mathematical equation slowdown relative to DIA, while achieving 2x mathematical equation the accuracy of DIA in global wave spectral energy and mean wave parameters, with up to 7x mathematical equation higher accuracy in some regions. Unlike previous ML approaches, NLML maintained inherent stability throughout model integration in a standalone, year-long WW3 simulation, without requiring additional constraints. Our new ML parameterization bridges the gap between accuracy and efficiency, offering a promising alternative for improving wave modeling in operational settings and research purposes.

16 TIDAL AND WAVE POWER↗

High-Fidelity Models and Fast EMT Simulation Algorithms for Isolated Multi-port Autonomous Reconfigurable Solar power plant (MARS)

The integration of hybrid photovoltaic (PV) and energy storage system (ESS) based plants has become a promising way of solving the intermittency of PV plants and providing frequency support to the power grid. The multi-port autonomous reconfigurable solar power plant (MARS) can integrate the PV systems and ESSs to an ac grid and dc lines. The proposed isolated MARS incorporates an isolated converter that connects to the PV arrays and is based on the dual active bridge (DAB) converter. The high frequency switching in the DAB and the means to control the DAB converter using delays between switching signals lead to the need for a small timestep in simulations. Moreover, several hundreds of modules that include a DAB converter are present in the MARS. The small timestep and the presence of several hundreds of modules lead to a significant rise in the overall simulation time. To address this issue, simulation algorithms like numerical stiffness-based hybrid discretization and the hysteresis relaxation technique are applied to the switched system model of isolated MARS. Additionally, an event-driven interpolating method is introduced to help increase the minimum timestep to simulate the conventional DAB converter model while maintaining high accuracy in the simulation results. The developed model is validated by comparison with its reference model built in the PSCAD/EMTDC and MATLAB software environments using library components.

Xia, Qian↗

A Linear-Complexity Tensor Butterfly Algorithm for Compressing High-Dimensional Oscillatory Integral Operators

This paper presents a multilevel tensor compression algorithm called tensor butterfly algorithm for efficiently representing large-scale and high-dimensional oscillatory integral operators, including Green's functions for wave equations and integral transforms such as Radon transforms and Fourier transforms. The proposed algorithm leverages a tensor extension of the so-called complementary low-rank property of existing matrix butterfly algorithms. The algorithm partitions the discretized integral operator tensor into subtensors of multiple levels and factorizes each subtensor at the middle level as a Tucker-type interpolative decomposition, whose factor matrices are formed in a multilevel fashion. For a d-dimensional (d > 1) integral operator discretized into a 2d-mode tensor with n2d entries, the overall CPU time and memory requirement scale as O(nd), in stark contrast to the O(nd log n) complexity of existing matrix algorithms such as matrix butterfly algorithms and fast Fourier transforms (FFTs), where n is the number of points per direction. When comparing with other tensor algorithms such as quantized tensor train (QTT), the proposed algorithm also shows superior CPU and memory performance for tensor contraction. Remarkably, the tensor butterfly algorithm can efficiently model high-frequency Green's function interactions between two unit cubes, each spanning 512 wavelengths per direction, which represents problems of scale over 512× larger than that existing butterfly algorithms can handle, with the same amount of computation resources. On the other hand, for a problem representing 64 wavelengths per direction, which is the largest size existing algebraic matrix algorithms can handle, our tensor butterfly algorithm exhibits 200x speedups and 30× memory reduction compared with existing ones. Moreover, the tensor butterfly algorithm also permits O(nd)-complexity FFTs and Radon transforms up to d = 6 dimensions.

Kielstra, P Michael↗

Simulation of Reverse Osmosis Membrane Compaction Using Material Point Method (MPM)

Access to fresh drinking water in the future requires effective management of industrial wastewater and water purification from available resources. In this study, we present the simulation methodology and the analysis of a Reverse Osmosis (RO) membrane under various pressure conditions using the Material Point Method (MPM). In contrast to other numerical methods, MPM solves the continuum governing equations on material points in a Lagrangian framework. The method does not require a grid connecting the material points hence making it suitable to simulate large deformations during membrane compaction. The time integration is carried out using the explicit Euler method, while the spatial discretization is performed using linear or cubic-spline shape functions. A series of planar images containing detailed pore structures obtained from X-ray tomography experiments is converted to a three-dimensional collection of material points to simulate the membrane. Compressive loads are applied to the top layer of the membrane to simulate the experiments. The membrane deformation and pore size distribution before and after load application are reported and compared with the experimental measurements. The presentation discusses the numerical methods used, the performance of the solver on high-performance computing machines, and the results of membrane compaction in detail.

ENGINEERING,MATHEMATICS AND COMPUTING↗

DS-TIDE: Harnessing Dynamical Systems for Efficient Time-Independent Differential Equation Solving

Time-Independent Differential Equations (TIDEs) are central to modeling equilibrium behavior across a wide range of scientific and engineering domains, from electrostatics to porous media flow. Conventional numerical solvers offer reliable solutions but incur significant computational costs due to fine-grained discretization and iterative procedures. Machine learning-based approaches address this by replacing iterative solving processes with one-time inference; however, their sophisticated models require extensive training resources that often exceed those of traditional solvers. Consequently, designing a TIDE solver that achieves high accuracy, broad applicability, and exceptional computational efficiency remains a fundamental challenge. In this paper, we propose DS-TIDE, a novel hardware solver that is inspired by, and subsequently leverages, the intrinsic connection between Dynamical Systems (DS) and Differential Equations (DEs) to efficiently and accurately solve TIDEs. DS-TIDE employs a CMOS-compatible DS-based processor, whose physical states evolve under carefully designed DE-driven dynamics and naturally converge to equilibrium -- the solution of the target TIDE -- within ~1µs on a ~1-watt DS-TIDE processor. To enhance expressivity, DS-TIDE incorporates Heterogeneous Dynamics with Temporal Layering (HDTL), which solves TIDEs through a three-stage DS evolution -- conditioning, solving, and decoding -- each governed by specialized dynamics. The entire evolution process is analogous to an infinitely deep neural network temporally unrolled, offering the system the capability of representing complex equations. Furthermore, DS-TIDE is equipped with an on-device DS-DE Auto-Alignment mechanism that dynamically adapts intrinsic hardware dynamics within milliseconds, effectively aligning the system’s dynamics to diverse target DEs. Experimental results across TIDEs from a wide range of scientific and engineering domains demonstrate that DS-TIDE achieves ~10^3× speedup, ~10^5× energy savings, and competitive or superior accuracy compared to state-of-the-art numerical and ML-based solvers.

Liu, Chuan↗

Hybrid Basis and Multi-Center Grid Method for Strong-Field Processes

We present a time-dependent framework that combines a hybrid basis, consisting of Gaussian-type orbitals (GTOs) and finite-element discrete-variable representation (FEDVR) functions, with a multicenter grid to simulate strong-field and attosecond dynamics in atoms and molecules. The method incorporates the construction of the orthonormal hybrid basis, the evaluation of electronic integrals, a unitary time-propagation scheme, and the extraction of optical and photoelectron observables. Its accuracy and robustness are benchmarked on one-electron systems such as atomic hydrogen and the dihydrogen cation (H$^+_2$) through comparisons with essentially-exact reference results for bound-state energies, high-harmonic generation spectra, photoionization cross sections, and photoelectron momentum distributions. This work establishes the groundwork for its integration with quantum-chemistry methods, which is already operational but will be detailed in future work, thereby enabling ab initio simulations of correlated polyatomic systems in intense ultrafast laser fields.

74 ATOMIC AND MOLECULAR PHYSICS↗

Lattice Green’s Functions for High-Order Finite Difference Stencils

Lattice Green's Functions (LGFs) are fundamental solutions to discretized linear operators, and as such they are a useful tool for solving discretized elliptic PDEs on domains that are unbounded in one or more directions. The majority of existing numerical solvers that make use of LGFs rely on a second-order discretization and operate on domains with free-space boundary conditions in all directions. Under these conditions, fast expansion methods are available that enable precomputation of 2D or 3D LGFs in linear time, avoiding the need for brute-force multi-dimensional quadrature of numerically unstable integrals. Here we focus on higher-order discretizations of the Laplace operator on domains with more general boundary conditions, by (1) providing an algorithm for fast and accurate evaluation of the LGFs associated with high-order dimension-split centered finite differences on unbounded domains, and (2) deriving closed-form expressions for the LGFs associated with both dimension-split and Mehrstellen discretizations on domains with one unbounded dimension. Through numerical experiments we demonstrate that these techniques provide LGF evaluations with near machine-precision accuracy, and that the resulting LGFs allow for numerically consistent solutions to high-order discretizations of the Poisson's equation on fully or partially unbounded 3D domains.

97 MATHEMATICS AND COMPUTING↗

Efficient exascale discretizations: High-order finite element methods

Efficient exploitation of exascale architectures requires rethinking of the numerical algorithms used in many large-scale applications. These architectures favor algorithms that expose ultra fine-grain parallelism and maximize the ratio of floating point operations to energy intensive data movement. One of the few viable approaches to achieve high efficiency in the area of PDE discretizations on unstructured grids is to use matrix-free/partially assembled high-order finite element methods, since these methods can increase the accuracy and/or lower the computational time due to reduced data motion. In this paper we provide an overview of the research and development activities in the Center for Efficient Exascale Discretizations (CEED), a co-design center in the Exascale Computing Project that is focused on the development of next-generation discretization software and algorithms to enable a wide range of finite element applications to run efficiently on future hardware. CEED is a research partnership involving more than 30 computational scientists from two US national labs and five universities, including members of the Nek5000, MFEM, MAGMA and PETSc projects. We discuss the CEED co-design activities based on targeted benchmarks, miniapps and discretization libraries and our work on performance optimizations for large-scale GPU architectures. We also provide a broad overview of research and development activities in areas such as unstructured adaptive mesh refinement algorithms, matrix-free linear solvers, high-order data visualization, and list examples of collaborations with several ECP and external applications.

97 MATHEMATICS AND COMPUTING↗

Characterizing the impact of finite matrix block size on conservative particle transport through three-dimensional fracture networks

Mass transfer of solutes between fractures and the surrounding rock matrix exerts a noticeable signature on the tail of travel time distributions. When the width of the matrix is assumed to be infinite and advective transport through the fracture is sufficiently fast, the tails of the travel time distributions exhibit a classically expected slope of ψ(t) ∝ t -3/2 . However, studies have yet to characterize how solute transfer between fractures via diffusion through finite matrix blocks influences the tail’s slope in three-dimensional fractured media. Here, in this study, we assess the impact of finite matrix block size on breakthrough curve shape at different spatio-temporal scales by con ducting particle tracking simulations in three-dimensional discrete fracture networks. We consider a variety of hydrodynamic and geostructural proper ties to determine their relative impact on the resulting travel time distributions. We observe that the impact of matrix diffusion through a finite block on travel time distributions is similar to that of an infinite matrix block when the fracture spacing is sufficiently large, matrix diffusion is relatively weak, or transport is considered at an early control plane distance. We observe that the converse of these conditions, results in deviations from the classical ψ(t) ∝ t -3/2 scaling. These results provide a first step toward developing a metric to assess when finite block size effects are expected to significantly influence transport.

58 GEOSCIENCES↗

Multiplexing and Demultiplexing Signals for Radiography Application Using the Discrete Fourier Transform

Our goal is to develop an X-ray phase-contrast imaging system that can provide excellent soft tissue contrast of phase, attenuation, and small-angle scatter. We propose to replace the common system of G0, G1, and G2 gradings with a biprism array to replace the G1 grading and introduce a novel X-ray tube designed to replace the motion of the phase stepping grading G2. The proposed X-ray tube uses temporal multiplexing to provide simultaneous virtual “electronic phase stepping.” In this work the discrete Fourier transform is used to separate from the composite measurement individual X-ray phase contrast measurements sampled at different frequencies. The method performs a discrete Fourier transform of a composite refence sequence to obtain using the frequency amplitudes calibration factors needed to extract the X-ray phase contrast measurement amplitudes from the composite image. The composite reference sequence is the sum of the individual sequences, at different frequencies, with amplitudes of one. The method takes the discrete Fourier transform of this composite reference sequence; whereby, the amplitude of each frequency component is compared with the total sum of its stand-alone sequence amplitude. A calibration factor is determined so that the amplitude of this composite reference frequency times the calibration factor must equal the total sum of the sequence amplitude—the zero-frequency amplitude of the discrete Fourier transform of its stand-alone sequence. To demultiplex the composite measured signal these calibration factors are multiplied by the amplitudes of the frequency components of the discrete Fourier transform of the composite X-phase-contrast measurement to obtain the amplitude of each frequency encoded measurement. Using these calibration factors, we demonstrate with the discrete Fourier transform in Mathematica the extraction of individual images from a composite image that one would expect obtaining from our proposed new X-ray phase contrast imaging system. We then demonstrate as an example how using images from X-ray phase contrast data one can calculate phase, attenuation and the dark field images using grading phase step data supplied to use from Microworks, GmbH in Karlsruhe, Germany.

42 ENGINEERING↗

Correlated charge noise and relaxation errors in superconducting qubits

In This report, the central challenge in building a quantum computer is error correction. Unlike classical bits, which are susceptible to only one type of error, quantum bits (“qubits”) are susceptible to two types of error, corresponding to flips of the qubit state about the X- and Z-directions. While the Heisenberg Uncertainty Principle precludes simultaneous monitoring of X- and Z-flips on a single qubit, it is possible to encode quantum information in large arrays of entangled qubits that enable accurate monitoring of all errors in the system, provided the error rate is low. Another crucial requirement is that errors cannot be correlated. Here, we characterize a superconducting multiqubit circuit and find that charge fluctuations are highly correlated on a length scale over 600 µm; moreover, discrete charge jumps are accompanied by a strong transient suppression of qubit energy relaxation time across the millimeter-scale chip. The resulting correlated errors are explained in terms of the charging event and phonon-mediated quasiparticle poisoning associated with absorption of gamma rays and cosmic-ray muons in the qubit substrate. Robust quantum error correction will require the development of mitigation strategies to protect multiqubit arrays from correlated errors due to particle impacts.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Scattering phase shift in quantum mechanics on quantum computers

Here, we investigate the feasibility of extracting infinite volume scattering phase shift on quantum computers in a simple one-dimensional quantum mechanical model, using the formalism established in the work by Guo and Gasparian [Phys. Rev. D 108, 074504 (2023)] that relates the integrated correlation functions for a trapped system to the infinite volume scattering phase shifts through a weighted integral. The system is first discretized in a finite box with periodic boundary conditions, and the formalism in real time is verified by employing a contact interaction potential with exact solutions. Quantum circuits are then designed and constructed to implement the formalism on current quantum computing architectures. To overcome the fast oscillatory behavior of the integrated correlation functions in real-time simulation, different methods of postdata analysis are proposed and discussed. Test results on IBM hardware show that good agreement can be achieved with two qubits, but complete failure ensues with three qubits due to two-qubit gate operation errors and thermal relaxation errors.

Guo, Peng [Dakota State Univ., Madison, SD (United↗

Flux-based three-dimensional electrodynamic modeling approach to superconducting circuits and materials

Modeling the behavior of superconducting electronic circuits containing Josephson junctions is crucial for the design of superconducting information processors and devices. In this paper, we introduce DEC-QED, a computational approach for modeling the electrodynamics of superconducting electronic circuits containing Josephson junctions in arbitrary three-dimensional electromagnetic environments. DEC-QED captures the nonlinear response and induced currents in BCS superconductors and accurately captures phenomena such as the Meissner effect, flux quantization, and Josephson effects. Using a spatial coarse-graining formulation based on discrete exterior calculus (DEC), DEC-QED can accurately simulate transient and long-time dynamics in superconductors. Finally, the expression of the entire electrodynamic problem in terms of the gauge-invariant flux field and charges makes the resulting classical field theory suitable for second quantization.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Gauge constrained algorithm of variational discrete action theory at N = 3 for the multiorbital Hubbard model

The recently developed variational discrete action theory (VDAT) provides a systematic variational approach to the ground state of the quantum many-body problem, where the quality of the solution is controlled by an integer N, and increasing N monotonically approaches the exact solution. VDAT can be exactly evaluated in the d = ∞ multiorbital Hubbard model using the self-consistent canonical discrete action theory (SCDA), which requires a self-consistency condition for the integer time Green's functions. Previous work demonstrates that N = 3 accurately captures multiorbital Mott/Hund physics at a cost similar to the Gutzwiller approximation. Here we employ a gauge constraint to automatically satisfy the self-consistency condition of the SCDA at N = 3, yielding an even more efficient algorithm with enhanced numerical stability. We derive closed form expressions of the gauge constrained algorithm for the multiorbital Hubbard model with general density-density interactions, allowing VDAT at N = 3 to be straightforwardly applied to the seven-orbital Hubbard model. We present results and a performance analysis using N = 2 and N = 3 for the SU⁡(2⁢N orb ) Hubbard model in d = ∞ with N orb = 2–8, and compare to numerically exact dynamical mean-field theory solutions where available. Finally, the developments in this work will greatly facilitate the application of VDAT at N = 3 to strongly correlated electron materials.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Solving the homogeneous Bethe-Salpeter equation with a quantum annealer

The homogeneous Bethe-Salpeter equation (hBSE), describing a bound system in a genuinely relativistic quantum-field theory framework, was solved for the first time by using a D-Wave quantum annealer. After applying standard techniques of discretization, the hBSE, in ladder approximation, can be formally transformed in a generalized eigenvalue problem (GEVP), with two square matrices: one symmetric and the other nonsymmetric. The latter matrix poses the challenge of obtaining a suitable formal approach for investigating the GEVP by means of a quantum annealer, i.e., to recast it as a quadratic unconstrained binary optimization problem. A broad numerical analysis of the proposed algorithms, applied to matrices of dimension up to 64, was carried out by using both the simulated-annealing package and the D-Wave . The numerical results very nicely compare with those obtained with standard classical algorithms, and also show interesting scalability features. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hybrid interferometric diagnostic for the refractive index measurement across nearly discrete shock waves

The measurement of high temperature gas properties is key for characterizing high speed flows. Nearly discrete changes in density across shock waves, in particular, are difficult to resolve through traditional fringe-counting interferometric methods. Existing techniques for estimating large fringe jumps are either resolution limited or require specialized window configurations. In this Letter, we describe a unique hybrid interferometric technique that combines narrowband fringes for high resolution and broadband fringes as an absolute reference to measure changes in refractive index with a resolution of up to 7 × 10 −8 across nearly discrete index changes of up to 1.5 × 10 −4 . By capturing fringes with an ultrahigh-speed camera, the refractive index changes across discrete shock fronts can be estimated inside a shock tube with high accuracy and time resolution. First, a novel hybrid calibration method for tracking finite fringes is discussed. Next, this technique is used to measure the post-initial-shock refractive indices for Mach 2.7 to 4.2 flows (pressures from 90.4 to 228.4 kPa). Results are then compared with theoretical values showing agreement within 2%.

Wang, Gwendolyn T. (ORCID:000000016271893X)↗