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 667 records · Page 37
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

A two dimensional power spectral estimate for some nonstationary processes

A two dimensional estimate for the power spectral density of a nonstationary process is being developed. The estimate will be applied to helicopter noise data which is clearly nonstationary. The acoustic pressure from the isolated main rotor and isolated tail rotor is known to be periodically correlated (PC) and the combined noise from the main and tail rotors is assumed to be correlation autoregressive (CAR). The results of this nonstationary analysis will be compared with the current method of assuming that the data is stationary and analyzing it as such. Another method of analysis is to introduce a random phase shift into the data as shown by Papoulis to produce a time history which can then be accurately modeled as stationary. This method will also be investigated for the helicopter data. A method used to determine the period of a PC process when the period is not know is discussed. The period of a PC process must be known in order to produce an accurate spectral representation for the process. The spectral estimate is developed. The bias and variability of the estimate are also discussed. Finally, the current method for analyzing nonstationary data is compared to that of using a two dimensional spectral representation. In addition, the method of phase shifting the data is examined.

Smith, Gregory L.↗
DOE OSTI2025

Randomized Algorithms for Low-Rank Matrix and Tensor Decompositions

This paper surveys randomized algorithms in numerical linear algebra for low-rank decompositions of matrices and tensors. The survey begins with a review of classical matrix algorithms that can be accelerated by randomized dimensionality reduction, such as the singular value decomposition (SVD) or interpolative (ID) and CUR decompositions. Recent advances in randomized dimensionality reduction are discussed, including new methods of fast matrix sketching and sampling techniques, which are incorporated into classical matrix algorithms for fast low-rank matrix approximations. The extension of randomized matrix algorithms to tensors is then explored for several low-rank tensor decompositions in the CP and Tucker formats, including the higher-order SVD, ID, and CUR decomposition.

Pearce, Katherine J. [The University of Texas at A↗
DOE OSTI2019

Evaluating Optimization Strategies for Engine Simulations Using Machine Learning Emulators

This work evaluates different optimization algorithms for computational fluid dynamics (CFD) simulations of engine combustion. Due to the computational expense of CFD simulations, emulators built with machine learning algorithms were used as surrogates for the optimizers. Two types of emulators were used: a Gaussian process (GP) and a weighted variety of machine learning methods called SuperLearner (SL). The emulators were trained using a dataset of 2048 CFD simulations that were run concurrently on a supercomputer. The design of experiments (DOE) for the CFD runs was obtained by perturbing nine input parameters using a Monte-Carlo method. The CFD simulations were of a heavy duty engine running with a low octane gasoline-like fuel at a partially premixed compression ignition mode. Ten optimization algorithms were tested, including types typically used in research applications. Each optimizer was allowed 800 function evaluations and was randomly tested 100 times. The optimizers were evaluated for the median, minimum, and maximum merits obtained in the 100 attempts. Some optimizers required more sequential evaluations, thereby resulting in longer wall clock times to reach an optimum. The best performing optimization methods were particle swarm optimization (PSO), differential evolution (DE), GENOUD (an evolutionary algorithm), and micro-genetic algorithm (GA). These methods found a high median optimum as well as a reasonable minimum optimum of the 100 trials. Moreover, all of these methods were able to operate with less than 100 successive iterations, which reduced the wall clock time required in practice. Two methods were found to be effective but required a much larger number of successive iterations: the DIRECT and MALSCHAINS algorithms. A random search method that completed in a single iteration performed poorly in finding optimum designs but was included to illustrate the limitation of highly concurrent search methods. The last three methods, Nelder–Mead, bound optimization by quadratic approximation (BOBYQA), and constrained optimization by linear approximation (COBYLA), did not perform as well.

Probst, Daniel M.↗
DOE OSTI2025

Microscopic calculations with noniterative finite amplitude methods and the application to neutron radiative captures and inelastic scatterings

We derive the fully self-consistent quasiparticle random-phase approximation (QRPA) equations with noniterative finite amplitude methods and calculate the transition strengths of giant resonances. Then, we apply the QRPA results to both neutron radiative capture calculations based on the statistical Hauser-Feshbach theory and inelastic scattering calculations based on distorted-wave Born approximation (DWBA). We compare the calculated results with available experimental data and demonstrate how our approach can reproduce giant resonances and various nuclear reactions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Random strain induced correlations in materials with intertwined nematic and magnetic orders

Electronic nematicity is rarely observed as an isolated instability of a correlated electron system. Instead, in iron pnictides and in certain cuprates and heavy-fermion materials, nematicity is intertwined with an underlying spin-stripe or charge-stripe state. As a result, random strain, ubiquitous in any real crystal, creates both random-field disorder for the nematic degrees of freedom and random-bond disorder for the spin or charge ones. Here, we put forward an Ashkin-Teller model with random Baxter fields to capture the dual role of random strain in nematic systems for which nematicity is a composite order arising from a stripe state. Using Monte Carlo to simulate this random Baxter-field model, we find not only the expected break-up of the system into nematic domains, but also the emergence of nontrivial disorder-promoted magnetic correlations. Such correlations enhance and tie up the fluctuations associated with the two degenerate magnetic stripe states from which nematicity arises, leaving characteristic signatures in the spatial profile of the magnetic domains, in the configurational space of the spin variables, and in the magnetic noise spectrum. We discuss possible experimental manifestations of these effects in iron-pnictide superconductors. Furthermore, our work establishes the random Baxter-field model as a more complete alternative to the random-field Ising model to describe complex electronic nematic phenomena in the presence of disorder.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Proposal and application of ROM-Lasso method for sensitivity coefficient evaluation

We propose a novel method for evaluating sensitivity coefficients of neutronics parameters to cross sections, so-called the reduced-order modeling technique ROM-Lasso. In this method, cross sections of interest are randomly sampled, and corresponding perturbed core analyses are performed. Then, the sensitivity coefficient vector of the higher-level model is expanded via the active subspace bases obtained with the lower-level model whose dimensional complexity is smaller than that of the higher-level model, and the expansion coefficients are estimated by the Lasso regression. A unique feature of the ROM-Lasso method allows the use of different bases optimized for each neutronics parameter. We conducted a verification calculation for an accelerator-driven system and demonstrated that the ROM-Lasso method can reproduce the sensitivity coefficients with a much smaller number of forward calculations than the direct method. The proposed method can be used to practically evaluate sensitivity coefficients. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
NASA NTRS1979

Recent advances in the solution of three-dimensional flow over wings with leading edge vortex separation

Recent advances in a panel method for the solution of three-dimensional flow about wing and wing-body combinations with leading-edge vortex separation are presented. These advances were achieved as part of an ultimately successful assault on two shortcomings of the method, namely convergence failures in seemingly random cases, and overprediction of lift coefficient for high aspect-ratio wings. Advances include the implementation of improved panel numerics for the purpose of eliminating the highly non-linear effects of ring vortices around doublet panel edges, and the development of a least squares procedure for damping vortex sheet geometry update instabilities. A variety of cases generated by the computer program implementing the method are presented. These cases are of two types. The first type consists of numerical studies, which verify the underlying mathematical assumptions of the method and moreover show that the results are strongly invariant with respect to such user dependent input as wing panel layout, initial sheet shape, sheet rollup, etc. The second type consists of cases run for the purpose of comparing computed results with experimental data, and these comparisons verify the underlying physical assumptions made by the method.

Johnson, F. T.↗
DOE OSTI2020

Structure–activity relationship-based chemical classification of highly imbalanced Tox21 datasets

Abstract The specificity of toxicant-target biomolecule interactions lends to the very imbalanced nature of many toxicity datasets, causing poor performance in Structure–Activity Relationship (SAR)-based chemical classification. Undersampling and oversampling are representative techniques for handling such an imbalance challenge. However, removing inactive chemical compound instances from the majority class using an undersampling technique can result in information loss, whereas increasing active toxicant instances in the minority class by interpolation tends to introduce artificial minority instances that often cross into the majority class space, giving rise to class overlapping and a higher false prediction rate. In this study, in order to improve the prediction accuracy of imbalanced learning, we employed SMOTEENN, a combination of Synthetic Minority Over-sampling Technique (SMOTE) and Edited Nearest Neighbor (ENN) algorithms, to oversample the minority class by creating synthetic samples, followed by cleaning the mislabeled instances. We chose the highly imbalanced Tox21 dataset, which consisted of 12 in vitro bioassays for > 10,000 chemicals that were distributed unevenly between binary classes. With Random Forest (RF) as the base classifier and bagging as the ensemble strategy, we applied four hybrid learning methods, i.e., RF without imbalance handling (RF), RF with Random Undersampling (RUS), RF with SMOTE (SMO), and RF with SMOTEENN (SMN). The performance of the four learning methods was compared using nine evaluation metrics, among which F 1 score, Matthews correlation coefficient and Brier score provided a more consistent assessment of the overall performance across the 12 datasets. The Friedman’s aligned ranks test and the subsequent Bergmann-Hommel post hoc test showed that SMN significantly outperformed the other three methods. We also found that a strong negative correlation existed between the prediction accuracy and the imbalance ratio (IR), which is defined as the number of inactive compounds divided by the number of active compounds. SMN became less effective when IR exceeded a certain threshold (e.g., > 28). The ability to separate the few active compounds from the vast amounts of inactive ones is of great importance in computational toxicology. This work demonstrates that the performance of SAR-based, imbalanced chemical toxicity classification can be significantly improved through the use of data rebalancing.

Idakwo, Gabriel↗
NASA NTRS1976

A higher order panel method for linearized supersonic flow

A higher order panel method using linearly varying source and quadratically varying doublet distributions for computing linearized supersonic flow over arbitrary wings and bodies is described. With tangential mass flux boundary conditions on circular cones at angles of attack, the source panel method gave pressure distributions which are in excellent agreement with exact nonlinear theory. The numerical source panel method was demonstrated to be very stable by randomly panelling an axially symmetric body. For wings with thickness and camber, both the source and doublet panel methods yield excellent agreement with exact linearized solutions. Computational experiments indicate that the use of exact surface paneling in lieu of linearized boundary conditions for wings provides better agreement with higher order theory and with experiment.

Ehlers, F. E.↗
DOE OSTI2018

Split‐dose 4‐L polyethylene glycol regimen for patients with previous colorectal surgery in bowel preparation before colonoscopy: A randomized, controlled, single‐blind study

OBJECTIVE We aimed to investigate the efficacy of a split‐dose 4‐L polyethylene glycol (PEG) regimen for the quality of bowel preparation in Asian patients with previous colorectal surgery for colorectal cancer (CRC). METHODS This was a prospective, single‐center, randomized controlled, endoscopist‐blinded study. Patients with previous colorectal surgery for CRC were randomly allocated to a routine, morning‐only 2‐L PEG (2‐MO) group or a split‐dose 4‐L PEG (4‐SD) group. The primary outcome was a successful bowel preparation rate. Secondary outcomes were polyp detection rate (PDR), adenoma detection rate (ADR), patient compliance, satisfaction, tolerance, willingness to repeat the preparation and difficulty of the bowel preparation process. RESULTS In total, 187 patients were included (93 in the 2‐MO group, 94 in the 4‐SD group) in this study. The rate of successful bowel preparation in the 4‐SD group was higher than in the 2‐MO group (89.4% vs 66.7%, P < 0.001) in an intention‐to‐treat analysis according to the Aronchick score. Patients’ satisfaction with the bowel preparation process in the 4‐SD group was superior to that in the 2‐MO group (93.4% vs 82.2%, P = 0.021). No significant differences were detected in PDR, ADR, patient compliance, tolerance, willingness to repeat the preparation or difficulty of the bowel preparation process. CONCLUSIONS The 4‐SD PEG regimen was superior to a routine, morning‐only 2‐L PEG preparation for bowel preparation in an Asian population with previous colorectal surgery.

Liu, Zhu↗
DOE OSTI2021

Solving inverse problems in stochastic models using deep neural networks and adversarial training

Inverse problems associated with stochastic models constitute a significant portion of scientific and engineering applications. In such cases the unknown quantities are distributions. The applicability of traditional methods is limited because of their demanding assumptions or prohibitive computational consumption; for example, maximum likelihood methods require closed-form density functions, and Markov Chain Monte Carlo needs a large number of simulations. We propose a new method that estimates the unknown distribution by matching the statistical properties between observed and simulated random processes. We leverage the expressive power of neural networks to approximate the unknown distribution and use a discriminative neural network for computing the statistical discrepancies between the observed and simulated random processes. Here we demonstrated numerically that the proposed methods can estimate both the model parameters and learn complicated unknown distributions.

42 ENGINEERING↗
DOE OSTI2020

Learning in Modal Space: Solving Time-Dependent Stochastic PDEs Using Physics-Informed Neural Networks

One of the open problems in scientific computing is the long-time integration of nonlinear stochastic partial differential equations (SPDEs), especially with arbitrary initial data. We address this problem by taking advantage of recent advances in scientific machine learning and the spectral dynamically orthogonal (DO) and borthogonal (BO) methods for representing stochastic processes. The recently introduced DO/BO methods reduce the SPDE to solving a system of deterministic PDEs and a system of stochastic ordinary differential equations. Specifically, we propose two new physics-informed neural networks (PINNs) for solving time-dependent SPDEs, namely the neural network (NN)-DO/BO methods. The proposed methods incorporate the DO/BO constraints into the loss function (along with the modal decomposition of the SPDE) with an implicit form instead of generating explicit expressions for the temporal derivatives of the DO/BO modes. Hence, the NN-DO/BO methods can overcome some of the drawbacks of the original DO/BO methods. For example, we do not need the assumption that the covariance matrix of the random coefficients is invertible as in the original DO method, and we can remove the assumption of no eigenvalue crossing as in the original BO method. Moreover, the NN-DO/BO methods can be used to solve time-dependent stochastic inverse problems with the same formulation and same computational complexity as for forward problems. Furthermore, we demonstrate the capability of the proposed methods via several numerical examples, namely: (1) A linear stochastic advection equation with deterministic initial condition: we obtain good results with the proposed methods, while the original DO/BO methods cannot be applied directly in this case. (2) Long-time integration of the stochastic Burgers' equation: we show the good performance of NN-DO/BO methods, especially the effectiveness of the NN-BO approach for such problems with many eigenvalue crossings during the whole time evolution, while the original BO method fails. (3) Nonlinear reaction diffusion equation: we consider both the forward problem and the inverse problems, including very noisy initial point values, to investigate the flexibility of the NN-DO/BO methods in handling inverse and mixed type problems. Taken together, these simulation results demonstrate that the NN-DO/BO methods can be employed to effectively quantify uncertainty propagation in a wide range of physical problems, but future work should address the efficiency issue of PINNs for forward problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Post-Mastectomy Radiotherapy After Neoadjuvant Chemotherapy in Breast Cancer: A Pooled Retrospective Analysis of Three Prospective Randomized Trials

Background: The impact of locoregional radiotherapy (RT) after neoadjuvant chemotherapy (NACT) and mastectomy in breast cancer patients is currently unclear. Several publications have suggested that patients with a favorable response to NACT might not benefit from RT after mastectomy. Methods: A retrospective analysis of three prospective randomized NACT trials was performed. Information on the use of RT was available for 817 breast cancer patients with non-inflammatory breast cancer who underwent mastectomy after NACT within the GeparTrio, GeparQuattro, and GeparQuinto-trials. RT was administered to 676 of these patients (82.7%). Results: The 5-year cumulative incidence of locoregional recurrence (LRR) was 15.2% (95% confidence interval [CI] 9.0–22.8%) in patients treated without RT and 11.3% in patients treated with RT (95% CI 8.7–14.3%). In the multivariate analysis, RT was associated with a lower risk of LRR (hazard ratio 0.51, 95% CI 0.27–1.0; p = 0.05). This effect was shown especially in patients with cT3/4 tumors, as well as in patients who were cN+ before neoadjuvant therapy, including those who converted to ypN0 after neoadjuvant therapy. In the bivariate analysis, disease-free survival was significantly worse in patients who received RT, however this was not confirmed in the multivariate analysis. Conclusions: Our results suggest that RT reduces the LRR rates in breast cancer patients who receive a mastectomy after NACT without an improvement in DFS. Prospective randomized controlled trials such as the National Surgical Adjuvant Breast and Bowel Project B-51/RTOG 1304 trial will analyze whether RT has any benefit in patients who have a favorable response after NACT.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2024

Efficient Unitary Designs from Random Sums and Permutations

A unitary k-design is an ensemble of unitaries that matches the first k moments of the Haar measure. In this work, we provide two efficient constructions of k-designs on n-qubits using new random matrix theory techniques. Our first construction is based on exponentiating sums of random i.i.d. Hermitian matrices and uses O(k2n2)-many gates. In the spirit of central limit theorems, we show that this random sum approximates the Gaussian Unitary Ensemble (GUE). We then show that the product of just two exponentiated GUE matrices is already approximately Haar random. Our second construction is based on products of exponentiated sums of random permutations and uses Õ(k poly (n)) many gates. The k dependence is optimal (up to polylogarithmic factors) and is inherited from the efficiency of existing k-wise independent permutations. Furthermore, replacing random permutations with quantum-secure pseudorandom permutations (PRPs), we also obtain a pseudorandom unitary (PRU) ensemble that is secure under nonadaptive queries. A central feature of both proofs is a new connection between the polynomial method in quantum query complexity and the large-dimension (N) expansion in random matrix theory. In particular, the first construction uses the polynomial method to control high moments of certain random matrix ensembles without requiring delicate Weingarten calculations. In doing so, we define and solve a moment problem on the unit circle, asking whether a finite number of equally weighted points can reproduce a given set of moments. In our second construction, the key step is to exhibit an orthonormal basis for irreducible representations of the partition algebra that has a low-degree large-N expansion. This allows us to show that the distinguishing probability is a low-degree rational polynomial of the dimension N.

algebra↗
DOE OSTI2019

A data-driven CO 2 leakage detection using seismic data and spatial–temporal densely connected convolutional neural networks

In carbon capture and sequestration (also known as carbon capture and storage, or CCS), developing effective monitoring methods is needed to detect and respond to CO 2 leakage. CO 2 leakage detection methods rely on geophysical observations and monitoring sensor network. However, traditional methods usually require the development of site-specific physical models and expert interpretation, and the effectiveness of these methods can be limited to different application locations, operational scenarios, and conditions. Here, we developed a novel data-driven leakage detection method based on densely connected convolutional neural networks. Our method is an end-to-end detection approach, that differs from conventional leakage monitoring methods by directly learning a mapping relationship between seismic data and the CO 2 leakage mass. To account for the spatial and temporal characteristics of seismic data, our novel networks architecture combines 1D and 2D convolutional neural networks. To overcome the computational expense of solving optimization problems, we apply a densely-connecting strategy in our network architecture that reduces the number of network parameters. Based on the features generated by our convolutional neural networks, we further incorporate a long short-term memory network to utilize time-sequential information, which further improves the detection accuracy. Lastly, we employ our detection method to synthetic seismic datasets generated based on flow simulations of a hypothetical CO 2 storage scenario with injection into a partially compartmentalized sandstone storage reservoir. To evaluate method performance, we conducted multiple experiments including a random leakage test, a sequential test, and a robustness test. Numerical results show that our CO 2 leakage detection method successfully detects the leakage and accurately predicts the leakage mass, suggesting that it has the potential for application in monitoring of real CO 2 storage sites.

58 GEOSCIENCES↗
NASA NTRS1985

Scattering Models and Basic Experiments in the Microwave Regime

The objectives of research over the next three years are: (1) to develop a randomly rough surface scattering model which is applicable over the entire frequency band; (2) to develop a computer simulation method and algorithm to simulate scattering from known randomly rough surfaces, Z(x,y); (3) to design and perform laboratory experiments to study geometric and physical target parameters of an inhomogeneous layer; (4) to develop scattering models for an inhomogeneous layer which accounts for near field interaction and multiple scattering in both the coherent and the incoherent scattering components; and (5) a comparison between theoretical models and measurements or numerical simulation.

Fung, A. K.↗
DOE OSTI2021

Flow-driven spectral chaos (FSC) method for simulating long-time dynamics of arbitrary-order non-linear stochastic dynamical systems

Uncertainty quantification techniques such as the time-dependent generalized polynomial chaos (TD-gPC) use an adaptive orthogonal basis to better represent the stochastic part of the solution space (aka random function space) in time. However, because the random function space is constructed using tensor products, TD-gPC-based methods are known to suffer from the curse of dimensionality. Here, we introduce a new numerical method called the flow-driven spectral chaos (FSC) which overcomes this curse of dimensionality at the random-function-space level. The proposed method is not only computationally more efficient than existing TD-gPC-based methods but is also far more accurate. The FSC method uses the concept of enriched stochastic flow maps to track the evolution of a finite-dimensional random function space efficiently in time. To transfer the probability information from one random function space to another, two approaches are developed and studied herein. In the first approach, the probability information is transferred in the mean-square sense, whereas in the second approach the transfer is done exactly using a new theorem that was developed for this purpose. The FSC method can quantify uncertainties with high fidelity, especially for the long-time response of stochastic dynamical systems governed by ODEs of arbitrary order. Six representative numerical examples, including a nonlinear problem (the Van-der-Pol oscillator), are presented to demonstrate the performance of the FSC method and corroborate the claims of its superior numerical properties. Finally, a parametric, high-dimensional stochastic problem is used to demonstrate that when the FSC method is used in conjunction with Monte Carlo integration, the curse of dimensionality can be overcome altogether.

(nonlinear) stochastic dynamical systems↗