Search NASA⌕ Search

SEARCH · Search NASA

Results for “Standard Problem”

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 505 records · Page 28

Overview of ASME V&V 20-2009 standard for verification and validation in computational fluid mechanics and heat transfer.

The objective of this Standard is the specification of a verification and validation approach that quantifies the degree of accuracy inferred from the comparison of solution and data for a specified variable at a specified validation point. The approach uses the concepts from experimental uncertainty analysis to consider the errors and uncertainties in both the solution and the data. The scope of this Standard is the quantification of the degree of accuracy of simulation of specified validation variables at a specified validation point for cases in which the conditions of the actual experiment are simulated. Consideration of solution accuracy at points within a domain other than the validation points, for example interpolation/extrapolation in a domain of validation, is a matter of engineering judgment specific to each family of problems and is beyond the scope of this Standard.

97 MATHEMATICS AND COMPUTING↗

Quantum Simulation of Field Theories Without State Preparation

We propose an algorithm for computing real-time observables using a quantum processor while avoiding the need to prepare the full quantum state. This reduction in quantum resources is achieved by classically sampling configurations in imaginary-time using standard lattice field theory. These configurations can then be passed to quantum processor for time-evolution. This method encounters a signal-to-noise problem which we characterize, and we demonstrate the application of standard lattice QCD methods to mitigate it.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A new algorithm for calculating the curvature perturbations in stochastic inflation

We propose a new approach for calculating the curvature perturbations produced during inflation in the stochastic formalism. In our formalism, the fluctuations of the e-foldings are directly calculated without perturbatively expanding the inflaton field and they are connected to the curvature perturbations by the δN formalism. The result automatically includes the contributions of the higher order perturbations because we solve the equation of motion non-perturbatively. In this paper, we analytically prove that our result (the power spectrum and the nonlinearity parameter) is consistent with the standard result in single field slow-roll inflation. We also describe the algorithm for numerical calculations of the curvature perturbations in more general inflation models.

79 ASTRONOMY AND ASTROPHYSICS↗

Space-Dependent Wielandt Shift Methods for Multigroup Diffusion Eigenvalue Problems

In the calculation of neutronic eigenfunctions and eigenvalues, it is often desirable to approximate the neutron transport equation by a diffusion equation that requires significantly less computational resources to solve. Even when a full transport solution is needed, the solution of the diffusion system can be used to accelerate iterative methods for calculating the transport eigenfunction and eigenvalue. The convergence rate of the basic power iteration method for eigenvalue problems is governed by the dominance ratio; realistic reactor core problems often have high dominance ratios and the power iteration method can converge slowly as a result. A common technique for accelerating the convergence of power iteration is the Wielandt shift (WS) method, which reduces the dominance ratio by 'shifting' the eigenvalue spectrum using an estimate of the desired eigenvalue. WS provides a significant speedup over power iteration if the eigenvalue estimate is close to the true eigenvalue, but it can be difficult to obtain such an estimate. In practice, the shift in the WS method can be dynamically updated in the iteration scheme, in a way that depends on the eigenvalue estimates from the most recent iterations. We present a physically-motivated Space-Dependent Wielandt Shift (SDWS) for solving multigroup diffusion eigenvalue problems. The space-dependence of the eigenvalue shift in SDWS enables a more effective acceleration of the power iteration scheme than WS at the beginning of the iteration scheme, when the current estimate of the eigenvalue is not close to the actual eigenvalue. Several variants of SDWS are discussed here, including an SDWS method that combines the strengths of SDWS (in the early iterations) with those of standard WS (in the later iterations). Numerical results from a 1-D multigroup diffusion problem demonstrate an order of magnitude speedup over power iteration and a 41% speedup over a standard WS technique. This speedup is problem-dependent and appears to be greater for 'more difficult' problems. In this summary, the term 'speedup' refers to a reduction in the number of iterations required to converge to the correct eigenvalue and eigenfunction. Because the scattering is treated fully implicitly (i.e., it is part of the left-hand side of the diffusion system and directly inverted), the computational cost of a single iteration does not vary significantly among the methods discussed in this summary. The number of iterations is therefore representative of the total computational cost for a method. We acknowledge that certain iterative solvers for linear systems (e.g., GMRES) require more computational time to converge when the system is nearly singular (i.e., when a very aggressive Wielandt shift is applied). Nonetheless, when using SDWS in the manner described in this summary, we have seen that the reduction in computational time from reducing the number of power iterations generally outweighs the extra computational time required by iterative solvers such as GMRES. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Planning Problem Combining Calculus of Variations and Optimal Transport

We consider some variants of the classical optimal transport where not only one optimizes over couplings between some variables x and y but also over some control variables governing the evolutions of these variables with time. Such a situation is motivated by an assignment problem of tasks with workers whose characteristics can evolve with time (and be controlled). We distinguish between the coupled and decoupled case. The coupled case is a standard optimal transport with the value of some optimal control problem as cost. The decoupled case is more involved since it is nonlinear in the transport plan.

97 MATHEMATICS AND COMPUTING↗

A new symmetrical quasi-classical model for electronically non-adiabatic processes: Application to the case of weak non-adiabatic coupling

Previous work has shown how a symmetrical quasi-classical (SQC) windowing procedure can be used to quantize the initial and final electronic degrees of freedom in the Meyer-Miller (MM) classical vibronic (i.e, nuclear + electronic) Hamiltonian, and that the approach provides a very good description of electronically non-adiabatic processes within a standard classical molecular dynamics framework for a number of benchmark problems. This study explores application of the SQC/MM approach to the case of very weak non-adiabatic coupling between the electronic states, showing (as anticipated) how the standard SQC/MM approach used to date fails in this limit, and then devises a new SQC windowing scheme to deal with it. Finally, application of this new SQC model to a variety of realistic benchmark systems shows that the new model not only treats the weak coupling case extremely well, but it is also seen to describe the “normal” regime (of electronic transition probabilities ≳ 0.1) even more accurately than the previous “standard” model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Antimicrobial properties of nanostructured surfaces – demonstrating the need for a standard testing methodology

Bioinspired nanostructured materials that exhibit antimicrobial properties are being synthesized and tested at increasing rates for use in healthcare, manufacturing processes, and diagnostics. Although progress has been made in improving and understanding their bactericidal activity, arguably, the biggest problem currently in the field is the lack of a standard testing methodology that allows for optimal characterization and better comparison of emerging nanostructures. In this work, we examine two forms of nanostructured silicon that vary in their ability to kill certain bacterial species due to different physical mechanisms and derive guidelines for the comparative testing. We perform a comprehensive evaluation of methodologies used extensively in the field (e.g., colony counting and live dead analysis) and the novel application of high-throughput flow cytometry. The data reveal how the techniques are complementary but not always directly equivalent or correlative. Therefore, comparison of results obtained using different methodologies on different materials can be grossly misleading. We report significant variations in bactericidal efficiencies depending on experimental environments (medium type, etc.) and methodologies employed. In addition, we demonstrate how cytometry is yet another powerful complementary tool that can aid the mechanistic understanding of antimicrobial activities of rough surfaces. Besides standardization for comparison, ultimately, evaluation methods need to consider anticipated applications. Then and only then can the true potential (or limitation) of a novel material be determined for its suitability for advancement in a particular field of use.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Uncertainty analysis of densities and isotopics: Handling correlations

This paper discusses two cases of correlated parameters in uncertainty analyses: (1) the case of measured mass, density, and volume or spatial dimension correlations; and (2) the case of measured material isotopics, where increasing one atom fraction must cause the others to decrease. In the first case, an equation is derived that has a term due to uncertain density, a term due to uncertain dimensions, and a term due to the correlation between density and dimensions. In a numerical test problem, this equation gives the same result as the standard equation that treats mass and dimensions independently. In the case of isotopics, an equation is derived relating the uncertainty due to uncertain isotopic fractions to the sensitivities to isotopic densities, which are easier to calculate. The equation is verified in a test problem. (authors)

97 MATHEMATICS AND COMPUTING↗

Solving the Hierarchy Problem at Reheating with a Large Number of Degrees of Freedom

We present a new solution to the electroweak hierarchy problem. Here we introduce $N$ copies of the standard model with varying values of the Higgs mass parameter. This generically yields a sector whose weak scale is parametrically removed from the cutoff by a factor of 1/$\sqrt{N}$. Ensuring that reheating deposits a majority of the total energy density into this lightest sector requires a modification of the standard cosmological history, providing a powerful probe of the mechanism. Current and near-future experiments can explore much of the natural parameter space. Furthermore, supersymmetric completions that preserve grand unification predict superpartners with mass below $m_W \times M_{pl}/M_{GUT} \sim 10 TeV$.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Simulating non-native cubic interactions on noisy quantum machines

As a milestone for general-purpose computing machines, we demonstrate that quantum processors can be programed to efficiently simulate dynamics that are not native to the hardware. Moreover, on noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates instead of a restricted set of standard gates. We demonstrate the general methodology by solving a cubic interaction problem, which appears in nonlinear optics, gauge theories, as well as plasma and fluid dynamics. To encode the non-native Hamiltonian evolution, we decompose the Hilbert space into a direct sum of invariant subspaces in which the nonlinear problem is mapped to a finite-dimensional Hamiltonian simulation problem. Furthermore, in a three-states example, the resultant unitary evolution is realized by a product of approximately 20 standard gates, using which approximately ten simulation steps can be carried out on state-of-the-art quantum hardware before results are corrupted by decoherence. In comparison, the simulation depth is improved by more than an order of magnitude when the unitary evolution is realized as a single cubic gate, which is compiled directly using optimal control. Alternatively, parametric gates may also be compiled by interpolating control pulses. Modular gates thus obtained provide high-fidelity building blocks for quantum Hamiltonian simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Practical Probabilistic Programming

Recent advances in probabilistic programming languages (PPLs) have provided the capability for exact inference: computing a closed-form probability distribution for a given probabilistic program. In particular, the new language Roulette uses a language oriented programming (LOP) approach, wherein analysts build new programming languages on top of a set of primitives provided by Roulette, which then translates these structures into a weighted model counting problem which can be solved by automated reasoning tools. However, because Roulette provides few convenience features, developing these new languages is challenging even for expert users. We developed a standard library of common probability functions for Roulette with the goal of improved usability. This included approximation of continuous probability density functions using discrete probability mass functions. We demonstrated this approach by modeling a cosmic ray striking a RAM controller. We found that Roulette provides a powerful interface for highly expressive probabilistic programs to be generated. In collaboration with the NNSA Advanced Simulation and Computing program, which resulted in development of a tool called Circulette, we were able to model complex circuits expressed in Verilog using probabilistic programs with an expressivity not previously possible. Our research question that motivated the development of a Roulette standard library was to determine whether non-experts could use a PPL to model relevant problems regarding radiation effects on microelectronics. This standard library improved the expressivity of Roulette by implementing common probability density functions, mathematical operators on distributions, and support for empirical distributions. While Roulette is a powerful modeling language, the untyped, LOP approach makes error messages difficult to understand and requires expert aid. We recommend further research on Roulette, especially with its error messages, to enable improved usability. At the same time, this project demonstrated that for users familiar with Roulette and the LOP approach, Roulette provides powerful new capabilities that can be integrated with other Sandia modeling capabilities.

97 MATHEMATICS AND COMPUTING↗

The premature formation of high-redshift galaxies

Observations with WFC3/IR on the Hubble Space Telescope and the use of gravitational lensing techniques have facilitated the discovery of galaxies as far back as z ∼ 10-12, a truly remarkable achievement. However, this rapid emergence of high-z galaxies, barely ∼200 Myr after the transition from Population III star formation to Population II, appears to be in conflict with the standard view of how the early universe evolved. This problem has much in common with the better known (and probably related) premature appearance of supermassive black holes at z ≳ 6. It is difficult to understand how ∼10{sup 9} M {sub ☉} black holes could have appeared so quickly after the big bang without invoking non-standard accretion physics and the formation of massive seeds, neither of which is seen in the local universe. In earlier work, we showed that the appearance of high-z quasars could instead be understood more reasonably in the context of the R {sub h} = ct universe, which does not suffer from the same time compression issues as ΛCDM does at early epochs. Here, we build on that work by demonstrating that the evolutionary growth of primordial galaxies was consistent with the current view of how the first stars formed, but only with the timeline afforded by the R {sub h} = ct cosmology. We also show that the growth of high-z quasars was mutually consistent with that of the earliest galaxies, though it is not yet clear whether the former grew from 5-20 M {sub ☉} seeds created in Population III or Population II supernova explosions.

79 ASTRONOMY AND ASTROPHYSICS↗

Hybrid quantum-classical algorithms for approximate graph coloring

We show how to apply the recursive quantum approximate optimization algorithm (RQAOA) to MAX- k -CUT, the problem of finding an approximate k -vertex coloring of a graph. We compare this proposal to the best known classical and hybrid classical-quantum algorithms. First, we show that the standard (non-recursive) QAOA fails to solve this optimization problem for most regular bipartite graphs at any constant level p : the approximation ratio achieved by QAOA is hardly better than assigning colors to vertices at random. Second, we construct an efficient classical simulation algorithm which simulates level- 1 QAOA and level- 1 RQAOA for arbitrary graphs. In particular, these hybrid algorithms give rise to efficient classical algorithms, and no benefit arising from the use of quantum mechanics is to be expected. Nevertheless, they provide a suitable testbed for assessing the potential benefit of hybrid algorithm: We use the simulation algorithm to perform large-scale simulation of level- 1 QAOA and RQAOA with up to 300 qutrits applied to ensembles of randomly generated 3 -colorable constant-degree graphs. We find that level- 1 RQAOA is surprisingly competitive: for the ensembles considered, its approximation ratios are often higher than those achieved by the best known generic classical algorithm based on rounding an SDP relaxation. This suggests the intriguing possibility that higher-level RQAOA may be a potentially useful algorithm for NISQ devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

International Round-Robin Testing of Bulk Thermoelectrics

Two international round-robin studies were conducted on transport properties measurements of bulk thermoelectric materials. The study discovered current measurement problems. In order to get ZT of a material four separate transport measurements must be taken. The round-robin study showed that among the four properties Seebeck coefficient is the one can be measured consistently. Electrical resistivity has +4-9% scatter. Thermal diffusivity has similar +5-10% scatter. The reliability of the above three properties can be improved by standardizing test procedures and enforcing system calibrations. The worst problem was found in specific heat measurements using DSC. The probability of making measurement error is great due to the fact three separate runs must be taken to determine Cp and the baseline shift is always an issue for commercial DSC. It is suggest the Dulong Petit limit be always used as a guide line for Cp. Procedures have been developed to eliminate operator and system errors. The IEA-AMT annex is developing standard procedures for transport properties testing.

36 MATERIALS SCIENCE↗

Projective Hedging Algorithms for Multistage Stochastic Programming, Supporting Distributed and Asynchronous Implementation

Here we propose a decomposition algorithm for multistage stochastic programming that resembles the progressive hedging method of Rockafellar and Wets but is provably capable of several forms of asynchronous operation. We derive the method from a class of projective operator splitting methods fairly recently proposed by Combettes and Eckstein, significantly expanding the known applications of those methods. Our derivation assures convergence for convex problems whose feasible set is compact, subject to some standard regularity conditions and a mild “fairness” condition on subproblem selection. The method’s convergence guarantees are deterministic and do not require randomization, in contrast to other proposed asynchronous variations of progressive hedging. Computational experiments described in an online appendix show the method to outperform progressive hedging on large-scale problems in a highly parallel computing environment.

97 MATHEMATICS AND COMPUTING↗

LOGISTIC FUNCTION PROFILE FIT: A least-squares program for fitting interface profiles to an extended logistic function

The extended logistic function provides a physically reasonable description of interfaces such as depth profiles or line scans of surface topological or compositional features. It describes these interfaces with the minimum number of parameters, namely, position, width, and asymmetry. Logistic Function Profile Fit (LFPF) is a robust, least-squares fitting program in which the nonlinear extended logistic function is linearized by a Taylor series expansion (equivalent to a Newton-Raphson approach) with no apparent introduction of bias in the analysis. The program provides reliable confidence limits for the parameters when systematic errors are minimal and provides a display of the residuals from the fit for the detection of systematic errors. The program will aid researchers in applying ASTM E1636-10, 'Standard practice for analytically describing sputter-depth-profile and linescan-profile data by an extended logistic function,' and may also prove useful in applying ISO 18516: 2006, 'Surface chemical analysis-Auger electron spectroscopy and x-ray photoelectron spectroscopy-determination of lateral resolution.' Examples are given of LFPF fits to a secondary ion mass spectrometry depth profile, an Auger surface line scan, and synthetic data generated to exhibit known systematic errors for examining the significance of such errors to the extrapolation of partial profiles.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Fundamental problems in astroparticle physics and cosmology (Final Technical Report)

In the standard cosmological model, structure forms when gas cools and condenses to the center of dark matter halos. The onset of structure is governed by rapid star formation and subsequent evolution of the first massive stars. One of the endpoints of stellar evolution is the formation of a black hole. We showed that all black hole merger events must occur after the universe is about 85 million years old. This prediction is important because it means that if a future experiment makes a detection of a black hole merger event at an earlier time then our understanding of cosmology and the onset of structure formation is not fully developed. In addition, we explored dark matter models that have either self-interactions or experience decays. In the first case, self-interactions may lead to the formation of a thick disk that can be co-planar to the Galactic disc due to correlations in angular momentum between dark matter and baryons that are predicted by tidal torque theory. We showed that for heavy dark matter particles, either the self interaction may not be strong enough to solve the small scale structure motivation or a dark disc cannot be present in the Milky Way. In the second-case, we showed that if dark matter experiences decays into two particles, one of which behaves like radiation, then it is possible to relieve the tension that exists between measurements of the local expansion rate. Finally, we developed methods on how to distinguish gamma-ray excesses from promising dark matter targets as compared to conventional astrophysical sources. This is an important toolset that is applicable to any suspected dark matter source.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

GRChombo : Numerical relativity with adaptive mesh refinement

In this work, we introduce GRChombo: a new numerical relativity code which incorporates full adaptive mesh refinement (AMR) using block structured Berger-Rigoutsos grid generation. The code supports non-trivial 'many-boxes-in-many-boxes' mesh hierarchies and massive parallelism through the message passing interface. GRChombo evolves the Einstein equation using the standard BSSN formalism, with an option to turn on CCZ4 constraint damping if required. The AMR capability permits the study of a range of new physics which has previously been computationally infeasible in a full 3 + 1 setting, while also significantly simplifying the process of setting up the mesh for these problems. We show that GRChombo can stably and accurately evolve standard spacetimes such as binary black hole mergers and scalar collapses into black holes, demonstrate the performance characteristics of our code, and discuss various physics problems which stand to benefit from the AMR technique.

Clough, Katy (ORCID:0000000188411522)↗