Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized methods”

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,657 records · Page 92

Improving AIRS Radiance Spectra in High Contrast Scenes Using MODIS

The Atmospheric Infrared Sounder (AIRS) on the EOS Aqua Spacecraft was launched on May 4, 2002. AIRS acquires hyperspectral infrared radiances in 2378 channels ranging in wavelength from 3.7-15.4 microns with spectral resolution of better than 1200, and spatial resolution of 13.5 km with global daily coverage. The AIRS is designed to measure temperature and water vapor profiles for improvement in weather forecast accuracy and improved understanding of climate processes. As with most instruments, the AIRS Point Spread Functions (PSFs) are not the same for all detectors. When viewing a non-uniform scene, this causes a significant radiometric error in some channels that is scene dependent and cannot be removed without knowledge of the underlying scene. The magnitude of the error depends on the combination of non-uniformity of the AIRS spatial response for a given channel and the non-uniformity of the scene, but is typically only noticeable in about 1% of the scenes and about 10% of the channels. The current solution is to avoid those channels when performing geophysical retrievals. In this effort we use data from the Moderate Resolution Imaging Spectroradiometer (MODIS) instrument to provide information on the scene uniformity that is used to correct the AIRS data. For the vast majority of channels and footprints the technique works extremely well when compared to a Principal Component (PC) reconstruction of the AIRS channels. In some cases where the scene has high inhomogeneity in an irregular pattern, and in some channels, the method can actually degrade the spectrum. Most of the degraded channels appear to be slightly affected by random noise introduced in the process, but those with larger degradation may be affected by alignment errors in the AIRS relative to MODIS or uncertainties in the PSF. Despite these errors, the methodology shows the ability to correct AIRS radiances in non-uniform scenes under some of the worst case conditions and improves the ability to match AIRS and MODIS radiances in non-uniform scenes.

spatial↗

All-acrylic multigraft copolymer superelastomers

Thermoplastic elastomer compositions comprising acrylic multigraft copolymers are described. The multigraft copolymers comprise a rubbery polyacrylate backbone and a plurality of randomly spaced glassy polyacrylate side chains. The multigraft copolymers can be prepared using a facile grafting through method that can provide copolymers with enhanced purity. The acrylic multigraft copolymers exhibit microphase separated morphologies and “superelastomeric” properties, including an elongation at break, stress at break, and/or strain recovery behavior that exceeds that of conventional triblock copolymer polyacrylate thermoplastic elastomers.

Mays, Jimmy W.↗

Sampling Size Optimization for Bioburden Density Estimation in Planetary Protection

Planetary protection (PP) is a discipline that focuses on minimizing the biological contamination of spacecraft to ensure compliance with international policy. Precise estimation of bioburden - the total number of microbes in or on spacecraft hardware – and the bioburden density are of utmost importance for PP. Such estimation is the way concordance with requirements is demonstrated, and it is critical for quantifying the potential risk of inadvertently contaminating other planetary bodies. Although a suite of molecular techniques have been used to thoroughly characterize and profile the microbiome of various cleanroom environments and spacecraft, the gold standard remains the physical enumeration of microbes via culturing of samples directly taken from spacecraft and associated surfaces. However, due to technical, budgetary, and programmatic constraints, only a manageable portion (around 10%) of the entire spacecraft surface is directly sampled with cotton swabs or wipes. To generate the bioburden current best estimate (CBE) for components not directly verifiable, the accepted approach is to apply a NASA-defined bioburden estimate based on the components’ manufacturing or assembly environment. This approach utilizes a prespecified bioburden density estimation that applies a maximum value across the total surface area of the specified component. For hardware components that underwent similar assembly processes, an implied bioburden is adopted for all components, based on a direct verification of a representative component within the same lot. Once all components have a CBE, the bioburden estimates are generated. In previous publication [ 1], we have shown that statistical risks quantifying the accuracy of the estimates for sampled, prespecified, and implied components can be derived and ranked. For mean squared error (MSE) function, the risks are available analytically and hence a cost function can be obtained to optimize the risks with respect to the sampling area and sampling cost. Since the sampling area and sampling cost are two complimentary variables, their sum will have a well-defined minimum. This paper presents the multivariate optimization of the integrated risk of an empirical Bayes estimator to determine the optimal sampling schedule for a given number of components. It is assumed that given a number of components, N, the bioburden density for each component can either be sampled, implied, or prespecified. The multivariate optimization searches through different options to sample, imply or prespecify the bioburden density for a component, and account for the component’s surface area and cost of sampling. The idea of the optimization is based on the observation that the statistical risk of using an estimator is a monotonically decreasing function of the sampled area. The larger the sampled area, the lower the risk of using the estimator as the estimator becomes more and more accurate as the sampling area increases. On the other hand, the cost of sampling is monotonically increasing as the sampled surface grows. This makes the risk and total cost of sampling complimentary variables which can be counterbalanced to achieve an optimal overall value with respect to the sampled surface. In this paper, the integrated risk has been used to quantify the accuracy of the estimator. This risk has been selected because it depends on neither the true value of the parameter nor on the collected data. The cost of each sample was also available to obtain the total cost of sampling of N components. The paper will present the results based on computer-simulated data as well as the data collected during the InSight mission. The computer-simulated data have N components with randomly generated total areas and each component assigned to one of the three categories according to the method of estimating of bioburden density: sampled, implied, or prespecified. The cost of sampling is also available. The cost of sampling is estimated based on a cost model provided by the planetary protection group at JPL. For this paper, the overall cost was assumed to be a linear function of exposure. The optimization process finds the allocation of the components to the three categories that minimizes the tradeoff between integrated risk and total cost. For the InSight data, a set of components is selected representing all three categories, and optimization is performed to determine if the performed allocation was optimal or if a better allocation could have been obtained. To the best of our knowledge, this work is the first attempt not only perform an accurate estimation of bioburden density but also do it in an optimal way.

97 - MATHEMATICS AND COMPUTING↗

An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians

In this study, we consider solving nonlinear optimization problems with a stochastic objective and deterministic equality constraints. We assume for the objective that its evaluation, gradient, and Hessian are inaccessible, while one can compute their stochastic estimates by, for example, subsampling. We propose a stochastic algorithm based on sequential quadratic programming (SQP) that uses a differentiable exact augmented Lagrangian as the merit function. To motivate our algorithm design, we first revisit and simplify an old SQP method Lucidi developed for solving deterministic problems, which serves as the skeleton of our stochastic algorithm. Based on the simplified deterministic algorithm, we then propose a non-adaptive SQP for dealing with stochastic objective, where the gradient and Hessian are replaced by stochastic estimates but the stepsizes are deterministic and prespecified. Finally, we incorporate a recent stochastic line search procedure Paquette and Scheinberg into the non-adaptive stochastic SQP to adaptively select the random stepsizes, which leads to an adaptive stochastic SQP. The global "almost sure" convergence for both non-adaptive and adaptive SQP methods is established. Numerical experiments on nonlinear problems in CUTEst test set demonstrate the superiority of the adaptive algorithm.

97 MATHEMATICS AND COMPUTING↗

Combining biomarker and virus phylogenetic models improves HIV-1 epidemiological source identification

To identify and stop active HIV transmission chains new epidemiological techniques are needed. Here, we describe the development of a multi-biomarker augmentation to phylogenetic inference of the underlying transmission history in a local population. HIV biomarkers are measurable biological quantities that have some relationship to the amount of time someone has been infected with HIV. To train our model, we used five biomarkers based on real data from serological assays, HIV sequence data, and target cell counts in longitudinally followed, untreated patients with known infection times. The biomarkers were modeled with a mixed effects framework to allow for patient specific variation and general trends, and fit to patient data using Markov Chain Monte Carlo (MCMC) methods. Subsequently, the density of the unobserved infection time conditional on observed biomarkers were obtained by integrating out the random effects from the model fit. This probabilistic information about infection times was incorporated into the likelihood function for the transmission history and phylogenetic tree reconstruction, informed by the HIV sequence data. To critically test our methodology, we developed a coalescent-based simulation framework that generates phylogenies and biomarkers given a specific or general transmission history. Testing on many epidemiological scenarios showed that biomarker augmented phylogenetics can reach 90% accuracy under idealized situations. Under realistic within-host HIV-1 evolution, involving substantial within-host diversification and frequent transmission of multiple lineages, the average accuracy was at about 50% in transmission clusters involving 5–50 hosts. Realistic biomarker data added on average 16 percentage points over using the phylogeny alone. Using more biomarkers improved the performance. Shorter temporal spacing between transmission events and increased transmission heterogeneity reduced reconstruction accuracy, but larger clusters were not harder to get right. More sequence data per infected host also improved accuracy. We show that the method is robust to incomplete sampling and that adding biomarkers improves reconstructions of real HIV-1 transmission histories. The technology presented here could allow for better prevention programs by providing data for locally informed and tailored strategies.

60 APPLIED LIFE SCIENCES↗

Sensitivity Enhancement and Random Telegraph Noise in Magnetic Tunnel Junctions with Compensated Anisotropy

We demonstrate the manipulation of perpendicular magnetic anisotropy (PMA) in magnetic tunnel junctions (MTJs) by varying the layer stacks and temperature. PMA is tuned to compensate the shape anisotropy, giving a nonhysteretic magnetic response, a noteworthy sensitivity enhancement, and a field detectability of 1.8 nT/$\sqrt{Hz}$ at 100 kHz. Such a method is further exemplified in multiple MTJs, providing a solution to obtain desired sensitivities and operating temperatures. Additionally, the electronic noise of this MTJ is revealed as a random telegraph noise (RTN) due to a generation-recombination process. In conclusion, the observed voltage-dependent RTN could potentially be applied to true random number generators.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Monte-Carlo Method of Calculating Weakly Coupled Systems Using the PRIZMA-DSP Code

A Monte Carlo method implemented in the PRIZMA-DSP code to calculate multiplying systems, including weakly coupled systems, is described. In the code, the basis of the method is a sequential calculation of a prescribed chain of active generations, which is described by, first and foremost, the dominant ratio of the system. The fission points of the running generation serve as a source for constructing neutron trajectories, new fission points arising on a trajectory are transmitted unchanged to calculate the next generation, and so on. In the calculation of the active generation, K{sub eff} and made-to-order linear-fractional functions are evaluated. In order for the distribution to become established, a passive calculation with prescribed chain length is made before the active calculation. In addition, after the calculation of each generation the operation of random mixing of the entire set of fission points and their distribution over the nuclei is performed in order to obtain a uniform distribution. At the start of the calculation, a special rejection procedure performs a pre-set number of preliminary computational iterations so that an arbitrary zeroth distribution over all nuclei goes to a distribution obtained via a characteristic function.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

An Evaluation of Timely Communications Access Methods Using NASA Space Network

There is a growing interest among scientists to coordinate diverse and temporally responsive measurements from multiple space and ground-based observatories in order to obtain greater insights into transient scientific events than would otherwise be possible. Many transient scientific events of interest occur randomly and the scientific value of follow-up observations decays with time. As a result, transient science operations among distributed observatories require timely access to communications network services. This paper develops two complimentary methods to improve users’ network access timeliness using the NASA Space Network (SN). Descriptive models of each method are developed using Systems Modeling Language. Pathfinder experiments are designed and executed. Suitability of the methods is discussed in light of the experimental results. Innovative applications of the methods are presented. This research establishes that the as-built SN systems have adequate capabilities and capacity to support infusion of the methods to current and future users with emergent time-sensitive service needs. The minimum service access wait time was determined to be approximately 10 min and is achievable 84% of the time. An average access wait time of approximately 14 min is expected when SN resource blocking occurs. A roadmap to improve SN access timeliness is presented.

Space Communications and Navigation↗

Acquisition of STEM Images by Adaptive Compressive Sensing

Compressive Sensing (CS) allows a signal to be sparsely measured first and accurately recovered later in software [1]. In scanning transmission electron microscopy (STEM), it is possible to compress an image spatially by reducing the number of measured pixels, which decreases electron dose and increases sensing speed [2,3,4]. The two requirements for CS to work are: (1) sparsity of basis coefficients and (2) incoherence of the sensing system and the representation system. However, when pixels are missing from the image, it is difficult to have an incoherent sensing matrix. Nevertheless, dictionary learning techniques such as Beta-Process Factor Analysis (BPFA) [5] are able to simultaneously discover a basis and the sparse coefficients in the case of missing pixels. On top of CS, we would like to apply active learning [6,7] to further reduce the proportion of pixels being measured, while maintaining image reconstruction quality. Suppose we initially sample 10% of random pixels. We wish to select the next 1% of pixels that are most useful in recovering the image. Now, we have 11% of pixels, and we want to decide the next 1% of “most informative” pixels. Active learning methods are online and sequential in nature. Our goal is to adaptively discover the best sensing mask during acquisition using feedback about the structures in the image. In the end, we hope to recover a high quality reconstruction with a dose reduction relative to the non-adaptive (random) sensing scheme. In doing this, we try three metrics applied to the partial reconstructions for selecting the new set of pixels: (1) variance, (2) Kullback-Leibler (KL) divergence using a Radial Basis Function (RBF) kernel, and (3) entropy. Figs. 1 and 2 display the comparison of Peak Signal-to-Noise (PSNR) using these three different active learning methods at different percentages of sampled pixels. At 20% level, all the three active learning methods underperform the original CS without active learning. However, they all beat the original CS as more of the “most informative” pixels are sampled. One can also argue that CS equipped with active learning requires less sampled pixels to achieve the same value of PSNR than CS with pixels randomly sampled, since all the three PSNR curves with active learning grow at a faster pace than that without active learning. For this particular STEM image, by observing the reconstructed images and the sensing masks, we find that while the method based on RBF kernel acquires samples more uniformly, the one on entropy samples more areas of significant change, thus less uniformly. The KL-divergence method performs the best in terms of reconstruction error (PSNR) for this example [8].

Xie, Weiyi↗

A Review of Spectral Methods for Variable Amplitude Fatigue Prediction and New Results

A comprehensive review of the available methods for estimating fatigue damage from variable amplitude loading is presented. The dependence of fatigue damage accumulation on power spectral density (psd) is investigated for random processes relevant to real structures such as in offshore or aerospace applications. Beginning with the Rayleigh (or narrow band) approximation, attempts at improved approximations or corrections to the Rayleigh approximation are examined by comparison to rainflow analysis of time histories simulated from psd functions representative of simple theoretical and real world applications. Spectral methods investigated include corrections by Wirsching and Light, Ortiz and Chen, the Dirlik formula, and the Single-Moment method, among other more recent proposed methods. Good agreement is obtained between the spectral methods and the time-domain rainflow identification for most cases, with some limitations. Guidelines are given for using the several spectral methods to increase confidence in the damage estimate.

Larsen, Curtis E.↗

Missing Data and Multiple Imputation: An Unbiased Approach

The default method of dealing with missing data in statistical analyses is to only use the complete observations (complete case analysis), which can lead to unexpected bias when data do not meet the assumption of missing completely at random (MCAR). For the assumption of MCAR to be met, missingness cannot be related to either the observed or unobserved variables. A less stringent assumption, missing at random (MAR), requires that missingness not be associated with the value of the missing variable itself, but can be associated with the other observed variables. When data are truly MAR as opposed to MCAR, the default complete case analysis method can lead to biased results. There are statistical options available to adjust for data that are MAR, including multiple imputation (MI) which is consistent and efficient at estimating effects. Multiple imputation uses informing variables to determine statistical distributions for each piece of missing data. Then multiple datasets are created by randomly drawing on the distributions for each piece of missing data. Since MI is efficient, only a limited number, usually less than 20, of imputed datasets are required to get stable estimates. Each imputed dataset is analyzed using standard statistical techniques, and then results are combined to get overall estimates of effect. A simulation study will be demonstrated to show the results of using the default complete case analysis, and MI in a linear regression of MCAR and MAR simulated data. Further, MI was successfully applied to the association study of CO2 levels and headaches when initial analysis showed there may be an underlying association between missing CO2 levels and reported headaches. Through MI, we were able to show that there is a strong association between average CO2 levels and the risk of headaches. Each unit increase in CO2 (mmHg) resulted in a doubling in the odds of reported headaches.

Foy, M.↗

The crystal structure of dGTPase reveals the molecular basis of dGTP selectivity

Deoxynucleotide triphosphohydrolases (dNTPases) play a critical role in cellular survival and DNA replication through the proper maintenance of cellular dNTP pools. While the vast majority of these enzymes display broad activity toward canonical dNTPs, such as the dNTPase SAMHD1 that blocks reverse transcription of retroviruses in macrophages by maintaining dNTP pools at low levels, Escherichia coli ( Ec )-dGTPase is the only known enzyme that specifically hydrolyzes dGTP. However, the mechanism behind dGTP selectivity is unclear. Here we present the free-, ligand (dGTP)- and inhibitor (GTP)-bound structures of hexameric Ec- dGTPase, including an X-ray free-electron laser structure of the free Ec- -dGTPase enzyme to 3.2 Å. To obtain this structure, we developed a method that applied UV-fluorescence microscopy, video analysis, and highly automated goniometer-based instrumentation to map and rapidly position individual crystals randomly located on fixed target holders, resulting in the highest indexing rates observed for a serial femtosecond crystallography experiment. Our structures show a highly dynamic active site where conformational changes are coupled to substrate (dGTP), but not inhibitor binding, since GTP locks dGTPase in its apo- form. Moreover, despite no sequence homology, Ec- dGTPase and SAMHD1 share similar active-site and HD motif architectures; however, Ec- dGTPase residues at the end of the substrate-binding pocket mimic Watson–Crick interactions providing guanine base specificity, while a 7-Å cleft separates SAMHD1 residues from dNTP bases, abolishing nucleotide-type discrimination. Furthermore, the structures shed light on the mechanism by which long distance binding (25 Å) of single-stranded DNA in an allosteric site primes the active site by conformationally “opening” a tyrosine gate allowing enhanced substrate binding.

Barnes, Christopher O.↗

Metalearners for estimating heterogeneous treatment effects using machine learning

There is growing interest in estimating and analyzing heterogeneous treatment effects in experimental and observational studies. We describe a number of metaalgorithms that can take advantage of any supervised learning or regression method in machine learning and statistics to estimate the conditional average treatment effect (CATE) function. Metaalgorithms build on base algorithms—such as random forests (RFs), Bayesian additive regression trees (BARTs), or neural networks—to estimate the CATE, a function that the base algorithms are not designed to estimate directly. We introduce a metaalgorithm, the X-learner, that is provably efficient when the number of units in one treatment group is much larger than in the other and can exploit structural properties of the CATE function. For example, if the CATE function is linear and the response functions in treatment and control are Lipschitz-continuous, the X-learner can still achieve the parametric rate under regularity conditions. We then introduce versions of the X-learner that use RF and BART as base learners. In extensive simulation studies, the X-learner performs favorably, although none of the metalearners is uniformly the best. In two persuasion field experiments from political science, we demonstrate how our X-learner can be used to target treatment regimes and to shed light on underlying mechanisms. A software package is provided that implements our methods.

42 ENGINEERING↗

Superspin renormalization and slow relaxation in random spin systems

We develop an excited-state real-space renormalization group (RSRG-X) formalism to describe the dynamics of conserved densities in randomly interacting spin-12 systems. Our formalism is suitable for systems with U(1) and Z2 symmetries, and we apply it to chains of randomly positioned spins with dipolar XX+YY interactions, as arise in Rydberg quantum simulators and other platforms. The formalism generates a sequence of effective Hamiltonians that provide approximate descriptions for dynamics on successively smaller energy scales. These effective Hamiltonians involve “superspins”: two-level collective degrees of freedom constructed from (anti)aligned microscopic spins. Conserved densities can then be understood as relaxing via coherent collective spin flips. For the well-studied simpler case of randomly interacting nearest-neighbor XX+YY chains, the superspins reduce to single spins. Our formalism also leads to a numerical method capable of simulating the dynamics up to an otherwise inaccessible combination of large system size and late time. Focusing on disorder-averaged infinite-temperature autocorrelation functions, in particular the spin survival probability Sp¯(t), we demonstrate quantitative agreement between our algorithm and exact diagonalization (ED) at low but nonzero frequencies. Such agreement holds for chains with nearest-neighbor, next-nearest-neighbor, and long-range dipolar interactions. Our results indicate decay of Sp¯(t) slower than any power law and feature no significant deviation from the ∼1/ln2(t) asymptote expected from the infinite-randomness fixed-point of the nearest-neighbor model. We also apply the RSRG-X formalism to two-dimensional long-range systems of moderate size and find slow late-time decay of Sp¯(t).

Zhao, Yi J↗

Shadow Distillation: Quantum Error Mitigation with Classical Shadows for Near-Term Quantum Processors

Mitigating errors in quantum information processing devices is especially important in the absence of fault tolerance. An effective method in suppressing state-preparation errors is using multiple copies to distill the ideal component from a noisy quantum state. Here, we use classical shadows and randomized measurements to circumvent the need for coherent access to multiple copies at an exponential cost. We study the scaling of resources using numerical simulations and find that the overhead is still favorable compared to full state tomography. We optimize measurement resources under realistic experimental constraints and apply our method to an experiment preparing a Greenberger-Horne-Zeilinger state with trapped ions. In addition to improving stabilizer measurements, the analysis of the improved results reveals the nature of errors affecting the experiment. Hence, our results provide a directly applicable method for mitigating errors in near-term quantum computers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient Stochastic Inversion Using Adjoint Models and Kernel-PCA

Performing stochastic inversion on a computationally expensive forward simulation model with a high-dimensional uncertain parameter space (e.g. a spatial random field) is computationally prohibitive even with gradient information provided. Moreover, the ‘nonlinear’ mapping from parameters to observables generally gives rise to non-Gaussian posteriors even with Gaussian priors, thus hampering the use of efficient inversion algorithms designed for models with Gaussian assumptions. In this work, we propose a novel Bayesian stochastic inversion methodology, characterized by a tight coupling between a gradient-based Langevin Markov Chain Monte Carlo (LMCMC) method and a kernel principal component analysis (KPCA). This approach addresses the ‘curse-of-dimensionality’ via KPCA to identify a low-dimensional feature space within the high-dimensional and nonlinearly correlated spatial random field. Moreover, non-Gaussian full posterior probability distribution functions are estimated via an efficient LMCMC method on both the projected low-dimensional feature space and the recovered high-dimensional parameter space. We demonstrate this computational framework by integrating and adapting recent developments such as data-driven statistics-on-manifolds constructions and reduction-through-projection techniques to solve inverse problems in linear elasticity.

97 MATHEMATICS AND COMPUTING↗

Surrogate Hessian accelerated structural optimization for stochastic electronic structure theories

In this work, we present an efficient energy-based method for structural optimization with stochastic electronic structure theories, such as diffusion quantum Monte Carlo (DMC). This method is based on robust line-search energy minimization in reduced parameter space, exploiting approximate but accurate Hessian information from a surrogate theory, such as density functional theory. The surrogate theory is also used to characterize the potential energy surface, allowing for simple but reliable ways to maximize statistical efficiency while retaining controllable accuracy. We demonstrate the method by finding the minimum DMC energy structures of the selected flake-like aromatic molecules, such as benzene, coronene, and ovalene, represented by 2, 6, and 19 structural parameters, respectively. In each case, the energy minimum is found within two parallel line-search iterations. The method is near-optimal for a line-search technique and suitable for a broad range of applications. It is easily generalized to any electronic structure method where forces and stresses are still under active development and implementation, such as diffusion Monte Carlo, auxiliary-field Monte Carlo, and stochastic configuration interaction, as well as deterministic approaches such as the random-phase approximation. Accurate and efficient means of geometry optimization could shed light on a broad class of materials and molecules, showing high sensitivity of induced properties to structural variables.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Disorder Enhanced Thermalization in Interacting Many-Particle System

We introduce an extension of the non-equilibrium dynamical mean field theory to incorporate the effects of static random disorder in the dynamics of a many-particle system by integrating out different disorder configurations resulting in an effective time-dependent density-density interaction. We use this method to study the non-equilibrium transient dynamics of a system described by the Fermi Anderson-Hubbard model following an interaction and disorder quench. The method recovers the solution of the disorder-free case for which the system exhibits qualitatively distinct dynamical behaviors in the weak-coupling (prethermalization) and strong-coupling regimes (collapse-and-revival oscillations). However, we find that weak random disorder promotes thermalization. In the weak coupling regime, the jump in the quasiparticle weight in the prethermal regime is suppressed by random disorder while in the strong-coupling regime, random disorder reduces the amplitude of the quasiparticle weight oscillations. These results highlight the importance of disorder in the dynamics of realistic many-particle systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗