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 109 records · Page 6

Optimal control of sun tracking solar concentrators

Application of the modern control theory to derive an optimal sun tracking control for a point focusing solar concentrator is presented. A standard tracking problem converted to regulator problem using a sun rate input achieves an almost zero steady state tracking error with the optimal control formulation. However, these control techniques are costly because optimal type algorithms require large computing systems, thus they will be used mainly as comparison standards for other types of control algorithms and help in their development.

Hughes, R. O.↗

A Parallel Algorithm for the Vehicle Routing Problem

The vehicle routing problem (VRP) is a dicult and well-studied combinatorial optimization problem. We develop a parallel algorithm for the VRP that combines a heuristic local search improvement procedure with integer programming. We run our parallel algorithm with as many as 129 processors and are able to quickly nd high-quality solutions to standard benchmark problems. We assess the impact of parallelism by analyzing our procedure's performance under a number of dierent scenarios.

Groer, Christopher S↗

Diabatic quantum annealing for the frustrated ring model

Abstract Quantum annealing (QA) is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare ground state and a problem Hamiltonian whose ground state encodes solutions to an optimization problem. The standard implementation relies on the evolution being adiabatic: keeping the system in the instantaneous ground state with high probability and requiring a time scale inversely related to the minimum energy gap between the instantaneous ground and excited states. However, adiabatic evolution can lead to evolution times that scale exponentially with the system size, even for computationally simple problems. Here, we study whether non-adiabatic evolutions with optimized annealing schedules can bypass this exponential slowdown for one such class of problems called the frustrated ring model. For sufficiently optimized annealing schedules and system sizes of up to 39 qubits, we provide numerical evidence that we can avoid the exponential slowdown. Our work highlights the potential of highly-controllable QA to circumvent bottlenecks associated with the standard implementation of QA.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simulation of Optical Phenomena in the Upper Atmosphere

This SAND report investigates the electron transport equation in the upper atmosphere and how it relates to auroral light emissions. The electron transport problem is a very stiff boundary value problem, so standard numerical methods such as symmetric collocation and shooting methods will not succeed unless if the boundary conditions are altered with unrealistic assumptions. We show this to be unnecessary and demon- strate a method in which the fast and slow modes of the boundary value problem are essentially decoupled. This allows for an upwind finite difference method to be applied to each mode as is appropriate. This greatly reduces the number of points needed in the mesh, and we demonstrate how this eliminates the need to define new boundary conditions. This method can be verified by showing that under certain restrictive as- sumptions, the electron transport equation has an exact solution that can be written as an integral. The connection between electron transport and the aurora is made explicit and a kinetic model for calculating auroral light emissions is given.

54 ENVIRONMENTAL SCIENCES↗

Analytic Theory and Control of the Motion of Spinning Rigid Bodies

Numerical simulations are often resorted to, in order to understand the attitude response and control characteristics of a rigid body. However, this approach in performing sensitivity and/or error analyses may be prohibitively expensive and time consuming, especially when a large number of problem parameters are involved. Thus, there is an important role for analytical models in obtaining an understanding of the complex dynamical behavior. In this dissertation, new analytic solutions are derived for the complete attitude motion of spinning rigid bodies, under minimal assumptions. Hence, we obtain the most general solutions reported in the literature so far. Specifically, large external torques and large asymmetries are included in the problem statement. Moreover, problems involving large angular excursions are treated in detail. A new tractable formulation of the kinematics is introduced which proves to be extremely helpful in the search for analytic solutions of the attitude history of such kinds of problems. The main utility of the new formulation becomes apparent however, when searching for feedback control laws for stabilization and/or reorientation of spinning spacecraft. This is an inherently nonlinear problem, where standard linear control techniques fail. We derive a class of control laws for spin axis stabilization of symmetric spacecraft using only two pairs of gas jet actuators. Practically, this could correspond to a spacecraft operating in failure mode, for example. Theoretically, it is also an important control problem which, because of its difficulty, has received little, if any, attention in the literature. The proposed control laws are especially simple and elegant. A feedback control law that achieves arbitrary reorientation of the spacecraft is also derived, using ideas from invariant manifold theory. The significance of this research is twofold. First, it provides a deeper understanding of the fundamental behavior of rigid bodies subject to body-fixed torques. Assessment of the analytic solutions reveals that they are very accurate; for symmetric bodies the solutions of Euler's equations of motion are, in fact, exact. Second, the results of this research have a fundamental impact on practical scientific and mechanical applications in terms of the analysis and control of all finite-sized rigid bodies ranging from nanomachines to very large bodies, both man made and natural. After all, Euler's equations of motion apply to all physical bodies, barring only the extreme limits of quantum mechanics and relativity.

Tsiotras, Panagiotis↗

Numerical Optimization Using Computer Experiments

Engineering design optimization often gives rise to problems in which expensive objective functions are minimized by derivative-free methods. We propose a method for solving such problems that synthesizes ideas from the numerical optimization and computer experiment literatures. Our approach relies on kriging known function values to construct a sequence of surrogate models of the objective function that are used to guide a grid search for a minimizer. Results from numerical experiments on a standard test problem are presented.

Trosset, Michael W.↗

A Generalized Perturbation Theory Solver In Rattlesnake Based On PETSc With Application To TREAT Steady State Uncertainty Quantification

Rattlesnake and MAMMOTH are the designated TREAT analysis tools currently being developed at the Idaho National Laboratory. Concurrent with development of the multi-physics, multi-scale capabilities, sensitivity analysis and uncertainty quantification (SA/UQ) capabilities are required for predicitive modeling of the TREAT reactor. For steady-state SA/UQ, that is essential for setting initial conditions for the transients, generalized perturbation theory (GPT) will be used. This work describes the implementation of a PETSc based solver for the generalized adjoint equations that constitute a inhomogeneous, rank deficient problem. The standard approach is to use an outer iteration strategy with repeated removal of the fundamental mode contamination. The described GPT algorithm directly solves the GPT equations without the need of an outer iteration procedure by using Krylov subspaces that are orthogonal to the operator’s nullspace. Three test problems are solved and provide sufficient verification for the Rattlesnake’s GPT capability. We conclude with a preliminary example evaluating the impact of the Boron distribution in the TREAT reactor using perturbation theory.

97 MATHEMATICS AND COMPUTING↗

A variational approach to the study of capillary phenomena

The problem of determining the free surface of a liquid in a capillary tube, and of a liquid drop, sitting first on a horizontal plane and then on more general surfaces is considered. With some modifications, the method applies to the study of pendent drops and of rotating drops as well. The standard capillary problem, i.e. the determination of the free surface of a liquid in a thin tube of general cross section, which resuls from the simultaneous action of surface tension, boundary adhesion and gravity is discussed. It turns out that in this case the existence of the solution surface depends heavily on the validity of a simple geometric condition about the mean curvature of the boundary curve of the cross section of the capillary tube. Some particular examples of physical interest are also be discussed. Liquid drops sitting on or hanging from a fixed horizontal plane are discussed. The symmetry of the solutions (which can actually be proved, as consequence of a general symmetrization argument) now plays the chief role in deriving both the existence and the regularity of energy-minimizing configurations. When symmetry fails (this is the case, for example, when the contact angle between the drop and the plate is not constant, or when the supporting surface is not itself symmetric), then more sophisticated methods must be used. Extensions in this direction are outlined.

Emmer, M.↗

Optimal control of the signal-to-noise ratio per unit time of a spin 1/2 particle: The crusher gradient and the radiation damping cases

We show to which extent the signal to noise ratio per unit time of a spin 1/2 particle can be maximized. We consider a cyclic repetition of experiments made of a measurement followed by a radio-frequency magnetic field excitation of the system, in the case of unbounded amplitude. In the periodic regime, the objective of the control problem is to design the initial state of the system and the pulse sequence which leads to the best signal to noise performance. We focus on two specific issues relevant in nuclear magnetic resonance, the crusher gradient and the radiation damping cases. Optimal control techniques are used to solve this non-standard control problem. We discuss the optimality of the Ernst angle solution, which is commonly applied in spectroscopic and medical imaging applications. In the radiation damping situation, we show that in some cases, the optimal solution differs from the Ernst one.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Air traffic controller aids for planning of arrival traffic - An AI approach

Air traffic management is considered as an AI problem, and planning concepts are developed for incorporation into an automation aid for enroute arrival controllers being developed by NASA. An Assumption-Based Truth Maintenance System is modified to include the nonmonotonicities inherent in the Air Traffic Control (ATC) domain, and it is noted under what circumstances the advantages of the ATMS in standard problem-solving domains carry over to planning. The noninteracting actions of the conceptualization are contrasted with the interacting actions of other domains. It is shown that the noninteracting nature of the ATC domain makes it possible to provide an efficient planner that avoids the frame problem.

Chrisley, Ron↗

Lefschetz thimble quantum Monte Carlo for spin systems

Monte Carlo simulations are useful tools for modeling quantum systems, but in some cases they suffer from a sign problem, leading to an exponential slow down in their convergence to a value. While solving the sign problem is generically NP hard, many techniques exist for mitigating the sign problem in specific cases; in particular, the technique of deforming the Monte Carlo simulation's plane of integration onto Lefschetz thimbles (complex hypersurfaces of stationary phase) has seen significant success in the context of quantum field theories. We extend this methodology to spin systems by utilizing spin coherent state path integrals to reexpress the spin system's partition function in terms of continuous variables. Using some toy systems, we demonstrate its effectiveness at lessening the sign problem in this setting, despite the fact that the initial mapping to spin coherent states introduces its own sign problem. The standard formulation of the spin coherent path integral is known to make use of uncontrolled approximations; despite this, for large spins they are typically considered to yield accurate results, so it is somewhat surprising that our results show significant systematic errors. Furthermore, possibly of independent interest, our use of Lefschetz thimbles to overcome the intrinsic sign problem in spin coherent state path integral Monte Carlo enables a novel numerical demonstration of a breakdown in the spin coherent path integral.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modeling and Integration of Flexible Demand in Heat and Electricity Integrated Energy System

This paper is focused on utilizing customers' flexible energy demand, including both heat demand and electricity demand, to provide balancing resources and relieve the difficulties of integrating variable wind power with the combined heat and power. The integration of heat and electricity energy systems providing customers with multiple options for fulfilling their energy demand is described. Customer aggregators are introduced to supply downstream demand in the most economical way. Controlling customers' energy consumption behaviors enables aggregators to adjust their energy demand in response to supply conditions. Incorporating aggregators' flexible energy demand into the centralized energy dispatch model, a two-level optimization problem (TLOP) is first formed where the system operatormaximizes social welfare subject to aggregators' strategies, which minimize the energy purchase cost. Furthermore, the subproblems are linearized based on several reasonable assumptions. Optimal conditions of the subproblems are then transformed as energy demands to be described as explicit piecewise-linear functions of electricity prices corresponding to the demand bid curves. In this way, the TLOP is transformed to a standard optimization problem, which requires aggregators to only submit a demand bid to run the centralized energy dispatch program. All the parameters pertaining to the aggregators' energy consumption models are internalized in the bid curves. The proposed technique is illustrated in a modified testing system.

combined heat and power (CHP)↗

Plaster: An Integration, Benchmark and Development Framework for Heterogeneous Metadata Normalization Methods

The recent advances in the automation of metadata normalization and the invention of a unified schema — Brick — alleviate the metadata normalization challenge for deploying portable applications across buildings. Yet, the lack of compatibility between existing metadata normalization methods precludes the possibility of comparing and combining them. While generic machine learning (ML) frameworks, such as MLJAR and OpenML, provide versatile interfaces for standard ML problems, they cannot easily accommodate the metadata normalization tasks for buildings due to the heterogeneity in the inference scope, type of data required as input, evaluation metric, and the building-specific human-in-the-loop learning procedure. We propose Plaster, an open and modular framework that incorporates existing advances in building metadata normalization. It provides unified programming interfaces for various types of learning methods for metadata normalization and defines standardized data models for building metadata and timeseries data. Thus, it enables the integration of different methods via a workflow, benchmarking of different methods via unified interfaces, and rapid prototyping of new algorithms. With Plaster, we 1) show three examples of the workflow integration, delivering better performance than individual algorithms, 2) benchmark/analyze five algorithms over five common buildings, and 3) exemplify the process of developing a new algorithm involving time series features. We believe Plaster will facilitate the development of new algorithms and expedite the adoption of standard metadata schema such as Brick, in order to enable seamless smart building applications in the future.

99 GENERAL AND MISCELLANEOUS↗

A general algorithm for solving the algebraic Riccati equation

The generalized eigenvalue problem provides a suitable framework for reliable solutions of many system theoretic, control, and estimation problems. A general algorithm for solving the matrix algebraic Riccati equation (ARE) which utilizes a pencil structure is described here. This algorithm avoids unnecessary inversion of cost or transition matrices, making it a numerically sound way to solve for the gains and/or ARE with singular quadratic costs, for cases satisfying detectability and stabilizability conditions. Examples are solution with discrete dead-beat control, noiseless measurements in Kalman filters and time-delays in discrete-time systems, which cause difficulties in the Hamiltonian standard eigenvalue problem formulation. The ARE algorithm implementatiton and numerical examples are shown.

Walker, R. A.↗

Convergence of Probability Densities Using Approximate Models for Forward and Inverse Problems in Uncertainty Quantification

Here, we analyze the convergence of probability density functions utilizing approximate models for both forward and inverse problems. We consider the standard forward uncertainty quantification problem where an assumed probability density on parameters is propagated through the approximate model to produce a probability density, often called a push-forward probability density, on a set of quantities of interest (QoI). The inverse problem considered in this paper seeks to update an initial probability density assumed on model input parameters such that the subsequent push-forward of this updated density through the parameter-to-QoI map matches a given probability density on the QoI. We prove that the densities obtained from solving the forward and inverse problems, using approximate models, converge to the true densities as the approximate models converge to the true models. Numerical results are presented to demonstrate convergence rates of densities for sparse grid approximations of parameter-to-QoI maps and standard spatial and temporal discretizations of PDEs and ODEs.

97 MATHEMATICS AND COMPUTING↗

Remarks on nonstandard least-squares problems

It is shown that after treating a least-squares problem in the standard fashion, the imposition of stochastic restrictions on certain parameters can be accomplished essentially by inverting a matrix of an order no larger than the total number of restricted parameters, and that generally there is an explicit term for correcting the unrestricted to the restricted solution. In addition, any known type of nonstandard least-squares adjustment problem can be reduced to an equivalent standard linear problem, that is, one in which there is exactly one observation per condition equation and in which the observations are not correlated.

Eichhorn, H.↗

NSFnets (Navier-Stokes flow nets): Physics-informed neural networks for the incompressible Navier-Stokes equations

In the last 50 years there has been a tremendous progress in solving numerically the Navier-Stokes equations using finite differences, finite elements, spectral, and even meshless methods. Yet, in many real cases, we still cannot incorporate seamlessly (multi-fidelity) data into existing algorithms, and for industrial-complexity applications the mesh generation is time consuming and still an art. Moreover, solving ill-posed problems (e.g., lacking boundary conditions) or inverse problems is often prohibitively expensive and requires different formulations and new computer codes. Here, we employ physics-informed neural networks (PINNs), encoding the governing equations directly into the deep neural network via automatic differentiation, to overcome some of the aforementioned limitations for simulating incompressible laminar and turbulent flows. We develop the Navier-Stokes flow nets (NSFnets) by considering two different mathematical formulations of the Navier-Stokes equations: the velocity-pressure (VP) formulation and the vorticity-velocity (VV) formulation. Since this is a new approach, we first select some standard benchmark problems to assess the accuracy, convergence rate, computational cost and flexibility of NSFnets; analytical solutions and direct numerical simulation (DNS) databases provide proper initial and boundary conditions for the NSFnet simulations. The spatial and temporal coordinates are the inputs of the NSFnets, while the instantaneous velocity and pressure fields are the outputs for the VP-NSFnet, and the instantaneous velocity and vorticity fields are the outputs for the VV-NSFnet. This is unsupervised learning and, hence, no labeled data are required beyond boundary and initial conditions and the fluid properties. The residuals of the VP or VV governing equations, together with the initial and boundary conditions, are embedded into the loss function of the NSFnets. No data is provided for the pressure to the VP-NSFnet, which is a hidden state and is obtained via the incompressibility constraint without extra computational cost. Unlike the traditional numerical methods, NSFnets inherit the properties of neural networks (NNs), hence the total error is composed of the approximation, the optimization, and the generalization errors. Here, we empirically attempt to quantify these errors by varying the sampling (“residual”) points, the iterative solvers, and the size of the NN architecture. For the laminar flow solutions, we show that both the VP and the VV formulations are comparable in accuracy but their best performance corresponds to different NN architectures. The initial convergence rate is fast but the error eventually saturates to a plateau due to the dominance of the optimization error. For the turbulent channel flow, we show that NSFnets can sustain turbulence at , but due to expensive training we only consider part of the channel domain and enforce velocity boundary conditions on the subdomain boundaries provided by the DNS data base. We also perform a systematic study on the weights used in the loss function for balancing the data and physics components, and investigate a new way of computing the weights dynamically to accelerate training and enhance accuracy. In the last part, we demonstrate how NSFnets should be used in practice, namely for ill-posed problems with incomplete or noisy boundary conditions as well as for inverse problems. We obtain reasonably accurate solutions for such cases as well without the need to change the NSFnets and at the same computational cost as in the forward well-posed problems. As a result, we also present a simple example of transfer learning that will aid in accelerating the training of NSFnets for different parameter settings.

97 MATHEMATICS AND COMPUTING↗