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 55 records · Page 3

Deterministically estimated fission source distributions for Monte Carlo k-eigenvalue problems

The standard Monte Carlo (MC) k-eigenvalue algorithm involves iteratively converging the fission source distribution using a series of potentially time-consuming inactive cycles before quantities of interest can be tallied. One strategy for reducing the computational time requirements of these inactive cycles is the Sourcerer method, in which a deterministic eigenvalue calculation is performed to obtain an improved initial guess for the fission source distribution. This method has been implemented in the Exnihilo software suite within SCALE using the SPNSPN or SNSN solvers in Denovo and the Shift MC code. The efficacy of this method is assessed with different Denovo solution parameters for a series of typical k-eigenvalue problems including small criticality benchmarks, full-core reactors, and a fuel cask. Here it is found that, in most cases, when a large number of histories per cycle are required to obtain a detailed flux distribution, the Sourcerer method can be used to reduce the computational time requirements of the inactive cycles.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

H→γγ as a Triangle Anomaly: Possible Implications for the Hierarchy Problem

The Standard Model calculation of H→γγ has the curious feature of being finite but regulator-dependent. While dimensional regularization yields a result which respects the electromagnetic Ward identities, additional terms which violate gauge invariance arise if the calculation is done setting d = 4. This discrepancy between the d=4 – ϵ and d = 4 results is recognized as a true ambiguity which must be resolved using physics input; as dimensional regularization respects gauge invariance, the d = 4 – ϵ calculation is accepted as the correct SM result. However, here we point out another possibility; working in analogy with the gauge chiral anomaly, we note that it is possible that the individual diagrams do violate the electromagnetic Ward identities, but that the gauge-invariance-violating terms cancel when all contributions to H→γγ, both from the SM and from new physics, are included. We thus examine the consequences of the hypothesis that the d = 4 calculation is valid, but that such a cancellation occurs. We work in general renormalizable gauge, thus avoiding issues with momentum routing ambiguities. We point out that the gauge-invariance-violating terms in d = 4 arise not just for the diagram containing a SM $W^{\pm}$ boson, but also for general fermion and scalar loops, and relate these terms to a lack of shift invariance in Higgs tadpole diagrams. We then derive the analogue of "anomaly cancellation conditions", and find consequences for solutions to the hierarchy problem. In particular, we find that supersymmetry obeys these conditions, even if it is softly broken at an arbitrarily high scale.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Saddle Points Theory of Two Classes of Augmented Lagrangians and Its Applications to Generalized Semi-infinite Programming

In this paper, we develop the sufficient conditions for the existence of local and global saddle points of two classes of augmented Lagrangian functions for nonconvex optimization problem with both equality and inequality constraints, which improve the corresponding results in available papers. The main feature of our sufficient condition for the existence of global saddle points is that we do not need the uniqueness of the optimal solution. Furthermore, we show that the existence of global saddle points is a necessary and sufficient condition for the exact penalty representation in the framework of augmented Lagrangians. Based on these, we convert a class of generalized semi-infinite programming problems into standard semi-infinite programming problems via augmented Lagrangians. Some new first-order optimality conditions are also discussed.

97 MATHEMATICS AND COMPUTING↗

Dipolar dark matter with massive bigravity

Massive gravity theories have been developed as viable IR modifications of gravity motivated by dark energy and the problem of the cosmological constant. On the other hand, modified gravity and modified dark matter theories were developed with the aim of solving the problems of standard cold dark matter at galactic scales. Here we propose to adapt the framework of ghost-free massive bigravity theories to reformulate the problem of dark matter at galactic scales. We investigate a promising alternative to dark matter called dipolar dark matter (DDM) in which two different species of dark matter are separately coupled to the two metrics of bigravity and are linked together by an internal vector field. We show that this model successfully reproduces the phenomenology of dark matter at galactic scales (i.e. MOND) as a result of a mechanism of gravitational polarisation. The model is safe in the gravitational sector, but because of the particular couplings of the matter fields and vector field to the metrics, a ghost in the decoupling limit is present in the dark matter sector. However, it might be possible to push the mass of the ghost beyond the strong coupling scale by an appropriate choice of the parameters of the model. Crucial questions to address in future work are the exact mass of the ghost, and the cosmological implications of the model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Efficient Mixed-Precision Matrix Factorization of the Inverse Overlap Matrix in Electronic Structure Calculations with AI-Hardware and GPUs

In recent years, a new kind of accelerated hardware has gained popularity in the artificial intelligence (AI) community which enables extremely high-performance tensor contractions in reduced precision for deep neural network calculations. In this article, we exploit Nvidia Tensor cores, a prototypical example of such AI-hardware, to develop a mixed precision approach for computing a dense matrix factorization of the inverse overlap matrix in electronic structure theory, S –1 . This factorization of S –1 , written as ZZT = S –1 , is used to transform the general matrix eigenvalue problem into a standard matrix eigenvalue problem. Here we present a mixed precision iterative refinement algorithm where Z is given recursively using matrix–matrix multiplications and can be computed with high performance on Tensor cores. To understand the performance and accuracy of Tensor cores, comparisons are made to GPU-only implementations in single and double precision. Additionally, we propose a nonparametric stopping criteria which is robust in the face of lower precision floating point operations. The algorithm is particularly useful when we have a good initial guess to Z, for example, from previous time steps in quantum-mechanical molecular dynamics simulations or from a previous iteration in a geometry optimization.

36 MATERIALS SCIENCE↗

Solving the Trivial Crossing Problem While Preserving the Nodal Symmetry of the Wave Function

In an adiabatic mixed quantum-classical simulation, the avoided crossing of weakly coupled eigenstates can lead to unphysical discontinuities in wave function dynamics, otherwise known as the trivial crossing problem. A standard solution to the trivial crossing problem eliminates spatial discontinuities in wave function dynamics by imposing changes to the eigenstate of the wave function. In this paper, we show that this solution has the side effect of introducing transient discontinuities in the nodal symmetry of the wave function. We present an alternative solution to the trivial crossing problem that preserves both the spatial and nodal structure of the adiabatic wave function. By considering a model of exciton dynamics on conjugated polymer systems, we show that failure to preserve wave function symmetry yields exciton dynamics that depends unphysically on polymer system size. We demonstrate that our symmetry-preserving solution to the trivial crossing problem yields more realistic dynamics and can thus improve the accuracy of simulations of larger systems that are prone to the trivial crossing problem.

74 ATOMIC AND MOLECULAR PHYSICS↗

Robust Resilient Signal Reconstruction under Adversarial Attacks

We consider the problem of signal reconstruction for a system under sparse signal corruption by a malicious agent. The reconstruction problem follows the standard error coding problem that has been studied extensively in the literature. We include a new challenge of robust estimation of the attack support. The problem is then cast as a constrained optimization problem merging promising techniques in the area of deep learning and estimation theory. A pruning algorithm is developed to reduce the "false positive" uncertainty of data-driven attack localization results, thereby improving the probability of correct signal reconstruction. Sufficient conditions for the correct reconstruction and the associated reconstruction error bounds are obtained for both exact and inexact attack support estimation. Moreover, a simulation of a water distribution system is presented to validate the proposed techniques.

Robust, Signal reconstruction, Resilient estimator↗

Quantum phase estimation for a class of generalized eigenvalue problems

Quantum phase estimation provides a path to quantum computation of solutions to Hermitian eigenvalue problems Hv = λv , such as those occurring in quantum chemistry. It is natural to ask whether the same technique can be applied to generalized eigenvalue problems Av = λBv , which arise in many areas of science and engineering. Here, we answer this question affirmatively. A restricted class of generalized eigenvalue problems could be solved as efficiently as standard eigenvalue problems. A paradigmatic example is provided by Sturm-Liouville problems. Another example comes from linear ideal magnetohydrodynamics, where phase estimation could be used to determine the stability of magnetically confined plasmas in fusion reactors.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

SEMI-ACTIVE CONTROL FOR TWO-BODY OCEAN WAVE ENERGY CONVERTER BY USING HYBRID MODEL PREDICTIVE CONTROL

Model predictive control (MPC) has been considered as one important feed-forward optimal control strategy for ocean wave energy converter (WEC) targeted on power maximization. The capability of MPC to handle system constraints (ex. stroke, velocity, actuator limitations), and the availability to provide optimal solution for linear system provide potential for the implementation of such algorithm in the WEC control. However, currently, only active MPC control has been introduced for single and two-body WECs. Such control strategy may introduce negative power during the optimization process, since the power take-off (PTO) damping has no constraint. In this paper, we proposed a hybrid MPC strategy in limiting both the PTO damping force and PTO damping to avoid negative power generation during cost function minimization (negative power minimization) for the two-body WEC. The problem is formulated into a quadratic programming (QP) problem targeted at power maximization. However, the standard QP problem formulation cannot be directly applied to the semi-active control problem due to the PTO damping constraints. Therefore, the problem is reformulated as a Mixed-integer Quadratic Programming (MIQP) problem, which contains logical switch to select constraint matrices based on the sign of the relative velocity between the buoy and submerged body. The optimal solution is compared with those of the active MPC control strategy and the passive model with the same irregular wave input.

16 TIDAL AND WAVE POWER↗

Orbital-enriched flat-top partition of unity method for the Schrödinger eigenproblem

Quantum mechanical calculations require the repeated solution of a Schrödinger equation for the wavefunctions of the system, from which materials properties follow. Recent work has shown the effectiveness of enriched finite element type Galerkin methods at significantly reducing the degrees of freedom required to obtain accurate solutions. However, time to solution has been adversely affected by the need to solve a generalized rather than standard eigenvalue problem and the ill-conditioning of associated system matrices. In this work, we address both issues by proposing a stable and efficient orbital-enriched partition of unity method to solve the Schrödinger boundary-value problem in a parallelepiped unit cell subject to Bloch-periodic boundary conditions. In the proposed partition of unity method, the three-dimensional domain is covered by overlapping patches, with a compactly-supported weight function associated with each patch. A key ingredient in our approach is the use of non-negative weight functions that possess the flat-top property, i.e., each weight function is identically equal to unity over some finite subset of its support. This flat-top property provides a pathway to devise a stable approximation over the whole domain. On each patch, we use $p$th degree orthogonal (Legendre) polynomials that ensure $p$th order completeness, and in addition include eigenfunctions of the radial Schrödinger equation. Furthermore, we adopt a variational lumping approach to construct a (block-)diagonal overlap matrix that yields a standard eigenvalue problem for which there exist efficient eigensolvers. The accuracy, stability, and efficiency of the proposed method is demonstrated for the Schrödinger equation with a harmonic potential as well as a localized Gaussian potential. In conclusion, we show that the proposed approach delivers optimal rates of convergence in the energy, and the use of orbital enrichment significantly reduces the number of degrees of freedom for a given desired accuracy in the energy eigenvalues while the stability of the enriched approach is fully maintained.

42 ENGINEERING↗

The Wave Energy Converter Control Competition: Overview

Over the past two years, a wave energy converter control systems competition (WECCCOMP) has been in progress, with the objective of comparing different wave energy converter (WEC) control paradigms on a standard benchmark problem. The target system is a point absorber, corresponding to a single float with an absolute reference, of the WaveStar WEC prototype. The system was modelled in WEC-Sim, with the hydrodynamic parameters validated against tank test data. Competitors were asked to design and implement a WEC control system for this model, with performance evaluated across six sea states. The evaluation criteria included a weighted combination of average converted power, peak/average power, and the degree to which the system physical constraints were exploited or temporarily exceeded.

16 TIDAL AND WAVE POWER↗

A Tidal Origin for a Three-body Resonance in Kepler-221

Over the course of the last two decades, traditional models of planet formation have been repeatedly challenged by the emerging census of extrasolar planets. Key among them is the orbital architecture problem: while standard models of orbital migration predict resonant orbits for short-period objects, most planets do not appear to lie in orbital resonances. Here, we show that the four-planet system Kepler-221, not previously recognized to have active orbital resonances, has a three-body commensurability relation unique within the Kepler sample. Using a suite of numerical experiments as well as a perturbative analysis, we demonstrate that this system likely began as a resonant chain and proceeded to undergo large-scale divergence away from resonance, under the action of tidal dissipation. Our results further indicate that obliquity tides, driven by a secular spin–orbit resonance and mutual inclination, are an excellent candidate for driving this orbital divergence, and that the high tidal luminosity may also explain the anomalous size of planet b, which lies within the Fulton radius gap.

79 ASTRONOMY AND ASTROPHYSICS↗

Elastic-plastic deformations of a beam with the SD-effect

The results for the bending of a cantilever beam with the SD-effect under a concentrated load are discussed. To solve this problem, the standard Bernoulli-Euler hypotheses for beams and the Ilyushin model of perfect plasticity are used. The problem is solved analytically for structural steel A40X. The SD-effect for elastic-plastic deformations is studied. The solutions for beam made of isotropic material and material with the SD-effect are compared.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hybrid preconditioning for iterative diagonalization of ill-conditioned generalized eigenvalue problems in electronic structure calculations

The iterative diagonalization of a sequence of large ill-conditioned generalized eigenvalue problems is a computational bottleneck in quantum mechanical methods employing a nonorthogonal basis for ab initio electronic structure calculations. We propose a hybrid preconditioning scheme to effectively combine global and locally accelerated preconditioners for rapid iterative diagonalization of such eigenvalue problems. In partition-of-unity finite-element (PUFE) pseudopotential density-functional calculations, employing a nonorthogonal basis, we show that the hybrid preconditioned block steepest descent method is a cost-effective eigensolver, outperforming current state-of-the-art global preconditioning schemes, and comparably efficient for the ill-conditioned generalized eigenvalue problems produced by PUFE as the locally optimal block preconditioned conjugate-gradient method for the well-conditioned standard eigenvalue problems produced by planewave methods.

74 ATOMIC AND MOLECULAR PHYSICS↗

Poblano v 1.0

Poblano is a Matlab toolbox of large-scale algorithms for nonlinear optimization. The algorithms in Poblano require only first-order derivative information (e.g., gradients for scalar-valued objective functions), and therefore can scale to very large problems [6].Poblano is a set of general purpose methods for solving unconstrained nonlinear optimization methods. It has been applied to standard test problems covering a range of application areas. The driving application for Poblano development has been tensor decompositions in data analysis applications (bibliometric analysis, social network analysis, chemometrics, etc.) [1].

Dunlavy, Daniel↗

Poblano v 1.0

Poblano is a Matlab toolbox of large-scale algorithms for nonlinear optimization. The algorithms in Poblano require only first-order derivative information (e.g., gradients for scalar-valued objective functions), and therefore can scale to very large problems [6].Poblano is a set of general purpose methods for solving unconstrained nonlinear optimization methods. It has been applied to standard test problems covering a range of application areas. The driving application for Poblano development has been tensor decompositions in data analysis applications (bibliometric analysis, social network analysis, chemometrics, etc.) [1].

Dunlavy, Daniel↗

An Integrated Approach to Scaling Task-Based Runtime Systems for Next Generation Engineering problems

The need to scale next-generation industrial engineering problems to the largest computational platforms presents unique challenges. Such problems may have complex coupled multi-physics models, as well as computationally and communication intensive algorithms not often seen in standard academic problems, while also needing high-demand I/O for analysis purposes. In such cases even codes with good existing scaling properties may need significant changes, addressed in a cross-cutting way to solve such problems at extreme scales. These challenges relate to system components that were not previously problematic on less complex problems and/or at smaller computational scales. This paper illustrates these challenges for Uintah, a highly scalable asynchronous many-task runtime system being applied to the modeling of a 1000 MWe ultra-supercritical coal boiler. In order to model this formidable, production engineering problem, not only was an integrated approach needed that built upon existing scalable components in areas such as complex stencil calculations and linear algebra, but the significant challenges of high demand I/O, complex task graphs, and infrastructure inefficiencies also had to be addressed. This integrated approach allowed this problem to run on 256K CPU cores on Mira, with good weak scaling to 512K CPU cores and similar strong scaling, except for radiation. The need for strong scaling of a new ray tracing-based radiation model required substantial Uintah infrastructure improvements before 119K CPU cores and 7.5K GPUs on Titan could be used, with scaling out to 256K CPU cores and 16K GPUs. The resulting code demonstrates not only excellent overall scalability but a significant improvement in overall performance for the full-scale, production boiler problem.

97 MATHEMATICS AND COMPUTING↗

Bootstrap AMG for spectral clustering

Graph Laplacian is a popular tool for analyzing graphs, particularly in graph partitioning and clustering. Given a notion of similarity (via an adjacency matrix), graph clustering refers to identifying different groups such that vertices in the same group are more similar compared to vertices across different groups. Data clustering can be reformulated in terms of a graph clustering problem when the given set of data is represented as a graph, also known as similarity graph. In this context, eigenvectors of the graph Laplacian are often used to obtain a new geometric representation of the original data set that generally enhances cluster properties and improves cluster detection. Here, we apply a bootstrap algebraic multigrid (AMG) method that constructs a set of vectors associated with the graph Laplacian. These vectors, referred to as algebraically smooth ones, span a low-dimensional Euclidean space, which we use to represent the data, enabling cluster detection both in synthetic and in realistic well-clustered graphs. We show that, in the case of a good quality bootstrap AMG, the computed smooth vectors employed in the construction of the final AMG operator, which by construction is spectrally equivalent to the originally given graph Laplacian, accurately approximate the space in the lower portion of the spectrum of the preconditioned operator. Thus, our approach can be viewed as a spectral clustering technique associated with the generalized spectral problem (Laplace operator versus the final AMG operator), and hence, it can be seen as an extension of the classical spectral clustering that employs a standard eigenvalue problem.

97 MATHEMATICS AND COMPUTING↗