Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mathematics and computing”

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,081 records · Page 60

Summary of Results for Converging Shock Wave Problems

The purpose of this note is to provide a brief overview of an attempt to simulate a Guderley-like imploding shock problem in xRAGE. Prior to this study, the following have been completed with respect to the Guderley problem itself: A canonical definition for use with ASC codes has been proposed (LA-UR-11-02765); 1D simulations with spherical symmetry on uniform grids have been performed, with associated spatial convergence analysis. The xRAGE code showed near 1st order convergence for this problem in the initial studies (LA-UR-10-06435); A version of the Guderley problem as been added to the xRAGE regression test suite. More recently, a large number of simulations have been performed for the Guderley problem (and a similar problem) using xRAGE’s (v. 1009.02) AMR capability.

Mathematics & Computing(97)↗

Optimal Inequalities to Bound a Performance Probability

A challenging problem encountered in engineering applications is the estimation of a probability-of-failure based on incomplete knowledge of the sources of uncertainty and/or limited sampling. Theories formulated to derive upper probability bounds offer an attractive alternative because first, they avoid postulating the probability laws that are often unknown and second, they substitute numerical optimization for statistical sampling. A critical assessment of one such technique is presented. It derives upper probability bounds from the McDiarmid concentration-of-measure theory, which postulates that fluctuations of a function are more-or-less concentrated about its mean value. Three applications of this theory are presented. The first two applications analyze “toy” polynomial functions defined in two and seventeen dimensions. The upper bounds of probability are calculated and compared to sampling-based estimates of the true-but-unknown probabilities. For these functions, the upper bounds obtained are too broad to be useful. These results are confirmed by conducting a similar analysis on a real engineering system, where upper bounds of probability associated with resonant frequencies of a structural system are estimated. These frequencies are predicted by a high-fidelity finite element model that was previously validated using vibration measurements. In this third application, the uncertainty is introduced by way of material properties and the effective preload of a beam-to-column connection, modeled explicitly. These applications suggest that the theory not only leads to upper bounds that are inefficient but that can also be sub-optimal if their numerical estimation is based on too few model runs. It is concluded that this particular theory, while mathematically attractive, may not be well suited for engineering applications.

Engineering(42)↗

A Statistical Methodology for Quantifying Improvement in Predictive Capability: Key Features and Benefits

In References [1, 2, 3], we proposed a statistical methodology for quanti fying improvement in predictive capability. In this note, we summarize the key features and benefits of our approach. We begin with a brief summary of our methodology. Broadly speaking, our approach models the predictive process statistically at a high level. Ac cordingly, we assume the existence of a body of experiments, the results of which have been (or will be) predicted. We can then treat the discrepancy between a prediction and the corresponding experimental result as a datum and the collection of such data informs us about the statistics of the prediction process.

Engineering(42)↗

THE FREE GAS THERMAL TREATMENT IN MCATK: Sampling the Thermal Motion of the Target Nucleus (U)

The free gas thermal treatment for neutron scattering, as formulated for Monte Carlo by Coveyou et al., is implemented and tested in the MCATK software library. This treatment is necessary for two reasons: 1) to handle the kinematics of a neutron colliding with a target nucleus in thermal motion and 2) to accurately use ACE scattering data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Residual a posteriori error estimation of a mimetic/virtual element method

A posteriori error estimation and adaptivity are very useful in the context of the mimetic finite difference method due to the flexibility of the meshes to which this family of numerical schemes can be applied. Nevertheless, developing error estimators for mimetic methods is not a straightforward task due to the lack of knowledge of the basis functions. This issue is tackled by the virtual element method recently introduced in [4], which can be interpreted as a Galerkin reformulation of the mimetic finite difference method. In the new virtual element setting, we develop a residual based a posteriori error estimator that immediately applies to its mimetic counterpart. For such estimator we prove the reliability and we show the numerical performance when it is combined with an adaptive strategy for the mesh refinement. For the lowest-regular approximation we also developed an hp-adaptive strategy based on the comparison between the numerical solution on a base mesh and on a reference mesh.

a posteriori error estimation↗

Performance Comparison of Luna and Typhoon

Luna is LANL’s latest TLCC2 capacity cluster, and initial reports from users have been extremely positive. In particular, users see Luna as enabling them to be more productive than they are on Typhoon, a previous large, capacity cluster. This report investigates the reasons why Luna outperforms Typhoon on LANL applications, as this information can help ensure that future TLCC procurements emphasize the features that most benefit our users.

Mathematics & Computing(97)↗

Interactive Machine Learning in Data Exploitation

The goal of interactive machine learning is to help scientists and engineers exploit more of their specialized data in less time. Interactive machine learning focuses on methods that empower domain experts to control and direct machine learning tools from within the deployed environment, whereas traditional machine learning does this in the development environment. This difference allows interactive machine learning systems to be more responsive, more accurate and cheaper to develop and maintain. This article provides a basic introduction to the main components and tries to untangle the many ideas that must be combined to produce practical interactive learning systems. It also describes recent developments in machine learning that have significantly advanced the theoretical and practical foundations for the next generation of interactive tools.

Information Science↗

SKA [Slides]

Abstract not provided.

97 MATHEMATICS AND COMPUTING↗

Final Technical Report for "Applied Mathematics Research: Simulation Based Optimization and Application to Electromagnetic Inverse Problems"

The focus of research was: Developing adaptive mesh for the solution of Maxwell's equations; Developing a parallel framework for time dependent inverse Maxwell's equations; Developing multilevel methods for optimization problems with inequality constraints; A new inversion code for inverse Maxwell's equations in the 0th frequency (DC resistivity); A new inversion code for inverse Maxwell's equations in low frequency regime. Although the research concentrated on electromagnetic forward and in- verse problems the results of the research was applied to the problem of image registration.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗