Practical implementations of speckle-based phase-retrieval methods in Python and GPU for tomography
Explore the source record for details and available documents.
SEARCH · Engineering Papers
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.
Explore the source record for details and available documents.
Identifying core taxa in microbial ecology highlights groups likely to participate in a broad range of potential ecological interactions. Here, we present BRCore, an R package to identify core taxa using abundance-occupancy distributions and beta-diversity contributions across ecological niches, and predict stochastic and deterministic taxa.
We focus on learning unknown dynamics from data using ODE-nets templated on implicit numerical initial value problem solvers. First, we perform inverse modified error analysis of the ODE-nets using unrolled implicit schemes for ease of interpretation. It is shown that training an ODE-net using an unrolled implicit scheme returns a close approximation of an inverse modified differential equation (IMDE). In addition, we establish a theoretical basis for hyperparameter selection when training such ODE-nets, whereas current strategies usually treat numerical integration of ODE-nets as a black box. We thus formulate an adaptive algorithm which monitors the level of error and adapts the number of (unrolled) implicit solution iterations during the training process, so that the error of the unrolled approximation is less than the current learning loss. This helps accelerate training while maintaining accuracy. Several numerical experiments are performed to demonstrate the advantages of the proposed algorithm compared to nonadaptive unrollings and validate the theoretical analysis. Here, we also note that this approach naturally allows for incorporating partially known physical terms in the equations, giving rise to what is termed “gray box” identification.
Explore the source record for details and available documents.
Abstract not provided.
Explore the source record for details and available documents.
As the search for improved and next-generation cathodes continues, it is clear that a deeper understanding of synthesis–structure–electrochemical property relationships is of critical importance. The effects of primary and secondary particle morphologies on various transition metal oxides have been studied, but new findings are still being reported. To date, few studies have focused on the effects of particle morphologies on Li- and Mn-rich oxides (>50% Mn) and even fewer studies have focused on the influence over key properties such as electrode-level impedance. In this study, we report the effects of particle morphologies on the area-specific-impedance (ASI) and thermal behavior of Li- and Mn-rich oxides. Samples with a fixed, layered–layered–spinel (LLS), composition were synthesized with differing primary morphologies and tested under standardized, full-cell protocols. The results suggest that smaller primary particle size (i.e., higher surface area) leads to lower overall ASI, a delay in the increasing impedance at low states-of-charge (SOCs), and surprisingly, improved thermal behavior.
The project that developed this is unclassified, with the mandate to produce open source code. This code computes the hitting time moments of a graph using a linear algebra configuration. The goal of this work is to explore the performance capabilities of the Chapel programming language. Toward that end, we generate random adjacency matrices which represent a random graph. The code can also read in an adjacency matrix from a file. The main computation is the Conjugate Gradient method.SAND2020-12651 M. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.
PNNL has developed an innovative cable testing system that leverages the Xilinx RF System-on-Chip (RFSoC) technology to create a more flexible and capable measurement tool than traditional approaches. The architecture is designed on the ZCU111 development board and takes advantage of the high-speed digital to analog converters (DAC) and analog to digital converters (ADC) to generate and capture digitally synthesized waveforms. The platform allows engineers to easily adjust power, frequency, duration and modulation on the fly rather than being locked into fixed hardware configurations
The terrain-following coordinate system used by many atmospheric models can cause numerical instabilities due to discretization errors as resolved terrain slopes increase and the grid becomes highly skewed. The immersed boundary (IB) method, which does not require the grid to conform to the terrain, has been shown to alleviate these errors, and has been used successfully for high-resolution atmospheric simulations over steep terrain, including vertical building surfaces. Since many previous applications of IB methods to atmospheric models have used very fine grid resolution (5 m or less), the present study seeks to evaluate IB method performance over a range of grid resolutions and aspect ratios. Two classes of IB algorithms, velocity reconstruction and shear stress reconstruction, are tested within the common framework of the Weather Research and Forecasting (WRF) Model. Performance is evaluated in two test cases, one with flat terrain and the other with the topography of Askervein Hill, both under neutrally stratified conditions. WRF-IB results are compared to similarity theory, observations, and native WRF results. Despite sensitivity to the location at which the IB intersects the model grid, the velocity reconstruction IB method shows consistent performance when used with a hybrid RANS/LES surface scheme. The shear stress reconstruction IB method is not sensitive to the grid intersection, but is less consistent and near-surface velocity errors can occur at coarse resolutions. This study represents an initial investigation of IB method variability across grid resolutions in WRF. Future work will focus on improving IB method performance at intermediate to coarse resolutions.
To model material ductile failure and crack propagation, cohesive zone elements can be embedded along potential fracture paths in a finite element simulation. When damage criteria are met, elements in the mesh decohere, simulating the formation and propagation of a crack. In this paper, we present a novel computational algorithm based on finite deformation theory, essential to modeling crack initiation and growth in solids undergoing large deformations. This new algorithm was formulated within a Lagrangian frame of reference to extend previous cohesive zone algorithms to include modeling crack growth in finite deformation contexts. The local coordinate system, necessary for defining an embedded cohesive zone, is constructed based upon the current configuration and is updated within the nonlinear iteration process, thereby resulting in the convergence of the solution for a growing crack in a large deformation quasi-static setting. The model’s accuracy was demonstrated by comparing finite element model simulation results with the analytic case of a constant surface separation, as shown in the verification examples. The power and efficacy of the algorithm to capture large deformations during crack growth were then demonstrated with a double cantilever beam example case. It indicates that the model can be applied to a variety of physical circumstances for predicting crack initiation and growth with delamination and fracture.
Explore the source record for details and available documents.
Abstract Large-scale high performance computing (HPC) systems typically consist of many thousands of CPUs and storage units used by hundreds to thousands of users simultaneously. Applications from large numbers of users have diverse characteristics, such as varying computation, communication, memory, and I/O intensity. A good understanding of the performance characteristics of each user application is important for job scheduling and resource provisioning. Among these performance characteristics, I/O performance is becoming increasingly important as data sizes rapidly increase and large-scale applications, such as simulation and model training, are widely adopted. However, predicting I/O performance is difficult because I/O systems are shared among all users and involve many layers of software and hardware stack, including the application, network interconnect, operating system, file system, and storage devices. Furthermore, updates to these layers and changes in system management policy can significantly alter the I/O behavior of applications and the entire system. To improve the prediction of the I/O performance on HPC systems, we propose integrating information from several different system logs and developing a regression-based approach to predict the I/O performance. Our proposed scheme can dynamically select the most relevant features from the log entries using various feature selection algorithms and scoring functions, and can automatically select the regression algorithm with the best accuracy for the prediction task. The evaluation results show that our proposed scheme can predict the write performance with up to 90% prediction accuracy and the read performance with up to 99% prediction accuracy using the real logs from the Cori supercomputer system at NERSC.
An efficient and accurate approach for calculating exact exchange and other two-electron integrals has been developed for periodic electronic structure methods. Traditional approaches used for integrating over the Brillouin zone in band structure calculations, e.g. trapezoidal or Monkhorst-Pack, are not accurate enough for two-electron integrals. This is because their integrands contain multiple singularities over the double integration of the Brillouin zone, which with simple integration methods lead to very inaccurate results. A common approach to this problem has been to replace the Coulomb interaction with a screened Coulomb interaction that removes singularities from the integrands in the two-electron integrals, albeit at the inelegance of having to introduce a screening factor which must precomputed or guessed. Instead of introducing screened Coulomb interactions in an ad hoc way, the method developed in this work derives an effective screened potential using a Filon-like integration approach that is based only on the lattice parameters. This approach overcomes the limitations of traditionally defined screened Coulomb interactions for calculating two-electron integrals, and makes chemistry many-body calculations tractable in periodic boundary conditions. This method has been applied to several systems for which conventional DFT methods do not work well, including the reaction pathways for the addition of H 2 to phenol and Au$^{–}_{20}$ nanoparticle, and the electron transfer of a charge trapped state in the Fe(II) containing mica, annite.
Here we propose a decomposition algorithm for multistage stochastic programming that resembles the progressive hedging method of Rockafellar and Wets but is provably capable of several forms of asynchronous operation. We derive the method from a class of projective operator splitting methods fairly recently proposed by Combettes and Eckstein, significantly expanding the known applications of those methods. Our derivation assures convergence for convex problems whose feasible set is compact, subject to some standard regularity conditions and a mild “fairness” condition on subproblem selection. The method’s convergence guarantees are deterministic and do not require randomization, in contrast to other proposed asynchronous variations of progressive hedging. Computational experiments described in an online appendix show the method to outperform progressive hedging on large-scale problems in a highly parallel computing environment.
Explore the source record for details and available documents.