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 901 records · Page 50

Solving the Swath Segment Selection Problem

Several artificial-intelligence search techniques have been tested as means of solving the swath segment selection problem (SSSP) -- a real-world problem that is not only of interest in its own right, but is also useful as a test bed for search techniques in general. In simplest terms, the SSSP is the problem of scheduling the observation times of an airborne or spaceborne synthetic-aperture radar (SAR) system to effect the maximum coverage of a specified area (denoted the target), given a schedule of downlinks (opportunities for radio transmission of SAR scan data to a ground station), given the limit on the quantity of SAR scan data that can be stored in an onboard memory between downlink opportunities, and given the limit on the achievable downlink data rate. The SSSP is NP complete (short for "nondeterministic polynomial time complete" -- characteristic of a class of intractable problems that can be solved only by use of computers capable of making guesses and then checking the guesses in polynomial time).

Knight, Russell↗

Exploiting Quantum Resonance to Solve Combinatorial Problems

Quantum resonance would be exploited in a proposed quantum-computing approach to the solution of combinatorial optimization problems. In quantum computing in general, one takes advantage of the fact that an algorithm cannot be decoupled from the physical effects available to implement it. Prior approaches to quantum computing have involved exploitation of only a subset of known quantum physical effects, notably including parallelism and entanglement, but not including resonance. In the proposed approach, one would utilize the combinatorial properties of tensor-product decomposability of unitary evolution of many-particle quantum systems for physically simulating solutions to NP-complete problems (a class of problems that are intractable with respect to classical methods of computation). In this approach, reinforcement and selection of a desired solution would be executed by means of quantum resonance. Classes of NP-complete problems that are important in practice and could be solved by the proposed approach include planning, scheduling, search, and optimal design.

Zak, Michail↗

Fracture Mechanics Analyses for Interface Crack Problems - A Review

Recent developments in fracture mechanics analyses of the interfacial crack problem are reviewed. The intent of the review is to renew the awareness of the oscillatory singularity at the crack tip of a bimaterial interface and the problems that occur when calculating mode mixity using numerical methods such as the finite element method in conjunction with the virtual crack closure technique. Established approaches to overcome the nonconvergence issue of the individual mode strain energy release rates are reviewed. In the recent literature many attempts to overcome the nonconvergence issue have been developed. Among the many approaches found only a few methods hold the promise of providing practical solutions. These are the resin interlayer method, the method that chooses the crack tip element size greater than the oscillation zone, the crack tip element method that is based on plate theory and the crack surface displacement extrapolation method. Each of the methods is validated on a very limited set of simple interface crack problems. However, their utility for a wide range of interfacial crack problems is yet to be established.

Krueger, Ronald↗

Issues and Strategies in Solving Multidisciplinary Optimization Problems

Optimization research at NASA Glenn Research Center has addressed the design of structures, aircraft and airbreathing propulsion engines. The accumulated multidisciplinary design activity is collected under a testbed entitled COMETBOARDS. Several issues were encountered during the solution of the problems. Four issues and the strategies adapted for their resolution are discussed. This is followed by a discussion on analytical methods that is limited to structural design application. An optimization process can lead to an inefficient local solution. This deficiency was encountered during design of an engine component. The limitation was overcome through an augmentation of animation into optimization. Optimum solutions obtained were infeasible for aircraft and airbreathing propulsion engine problems. Alleviation of this deficiency required a cascading of multiple algorithms. Profile optimization of a beam produced an irregular shape. Engineering intuition restored the regular shape for the beam. The solution obtained for a cylindrical shell by a subproblem strategy converged to a design that can be difficult to manufacture. Resolution of this issue remains a challenge. The issues and resolutions are illustrated through a set of problems: Design of an engine component, Synthesis of a subsonic aircraft, Operation optimization of a supersonic engine, Design of a wave-rotor-topping device, Profile optimization of a cantilever beam, and Design of a cylindrical shell. This chapter provides a cursory account of the issues. Cited references provide detailed discussion on the topics. Design of a structure can also be generated by traditional method and the stochastic design concept. Merits and limitations of the three methods (traditional method, optimization method and stochastic concept) are illustrated. In the traditional method, the constraints are manipulated to obtain the design and weight is back calculated. In design optimization, the weight of a structure becomes the merit function with constraints imposed on failure modes and an optimization algorithm is used to generate the solution. Stochastic design concept accounts for uncertainties in loads, material properties, and other parameters and solution is obtained by solving a design optimization problem for a specified reliability. Acceptable solutions can be produced by all the three methods. The variation in the weight calculated by the methods was found to be modest. Some variation was noticed in designs calculated by the methods. The variation may be attributed to structural indeterminacy. It is prudent to develop design by all three methods prior to its fabrication. The traditional design method can be improved when the simplified sensitivities of the behavior constraint is used. Such sensitivity can reduce design calculations and may have a potential to unify the traditional and optimization methods. Weight versus reliability traced out an inverted-S-shaped graph. The center of the graph corresponded to mean valued design. A heavy design with weight approaching infinity could be produced for a near-zero rate of failure. Weight can be reduced to a small value for a most failure-prone design. Probabilistic modeling of load and material properties remained a challenge.

Patnaik, Surya↗

NASA Conference on Thermal Radiation Problems in Space Technology: A Compilation of Summaries of the Papers Presented

This document contains summaries of the talks presented at a small NASA Conference on Thermal Radiation Problems in Space Technology held at the Langley Research Center on September 12 and 13, 1960. The conferees were NASA members and NASA contractors directly concerned with radiation characteristics of materials and with thermal problems of spacecraft. The purpose of the conference was not only to present significant research information but also to provide an opportunity for the conferees to become aware of each other's fields of interest, activities, techniques, and problems. As arranged herein, the first set of talks, mostly by the contractors, is concerned with surfaces and surface coatings, and with the determination of their pertinent characteristics. The second set of talks, mostly by NASA personnel, is concerned with spacecraft and their thermal problems.

Source record↗

A Survey of the Isentropic Euler Vortex Problem Using High-Order Methods

The flux reconstruction (FR) method offers a simple, efficient, and easy to implement method, and it has been shown to equate to a differential approach to discontinuous Galerkin (DG) methods. The FR method is also accurate to an arbitrary order and the isentropic Euler vortex problem is used here to empirically verify this claim. This problem is widely used in computational fluid dynamics (CFD) to verify the accuracy of a given numerical method due to its simplicity and known exact solution at any given time. While verifying our FR solver, multiple obstacles emerged that prevented us from achieving the expected order of accuracy over short and long amounts of simulation time. It was found that these complications stemmed from a few overlooked details in the original problem definition combined with the FR and DG methods achieving high-accuracy with minimal dissipation. This paper is intended to consolidate the many versions of the vortex problem found in literature and to highlight some of the consequences if these overlooked details remain neglected.

High-Order↗

Lunar Flight Study Series: Volume 8. Earth-Moon Transit Studies Based on Ephemeris Data and Using Best Available Computer Program. Part 3: Analysis of Some Lunar Landing Site Problems Utilizing Two Fundamental Principles

This report presents two fundamental properties of lunar trajectories and makes use of these properties to solve various lunar landing site problems. Not only are various problems treated and solved but the properties and methods are established for use in the solution of other problems. This report presents an analysis of lunar landing site problems utilizing the direct mission mode as well as the orbital mission mode. A particular landing site is then specified and different flight profiles are analyzed for getting an exploration vehicle to that landing site. Rendezvous compatible lunar orbits for various stay-times at the landing site are treated. Launch opportunities are discussed for establishing rendezvous compatible lunar orbits without powered plane changes. Then, the minimum required plane changes for rendezvous in the lunar orbit are discussed for launching from earth on any day. On days that afford rendezvous compatible opportunities, there are no powered plane change requirements in the operations from launch at AMR through the rendezvous in lunar orbit, after the stay at the lunar site.

Tucker, W. B.↗

Spiral Lamber's Problem with Generalized Logarithmic Spirals

Lambert’s problem subject to a continuous acceleration is solved using the family of generalized logarithmic spirals. Thanks to the existence of two first integrals related to the energy and angular momentum surprising analogies with the Keplerian case are found. A minimum-energy spiral transfer exists. Increasing the value of the constant of the generalized energy yields pairs of conjugate spiral trajectories. The properties of such spirals are strongly connected with the properties of conjugate Keplerian orbits. When the generalized constant of the energy reaches a critical value the two solutions degenerate into a pair of parabolic spirals, one of which connects the two vectors through infinity. From that point the spiral transfers become hyperbolic. Generalized logarithmic spirals admit closed-form solutions to all the required magnitudes including the time of flight, providing a deep insight into the dynamics of the problem. In addition, the maximum acceleration along the transfer is found analytically so the solutions that violate the design constraints on the maximum thrust acceleration can be rejected without any further computations. When the time of flight is fixed there is still a degree of freedom in the solution, related to a control parameter. Resonant transfers appear naturally thanks to the symmetry properties of the generalized logarithmic spirals. The problem of designing a low-thrust transfer between two bodies can be reduced to solving the corresponding spiral Lambert’s problem. In order to show the versatility of the method it is applied to the design of an asteroid tour and to explore launch opportunities to Mars.\

Roa, Javier↗

Lambert’s Problem – A Geometric Approach

A fundamental problem in spacecraft mission design is to find a free flight path from one place to another in a chosen travel time. Lambert studied this problem for free flight in an inverse square central force field, and Lagrange produced a solution in 1778. Although this is an old problem, a new approach may be of some value. There are two steps to the new solution. First, find every ellipse with focus at the origin that intersects two circles both centered at the origin. Then select only those ellipses that have a specified angle between the intersection points of the ellipse with the inner and outer circles. Second, find the travel times between intersections for each ellipse. These are all the possible travel times from which one may choose. Standard solutions to Lambert’s problem can be found in references [1-4].

Easton, Robert↗

A Multilevel Approach For SolvingLarge-Scale QUBO Problems With Noisy Hybrid Quantum Approximate Optimization

Quantum approximate optimization is one ofthe promising candidates for useful quantum computation,particularly in the context of finding approximate solutionsto Quadratic Unconstrained Binary Optimization (QUBO)problems. However, the existing quantum processing units(QPUs) are of relatively small size, and canonical mappingsof QUBO via the Ising model require one qubit per vari-able, rendering direct large-scale optimization infeasible.In classical optimization, a general strategy for addressingmany large-scale problems is via multilevel/multigrid meth-ods, where the large target problem is iteratively coarsenedand the global solution is constructed from multiple small-scale optimization runs. In this work, we experimentallytest how existing QPUs perform when used as a sub-solverwithin such a multilevel strategy. To this aim, we com-bine and extend (via additional classical processing steps)the recently proposed Noise-Directed Adaptive Remapping(NDAR) and Quantum Relax&Round (QRR) algorithms.We first demonstrate the effectiveness of our heuristicextensions on Rigetti’s superconducting transmon deviceAnkaa-2. We find approximate solutions to10instances offully connected82-qubit Sherrington-Kirkpatrick graphswith random integer-valued coefficients obtaining normal-ized approximation ratios (ARs) in the range∼0.98−1.0,and the same class with real-valued coefficients (ARs∼0.94−1.0). Then, we implement the extended NDAR andQRR algorithms as subsolvers in the multilevel algorithmfor6large-scale graphs with at most∼27,000variables.In practice, the QPU (with classical post-processing steps)is used to find approximate solutions to dozens of at most82-qubit problems, which are iteratively used to constructthe global solution. We observe that quantum optimizationresults are competitive in terms of the quality of solutionswhen compared to classical heuristics used as subsolverswithin the multilevel approach.Reproducibility: source code and data are available at[TBA upon acceptance]

quantum computing↗

Problem Complexity and LLM: H-M Team Reliability in Challenging Environments

In traditional human-machine operations, the functional decomposition of actions and responsibilities among various agents is assigned a priori. For instance, in current air traffic operations, although assisted by software, human pilots have the ultimate control of aircraft. Multiagent human-machine and machine-machine systems will face problems of varying and potentially unpredicted complexity in future challenging scenarios of planetary, en route, and orbital activities. Hence, it is important to enable dynamic transfer of decision-making to appropriate team members, human or machine, depending on which agent is best equipped to solve that specific problem on a time budget. In this paper, we consider aspects of problem-solving and its modeling that affect the outcomes of decision-making as a function of solution quality and the likelihood of solving the problem on a required time budget. We focus on Large Language Models (LLM) as potential machine teammates and conclude that practical, predictive modeling of their performance, at the current stage of their development, is infeasible. Simple examples help us illustrate that current LLM will require fundamental advancements to provide reliable support in team decision-making, especially in safety-critical and time-critical domains. The study is not meant to diminish the value of the remarkable capabilities of LLM, but rather to gain a better understanding of the technology’s appropriate use and the needed additions.

function allocation↗

SUPPORT OF NEW COMPUTER HARDWARE AT LUCH'S MC&A SYSTEM: PROBLEMS AND A SOLUTION

Abstract Microsoft Windows NT 4.0 operating system is the only software product certified in Russia for using in MC&A systems. In the paper a solution for allowing the installation of this outdated operating system on new computers is discussed. The solution has been successfully tested and has been in use at Luch's network since March 2008. Furthermore, it is being recommended for other Russian enterprises for the same purpose. Introduction Typically, the software part of a nuclear material control and accounting (MC&A) system consists of an operating system (OS), database management systems (DBMS), accounting program itself and database of nuclear materials. Russian regulations require the operating system and database for MC&A be certified for information security, and the whole system must pass an accreditation. Historically, the only certified operating system for MC&A still continues to be Microsoft Windows NT 4.0 Server/Workstation. Attempts to certify newer versions of Windows failed. Luch, like most other Russian sites, uses Microsoft Windows NT 4.0 and SQL Server 6.5. Luch's specialists have developed an application (LuchMAS) for accounting purposes. Starting from about 2004, some problems appeared in Luch's accounting system. They were related to the complexity of installing Windows NT 4.0 on new computers. At first, it was possible to solve the problem choosing computer equipment that is compatible with Windows NT 4.0 or selecting certain operating system settings. Over time, the problem worsened and now it is almost impossible to install Windows NT 4.0 on new computers. The reason is the lack of hardware drivers in the outdated operating system. The problem was serious enough that it could have affected the long-term sustainability of Luch's MC&A system if adequate alternate measures were not developed.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Application of the INSTANT-HPS PN Transport Code to the C5G7 Benchmark Problem

INSTANT is the INL's next generation neutron transport solver to support high-fidelity multi-physics reactor simulation INSTANT is in continuous development to extend its capability Code is designed to take full advantage of middle to large cluster (10-1000 processors) Code is designed to focus on method adaptation while also mesh adaptation will be possible. It utilizes the most modern computing techniques to generate a neutronics tool of full-core transport calculations for reactor analysis and design. It can perform calculations on unstructured 2D/3D triangular, hexagonal and Cartesian geometries. Calculations can be easily extended to more geometries because of the independent mesh framework coded with the model Fortran. This code has a multigroup solver with thermal rebalance and Chebyshev acceleration. It employs second-order PN and Hybrid Finite Element method (PNHFEM) discretization scheme. Three different in-group solvers - preconditioned Conjugate Gradient (CG) method, preconditioned Generalized Minimal Residual Method (GMRES) and Red-Black iteration - have been implemented and parallelized with the spatial domain decomposition in the code. The input is managed with extensible markup language (XML) format. 3D variables including the flux distributions are outputted into VTK files, which can be visualized by tools such as VisIt and ParaView. An extension of the code named INSTANTHPS provides the capability to perform 3D heterogeneous transport calculations within fuel pins. C5G7 is an OECD/NEA benchmark problem created to test the ability of modern deterministic transport methods and codes to treat reactor core problems without spatial homogenization. This benchmark problem had been widely analyzed with various code packages. In this transaction, results of the applying the INSTANT-HPS code to the C5G7 problem are summarized.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

C5 Benchmark Problem with Discrete Ordinate Radiation Transport Code DENOVO

The C5 benchmark problem proposed by the Organisation for Economic Co-operation and Development/Nuclear Energy Agency was modeled to examine the capabilities of Denovo, a three-dimensional (3-D) parallel discrete ordinates (S{sub N}) radiation transport code, for problems with no spatial homogenization. Denovo uses state-of-the-art numerical methods to obtain accurate solutions to the Boltzmann transport equation. Problems were run in parallel on Jaguar, a high-performance supercomputer located at Oak Ridge National Laboratory. Both the two-dimensional (2-D) and 3-D configurations were analyzed, and the results were compared with the reference MCNP Monte Carlo calculations. For an additional comparison, SCALE/KENO-V.a Monte Carlo solutions were also included. In addition, a sensitivity analysis was performed for the optimal angular quadrature and mesh resolution for both the 2-D and 3-D infinite lattices of UO{sub 2} fuel pin cells. Denovo was verified with the C5 problem. The effective multiplication factors, pin powers, and assembly powers were found to be in good agreement with the reference MCNP and SCALE/KENO-V.a Monte Carlo calculations.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Application of the Differential Evolution Method to Solving Inverse Transport Problems

The differential evolution method, a powerful stochastic optimization algorithm that mimics the process of evolution in nature, is applied to inverse transport problems with several unknown parameters of mixed types, including interface location identification, source composition identification, and material mass density identification, in spherical and cylindrical radioactive source/shield systems. In spherical systems, measurements of leakages of discrete gamma-ray lines are assumed, while in cylindrical systems, measurements of scalar fluxes of discrete lines at points outside the system are assumed. The performance of the differential evolution algorithm is compared to the Levenberg-Marquardt method, a standard gradient-based technique, and the covariance matrix adaptation evolution strategy, another stochastic technique, on a variety of numerical test problems with several (i.e., three or more) unknown parameters. Numerical results indicate that differential evolution is the most adept method for finding the global optimum for these problems. In spherical geometry, differential evolution implemented serially is run-time competitive with gradient-based methods, while a parallel version of differential evolution would be run-time competitive with gradient-based techniques in cylindrical geometry. A hybrid differential evolution/Levenberg-Marquardt method is also introduced, and numerical results indicate that it can be a fast and robust optimizer for inverse transport problems.

99 GENERAL AND MISCELLANEOUS↗

USING THE LEVENBERG-MARQUARDT METHOD FOR SOLUTIONS OF INVERSE TRANSPORT PROBLEMS IN ONE- AND TWO-DIMENSIONAL GEOMETRIES

Determining the components of a radioactive source/shield system using the system's radiation signature, a type of inverse transport problem, is one of great importance in homeland security, material safeguards, and waste management. Here, the Levenberg-Marquardt (or simply 'Marquardt') method, a standard gradient-based optimization technique, is applied to the inverse transport problems of interface location identification, shield material identification, source composition identification, and material mass density identification (both separately and combined) in multilayered radioactive source/shield systems. One-dimensional spherical problems using leakage measurements of neutron-induced gamma-ray lines and two-dimensional cylindrical problems using flux measurements of uncollided passive gamma-ray lines are considered. Gradients are calculated using an adjoint-based differentiation technique that is more efficient than difference formulas. The Marquardt method is iterative and directly estimates unknown interface locations, source isotope weight fractions, and material mass densities, while the unknown shield material is identified by estimating its macroscopic gamma-ray cross sections. Numerical test cases illustrate the utility of the Marquardt method using both simulated data that are perfectly consistent with the optimization process and realistic data simulated by Monte Carlo.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

ON THE ANALATICAL SOLUTIONS AND NUMERICAL VERIFICATIONS OF THE TWO-PHASE WATER FAUCET PROBLEM

The two-phase water faucet problem is one of the benchmark problems originally proposed by Ransom. The test consists of a vertical pipe, which is initially filled with a uniform column of liquid moving with an initial velocity and an annulus of gas sitting still. At the top boundary, liquid is supplied at the same velocity as the initial velocity, and the bottom of the pipe opens to the ambient. Due to the gravity effect, the liquid column accelerates and becomes thinner. With simplifications, such as massless gas phase and no wall and interfacial frictions, an analytical solution could be obtained for the transient liquid velocity and void fraction distribution. The test has been widely used for the purposes of code assessment, benchmark and numerical verifications. This exact solution was used in this work to verify the numerical accuracy of a high-resolution spatial discretization scheme. The high-resolution spatial discretization scheme is based on the commonly used staggered grid mesh, and slope limiter was introduced to achieve high resolutions in space. It was found that, at the steady state, an expected second-order spatial accuracy could not be achieved. A further investigation showed that this exact solution does not actually satisfy the commonly used two-fluid single pressure two-phase flow equations. More importantly, we have also found that a steady-state exact solution could be obtained for the water faucet problem. In this work, we have demonstrated the derivation of the steady-state exact solution for the water faucet problem. The exact solution was then used to verify a first-order and a high-resolution spatial discretization scheme, from which expected order of accuracy was achieved by doing mesh refinement.

42 ENGINEERING↗

MC21/CTF and VERA-CS Mutiphysics Solutions to VERA Core Physics Benchmark Problems 6 and 7

The continuous energy Monte Carlo neutron transport code, MC21, was coupled to the CTF subchannel thermal-hydraulics code using a combination of CASL tools and in-house Python scripts. An MC21/CTF solution for VERA Core Physics Benchmark Progression Problem 6 demonstrated excellent agreement with MC21/COBRA-IE and VERA solutions. The MC21/CTF solution for VERA Core Physics Benchmark Progression Problem 7, Watts Bar Unit 1 at beginning of cycle (BOC) hot full power (HFP) equilibrium xenon conditions, is the first published coupled Monte Carlo neutronics / subchannel T-H solution for this problem. MC21/CTF predicted a critical boron concentration of 854.5 ppm, yielding a critical eigenvalue of 0.99994 ± 6.8E-6 (95% CI). Excellent agreement with a VERA solution of Problem 7 was also demonstrated for integral and local power and temperature parameters.

Aviles, Brian↗