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 739 records · Page 41

Machine-learning error models for approximate solutions to parameterized systems of nonlinear equations

Here, this work proposes a machine-learning framework for constructing statistical models of errors incurred by approximate solutions to parameterized systems of nonlinear equations. These approximate solutions may arise from early termination of an iterative method, a lower-fidelity model, or a projection-based reduced-order model, for example. The proposed statistical model comprises the sum of a deterministic regression-function model and a stochastic noise model. The method constructs the regression-function model by applying regression techniques from machine learning (e.g., support vector regression, artificial neural networks) to map features (i.e., error indicators such as sampled elements of the residual) to a prediction of the approximate-solution error. The method constructs the noise model as a mean-zero Gaussian random variable whose variance is computed as the sample variance of the approximate-solution error on a test set; this variance can be interpreted as the epistemic uncertainty introduced by the approximate solution. This work considers a wide range of feature-engineering methods, data-set-construction techniques, and regression techniques that aim to ensure that (1) the features are cheaply computable, (2) the noise model exhibits low variance (i.e., low epistemic uncertainty introduced), and (3) the regression model generalizes to independent test data. Finally, numerical experiments performed on several computational-mechanics problems and types of approximate solutions demonstrate the ability of the method to generate statistical models of the error that satisfy these criteria and significantly outperform more commonly adopted approaches for error modeling.

97 MATHEMATICS AND COMPUTING↗

Stochastic gradient descent algorithm for stochastic optimization in solving analytic continuation problems

We propose a stochastic gradient descent based optimization algorithm to solve the analytic continuation problem in which we extract real frequency spectra from imaginary time Quantum Monte Carlo data. The procedure of analytic continuation is an ill-posed inverse problem which is usually solved by regularized optimization methods, such like the Maximum Entropy method, or stochastic optimization methods. The main contribution of this work is to improve the performance of stochastic optimization approaches by introducing a supervised stochastic gradient descent algorithm to solve a flipped inverse system which processes the random solutions obtained by a type of Fast and Efficient Stochastic Optimization Method.

97 MATHEMATICS AND COMPUTING↗

Prediction on Underestimation of Statistical Uncertainty in Monte Carlo Eigenvalue Calculation for Two-dimensional Heterogeneous Color Set Geometry

In a Monte Carlo calculation, statistical uncertainty is inevitably included in the result. The statistical uncertainty is commonly estimated by the central limit theorem without considering correlation among generations. The statistical uncertainty is usually expected to decrease at the inverse square root of the number of neutron histories. However, in a Monte Carlo eigenvalue calculation in a large geometry whose dominance ratio is close to unity, the central limit theorem would not be valid and thus the statistical uncertainty of fission source distribution can be significantly underestimated when inter-cycle correlation is not appropriately taken into account. The true statistical uncertainty can be calculated by statistical processing of the results obtained by multiple Monte Carlo runs using different initial random seeds, but this approach has a drawback of large calculation cost. Therefore, prediction of true statistical uncertainty by alternate approach is desirable. One of the solutions for this issue is an evaluation method of statistical uncertainty based on the eigenfunction expansion and the Autoregressive model (AR model). In this method, the true statistical uncertainty is theoretically derived by applying the AR model to behavior of expansion coefficients of eigenfunction in fission source distribution during cycles. Underestimation ratio of statistical uncertainty of fission source distribution can be predicted by this method. Note that the underestimation ratio of statistical uncertainty is defined by the ratio of estimated error by a Monte Carlo calculation to the true statistical error. In the previous study, the proposed method was verified in a simple condition such as one energy group, one dimensional homogeneous slab geometry. Contributions of this summary are as follows. Firstly, expression of the noise term that is appeared in the AR model is theoretically derived. Secondly, prediction on underestimation ratio of statistical uncertainty is carried out in a more general case, i.e., flux of each fuel cell in 2 x 2 heterogeneous assembly geometry taken from the C5G7 benchmark problem. Through the present study, applicability of the theoretical prediction for underestimation of statistical uncertainty in practical problems will be verified. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗

Estimating basis functions in massive fields under the spatial mixed effects model

Abstract Spatial prediction is commonly achieved under the assumption of a Gaussian random field by obtaining maximum likelihood estimates of parameters, and then using the kriging equations to arrive at predicted values. For massive datasets, fixed rank kriging using the expectation–maximization algorithm for estimation has been proposed as an alternative to the usual but computationally prohibitive kriging method. The method reduces computation cost of estimation by redefining the spatial process as a linear combination of basis functions and spatial random effects. A disadvantage of this method is that it imposes constraints on the relationship between the observed locations and the knots. We develop an alternative method that utilizes the spatial mixed effects model, but allows for additional flexibility by estimating the range of the spatial dependence between the observations and the knots via an alternating expectation conditional maximization algorithm. Experiments show that our methodology improves estimation without sacrificing prediction accuracy while also minimizing the additional computational burden of extra parameter estimation. The methodology is applied to a temperature dataset archived by the United States National Climate Data Center, with improved results over previous methodology.

Pazdernik, Karl↗

SU-F-T-600: Influence of Acuros XB and AAA Dose Calculation Algorithms On Plan Quality Metrics and Normal Lung Doses in Lung SBRT

Purpose: To study the influence of superposition-beam model (AAA) and determinant-photon transport-solver (Acuros XB) dose calculation algorithms on the treatment plan quality metrics and on normal lung dose in Lung SBRT. Methods: Treatment plans of 10 Lung SBRT patients were randomly selected. Patients were prescribed to a total dose of 50-54Gy in 3–5 fractions (10?5 or 18?3). Doses were optimized accomplished with 6-MV using 2-arcs (VMAT). Doses were calculated using AAA algorithm with heterogeneity correction. For each plan, plan quality metrics in the categories- coverage, homogeneity, conformity and gradient were quantified. Repeat dosimetry for these AAA treatment plans was performed using AXB algorithm with heterogeneity correction for same beam and MU parameters. Plan quality metrics were again evaluated and compared with AAA plan metrics. For normal lung dose, V{sub 20} and V{sub 5} to (Total lung- GTV) were evaluated. Results: The results are summarized in Supplemental Table 1. PTV volume was mean 11.4 (±3.3) cm{sup 3}. Comparing RTOG 0813 protocol criteria for conformality, AXB plans yielded on average, similar PITV ratio (individual PITV ratio differences varied from −9 to +15%), reduced target coverage (−1.6%) and increased R50% (+2.6%). Comparing normal lung doses, the lung V{sub 20} (+3.1%) and V{sub 5} (+1.5%) were slightly higher for AXB plans compared to AAA plans. High-dose spillage ((V105%PD - PTV)/ PTV) was slightly lower for AXB plans but the % low dose spillage (D2cm) was similar between the two calculation algorithms. Conclusion: AAA algorithm overestimates lung target dose. Routinely adapting to AXB for dose calculations in Lung SBRT planning may improve dose calculation accuracy, as AXB based calculations have been shown to be closer to Monte Carlo based dose predictions in accuracy and with relatively faster computational time. For clinical practice, revisiting dose-fractionation in Lung SBRT to correct for dose overestimates attributable to algorithm may very well be warranted.

60 APPLIED LIFE SCIENCES↗

Efficient computation of basic sums for random polydispersed composites

The main goal of the paper was to develop algorithms and methods for computation of basic sums, the mathematical objects of great importance in computational materials science having applications to description of the representative volume element (RVE) and to the effective properties of 2D composites. The previously used algorithm had the exponential complexity. We propose a linearly complex algorithm. All the presented algorithms can be easily implemented in modern scientific computing packages, while maintaining both efficient calculations and a high level of abstraction. The proposed approach is applied to derivation of a polynomial approximation of the effective conductivity formula for 2D random material with non-overlapping circular inclusions with normally distributed radii. The obtained formulas are applied to the optimal packing problem of disks on the plane.

97 MATHEMATICS AND COMPUTING↗

Enhancing statistical moment calculations for stochastic Galerkin solutions with Monte Carlo techniques

Here, we provide a method for enhancing stochastic Galerkin moment calculations to the linear elliptic equation with random diffusivity using an ensemble of Monte Carlo solutions. This hybrid approach combines the accuracy of low-order stochastic Galerkin and the computational efficiency of Monte Carlo methods to provide statistical moment estimates which are significantly more accurate than performing each method individually. The hybrid approach involves computing a low-order stochastic Galerkin solution, after which Monte Carlo techniques are used to estimate the residual. We show that the combined stochastic Galerkin solution and residual is superior in both time and accuracy for a one-dimensional test problem and a more computational intensive two-dimensional linear elliptic problem for both the mean and variance quantities.

97 MATHEMATICS AND COMPUTING↗

Optimizing automatic morphological classification of galaxies with machine learning and deep learning using Dark Energy Survey imaging

There are several supervised machine learning methods used for the application of automated morphological classification of galaxies; however, there has not yet been a clear comparison of these different methods using imaging data, or an investigation for maximizing their effectiveness. We carry out a comparison between several common machine learning methods for galaxy classification [Convolutional Neural Network (CNN), K-nearest neighbour, logistic regression, Support Vector Machine, Random Forest, and Neural Networks] by using Dark Energy Survey (DES) data combined with visual classifications from the Galaxy Zoo 1 project (GZ1). Our goal is to determine the optimal machine learning methods when using imaging data for galaxy classification. We show that CNN is the most successful method of these ten methods in our study. Using a sample of ~2800 galaxies with visual classification from GZ1, we reach an accuracy of ~0.99 for the morphological classification of ellipticals and spirals. The further investigation of the galaxies that have a different ML and visual classification but with high predicted probabilities in our CNN usually reveals the incorrect classification provided by GZ1. We further find the galaxies having a low probability of being either spirals or ellipticals are visually lenticulars (S0), demonstrating that supervised learning is able to rediscover that this class of galaxy is distinct from both ellipticals and spirals. We confirm that ~2.5 percent galaxies are misclassified by GZ1 in our study. After correcting these galaxies’ labels, we improve our CNN performance to an average accuracy of over 0.99 (accuracy of 0.994 is our best result).

79 ASTRONOMY AND ASTROPHYSICS↗

On the Optimal Stabilization of an Integral Manifold

By the method of Lyapunov functions, we study the problem of optimal stabilization of an analytically defined integral manifold in the class of stochastic differential equations in the case where random perturbations belong to the class of processes with independent increments.

97 MATHEMATICS AND COMPUTING↗

Smoothing by cubic spline modified applied to solve inverse thermal problem

This paper presents an alternative to cubic spline regularization and its weighted form applied in solving inverse thermal problems. The inverse heat transfer problems are classified as ill-posed, that is, the solution may become unstable, mainly because they are sensitive to random errors deriving from the input data, necessitating a regularization method to soften these effects. The smoothing technique proposed by cubic spline regularization ensures that the global data tend to be more stable, with fewer data oscillations and dependent on a single arbitrary parameter input. It also shows that the weighted cubic spline is able to enhance filter action. The methods have been implemented in order for the search engine to optimize the choice of parameters and weight and, thus, the smoothing gains more flexibility and accuracy. The simulated and experimental tests confirm that the techniques are effective in reducing the amplified noise by inverse thermal problem presented.

97 MATHEMATICS AND COMPUTING↗

Cost analysis of laparoscopic lavage compared with sigmoid resection for perforated diverticulitis in the Ladies trial

Abstract Background Laparoscopic peritoneal lavage is an alternative to sigmoid resection in selected patients presenting with purulent peritonitis from perforated diverticulitis. Although recent trials have lacked superiority for lavage in terms of morbidity, mortality was not compromised, and beneficial secondary outcomes were shown. These included shorter duration of surgery, less stoma formation and less surgical reintervention (including stoma reversal) for laparoscopic lavage versus sigmoid resection respectively. The cost analysis of laparoscopic lavage for perforated diverticulitis in the Ladies RCT was assessed in the present study. Methods This study involved an economic evaluation of the randomized LOLA (LaparOscopic LAvage) arm of the Ladies trial (comparing laparoscopic lavage with sigmoid resection in patients with purulent peritonitis due to perforated diverticulitis). The actual resource use per individual patient was documented prospectively and analysed (according to intention-to-treat) for up to 1 year after randomization. Results Eighty-eight patients were randomized to either laparoscopic lavage (46) or sigmoid resection (42). The total medical costs for lavage were lower (mean difference € − 3512, 95 per cent bias-corrected and accelerated c.i. −16 020 to 8149). Surgical reintervention increased costs in the lavage group, whereas stoma reversal increased costs in the sigmoid resection group. Differences in favour of laparoscopy were robust when costs were varied by ±20 per cent in a sensitivity analysis (mean cost difference € − 2509 to −4438). Conclusion Laparoscopic lavage for perforated diverticulitis is more cost-effective than sigmoid resection.

Vennix, S.↗

First-principles study on the mechanical and thermodynamic properties of MoNbTaTiW

Refractory high-entropy alloys (RHEAs) are emerging as new materials for high temperature structural applications because of their stable mechanical and thermal properties at temperatures higher than 2273 K. In this study, the mechanical properties of MoNbTaTiW REDEA are examined by applying calculations based on first-principles density functional theory (DFT) and using a large unit cell with 100 randomized atoms. The phase calculation of MoNbTaTiW with CALPHAD method shows the existence of a stable body-centered cubic structure at a high temperature and a hexagonal closely packed phase at a low temperature. The predicted phase, shear modulus, Young’s modulus, Poisson’s ratio, and hardness values are consistent with available experimental results. The linear thermal expansion coefficient, vibrational entropy, and vibrational heat capacity of MoNbTaTiW RHEA are investigated in accordance with Debye-Grüneisen theory. These results may provide a basis for future research related to the application of RHEAs.

36 MATERIALS SCIENCE↗

Propagating uncertainties in large-scale hemodynamics models via network uncertainty quantification and reduced-order modeling

Numerical simulations of the cardiovascular system are affected by uncertainties arising from a substantial lack of data related to the boundary conditions and the physical parameters of the mathematical models. Quantifying the impact of this uncertainty on the numerical results along the circulatory network is challenged by the complexity of both the morphology of the domain and the local dynamics. Here, we propose to integrate (i) the Transverse Enriched Pipe Element Methods (TEPEM) as a reduced-order model for effectively computing the 3D local hemodynamics; and (ii) a combination of uncertainty quantification via Polynomial Chaos Expansion and classical relaxation methods – called network uncertainty quantification (NetUQ) – for effectively propagating random variables that encode uncertainties throughout the networks. The findings demonstrate the computational effectiveness of computing the propagation of uncertainties in networks with nontrivial topology, including portions of the cerebral and the coronary systems.

97 MATHEMATICS AND COMPUTING↗

Block copolymer self-assembly to pattern gold nanodots for site-specific placement of DNA origami and attachment of nanomaterials

Directed placement of DNA origami could play a key role in future integrated nanoelectronic devices. Here we demonstrated the site-selective attachment of DNA origami on gold dots formed using a pattern transfer method through block copolymer self-assembly. First, a random copolymer brush layer is grafted on the Si surface and then poly (styrene-b-methylmethacrylate) block copolymer is spin-coated to give a hexagonal nanoarray after annealing. UV irradiation followed by acetic acid etching is used to remove the PMMA, creating cylindrical holes and then oxygen plasma etching removes the random copolymer layer inside those holes. Next, metal evaporation, followed by lift-off creates a gold dot array. We evaluated different ligand functionalization of Au dots, as well as DNA hybridization to attach DNA origami to the nanodots. DNA-coated Au nanorods are assembled on the DNA origami as a step towards creating nanowires and to facilitate electron microscopy characterization of the attachment of DNA origami on these Au nanodots. The DNA hybridization approach showed better DNA attachment to Au nanodots than localization by electrostatic interaction. Here, this work contributes to the understanding of DNA-templated assembly, nanomaterials, and block copolymer nanolithography. Furthermore, the work shows potential for creating DNA-templated nanodevices and their placement in ordered arrays in future nanoelectronics.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Monte Carlo evaluation of the semiclassical multi-step direct reaction series

We show how the multi-step direct reaction series can be evaluated using Monte Carlo methods. Nucleon-nucleon collisions occur according to the random selection of a nucleon’s attenuation factor along its classical trajectory. The particles and hole excited in a collision are selected from a local Fermi distribution. We assume that the particles continue to propagate and possibly collide again before leaving the nucleus. We assume that holes collide in place, to possibly produce other particles and holes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Multipactor threshold calculation of coaxial transmission lines in microwave applications with nonstationary statistical theory

This paper presents a statistical theory for the initial onset of multipactor breakdown in coaxial transmission lines, taking both the nonuniform electric field and random electron emission velocity into account. A general numerical method is first developed to construct the joint probability density function based on the approximate equation of the electron trajectory. The nonstationary dynamics of the multipactor process on both surfaces of coaxial lines are modelled based on the probability of various impacts and their corresponding secondary emission. The resonant assumption of the classical theory on the independent double-sided and single-sided impacts is replaced by the consideration of their interaction. As a result, the time evolutions of the electron population for exponential growth and absorption on both inner and outer conductor, in response to the applied voltage above and below the multipactor breakdown level, are obtained to investigate the exact mechanism of multipactor discharge in coaxial lines. Furthermore, the multipactor threshold predictions of the presented model are compared with experimental results using measured secondary emission yield of the tested samples which shows reasonable agreement. Finally, the detailed impact scenario reveals that single-surface multipactor is more likely to occur with a higher outer to inner conductor radius ratio.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Charge transfer excitations from particle-particle random phase approximation—Opportunities and challenges arising from two-electron deficient systems

The particle-particle random phase approximation (pp-RPA) is a promising method for studying charge transfer (CT) excitations. Through a detailed analysis on two-electron deficient systems, we show that the pp-RPA is always able to recover the long-distance asymptotic –1/R trend for CT excitations as a result of the concerted effect between orbital energies and the pp-RPA kernel. We also provide quantitative results for systems with relatively short donor-acceptor distances. With conventional hybrid or range-separated functionals, the pp-RPA performs much better than time-dependent density functional theory (TDDFT), although it still gives underestimated results which are not as good as TDDFT with system-dependent tuned functionals. For pp-RPA, there remain three great challenges in dealing with CT excitations. First, the delocalized frontier orbitals in strongly correlated systems often lead to difficulty with self-consistent field convergence as well as an incorrect picture with about half an electron transferred. Second, the commonly used density functionals often underestimate the energy gap between the highest occupied molecular orbital and the lowest unoccupied molecular orbital (LUMO) for the two-electron deficient species, resulting in systems with delocalized orbitals. Third, the performance of pp-RPA greatly depends on the energy difference between the LUMO and a higher virtual orbital. However, the meaning of the orbital energies for higher virtual orbitals is still not clear. We also discuss the performance of an approximate pp-RPA scheme that uses density functional tight binding (pp-DFTB) as reference and demonstrate that the aforementioned challenges can be overcome by adopting suitable range-separated hybrid functionals. Here, the pp-RPA and pp-DFTB are thus promising general approaches for describing charge transfer excitations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗