Search NASA⌕ Search

SEARCH · Search NASA

Results for “problems”

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 379 records · Page 21

Sensitivity Equation Derivation for Transient Heat Transfer Problems

The focus of the paper is on the derivation of sensitivity equations for transient heat transfer problems modeled by different discretization processes. Two examples will be used in this study to facilitate the discussion. The first example is a coupled, transient heat transfer problem that simulates the press molding process in fabrication of composite laminates. These state equations are discretized into standard h-version finite elements and solved by a multiple step, predictor-corrector scheme. The sensitivity analysis results based upon the direct and adjoint variable approaches will be presented. The second example is a nonlinear transient heat transfer problem solved by a p-version time-discontinuous Galerkin's Method. The resulting matrix equation of the state equation is simply in the form of Ax = b, representing a single step, time marching scheme. A direct differentiation approach will be used to compute the thermal sensitivities of a sample 2D problem.

Hou, Gene↗

High Order And High Resolution Methods For a Model CAA Problem

The initial value problem for the first order linear wave equation in one space dimension is treated for two cases with specified initial data and grid, and data from solutions at t = 400 and t = 800 are presented, as prescribed for Problem 1 in Category 1. Results are shown from computations with a sequence of recently developed high order and high resolution methods which combine Hermite interpolation, Cauchy-Kowaleskya recursion for time derivatives, and Taylor series time advancement. These methods have the same order of accuracy in time as in space. Results are shown from methods that range from third to nineteenth order. The stated problems with the prescribed coarse grid can be simulated with errors that are at the level of machine accuracy if the method is sufficiently high order. In addition, the growth of the maximum absolute error out to t = 100,000 is given for simulations with the stated problem data.

Goodrich, John W.↗

Category 5: Sound Generation in Viscous Problems

Two problems are considered. Problem 1: Aeolian tones, sound generation by flow over cylinders, are relevant to airframe and power plant noise (heat exchanger, power transmission lines and chimneys). The purpose of this problem is to test the ability of a CFD/CAA code to accurately predict sound generation by viscous flows and sound propagation through interactions between acoustic wave & solid wall and between acoustic waves & shear layers. Problem 2: Sound generation by flow over a cavity.Air flows over the cavity shown below with a mean approach flow velocity of 50 m/s. The boundary layer that develops over the flat plate is turbulent with a thickness of 14 mm at the entrance to the cavity. Calculate the power spectra at the center of each cavit wall and the center of the cavity floor. Experimental data will be available for comparison.

Lee, Soogab↗

STAGS Example Problems Manual

This document summarizes the STructural Analysis of General Shells (STAGS) development effort, STAGS performance for selected demonstration problems, and STAGS application problems illustrating selected advanced features available in the STAGS Version 5.0. Each problem is discussed including selected background information and reference solutions when available. The modeling and solution approach for each problem is described and illustrated. Numerical results are presented and compared with reference solutions, test data, and/or results obtained from mesh refinement studies. These solutions provide an indication of the overall capabilities of the STAGS nonlinear finite element analysis tool and provide users with representative cases, including input files, to explore these capabilities that may then be tailored to other applications.

Knight, Norman F., Jr.↗

At-Least Version of the Generalized Minimum Spanning Tree Problem: Optimization Through Ant Colony System and Genetic Algorithms

The At-Least version of the Generalized Minimum Spanning Tree Problem (L-GMST) is a problem in which the optimal solution connects all defined clusters of nodes in a given network at a minimum cost. The L-GMST is NPHard; therefore, metaheuristic algorithms have been used to find reasonable solutions to the problem as opposed to computationally feasible exact algorithms, which many believe do not exist for such a problem. One such metaheuristic uses a swarm-intelligent Ant Colony System (ACS) algorithm, in which agents converge on a solution through the weighing of local heuristics, such as the shortest available path and the number of agents that recently used a given path. However, in a network using a solution derived from the ACS algorithm, some nodes may move around to different clusters and cause small changes in the network makeup. Rerunning the algorithm from the start would be somewhat inefficient due to the significance of the changes, so a genetic algorithm based on the top few solutions found in the ACS algorithm is proposed to quickly and efficiently adapt the network to these small changes.

Janich, Karl W.↗

Exploring the Connection Between Sampling Problems in Bayesian Inference and Statistical Mechanics

The Bayesian and statistical mechanical communities often share the same objective in their work - estimating and integrating probability distribution functions (pdfs) describing stochastic systems, models or processes. Frequently, these pdfs are complex functions of random variables exhibiting multiple, well separated local minima. Conventional strategies for sampling such pdfs are inefficient, sometimes leading to an apparent non-ergodic behavior. Several recently developed techniques for handling this problem have been successfully applied in statistical mechanics. In the multicanonical and Wang-Landau Monte Carlo (MC) methods, the correct pdfs are recovered from uniform sampling of the parameter space by iteratively establishing proper weighting factors connecting these distributions. Trivial generalizations allow for sampling from any chosen pdf. The closely related transition matrix method relies on estimating transition probabilities between different states. All these methods proved to generate estimates of pdfs with high statistical accuracy. In another MC technique, parallel tempering, several random walks, each corresponding to a different value of a parameter (e.g. "temperature"), are generated and occasionally exchanged using the Metropolis criterion. This method can be considered as a statistically correct version of simulated annealing. An alternative approach is to represent the set of independent variables as a Hamiltonian system. Considerab!e progress has been made in understanding how to ensure that the system obeys the equipartition theorem or, equivalently, that coupling between the variables is correctly described. Then a host of techniques developed for dynamical systems can be used. Among them, probably the most powerful is the Adaptive Biasing Force method, in which thermodynamic integration and biased sampling are combined to yield very efficient estimates of pdfs. The third class of methods deals with transitions between states described by rate constants. These problems are isomorphic with chemical kinetics problems. Recently, several efficient techniques for this purpose have been developed based on the approach originally proposed by Gillespie. Although the utility of the techniques mentioned above for Bayesian problems has not been determined, further research along these lines is warranted

Pohorille, Andrew↗

Using Sequence Diagrams to Detect Communication Problems Between Systems

Many software systems are evolving complex system of systems (SoS) for which inter-system communication is both mission-critical and error-prone. Such communication problems ideally would be detected before deployment. In a NASA-supported Software Assurance Research Program (SARP) project, we are researching a new approach addressing such problems. In this paper, we show that problems in the communication between two systems can be detected by using sequence diagrams to model the planned communication and by comparing the planned sequence to the actual sequence. We identify different kinds of problems that can be addressed by modeling the planned sequence using different level of abstractions.

Lindvall, Mikael↗

Direct Multiple Shooting Optimization with Variable Problem Parameters

Taking advantage of a novel approach to the design of the orbital transfer optimization problem and advanced non-linear programming algorithms, several optimal transfer trajectories are found for problems with and without known analytic solutions. This method treats the fixed known gravitational constants as optimization variables in order to reduce the need for an advanced initial guess. Complex periodic orbits are targeted with very simple guesses and the ability to find optimal transfers in spite of these bad guesses is successfully demonstrated. Impulsive transfers are considered for orbits in both the 2-body frame as well as the circular restricted three-body problem (CRTBP). The results with this new approach demonstrate the potential for increasing robustness for all types of orbit transfer problems.

Whitley, Ryan J.↗

An Optimization Model for Scheduling Problems with Two-Dimensional Spatial Resource Constraint

Traditional scheduling problems involve determining temporal assignments for a set of jobs in order to optimize some objective. Some scheduling problems also require the use of limited resources, which adds another dimension of complexity. In this paper we introduce a spatial resource-constrained scheduling problem that can arise in assembly, warehousing, cross-docking, inventory management, and other areas of logistics and supply chain management. This scheduling problem involves a twodimensional rectangular area as a limited resource. Each job, in addition to having temporal requirements, has a width and a height and utilizes a certain amount of space inside the area. We propose an optimization model for scheduling the jobs while respecting all temporal and spatial constraints.

Garcia, Christopher↗

Model Checking - My 27-Year Quest to Overcome the State Explosion Problem

Model Checking is an automatic verification technique for state-transition systems that are finite=state or that have finite-state abstractions. In the early 1980 s in a series of joint papers with my graduate students E.A. Emerson and A.P. Sistla, we proposed that Model Checking could be used for verifying concurrent systems and gave algorithms for this purpose. At roughly the same time, Joseph Sifakis and his student J.P. Queille at the University of Grenoble independently developed a similar technique. Model Checking has been used successfully to reason about computer hardware and communication protocols and is beginning to be used for verifying computer software. Specifications are written in temporal logic, which is particularly valuable for expressing concurrency properties. An intelligent, exhaustive search is used to determine if the specification is true or not. If the specification is not true, the Model Checker will produce a counterexample execution trace that shows why the specification does not hold. This feature is extremely useful for finding obscure errors in complex systems. The main disadvantage of Model Checking is the state-explosion problem, which can occur if the system under verification has many processes or complex data structures. Although the state-explosion problem is inevitable in worst case, over the past 27 years considerable progress has been made on the problem for certain classes of state-transition systems that occur often in practice. In this talk, I will describe what Model Checking is, how it works, and the main techniques that have been developed for combating the state explosion problem.

Clarke, Ed↗

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↗