Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 613 records · Page 34

Hamiltonian formalism in the equilibrium problem for a plasma with islands

Hamiltonian formalism is applied to the equilibrium problem for a plasma with islands by using an analogy between the equilibrium problem for a plasma with one island and the nonlinear mechanics of a physical pendulum. A relationship is established between magnetic flux coordinates with straightened magnetic field lines and the action-angle variables. The flux and current representations of a magnetic field with islands are obtained, and the solution to the equilibrium problem for a narrow island is presented.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Goal-Oriented Optimal Approximations of Bayesian Linear Inverse Problems

We propose optimal dimensionality reduction techniques for the solution of goal-oriented linear-Gaussian inverse problems, where the quantity of interest (QoI) is a function of the inversion parameters. These approximations are suitable for large-scale applications. In particular, we study the approximation of the posterior covariance of the QoI as a low-rank negative update of its prior covariance and prove optimality of this update with respect to the natural geodesic distance on the manifold of symmetric positive definite matrices. Assuming exact knowledge of the posterior mean of the QoI, the optimality results extend to optimality in distribution with respect to the Kullback--Leibler divergence and the Hellinger distance between the associated distributions. We also propose the approximation of the posterior mean of the QoI as a low-rank linear function of the data and prove optimality of this approximation with respect to a weighted Bayes risk. Both of these optimal approximations avoid the explicit computation of the full posterior distribution of the parameters and instead focus on directions that are well informed by the data and relevant to the QoI. These directions stem from a balance among all the components of the goal-oriented inverse problem: prior information, forward model, measurement noise, and ultimate goals. We illustrate the theory using a high-dimensional inverse problem in heat transfer.

97 MATHEMATICS AND COMPUTING↗

A Parallel Cut-Cell Algorithm for the Free-Boundary Grad--Shafranov Problem

A parallel cut-cell algorithm is described to solve the free-boundary problem of the Grad--Shafranov equation. The algorithm reformulates the free-boundary problem in an irregular bounded domain and its important aspects include a searching algorithm for the magnetic axis and separatrix, a surface integral along the irregular boundary to determine the boundary values, an approach to optimize the coil current based on a targeting plasma shape, Picard iterations with Aitken's acceleration for the resulting nonlinear problem, and a Cartesian grid embedded boundary method to handle the complex geometry. Here the algorithm is implemented in parallel using a standard domain-decomposition approach and a good parallel scaling is observed. Numerical results verify the accuracy and efficiency of the free-boundary Grad--Shafranov solver.

97 MATHEMATICS AND COMPUTING↗

Optimal Experimental Design for Inverse Problems in the Presence of Observation Correlations

Optimal experimental design (OED) is the general formalism of sensor placement and decisions on the data collection strategy for engineered or natural experiments. This problem is prevalent in many critical fields such as battery design, numerical weather prediction, geosciences, environmental and urban studies. State-of-the-art computational methods for experimental design do not accommodate correlation structure in observational errors produced by many expensive-to-operate devices such as X-ray machines, radars, and satellites. Discarding evident data correlations leads to biased results, higher expenses, and waste of valuable resources. We present a general formulation of the OED formalism for model-constrained large-scale Bayesian linear inverse problems, where measurement errors are generally correlated. The proposed approach utilizes the Hadamard product of matrices to formulate the weighted-likelihood, and is valid for both finite as well as infinite-dimensional Bayesian inverse problems. Extensive numerical experiments are carried out for empirical verification of the proposed approach using an advection-diffusion model, where the objective is to optimally place a small set of sensors, under a limited budget, to predict the concentration of a contaminant in a closed and bounded domain.

Correlated observations↗

A Variational Inference Approach to Inverse Problems with Gamma Hyperpriors

Hierarchical models with gamma hyperpriors provide a flexible, sparse-promoting framework to bridge L 1 and L 2 regularizations in Bayesian formulations to inverse problems. Despite the Bayesian motivation for these models, existing methodologies are limited to maximum a posteriori estimation. The potential to perform uncertainty quantification has not yet been realized. This paper introduces a variational iterative alternating scheme for hierarchical inverse problems with gamma hyperpriors. The proposed variational inference approach yields accurate reconstruction, provides meaningful uncertainty quantification, and is easy to implement. In addition, it lends itself naturally to conduct model selection for the choice of hyperparameters. Here, we illustrate the performance of our methodology in several computed examples, including a deconvolution problem and sparse identification of dynamical systems from time series data.

Bayesian shrinkage↗

An Asymptotically Compatible Coupling Formulation for Nonlocal Interface Problems with Jumps

Here, we introduce a mathematically rigorous formulation for a nonlocal interface problem with jumps and propose an asymptotically compatible finite element discretization for the weak form of the interface problem. After proving the well-posedness of the weak form, we demonstrate that solutions to the nonlocal interface problem converge to the corresponding local counterpart when the nonlocal data are appropriately prescribed. Several numerical tests in one and two dimensions show the applicability of our technique, its numerical convergence to exact nonlocal solutions, its convergence to the local limit when the horizons vanish, and its robustness with respect to the patch test.

97 MATHEMATICS AND COMPUTING↗

The nonconforming virtual element method for eigenvalue problems

We analyse the nonconforming Virtual Element Method (VEM) for the approximation of elliptic eigenvalue problems. The nonconforming VEM allow to treat in the same formulation the two- and three-dimensional case.We present two possible formulations of the discrete problem, derived respectively by the nonstabilized and stabilized approximation of the L 2 -inner product, and we study the convergence properties of the corresponding discrete eigenvalue problems. The proposed schemes provide a correct approximation of the spectrum and we prove optimal-order error estimates for the eigenfunctions and the usual double order of convergence of the eigenvalues. Finally we show a large set of numerical tests supporting the theoretical results, including a comparison with the conforming Virtual Element choice.

97 MATHEMATICS AND COMPUTING↗

Using Differential Forms to Find Symmetries in the Noh Problem for an Ideal Gas in a Spherical System

The Euler equations describe inviscid, compressible gas flow and are derived using the laws of conservation of mass, momentum, and energy. From these equations a common test problem, the Noh problem, can be solved for invariant solutions in planar, cylindrical, and spherical geometries. Using Lie group analysis methods, we will solve the Noh Problem for an ideal gas in a spherical system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

String Theory, the Dark Sector, and the Hierarchy Problem

We discuss dark energy, dark matter and the hierarchy problem in the context of a general non-commutative formulation of string theory. In this framework dark energy is generated by the dynamical geometry of the dual spacetime while dark matter, on the other hand, comes from the degrees of freedom dual to the visible matter. This formulation of string theory is sensitive both to the IR and UV scales and the Higgs scale is radiatively stable by being a geometric mean of radiatively stable UV and IR scales. We also comment on various phenomenological signatures of this novel approach to dark energy, dark matter and the hierarchy problem. We find that this new view on the hierarchy problem is realized in a toy model based on a non-holomorphic deformation of the stringy cosmic string. Finally, we discuss a proposal for a new non-perturbative formulation of string theory, which sheds light on M theory and F theory, as well as on supersymmetry and holography.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Feasible Actuator Range Modifier (FARM), a Tool Aiding the Solution of Unit Dispatch Problems for Advanced Energy Systems

Integrated energy systems (IESs) seek to minimize power generating costs in future power grids through the coupling of different energy technologies. To accommodate fluctuations in load demand due to the penetration of renewable energy sources, flexible operation capabilities must be fully exploited, and even power plants that are traditionally considered as base-load units need to be operated according to unconventional paradigms. Thermomechanical loads induced by frequent power adjustments can accelerate the wear and tear. If a unit is flexibly operated without respecting limits on materials, the risk of failures of expensive components will eventually increase, nullifying the additional profits ensured by flexible operation. In addition to the bounds on power variations (explicit constraints),the solution of the unit dispatch problem needs to meet the limits on the variation of key process variables, including temperature, pressure and flow rate (implicit constraints).The FARM (Feasible Actuator Range Modifier) module was developed to enable existing optimization algorithms to identify solutions to the unit dispatch problem that are both economically favorable and technologically sustainable. Thanks to the iterative dispatcher–validator scheme, FARM permits addressing all the imposed constraints without excessively increasing the computational costs. In this work, the algorithms constituting the module are described, and the performance was assessed by solving the unit dispatch problem for an IES composed of three units, i.e., balance of plant, gas turbine, and high-temperature steam electrolysis. Finally, the FARM module provides dedicated tools for visualizing the response of the constrained variables of interest during operational transients and a tool aiding the operator at making decisions. These techniques might represent the first step towards the deployment of an ecological interface design (EID) for IES units.

47 OTHER INSTRUMENTATION↗

The Real Problem (Humans) and Some Potentially Effective Alternatives and New Tools

The presentation offers a wider perspective, where on the example of Everglades’ restoration efforts, the real problem – humans – is exposed. Some potentially effective alternatives and new tools are offered and discussed. Everglades’s problems are primarily caused to human activity, whether these are related to poor water quality, land use changes or cheap short-sighted fixes. Ground rules need to be set in order to have a real discussion and seek real solutions to such problems. The difference between facts and opinions is explained, so is the difference between interests and positions. These terms are often partly coinciding in human minds, thus causing further misunderstandings in pursuing real solutions. Some confounding factors in the Everglades restoration efforts are listed, with one of the main examples being the assignment of a monetary value to all factors. Some of these factors are priceless, but not being valued easily and properly (such as water). The proposed alternative to monetary value is assigning energy as the unit of measurement. The two main methods for such alternate approach are (1) Embodied energy (Emergy) and (2) Life Cycle Analysis. Agriculturally-based ecosystems services are different from natural ecosystems services. Pursuing agriculturally-based ecosystems services (such as e.g. water storage on farms, reducing nutrients in water, using flood-tolerant crops cultivars, etc.) can develop eco-services into agricultural operations and systems, addressing everyone’s interest and benefiting the society.

09 BIOMASS FUELS↗

Efficient solutions to the NDA-NCA low-order eigenvalue problem

Recent algorithmic advances combine moment-based acceleration and Jacobian-Free Newton-Krylov (JFNK) methods to accelerate the computation of the dominant eigenvalue in a k-eigenvalue calculation. In particular, NDA-NCA [1], builds a sequence of low-order (LO) diffusion-based eigenvalue problems in which the solution converges to the true eigenvalue solution. Within NDA-NCA, the solution to the LO k-eigenvalue problem is computed by solving a system of nonlinear equation using some variant of Newton's method. We show that we can speed up the solution to the LO problem dramatically by abandoning the JFNK method and exploiting the structure of the Jacobian matrix. (authors)

97 MATHEMATICS AND COMPUTING↗

The packing problem of uncertain multicasts

Summary Multicast performs better than unicast in delivering the same content from a fixed single source to a set of destinations. Many efforts have been made to optimize such kind of deterministic multicast, such as minimizing the transmission cost of each multicast session. In practice, it is not necessary that the source of each multicast session has to be in a specific location, as long as certain constraints are satisfied. Accordingly, applications usually meet a novel multicast with uncertain sources, ie, uncertain multicast. That is, multiple nodes have the responsibility to act as the root node of a multicast session. Prior proposals have addressed an uncertain multicast by constructing the minimum cost forest. However, it is still unknown how to efficiently share the network resources, when a set of uncertain multicast occupies the network simultaneously. To tackle such a challenging issue, we present the packing problem of uncertain multicasts (MPU) to minimize the total transmission cost, under the constraint of link capacity. We prove that the MPU problem is NP‐hard. An intrinsic solution is constructing the minimum cost forest for each uncertain multicast individually. This method, however, is inefficient and may be infeasible because of the constraint of link capacity. Thus, we design 2 dedicated greedy methods, named priority‐based and adjusting congested link, to approximate the optimal solution. The comprehensive results indicate that both of our 2 methods can find a feasible solution for the MPU problem. Moreover, given a set of uncertain multicasts, the adjusting congested link method can generate a desired transmission structure for each uncertain multicast and achieve the least total cost when packing them.

Ren, Bangbang↗

Constrained Extrapolation Problem and Order-Dependent Mappings

In this work, we consider the problem of extrapolating the perturbation series for the dilute Fermi gas in three dimensions to the unitary limit of infinite scattering length and into the BEC region, using the available strong-coupling information to constrain the extrapolation problem. In this constrained extrapolation problem (CEP) the goal is to find classes of approximants that give well converged results already for low perturbative truncation orders. First, we show that standard Padé and Borel methods are too restrictive to give satisfactory results for this CEP. A generalization of Borel extrapolation is given by the so-called Maximum Entropy extrapolation method (MaxEnt). However, we show that MaxEnt requires extensive elaborations to be applicable to the dilute Fermi gas and is thus not practical for the CEP in this case. Instead, we propose order-dependent-mapping extrapolation (ODME) as a simple, practical, and general method for the CEP. Here, we find that the ODME approximants for the ground-state energy of the dilute Fermi gas are robust with respect to changes of the mapping choice and agree with results from quantum Monte Carlo simulations within uncertainties.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

OpenGraphGym: A Parallel Reinforcement Learning Framework for Graph Optimization Problems

This paper presents an open-source, parallel AI environment (named OpenGraphGym) to facilitate the application of reinforcement learning (RL) algorithms to address combinatorial graph optimization problems. This environment incorporates a basic deep reinforcement learning method, and several graph embeddings to capture graph features, it also allows users to rapidly plug in and test new RL algorithms and graph embeddings for graph optimization problems. This new open-source RL framework is targeted at achieving both high performance and high quality of the computed graph solutions. This RL framework forms the foundation of several ongoing research directions, including 1) benchmark works on different RL algorithms and embedding methods for classic graph problems; 2) advanced parallel strategies for extreme-scale graph computations, as well as 3) performance evaluation on real-world graph solutions.

Zheng, Weijian↗

Scalable Data Management of the Uintah Simulation Framework for Next-Generation Engineering Problems with Radiation

The need to scale next-generation industrial engineering problems to the largest computational platforms presents unique challenges. This paper focuses on data management related problems faced by the Uintah simulation framework at a production scale of 260K processes. Uintah provides a highly scalable asynchronous many-task runtime system, which in this work is used for the modeling of a 1000 megawatt electric (MWe) ultra-supercritical (USC) coal boiler. At 260K processes, we faced both parallel I/O and visualization related challenges, e.g., the default file-per-process I/O approach of Uintah did not scale on Mira. In this paper we present a simple to implement, restructuring based parallel I/O technique. We impose a restructuring step that alters the distribution of data among processes. The goal is to distribute the dataset such that each process holds a larger chunk of data, which is then written to a file independently. This approach finds a middle ground between two of the most common parallel I/O schemes–file per process I/O and shared file I/O–in terms of both the total number of generated files, and the extent of communication involved during the data aggregation phase. To address scalability issues when visualizing the simulation data, we developed a lightweight renderer using OSPRay, which allows scientists to visualize the data interactively at high quality and make production movies. Finally, this work presents a highly efficient and scalable radiation model based on the sweeping method, which significantly outperforms previous approaches in Uintah, like discrete ordinates. The integrated approach allowed the USC boiler problem to run on 260K CPU cores on Mira.

97 MATHEMATICS AND COMPUTING↗

Landscaping the strong CP problem

One often hears that the strong CP problem is the one problem which cannot be solved by anthropic reasoning. We argue that this is not so. Due to nonperturbative dynamics, states with a different CP violating paramenter θ acquire different vacuum energies after the QCD phase transition. These add to the total variation of the cosmological constant in the putative landscape of Universes. An interesting possibility arises when the cosmological constant is mostly cancelled by the membrane nucleation mechanism. If the step size in the resulting discretuum of cosmological constants, ΔΛ, is in the interval (meV) 4 < ΔΛ < (100 MeV) 4 , the cancellation of vacuum energy can be assisted by the scanning of θ. For (meV) 4 < ΔΛ < (keV) 4 this may yield θ < 10 -10 , meeting the observational limits. This scenario opens up 24 orders of magnitude of acceptable parameter space for ΔΛ compared to membrane nucleation acting alone. In such a Universe one may not need a light axion to solve the strong CP problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

S-matrix bootstrap in 3+1 dimensions: regularization and dual convex problem

The S-matrix bootstrap maps out the space of S-matrices allowed by analyticity, crossing, unitarity, and other constraints. For the 2 → 2 scattering matrix S 2→2 such space is an infinite dimensional convex space whose boundary can be determined by maximizing linear functionals. On the boundary interesting theories can be found, many times at vertices of the space. Here we consider 3 + 1 dimensional theories and focus on the equivalent dual convex minimization problem that provides strict upper bounds for the regularized primal problem and has interesting practical and physical advantages over the primal problem. Its variables are dual partial waves k ℓ (s) that are free variables, namely they do not have to obey any crossing, unitarity or other constraints. Nevertheless they are directly related to the partial waves f ℓ (s), for which all crossing, unitarity and symmetry properties result from the minimization. Numerically, it requires only a few dual partial waves, much as one wants to possibly match experimental results. We consider the case of scalar fields which is related to pion physics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗