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 253 records · Page 14

A memory-distributed quasi-Newton solver for nonlinear programming problems with a small number of general constraints

We approach the problem of parallelizing state-of-the-art nonlinear programming optimization algorithms.Specifically, we focus on parallelizing quasi-Newton interior-point methods that use limited-memory secant Hessian approximations. Such interior-point methods are known to have better convergence properties and to be more effective on large-scale problems than gradient-based and derivative-free optimization algorithms. We target nonlinear and potentially nonconvex optimization problems with an arbitrary number of bound constraints and a small number of general equality and inequality constraints on the optimization variables. These problems occur for example in the form of optimal control, optimal design, and inverse problems governed by ordinary or partial differential equations, whenever they are expressed in a “reduced-space” optimization approach. We introduce and analyze the time and space complexity of a decomposition method for solving the quasi-Newton linear systems that leverages the fact that the quasi-Newton Hessian matrix has a small number of dense blocks that border a low-rank update of a diagonal matrix. This enables an efficient parallelization on memory-distributed computers of the iterations of the optimization algorithm, a state-of-the-art filter line-search interior-point algorithm by Wächter et. al. We illustrate the efficiency of the proposed method by solving structural topology optimization problems on up to 4608 cores on a parallel machine.

97 MATHEMATICS AND COMPUTING↗

GPU Based General-Purpose Parallel computing to Solve Nuclear Reactor In-Core fuel Management Design and Operation Problem

In-core fuel management study is a crucial activity in nuclear power plant design and operation. Its common problem is to find an optimum arrangement of fuel assemblies inside the reactor core. Main objective for this activity is to reduce the cost of generating electricity, which can be done by altering several physical properties of the nuclear reactor without violating any of the constraints imposed by operational and safety considerations. This research try to address the problem of nuclear fuel arrangement problem, which is, leads to the multi-objective optimization problem. However, the calculation of the reactor core physical properties itself is a heavy computation, which became obstacle in solving the optimization problem by using genetic algorithm optimization.This research tends to address that problem by using the emerging General Purpose Computation on Graphics Processing Units (GPGPU) techniques implemented by C language for CUDA (Compute Unified Device Architecture) parallel programming. By using this parallel programming technique, we develop parallelized nuclear reactor fitness calculation, which is involving numerical finite difference computation. This paper describes current prototype of the parallel algorithm code we have developed on CUDA, that performs one hundreds finite difference calculation for nuclear reactor fitness evaluation in parallel by using GPU G9 Hardware Series developed by NVIDIA.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Generalized Kepler problems. I. Without magnetic charges

For each simple euclidean Jordan algebra V of rank {rho} and degree {delta}, we introduce a family of classical dynamic problems. These dynamical problems all share the characteristic features of the Kepler problem for planetary motions, such as the existence of Laplace-Runge-Lenz vector and hidden symmetry. After suitable quantizations, a family of quantum dynamic problems, parametrized by the nontrivial Wallach parameter {nu}, is obtained. Here, {nu} Element-Of W(V):={l_brace}k({delta}/2) Double-Vertical-Line k=1,...,({rho}-1){r_brace} Union (({rho}-1)({delta}/2),{infinity}) and was introduced by N. Wallach to parametrize the set of nontrivial scalar-type unitary lowest weight representations of the conformal group of V. For the quantum dynamic problem labelled by {nu}, the bound state spectra is -(1/2/(I+{nu}({rho}/2)){sup 2}), I= 0, 1, Horizontal-Ellipsis and its Hilbert space of bound states gives a new realization for the afore-mentioned representation labelled by {nu}. A few results in the literature about these representations become more explicit and more refined. The Lagrangian for a classical Kepler-type dynamic problem introduced here is still of the simple form: (1/2) parallel x parallel {sup 2}+(1/r). Here, x is the velocity of a unit-mass particle moving on the space consisting of V's semi-positive elements of a fixed rank, and r is the inner product of x with the identity element of V.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The impedance problem of wave diffraction by a strip with higher order boundary conditions

This work is devoted to analyse an impedance boundary-transmission problem for the Helmholtz equation originated by a problem of wave diffraction by an infinite strip with higher order imperfect boundary conditions. A constructive approach of operator relations is built, which allows a transparent interpretation of the problem in an operator theory framework. In particular, different types of operator relations are exhibited for different types of operators acting between Lebesgue and Sobolev spaces on a finite interval and the positive half-line. All this has consequences in the understanding of the structure of this type of problems. In particular, a Fredholm characterization of the problem is obtained in terms of the initial space order parameters. At the request of the author and the Proceedings Editor the above article has been replaced with a corrected version. The original PDF file supplied to AIP Publishing contained an error in the title of the article. The original title appeared as: 'The Impedance Problem of Wave Diffraction by a trip with Higher Order Boundary Conditions.' This article has been replaced and the title now appears correctly online. The corrected article was published on 8 November 2013.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Singular linear-quadratic control problem for systems with linear delay

A singular linear-quadratic optimization problem on the trajectories of non-autonomous linear differential equations with linear delay is considered. The peculiarity of this problem is the fact that this problem has no solution in the class of integrable controls. To ensure the existence of solutions is required to expand the class of controls including controls with impulse components. Dynamical systems with linear delay are used to describe the motion of pantograph from the current collector with electric traction, biology, etc. It should be noted that for practical problems fact singularity criterion of quality is quite commonly occurring, and therefore the study of these problems is surely important. For the problem under discussion optimal programming control contained impulse components at the initial and final moments of time is constructed under certain assumptions on the functional and the right side of the control system.

97 MATHEMATICS AND COMPUTING↗

Capacitated arc routing problem and its extensions in waste collection

Capacitated arc routing problem (CARP) is the youngest generation of graph theory that focuses on solving the edge/arc routing for optimality. Since many years, operational research devoted to CARP counterpart, known as vehicle routing problem (VRP), which does not fit to several real cases such like waste collection problem and road maintenance. In this paper, we highlighted several extensions of capacitated arc routing problem (CARP) that represents the real-life problem of vehicle operation in waste collection. By purpose, CARP is designed to find a set of routes for vehicles that satisfies all pre-setting constraints in such that all vehicles must start and end at a depot, service a set of demands on edges (or arcs) exactly once without exceeding the capacity, thus the total fleet cost is minimized. We also addressed the differentiation between CARP and VRP in waste collection. Several issues have been discussed including stochastic demands and time window problems in order to show the complexity and importance of CARP in the related industry. A mathematical model of CARP and its new version is presented by considering several factors such like delivery cost, lateness penalty and delivery time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum learning of classical stochastic processes: The completely positive realization problem

Among several tasks in Machine Learning, a specially important one is the problem of inferring the latent variables of a system and their causal relations with the observed behavior. A paradigmatic instance of this is the task of inferring the hidden Markov model underlying a given stochastic process. This is known as the positive realization problem (PRP), [L. Benvenuti and L. Farina, IEEE Trans. Autom. Control 49(5), 651–664 (2004)] and constitutes a central problem in machine learning. The PRP and its solutions have far-reaching consequences in many areas of systems and control theory, and is nowadays an important piece in the broad field of positive systems theory. We consider the scenario where the latent variables are quantum (i.e., quantum states of a finite-dimensional system) and the system dynamics is constrained only by physical transformations on the quantum system. The observable dynamics is then described by a quantum instrument, and the task is to determine which quantum instrument — if any — yields the process at hand by iterative application. We take as a starting point the theory of quasi-realizations, whence a description of the dynamics of the process is given in terms of linear maps on state vectors and probabilities are given by linear functionals on the state vectors. This description, despite its remarkable resemblance with the hidden Markov model, or the iterated quantum instrument, is however devoid of any stochastic or quantum mechanical interpretation, as said maps fail to satisfy any positivity conditions. The completely positive realization problem then consists in determining whether an equivalent quantum mechanical description of the same process exists. We generalize some key results of stochastic realization theory, and show that the problem has deep connections with operator systems theory, giving possible insight to the lifting problem in quotient operator systems. Our results have potential applications in quantum machine learning, device-independent characterization and reverse-engineering of stochastic processes and quantum processors, and more generally, of dynamical processes with quantum memory [M. Guţă, Phys. Rev. A 83(6), 062324 (2011); M. Guţă and N. Yamamoto, e-print http://arxiv.org/abs/1303.3771 (2013)].

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Students’ conceptions and problem-solving ability on topic chemical thermodynamics

The enthalpy concept and its change were introduced to describe the forms of internal energy transfer in chemical reactions. Likewise, the concepts of exothermic and endothermic reactions introduced as a consequence of heat transfer form. In the heat measurement process at constant pressure, work is often ignored. The exothermic or endothermic reactions, usually only based on the increase or decrease of the reaction temperature, without associated with the internal energy. Depictions of enthalpy and its change assumed closely related to students’ problem-solving ability. Therefore, the study to describe pre-service chemistry teacher student’s conceptions and problem-solving ability on topic chemical thermodynamics has been done. This research was a case study of chemical education course in Provinsi Lampung. The subjects of this study were 42 students who attend the chemical thermodynamics course. Questions about exothermic and endothermic reactions, enthalpy and its change, as well as internal energy and its change were given in the form of an essay exam questions. Answers related to conception qualitatively categorized, while problem solving answers were scored and assessed. The results showed that, in general, students were having problems in enthalpy and describe the changes in the form of heat and work. The highest value of problem solving ability obtained 26.67 from the maximum value of 100. The lowest value was 0, and the average value was 14.73. These results show that the problem-solving ability of pre-service chemistry teacher students was low. The results provide insight to researchers, and educators to develop learning or lab work on this concept.

42 ENGINEERING↗

Variational stability of optimal control problems involving subdifferential operators

This paper is concerned with the problem of minimizing an integral functional with control-nonconvex integrand over the class of solutions of a control system in a Hilbert space subject to a control constraint given by a phase-dependent multivalued map with closed nonconvex values. The integrand, the subdifferential operators, the perturbation term, the initial conditions and the control constraint all depend on a parameter. Along with this problem, the paper considers the problem of minimizing an integral functional with control-convexified integrand over the class of solutions of the original system, but now subject to a convexified control constraint. By a solution of a control system we mean a 'trajectory-control' pair. For each value of the parameter, the convexified problem is shown to have a solution, which is the limit of a minimizing sequence of the original problem, and the minimal value of the functional with the convexified integrand is a continuous function of the parameter. This property is commonly referred to as the variational stability of a minimization problem. An example of a control parabolic system with hysteresis and diffusion effects is considered. Bibliography: 24 titles.

97 MATHEMATICS AND COMPUTING↗

Space-Dependent Wielandt Shifts for Multigroup Diffusion Eigenvalue Problems

We present a new concept—the space-dependent Wielandt shift (SDWS)—for accelerating the convergence of the power iteration (PI) scheme for multigroup diffusion k-eigenvalue problems. The SDWS improves on standard Wielandt shift (WS) techniques, which are empirical in nature and are typically effective only when the current estimate of the solution is reasonably converged. By accounting for the physics of the problem through SDWS, we are able to improve the acceleration for the initial iterates when the current estimate of the solution is not close to convergence. Numerical results from one-dimensional problems suggest that, compared to standard WS techniques, the new SDWS techniques can provide upward of a 46% reduction in the number of PIs required for convergence and a 40% reduction in the computational time required. This improvement is sensitive to several problem-dependent factors, such as the geometry and energy-dependence of the problem, the spatial discretization, and the initial guess. The reduction in computational time is also dependent on the linear solver in the PI scheme, as it is well known that WSs can significantly worsen the conditioning of the diffusion linear system. In this paper, we provide a detailed study of the impact of WSs on the performance of several iterative linear solvers. Results from our implementation of SDWS in the three-dimensional (3D) code MPACT show that SDWS can provide similar speedups for 3D multigroup diffusion eigenvalue problems. These results also show that moderate speedups can be obtained by applying SDWS to the coarse mesh finite difference (CMFD) solver in a CMFD-accelerated transport scheme. However, the benefit of doing this may be limited because all but the first few CMFD solves are relatively easy to converge, regardless of the WS used.

Nuclear Science & Technology↗

Can compactifications solve the cosmological constant problem?

Recently, there have been claims in the literature that the cosmological constant problem can be dynamically solved by specific compactifications of gravity from higher-dimensional toy models. These models have the novel feature that in the four-dimensional theory, the cosmological constant Λ is much smaller than the Planck density and in fact accumulates at Λ=0. Here we show that while these are very interesting models, they do not properly address the real cosmological constant problem. As we explain, the real problem is not simply to obtain Λ that is small in Planck units in a toy model, but to explain why Λ is much smaller than other mass scales (and combinations of scales) in the theory. Instead, in these toy models, all other particle mass scales have been either removed or sent to zero, thus ignoring the real problem. To this end, we provide a general argument that the included moduli masses are generically of order Hubble, so sending them to zero trivially sends the cosmological constant to zero. We also show that the fundamental Planck mass is being sent to zero, and so the central problem is trivially avoided by removing high energy physics altogether. On the other hand, by including various large mass scales from particle physics with a high fundamental Planck mass, one is faced with a real problem, whose only known solution involves accidental cancellations in a landscape.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comparing three generations of D-Wave quantum annealers for minor embedded combinatorial optimization problems

Abstract Quantum annealing (QA) is a novel type of analog computation that aims to use quantum mechanical fluctuations to search for optimal solutions of Ising problems. QA in the transverse Ising model, implemented on D-Wave quantum processing units, are available as cloud computing resources. In this study we report concise benchmarks across three generations of D-Wave quantum annealers, consisting of four different devices, for the NP-hard discrete combinatorial optimization problems unweighted maximum clique and unweighted maximum cut on random graphs. The Ising, or equivalently quadratic unconstrained binary optimization, formulation of these problems do not require auxiliary variables for order reduction, and their overall structure and weights are not highly variable, which makes these problems simple test cases to understand the sampling capability of current D-Wave quantum annealers. All-to-all minor embeddings of size 52, with relatively uniform chain lengths, are used for a direct comparison across the Chimera, Pegasus, and Zephyr device topologies. A grid-search over annealing times and the minor embedding chain strengths is performed in order to determine the level of reasonable performance for each device and problem type. Experiment metrics that are reported are approximation ratios for non-broken chain samples, chain break proportions, and time-to-solution for the maximum clique problem instances. How fairly the quantum annealers sample optimal maximum cliques, for instances which contain multiple maximum cliques, is quantified using entropy of the measured ground state distributions. The newest generation of quantum annealing hardware, which has a Zephyr hardware connectivity, performed the best overall with respect to approximation ratios and chain break frequencies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dimer piling problems and interacting field theory

The dimer tiling problem asks in how many ways can the edges of a graph be covered by dimers so that each site is covered once. In the special case of a planar graph, this problem has a solution in terms of a free fermionic field theory. We rediscover and explore an expression for the number of coverings of an arbitrary graph by arbitrary objects in terms of an interacting fermionic field theory first proposed by Samuel. Generalizations of the dimer tiling problem, which we call “dimer piling problems,” demand that each site be covered N times by indistinguishable dimers. Our field theory provides a solution of these problems in the large- N limit. We give a similar path integral representation for certain lattice coloring problems. Published by the American Physical Society 2024

Astronomy & Astrophysics↗

Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer

We solve a multi-period portfolio optimization problem using D-Wave Systems' quantum annealer. We derive a formulation of the problem, discuss several possible integer encoding schemes, and present numerical examples that show high success rates. The formulation incorporates transaction costs (including permanent and temporary market impact), and, significantly, the solution does not require the inversion of a covariance matrix. The discrete multi-period portfolio optimization problem we solve is significantly harder than the continuous variable problem. We present insight into how results may be improved using suitable software enhancements and why current quantum annealing technology limits the size of problem that can be successfully solved today. Here, the formulation presented is specifically designed to be scalable, with the expectation that as quantum annealing technology improves, larger problems will be solvable using the same techniques.

97 MATHEMATICS AND COMPUTING↗

The Quantum Alternating Operator Ansatz for Satisfiability Problems

Here, we comparatively study, through large-scale numerical simulation, the performance across a large set of Quantum Alternating Operator Ansatz (QAOA) implementations for finding approximate and optimum solutions to unconstrained combinatorial optimization problems. Our survey includes over 100 different mixing unitaries, and we combine each mixer with both the standard phase separator unitary representing the objective function and a thresholded version. Our numerical tests for randomly chosen instances of the unconstrained optimization problems Max 2-SAT and Max 3-SAT reveal that the traditional transverse-field mixer with the standard phase separator performs best for problem sizes of 8 through 14 variables, while the recently introduced Grover mixer with thresholding wins at problems of size 6. This result (i) corrects earlier work suggesting that the Grover mixer is a superior mixer based only on results from problems of size 6, thus illustrating the need to push numerical simulation to larger problem sizes to more accurately predict performance; and (ii) it suggests that more complicated mixers and phase separators may not improve QAOA performance.

97 MATHEMATICS AND COMPUTING↗

Convex Relaxations of the Network Flow Problem Under Cycle Constraints

In this paper, we consider the problem of optimizing the flows in a lossless flow network with additional nonconvex cycle constraints on nodal variables; such constraints appear in several applications, including electric power, water distribution, and natural gas networks. This problem is a nonconvex version of the minimum-cost network flow problem (NFP), and to solve it, we propose three different approaches. One approach is based on solving a convex approximation of the problem, obtained by augmenting the cost function with an entropy-like term to relax the nonconvex constraints. We show that the approximation error, for which we give an upper bound, can be made small enough for practical use. An alternative approach is to solve the classical NFP, that is, without the cycle constraints, and solve a separate optimization problem afterwards in order to recover the actual flows satisfying the cycle constraints; the solution of this separate problem maximizes the individual entropies of the cycles. The third approach is based on replacing the nonconvex constraint set with a convex inner approximation, which yields a suboptimal solution for the cyclic networks with each edge belonging to at most two cycles. We validate the practical usefulness of the theoretical results through numerical examples, in which we study the standard test systems for water and electric power distribution networks.

42 ENGINEERING↗

Global Solution Strategies for the Network-Constrained Unit Commitment Problem with AC Transmission Constraints

Here, we propose a novel global solution algorithm for the network-constrained unit commitment problem that incorporates a nonlinear alternating current (AC) model of the transmission network, which is a nonconvex mixed-integer nonlinear programming (MINLP) problem. Our algorithm is based on the multi-tree global optimization methodology, which iterates between a mixed-integer lower-bounding problem and a nonlinear upper-bounding problem. We exploit the mathematical structure of the unit commitment problem with AC power flow constraints (UC-AC) and leverage second-order cone relaxations, piecewise outer approximations, and optimization-based bounds tightening to guarantee a globally optimal solution at convergence. Numerical results on four benchmark problems illustrate the effectiveness of our algorithm, both in terms of convergence rate and solution quality.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Physics-Informed Neural Networks for Heat Transfer Problems

Abstract Physics-informed neural networks (PINNs) have gained popularity across different engineering fields due to their effectiveness in solving realistic problems with noisy data and often partially missing physics. In PINNs, automatic differentiation is leveraged to evaluate differential operators without discretization errors, and a multitask learning problem is defined in order to simultaneously fit observed data while respecting the underlying governing laws of physics. Here, we present applications of PINNs to various prototype heat transfer problems, targeting in particular realistic conditions not readily tackled with traditional computational methods. To this end, we first consider forced and mixed convection with unknown thermal boundary conditions on the heated surfaces and aim to obtain the temperature and velocity fields everywhere in the domain, including the boundaries, given some sparse temperature measurements. We also consider the prototype Stefan problem for two-phase flow, aiming to infer the moving interface, the velocity and temperature fields everywhere as well as the different conductivities of a solid and a liquid phase, given a few temperature measurements inside the domain. Finally, we present some realistic industrial applications related to power electronics to highlight the practicality of PINNs as well as the effective use of neural networks in solving general heat transfer problems of industrial complexity. Taken together, the results presented herein demonstrate that PINNs not only can solve ill-posed problems, which are beyond the reach of traditional computational methods, but they can also bridge the gap between computational and experimental heat transfer.

Engineering↗