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 649 records · Page 36

Classification of Aircraft Maneuvers for Fault Detection

Automated fault detection is an increasingly important problem in aircraft maintenance and operation. Standard methods of fault detection assume the availability of either data produced during all possible faulty operation modes or a clearly-defined means to determine whether the data provide a reasonable match to known examples of proper operation. In the domain of fault detection in aircraft, the first assumption is unreasonable and the second is difficult to determine. We envision a system for online fault detection in aircraft, one part of which is a classifier that predicts the maneuver being performed by the aircraft as a function of vibration data and other available data. To develop such a system, we use flight data collected under a controlled test environment, subject to many sources of variability. We explain where our classifier fits into the envisioned fault detection system as well as experiments showing the promise of this classification subsystem.

Oza, Nikunj↗

Threshold Laws for Two-Electron Ejection Processes: A Still Controversial Problem in Atomic Physics

This talk deals with collision processes of the following kind: (a) an ionizing collision of an electron with a neutral atom, (b) a photon incident of a negative ion resulting in two-electron ejection. In both cases the final state is a positive ion and two outgoing electrons, and in principle both processes should be governed by the same form of threshold law. It is generally conceded that this is one of the most difficult basic problems in nonrelativistic quantum mechanics. The standard treatment (due to Wannier) will be briefly reviewed in terms of the derivation of his well- known threshold law for the yield (Q) of positive ions vs. the excess energy (E): Q(sub w) varies as E(exp 1.127...). The derivation is a brilliant analysis based on Newton's equations, leading to the dominance of events in which the two electrons emerge on opposite sides of the residual ion with similar energies. In contrast, I will argue on the basis of quantum mechanical ideas that in the threshold limit the more likely outcome are events in which the electrons emerge with decidedly different energies, leading to a formally different (Coulomb-dipole) threshold law Q(sub CD) varies as E(1 + C sin(alpha ln(E)+mu)]/[ln(E)](exp 2). Additional aspects of that approach will be discussed . Some: experimental results will be presented, and more incisive predictions involving polarized projectiles and targets will be given.

Temkin, Aaron↗

Maneuver Classification for Aircraft Fault Detection

Automated fault detection is an increasingly important problem in aircraft maintenance and operation. Standard methods of fault detection assume the availability of either data produced during all possible faulty operation modes or a clearly-defined means to determine whether the data provide a reasonable match to known examples of proper operation. In the domain of fault detection in aircraft, identifying all possible faulty and proper operating modes is clearly impossible. We envision a system for online fault detection in aircraft, one part of which is a classifier that predicts the maneuver being performed by the aircraft as a function of vibration data and other available data. To develop such a system, we use flight data collected under a controlled test environment, subject to many sources of variability. We explain where our classifier fits into the envisioned fault detection system as well as experiments showing the promise of this classification subsystem.

Oza, Nikunj C.↗

Design and architecture of the Mars relay network planning and analysis framework

In this paper we describe the design and architecture of the Mars Network planning and analysis framework that supports generation and validation of efficient planning and scheduling strategy. The goals are to minimize the transmitting time, minimize the delaying time, and/or maximize the network throughputs. The proposed framework would require (1) a client-server architecture to support interactive, batch, WEB, and distributed analysis and planning applications for the relay network analysis scheme, (2) a high-fidelity modeling and simulation environment that expresses link capabilities between spacecraft to spacecraft and spacecraft to Earth stations as time-varying resources, and spacecraft activities, link priority, Solar System dynamic events, the laws of orbital mechanics, and other limiting factors as spacecraft power and thermal constraints, (3) an optimization methodology that casts the resource and constraint models into a standard linear and nonlinear constrained optimization problem that lends itself to commercial off-the-shelf (COTS)planning and scheduling algorithms.

Mars relay network planning analysis↗

Optimal Feedback Control of Thermal Networks

An improved approach to the mathematical modeling of feedback control of thermal networks has been devised. Heretofore software for feedback control of thermal networks has been developed by time-consuming trial-and-error methods that depend on engineers expertise. In contrast, the present approach is a systematic means of developing algorithms for feedback control that is optimal in the sense that it combines performance with low cost of implementation. An additional advantage of the present approach is that a thermal engineer need not be expert in control theory. Thermal networks are lumped-parameter approximations used to represent complex thermal systems. Thermal networks are closely related to electrical networks commonly represented by lumped-parameter circuit diagrams. Like such electrical circuits, thermal networks are mathematically modeled by systems of differential-algebraic equations (DAEs) that is, ordinary differential equations subject to a set of algebraic constraints. In the present approach, emphasis is placed on applications in which thermal networks are subject to constant disturbances and, therefore, integral control action is necessary to obtain steady-state responses. The mathematical development of the present approach begins with the derivation of optimal integral-control laws via minimization of an appropriate cost functional that involves augmented state vectors. Subsequently, classical variational arguments provide optimality conditions in the form of the Hamiltonian equations for the standard linear-quadratic-regulator (LQR) problem. These equations are reduced to an algebraic Riccati equation (ARE) with respect to the augmented state vector. The solution of the ARE leads to the direct computation of the optimal proportional- and integral-feedback control gains. In cases of very complex networks, large numbers of state variables make it difficult to implement optimal controllers in the manner described in the preceding paragraph.

Papalexandris, Miltiadis↗

Uniform DT 3T burn: computations and sensitivities

A numerical model was developed in C to integrate the nonlinear deutrium-tritium (DT) burn equations in a three temperature (3T) approximation for spatially uniform test problems relevant to Inertial Confinement Fusion (ICF). Base model results are in excellent agreement with standard 3T results. Data from NDI, SESAME, and TOPS databases is extracted to create fits for the reaction rate parameter, the Planck opacity, and the coupling frequencies of the plasma temperatures. The impact of different fits (e.g., TOPS versus SESAME opacity data, higher order polynomial fits ofNDI data for the reaction rate parameter) were explored, and sensitivity to several model inputs are presented including: opacity data base, Coulomb logarithm, and Bremsstrahlung. Sensitivity to numerical integration time step size, and the relative insensitivity to the discretized numerics and numerical integration method was demonstrated. Variations in the IC for densities and temperatures were explored, showing similar DT burn profiles in most cases once ignition occurs. A coefficient multiplying the Compton coupling term (default, A = 1) can be adjusted to approximate results from more sophisticated models. The coefficient was reset (A = 0.4) to match the maximum temperatures resulting from standard multi-group simulations of the base case test problem. Setting the coefficient to a larger value, (A = 0.6) matches maximum ion temperatures in a kinetic simulation of a high density ICF-like regime. Matching peak temperatures does not match entire temperature-time profiles, indicating the Compton coefficient is density and time dependent as the photon distribution evolves. In the early time burn during the ignition of the DT, the present model with modified Compton coupling provides a very simple method to obtain a much improved match to the more accurate solution from the multi-group radiation model for these DT burn regimes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Analysis of Anderson Acceleration on a Simplified Neutronics/Thermal Hydraulics System

ABSTRACT A standard method for solving coupled multiphysics problems in light water reactors is Picard iteration, which sequentially alternates between solving single physics applications. This solution approach is appealing due to simplicity of implementation and the ability to leverage existing software packages to accurately solve single physics applications. However, there are several drawbacks in the convergence behavior of this method; namely slow convergence and the necessity of heuristically chosen damping factors to achieve convergence in many cases. Anderson acceleration is a method that has been seen to be more robust and fast converging than Picard iteration for many problems, without significantly higher cost per iteration or complexity of implementation, though its effectiveness in the context of multiphysics coupling is not well explored. In this work, we develop a one-dimensional model simulating the coupling between the neutron distribution and fuel and coolant properties in a single fuel pin. We show that this model generally captures the convergence issues noted in Picard iterations which couple high-fidelity physics codes. We then use this model to gauge potential improvements with regard to rate of convergence and robustness from utilizing Anderson acceleration as an alternative to Picard iteration.

Toth, Alex↗

Elk: A New MOOSE Framework Application for Radio-frequency Electromagnetics

A new tool in-development for general electromagnetic (EM) simulation for modeling radio-frequency (rf) systems is presented. The primary motivation for development of this tool is to leverage the flexibility and high-performance-computing capability of the Multiphysics Object-Oriented Simulation Environment (MOOSE) Framework developed by Idaho National Laboratory (INL) for complex EM problems. A MOOSE application (or MOOSE App) enables the end user to create a fully-functional simulation scenario without needing explicit knowledge of the underlying finite-element weak form implementation. MOOSE combines the libMesh library and the PetSc suite as the finite element and solver libraries, giving a robust platform for solving highly non-linear, coupled sets of PDEs such as those found in EM and plasma physics problems. Initial validation efforts have included standard waveguide and antenna benchmarks with the current focus being field validation against the well-known capacitively-coupled GEC Reference Cell (GEC-CCP). The results of this effort will be outlined and discussed. Future work plans including cold-plasma rf wave propagation studies and coupling to the plasma fluid MOOSE App, Zapdos [Lindsay et al 2016 J. Phys. D: Appl. Phys. 49 235204], will also be discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Interpreting Primal-Dual Algorithms for Constrained Multiagent Reinforcement Learning

Constrained multiagent reinforcement learning (C-MARL) is gaining importance as MARL algorithms find new applications in real-world systems ranging from energy systems to drone swarms. Most C-MARL algorithms use a primal-dual approach to enforce constraints through a penalty function added to the reward. In this paper, we study the structural effects of this penalty term on the MARL problem. First, we show that the standard practice of using the constraint function as the penalty leads to a weak notion of safety. However, by making simple modifications to the penalty term, we can enforce meaningful probabilistic (chance and conditional value at risk) constraints. Second, we quantify the effect of the penalty term on the value function, uncovering an improved value estimation procedure. We use these insights to propose a constrained multiagent advantage actor critic (C-MAA2C) algorithm. Simulations in a simple constrained multiagent environment affirm that our reinterpretation of the primal-dual method in terms of probabilistic constraints is effective, and that our proposed value estimate accelerates convergence to a safe joint policy.

chance constraints↗

Sensitivity analysis of coupled criticality calculations

Perturbation theory based sensitivity analysis is a vital part of todays' nuclear reactor design. This paper presents an extension of standard techniques to examine coupled criticality problems with mutual feedback between neutronics and an augmenting system (for example thermal-hydraulics). The proposed procedure uses a neutronic and an augmenting adjoint function to efficiently calculate the first order change in responses of interest due to variations of the parameters describing the coupled problem. The effect of the perturbations is considered in two different ways in our study: either a change is allowed in the power level while maintaining criticality (power perturbation) or a change is allowed in the eigenvalue while the power is constrained (eigenvalue perturbation). The calculated response can be the change in the power level, the reactivity worth of the perturbation, or the change in any functional of the flux, the augmenting dependent variables and the input parameters. To obtain power- and criticality-constrained sensitivities power- and k-reset procedures can be applied yielding identical results. Both the theoretical background and an application to a one dimensional slab problem are presented, along with an iterative procedure to compute the necessary adjoint functions using the neutronics and the augmenting codes separately, thus eliminating the need of developing new programs to solve the coupled adjoint problem. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

[Development of New Mathematical Methodology in Air Traffic Control for the Analysis of Hybrid Systems]

The aim of this research is to develop new mathematical methodology for the analysis of hybrid systems of the type involved in Air Traffic Control (ATC) problems. Two directions of investigation were initiated. The first used the methodology of nonlinear generalized functions, whose mathematical foundations were initiated by Colombeau and developed further by Oberguggenberger; it has been extended to apply to ordinary differential. Systems of the type encountered in control in joint work with the PI and M. Oberguggenberger. This involved a 'mixture' of 'continuous' and 'discrete' methodology. ATC clearly involves mixtures of two sorts of mathematical problems: (1) The 'continuous' dynamics of a standard control type described by ordinary differential equations (ODE) of the form: {dx/dt = f(x, u)} and (2) the discrete lattice dynamics involved of cellular automata. Most of the CA literature involves a discretization of a partial differential equation system of the type encountered in physics problems (e.g. fluid and gas problems). Both of these directions requires much thinking and new development of mathematical fundamentals before they may be utilized in the ATC work. Rather than consider CA as 'discretization' of PDE systems, I believe that the ATC applications will require a completely different and new mathematical methodology, a sort of discrete analogue of jet bundles and/or the sheaf-theoretic techniques to topologists. Here too, I have begun work on virtually 'virgin' mathematical ground (at least from an 'applied' point of view) which will require considerable preliminary work.

Hermann, Robert↗

The issue of gauge choice in the Landau problem and the physics of canonical and mechanical orbital angular momenta

One intriguing issue in the nucleon spin decomposition problem is the existence of two types of decompositions, which are representably characterized by two different orbital angular momenta (OAMs) of quarks. The one is the mechanical OAM, while the other is the so-called gauge-invariant canonical (g.i.c.) OAM, the concept of which was introduced by Chen et al. An especially delicate quantity is the g.i.c. OAM, which must be distinguished from the ordinary (gauge-variant) canonical OAM. We find that, owing to its analytically solvable nature, the famous Landau problem offers an ideal tool to understand the difference and the physical meaning of the above three OAMs, i.e. the standard canonical OAM, g.i.c. OAM, and the mechanical OAM. We analyze these three OAMs in two different formulations of the Landau problem, first in the standard (gauge-fixed) formulation and second in the gauge-invariant (but path-dependent) formulation of DeWitt. Especially interesting is the latter formalism. It is shown that the choice of path has an intimate connection with the choice of gauge, but they are not necessarily equivalent. Then, we answer the question about what is the consequence of a particular choice of path in DeWitt’s formalism. This analysis also clarifies the implication of the gauge symmetry hidden in the concept of g.i.c. OAM. Finally, we show that the finding above offers a clear understanding about the uniqueness or non-uniqueness problem of the nucleon spin decomposition, which arises from the arbitrariness in the definition of the so-called physical component of the gauge field.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Viscoelastic analysis of adhesively bonded joints

An adhesively bonded lap joint is analyzed by assuming that the adherends are elastic and the adhesive is linearly viscoelastic. After formulating the general problem a specific example for two identical adherends bonded through a three parameter viscoelastic solid adhesive is considered. The standard Laplace transform technique is used to solve the problem. The stress distribution in the adhesive layer is calculated for three different external loads, namely, membrane loading, bending, and transverse shear loading. The results indicate that the peak value of the normal stress in the adhesive is not only consistently higher than the corresponding shear stress but also decays slower.

Delale, F.↗

Viscoelastic analysis of adhesively bonded joints

In this paper an adhesively bonded lap joint is analyzed by assuming that the adherends are elastic and the adhesive is linearly viscoelastic. After formulating the general problem a specific example for two identical adherends bonded through a three parameter viscoelastic solid adhesive is considered. The standard Laplace transform technique is used to solve the problem. The stress distribution in the adhesive layer is calculated for three different external loads namely, membrane loading, bending, and transverse shear loading. The results indicate that the peak value of the normal stress in the adhesive is not only consistently higher than the corresponding shear stress but also decays slower.

Delale, F.↗

Strict Constraint Feasibility in Analysis and Design of Uncertain Systems

This paper proposes a methodology for the analysis and design optimization of models subject to parametric uncertainty, where hard inequality constraints are present. Hard constraints are those that must be satisfied for all parameter realizations prescribed by the uncertainty model. Emphasis is given to uncertainty models prescribed by norm-bounded perturbations from a nominal parameter value, i.e., hyper-spheres, and by sets of independently bounded uncertain variables, i.e., hyper-rectangles. These models make it possible to consider sets of parameters having comparable as well as dissimilar levels of uncertainty. Two alternative formulations for hyper-rectangular sets are proposed, one based on a transformation of variables and another based on an infinity norm approach. The suite of tools developed enable us to determine if the satisfaction of hard constraints is feasible by identifying critical combinations of uncertain parameters. Since this practice is performed without sampling or partitioning the parameter space, the resulting assessments of robustness are analytically verifiable. Strategies that enable the comparison of the robustness of competing design alternatives, the approximation of the robust design space, and the systematic search for designs with improved robustness characteristics are also proposed. Since the problem formulation is generic and the solution methods only require standard optimization algorithms for their implementation, the tools developed are applicable to a broad range of problems in several disciplines.

Crespo, Luis G.↗

Hard Constraints in Optimization Under Uncertainty

This paper proposes a methodology for the analysis and design of systems subject to parametric uncertainty where design requirements are specified via hard inequality constraints. Hard constraints are those that must be satisfied for all parameter realizations within a given uncertainty model. Uncertainty models given by norm-bounded perturbations from a nominal parameter value, i.e., hyper-spheres, and by sets of independently bounded uncertain variables, i.e., hyper-rectangles, are the focus of this paper. These models, which are also quite practical, allow for a rigorous mathematical treatment within the proposed framework. Hard constraint feasibility is determined by sizing the largest uncertainty set for which the design requirements are satisfied. Analytically verifiable assessments of robustness are attained by comparing this set with the actual uncertainty model. Strategies that enable the comparison of the robustness characteristics of competing design alternatives, the description and approximation of the robust design space, and the systematic search for designs with improved robustness are also proposed. Since the problem formulation is generic and the tools derived only require standard optimization algorithms for their implementation, this methodology is applicable to a broad range of engineering problems.

Crespo, Luis G.↗

Taming the Goldstone contributions to the effective potential

The standard perturbative effective potential suffers from two related problems of principle involving the field-dependent Goldstone boson squared mass, G. First, in general G can be negative, and it actually is negative in the Standard Model; this leads to imaginary contributions to the effective potential that are not associated with a physical instability, and therefore spurious. Second, in the limit that G approaches zero, the effective potential minimization condition is logarithmically divergent already at two-loop order, and has increasingly severe power-law singularities at higher loop orders. I resolve both issues by resumming the Goldstone boson contributions to the effective potential. For the resulting resummed effective potential, the minimum value and the minimization condition that gives the vacuum expectation value are obtained in forms that do not involve G at all.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The improved robustness of multigrid elliptic solvers based on multiple semicoarsened grids

Multigrid convergence rates degenerate on problems with stretched grids or anisotropic operators, unless one uses line or plane relaxation. For 3-D problems, only plane relaxation suffices, in general. While line and plane relaxation algorithms are efficient on sequential machines, they are quite awkward and inefficient on parallel machines. A new multigrid algorithm is presented based on the use of multiple coarse grids, that eliminates the need for line or plane relaxation in anisotropic problems. This algorithm was developed and the standard multigrid theory was extended to establish rapid convergence for this class of algorithms. The new algorithm uses only point relaxation, allowing easy and efficient parallel implementation, yet achieves robustness and convergence rates comparable to line and plane relaxation multigrid algorithms. The algorithm described is a variant of Mulder's multigrid algorithm for hyperbolic problems. The latter uses multiple coarse grids to achieve robustness, but is unsuitable for elliptic problems, since its V-cycle convergence rate goes to one as the number of levels increases. The new algorithm combines the contributions from the multiple coarse grid via a local switch, based on the strength of the discrete operator in each coordinate direction.

Naik, Naomi H.↗