Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm development”

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,009 records · Page 56

Metrology of Time-Domain Soft X-Ray Attosecond Pulses and Reevaluation of Pulse Durations of Three Recent Experiments

Attosecond pulses in the soft x-ray (SXR) to water-window energy region offer the tools for creating and studying target-specific localized inner-shell electrons or holes in materials, enabling monitoring or controlling charge and energy flows in a dynamic system on attosecond timescales. Recently, a number of laboratories have reported generation of continuum harmonics in the hundred-electron-volt to kilovolt region with few-cycle long-wavelength mid-infrared lasers. These harmonics have the bandwidth to support pulses with durations of a few to a few-ten attoseconds. But harmonics generated in a gas medium have attochirps that cannot be fully compensated by materials over a broad spectral range; thus, realistically what are the typical shortest attosecond pulses that one can generate? To answer this question, it is essential that the temporal attosecond pulses be accurately characterized. By reanalyzing the soft x-ray attosecond metrology reported in three recent experiments using a newly developed broadband phase retrieval algorithm, we demonstrate here that the generated attosecond pulses in the first two papers have durations of about 60 as, longer than what they have reported. Similarly, the duration from the third experiment is retrieved to be about half of the 322-as upper limit cited in that work. We also introduce the autocorrelation (AC) of the streaking spectrogram. By comparing the ACs from the experiments and from the retrieved SXR pulses, the accuracy of the retrieved results can be directly visualized. Our retrieval method is fast and accurate, and it shall provide a powerful tool for the metrology of the emerging few-ten-attosecond pulses.

74 ATOMIC AND MOLECULAR PHYSICS↗

Modeling and experimental validation of dynamical effects in Bragg coherent x-ray diffractive imaging of finite crystals

Bragg coherent diffractive imaging (BCDI) is a noninvasive microscopy technique that can visualize the shape and internal lattice deviations of crystals with nanoscale spatial resolution and picometer deformation sensitivity. Its strain imaging capability relies on Fourier transform–based iterative phase retrieval algorithms, which are mostly developed under the kinematical approximation. Such approximation prohibits the application of BCDI on larger crystals, which are commonly seen in most emerging functional materials. Understanding the dynamical effect in BCDI, as well as developing a validated method for modeling BCDI at the dynamical diffraction limit, is crucial for applying BCDI to hierarchical systems that contain micron-sized crystals and grains. Thus we report a comparative study on the impact of dynamical diffraction effects by comparing the reconstruction results from two measurements of the same crystal. Forward simulation is implemented to show subtle changes of interference fringes in the diffraction pattern due to the dynamical diffraction, and is compared directly with the experimental data.

36 MATERIALS SCIENCE↗

Coupled Lindblad Pseudomode Theory for Simulating Open Quantum Systems

Coupled Lindblad pseudomode theory is a promising approach for simulating non-Markovian quantum dynamics on both classical and quantum platforms, with dynamics that can be realized as a quantum channel. We provide theoretical evidence that the number of coupled pseudomodes only needs to scale as polylog⁡(𝑇/𝜖) in the simulation time 𝑇 and precision 𝜖. Inspired by the realization problem in control theory, we also develop a robust numerical algorithm for constructing the coupled modes that avoid the nonconvex optimization required by existing approaches. We demonstrate the effectiveness of our method by computing population dynamics and absorption spectra for the spin-boson model. Furthermore, this Letter provides a significant theoretical and computational improvement to the coupled Lindblad framework, which impacts a broad range of applications from classical simulations of quantum impurity problems to quantum simulations on near-term quantum platforms.

Anderson impurity model↗

Descriptor: Infrastructure Perception and Control: Multi-Sensor Object Tracking Dataset (IPC-MSOT)

Traffic intersections are crucial and challenging nodes in transportation networks where multiple lanes of vehicles and pedestrians converge. Traffic accidents often occur at traffic intersections, including a large proportion of traffic fatalities and about one-half of all traffic injuries in the United States. Object detection data were collected in 2024 across three intersections in Colorado Springs, CO, USA, over the course of multiple days and various times to induce a heterogeneous mix of traffic conditions and behaviors. The purpose of the data collection exercises was to learn various attributes about infrastructure sensors and to build a repository of high-resolution, object-level data that can be used for research and development (e.g., to develop multisensor data fusion algorithms). The Infrastructure Perception and Control:Multi-Sensor Object tracking (IPC-MSOT) dataset was collected as part of the U.S. Department of Transportation's Strengthening Mobility and Revolutionizing Transportation (SMART) project, where the city of Colorado Springs, Colorado, and the National Renewable Energy Laboratory collaborated to collect object-level trajectory data from road users using multiple types of infrastructure sensors deployed at different intersections. This dataset allows for testing of late-stage sensor fusion algorithms and their ability to ingest multimodal sensor data, and it can be utilized by traffic engineers to design and evaluate trajectory-based signal control strategies.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Electromagnetic Transient Simulation of Large-Scale Inverter-Based Resources With High-Granularity

The power grid is undergoing a significant transformation with the rapid increase in inverter-based resources (IBRs), including large-scale photovoltaic (PV) plants. Ensuring reliable and resilient grid operation in this new paradigm necessitates high-granularity electromagnetic transient (EMT) modeling that accurately captures the behavior of individual inverters and their interactions within IBR plants. Central to this approach is the detailed representation of both the IBR plant’s collector system and the dynamics of individual inverters. To achieve this, a high-granularity EMT model of a large-scale PV plant has been developed using advanced simulation algorithms, including matrix splitting and the Schur complement. These proposed techniques significantly enhance simulation speed, numerical stability, and accuracy while improving the modularity and efficiency of the collector system’s representation. The effectiveness of the proposed methods is validated through simulations of a representative large-scale PV plant consisting of 125 individual PV inverters, 25 IBR unit transformers, and a 52-bus collector system.

Choi, Jongchan [Oak Ridge National Laboratory (ORN↗

Explainable Bayesian Neural Network for Probabilistic Transient Stability Analysis Considering Wind Energy

While several data-driven models have been developed for transient stability assessment, how to consider the uncertainties from load and renewable generations and provide interpretation of data-driven assessment results are still open. This paper proposes an explainable Bayesian Neural Network (BNN) for probabilistic transient stability assessment (TSA). By extracting the uncertainties from loads and wind farms, the BNN model can make a reliable prediction and quantify the prediction uncertainties. We also develop the Gradient Shap algorithm to make the global and local explanations for the probabilistic TSA model, a significant advantage over existing black-box data-driven methods. Numerical results on the modified IEEE 39-bus system show that the proposed method outperforms the existing methods in terms of prediction accuracy and uncertainty quantification capabilities. The explainability of the proposed method allows system operators to design preventive controls for enhancing system stability.

Bayesian Neural Network↗

Deploying MARTe2 and MDSplus for Scalable Real-Time Control Systems: A Proof-of-Concept for the SMART Tokamak

The SMART tokamak is a spherical tokamak with flexible shaping that will need a modular and high-performance real-time control system. This work presents the implementation and validation of the MARTe2 framework at the Princeton Plasma Physics Laboratory (PPPL) as a testbed for supporting SMART (University of Seville, Spain). The system integrates MARTe2, MDSplus for data archiving, and user datagram protocol (UDP)-based communication with both synthetic and physical devices. A deterministic control loop was developed using custom control algorithms, showing the system’s ability to operate under strict real-time constraints. The resulting framework is scalable, maintainable, and adaptable to experimental tokamaks like SMART.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Fast increased fidelity samplers for approximate Bayesian Gaussian process regression

Gaussian processes (GPs) are common components in Bayesian non-parametric models having a rich methodological literature and strong theoretical grounding. The use of exact GPs in Bayesian models is limited to problems containing several thousand observations due to their prohibitive computational demands. We develop a posterior sampling algorithm using H-matrix approximations that scales at O(n log 2 n). We show that this approximation’s Kullback-Leibler divergence to the true posterior can be made arbitrarily small. Though multidimensional GPs could be used with our algorithm, d-dimensional surfaces are modeled as tensor products of univariate GPs to minimize the cost of matrix construction and maximize computational efficiency. We illustrate the performance of this fast increased fidelity approximate GP, FIFA-GP, using both simulated and non-synthetic data sets

97 MATHEMATICS AND COMPUTING↗

Explicit Quantum Circuits for Block Encodings of Certain Sparse Matrices

Many standard linear algebra problems can be solved on a quantum computer by using recently developed quantum linear algebra algorithms that make use of block encodings and quantum eigenvalue/singular value transformations. A block encoding embeds a properly scaled matrix of interest A in a larger unitary transformation U that can be decomposed into a product of simpler unitaries and implemented efficiently on a quantum computer. Although quantum algorithms can potentially achieve exponential speedup in solving linear algebra problems compared to the best classical algorithm, such a gain in efficiency ultimately hinges on our ability to construct an efficient quantum circuit for the block encoding of A, which is difficult in general, and not trivial even for well structured sparse matrices. Here, in this paper, we give a few examples on how efficient quantum circuits can be explicitly constructed for some well structured sparse matrices and discuss a few strategies used in these constructions. We also provide implementations of these quantum circuits in MATLAB.

97 MATHEMATICS AND COMPUTING↗

Reducing Operator Complexity of Galerkin Coarse-grid Operators with Machine Learning

Here, we propose a data-driven and machine-learning-based approach to compute non-Galerkin coarse-grid operators in multigrid (MG) methods, addressing the well-known issue of increasing operator complexity. Guided by the MG theory on spectrally equivalent coarse-grid operators, we have developed novel machine learning algorithms that utilize neural networks combined with smooth test vectors from multigrid eigenvalue problems. The proposed method demonstrates promise in reducing the complexity of coarse-grid operators while maintaining overall MG convergence for solving parametric partial differential equation problems. Numerical experiments on anisotropic rotated Laplacian and linear elasticity problems are provided to showcase the performance and comparison with existing methods for computing non-Galerkin coarse-grid operators.

97 MATHEMATICS AND COMPUTING↗

A Shift Selection Strategy for Parallel Shift-invert Spectrum Slicing in Symmetric Self-consistent Eigenvalue Computation

The central importance of large-scale eigenvalue problems in scientific computation necessitates the development of massively parallel algorithms for their solution. Recent advances in dense numerical linear algebra have enabled the routine treatment of eigenvalue problems with dimensions on the order of hundreds of thousands on the world’s largest supercomputers. In cases where dense treatments are not feasible, Krylov subspace methods offer an attractive alternative due to the fact that they do not require storage of the problem matrices. However, demonstration of scalability of either of these classes of eigenvalue algorithms on computing architectures capable of expressing massive parallelism is non-trivial due to communication requirements and serial bottlenecks, respectively. In this work, we introduce the SISLICE method: a parallel shift-invert algorithm for the solution of the symmetric self-consistent field (SCF) eigenvalue problem. The SISLICE method drastically reduces the communication requirement of current parallel shift-invert eigenvalue algorithms through various shift selection and migration techniques based on density of states estimation and k-means clustering, respectively. This work demonstrates the robustness and parallel performance of the SISLICE method on a representative set of SCF eigenvalue problems and outlines research directions that will be explored in future work.

97 MATHEMATICS AND COMPUTING↗

Accurate and Accelerated Neuromorphic Network Design Leveraging A Bayesian Hyperparameter Pareto Optimization Approach

Neuromorphic systems allow for extremely efficient hardware implementations for neural networks (NNs). In recent years, several algorithms have been presented to train spiking NNs (SNNs) for neuromorphic hardware. However, SNNs often provide lower accuracy than their artificial NNs (ANNs) counterparts or require computationally expensive and slow training/inference methods. To close this gap, designers typically rely on reconfiguring SNNs through adjustments in the neuron/synapse model or training algorithm itself. Nevertheless, these steps incur significant design time, while still lacking the desired improvement in terms of training/inference times (latency). Designing SNNs that can mimic the accuracy of ANNs with reasonable training times is an exigent challenge in neuromorphic computing. In this work, we present an alternative approach that looks at such designs as an optimization problem rather than algorithm or architecture redesign. We develop a versatile multiobjective hyperparameter optimization (HPO) for automatically tuning HPs of two state-of-the-art SNN training algorithms, SLAYER and HYBRID. We emphasize that, to the best of our knowledge, this is the first work trying to improve SNNs’ computational efficiency, accuracy, and training time using an efficient HPO. We demonstrate significant performance improvements for SNNs on several datasets without the need to redesign or invent new training algorithms/architectures. Our approach results in more accurate networks with lower latency and, in turn, higher energy efficiency than previous implementations. In particular, we demonstrate improvement in accuracy and more than 5× reduction in the training/inference time for the SLAYER algorithm on the DVS Gesture dataset. In the case of HYBRID, we demonstrate 30% reduction in timesteps while surpassing the accuracy of the state-of-the-art networks on CIFAR10. Further, our analysis suggests that even a seemingly minor change in HPs could change the accuracy by 5 - 6×.

Parsa, Maryam↗

Weatherization Assistant NEAT/MHEA

The software provides a measure selection technique indicating cost effective retrofit activities that can be applied to a home using a standard Savings to Investment Ratio (SIR). Users must provide an input file describing the characteristics of the home to be evaluated. The software takes the input data provided and calculates energy savings and cost savings predicted for a standard set of measures given the input parameters. The Weatherization Assistant computes estimates of pre-retrofit whole building space heating and cooling energy consumptions based on the house description data supplied by the user. The consumptions are computed using a monthly heating and cooling variable base degree-day method by algorithms similar to those developed for the CIRA program [LBL, 1982]. The building consumptions are needed in computing the energy savings from measures affecting the efficiencies of the heating and cooling equipment. Weatherization Assistant then computes the energy savings and costs for each individual measure applicable to the building described as if it were the only measure installed in the house. From these energy savings, a discounted dollar savings over the life of each measure is computed. The ratio of this dollar savings to the cost of installing the measure, the "savings-to-investment ratio" (SIR), is used in an initial ranking of the measures' effectiveness. The "interacted" savings and SIR of measures are then determined assuming the measures are added to the house collectively, in order of their ranking, e.g., the second ranked measure is installed in the house initially described by the user after having been modified by the first ranked measure. If this second-ranked measure's updated SIR is greater than a user-defined limit, the measure is left implemented, else it is removed so that the next measure's effectiveness is not dependent on it. The choice between two mutually exclusive measures (such as different levels of insulation) is made on the basis of their "net present value" (NPV), the difference of life-time savings and installation cost, rather than their SIR. This has been shown to be the more correct criterion on which to base the selection between two measures, both of which cannot be installed. The audit computes and reports to the user the energy savings, discounted dollar savings, installation cost, and SIR for each measure considered cost-effective. For those with SIR greater than the user-designated cutoff, a materials list gives the material name, type, and quantity required for installation of the measure. Weatherization Assistant permits entry of pre-retrofit billing data for gas or electrically heated homes or homes with electric air-conditioning. The user may then make the decision to have the savings of the measures adjusted to reflect the difference in billed consumption and that predicted by the program.

Gettings, Michael↗

flifish

Identifying single molecules from fluorescence images obtained by a camera and obtain their location and intensity has many applications. We have developed an efficient mathematical algorithm for this task and translate it into computer software. Our algorithm are fast, stable and accurate comparing other programs to do the similar task. We have used our software in several scientific research areas, such as tracking receptors in live cells, super resolution fluorescence microscopy, and counting mRNA copies in cells.

Hu, Dehong↗

The Satellite Image Simulation Toolkit

The Satellite Image Simulation Toolkit (SatIST) is a python software package designed to generate diverse and realistic satellite imaging scenarios. It serves as a toolkit for simulating data that supports the development and testing of algorithms used in satellite detection, calibration, and characterization. SIST provides a suite of simulation tools that allow users to replicate various satellite observation conditions, including sidereal and target tracking. By enabling the creation of scenarios that mimic real-world satellite operations, SIST facilitates advancements in satellite image data processing and the study of satellite behavior under different observational parameters.

Perloff, AlexxS [Lawrence Livermore National Labor↗

Evaluating asynchronous Schwarz solvers on GPUs

With the commencement of the exascale computing era, we realize that the majority of the leadership supercomputers are heterogeneous and massively parallel. Even a single node can contain multiple co-processors such as GPUs and multiple CPU cores. For example, ORNL’s Summit accumulates six NVIDIA Tesla V100 GPUs and 42 IBM Power9 cores on each node. Synchronizing across compute resources of multiple nodes can be prohibitively expensive. Hence, it is necessary to develop and study asynchronous algorithms that circumvent this issue of bulk-synchronous computing. In this study, we examine the asynchronous version of the abstract Restricted Additive Schwarz method as a solver. We do not explicitly synchronize, but allow the communication between the sub-domains to be completely asynchronous, thereby removing the bulk synchronous nature of the algorithm. We accomplish this by using the one-sided Remote Memory Access (RMA) functions of the MPI standard. We study the benefits of using such an asynchronous solver over its synchronous counterpart. We also study the communication patterns governed by the partitioning and the overlap between the sub-domains on the global solver. Finally, we show that this concept can render attractive performance benefits over the synchronous counterparts even for a well-balanced problem.

Nayak, Pratik↗

Vector elastic deconvolution migration with dual wavefield decomposition

Here, we report elastic-wave imaging using multicomponent data can provide more useful subsurface information than acoustic-wave imaging, but it is usually algorithmically challenging. We have developed a vector elastic deconvolution migration method for high-resolution imaging of subsurface structures in isotropic and anisotropic elastic media. Our new method uses a vector deconvolution imaging condition based on dual wavefield decomposition, including an explicit directional wavefield separation using the Hilbert transform and a P/S vector wavefield decomposition using the low-rank decomposition method. Using three elastic models, we numerically determine that our new method produces notably higher resolution and more amplitude-balanced elastic images compared with a crosscorrelation-based vector elastic reverse time migration method.

58 GEOSCIENCES↗

Transmission Capacity Allocation in Zonal Electricity Markets

In this work, we propose a novel framework for modeling zonal electricity markets, based on projecting the constraints of the nodal network onto the space of the zonal aggregation of the network. The framework avoids circular definitions and discretionary parameters, which are recurrent in the implementation and study of zonal markets. Using this framework, we model and analyze two zonal market designs currently present in Europe: flow-based market coupling (FBMC) and available-transfer-capacity market coupling (ATCMC). We develop cutting-plane algorithms for simulating FBMC and ATCMC while accounting for the robustness of imports/exports to single element failures, and we conduct numerical simulations of FBMC and ATCMC on a realistic instance of the Central Western European system under the equivalent of 100 years of operating conditions. We find that FBMC and ATCMC are unable to anticipate the congestion of branches interconnecting zones and branches within zones and that both zonal designs achieve similar overall cost efficiencies (0.01% difference), whereas a nodal market design largely outperforms both of them (5.09% better than FBMC). These findings raise the question of whether it is worth it for more European countries to switch from ATCMC to FBMC, instead of advancing directly toward a nodal market design.

24 POWER TRANSMISSION AND DISTRIBUTION↗