Search NASA⌕ Search

SEARCH · Search NASA

Results for “problem solving complexity”

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 667 records · Page 37
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Computation of incompressible viscous flows through artificial heart devices with moving boundaries

The extension of computational fluid dynamics techniques to artificial heart flow simulations is illustrated. Unsteady incompressible Navier-Stokes equations written in 3-D generalized curvilinear coordinates are solved iteratively at each physical time step until the incompressibility condition is satisfied. The solution method is based on the pseudo compressibility approach and uses an implicit upwind differencing scheme together with the Gauss-Seidel line relaxation method. The efficiency and robustness of the time accurate formulation of the algorithm are tested by computing the flow through model geometries. A channel flow with a moving indentation is computed and validated with experimental measurements and other numerical solutions. In order to handle the geometric complexity and the moving boundary problems, a zonal method and an overlapping grid embedding scheme are used, respectively. Steady state solutions for the flow through a tilting disk heart valve was compared against experimental measurements. Good agreement was obtained. The flow computation during the valve opening and closing is carried out to illustrate the moving boundary capability.

Kiris, Cetin↗
NASA NTRS2003

System Identification of X-33 Neural Network

Modern flight control research has improved spacecraft survivability as its goal. To this end we need to have a failure detection system on board. In case the spacecraft is performing imperfectly, reconfiguration of control is needed. For that purpose we need to have parameter identification of spacecraft dynamics. Parameter identification of a system is called system identification. We treat the system as a black box which receives some inputs that lead to some outputs. The question is: what kind of parameters for a particular black box can correlate the observed inputs and outputs? Can these parameters help us to predict the outputs for a new given set of inputs? This is the basic problem of system identification. The X33 was supposed to have the onboard capability of evaluating the current performance and if needed to take the corrective measures to adapt to desired performance. The X33 is comprised of both rocket and aircraft vehicle design characteristics and requires, in general, analytical methods for evaluating its flight performance. Its flight consists of four phases: ascent, transition, entry and TAEM (Terminal Area Energy Management). It spends about 200 seconds in ascent phase, reaching an altitude of about 180,000 feet and a speed of about 10 to 15 Mach. During the transition phase which lasts only about 30 seconds, its altitude may increase to about 190,000 feet but its speed is reduced to about 9 Mach. At the beginning of this phase, the Main Engine is Cut Off (MECO) and the control is reconfigured with the help of aerosurfaces (four elevons, two flaps and two rudders) and reaction control system (RCS). The entry phase brings down the altitude of X33 to about 90,000 feet and its speed to about Mach 3. It spends about 250 seconds in this phase. Main engine is still cut off and the vehicle is controlled by complex maneuvers of aerosurfaces. The last phase TAEM lasts for about 450 seconds and the altitude and speed, both are reduced to zero. The present attempt, as a start, focuses only on the entry phase. Since the main engine remains cut off in this phase, there is no thrust acting on the system. This considerably simplifies the equations of motion. We introduce another simplification by assuming the system to be linear after some non-linearities are removed analytically from our consideration. Under these assumptions, the problem could be solved by Classical Statistics by employing the least sum of squares approach. Instead we chose to use the Neural Network method. This method has many advantages. It is modern, more efficient, can be adapted to work even when the assumptions are diluted. In fact, Neural Networks try to model the human brain and are capable of pattern recognition.

Aggarwal, Shiv↗
NASA NTRS1978

Applied Routh approximation

The Routh approximation technique for reducing the complexity of system models was applied in the frequency domain to a 16th order, state variable model of the F100 engine and to a 43d order, transfer function model of a launch vehicle boost pump pressure regulator. The results motivate extending the frequency domain formulation of the Routh method to the time domain in order to handle the state variable formulation directly. The time domain formulation was derived and a characterization that specifies all possible Routh similarity transformations was given. The characterization was computed by solving two eigenvalue-eigenvector problems. The application of the time domain Routh technique to the state variable engine model is described, and some results are given. Additional computational problems are discussed, including an optimization procedure that can improve the approximation accuracy by taking advantage of the transformation characterization.

Merrill, W. C.↗
NASA NTRS1986

Solution of the symmetric eigenproblem AX=lambda BX by delayed division

Delayed division is an iterative method for solving the linear eigenvalue problem AX = lambda BX for a limited number of small eigenvalues and their corresponding eigenvectors. The distinctive feature of the method is the reduction of the problem to an approximate triangular form by systematically dropping quadratic terms in the eigenvalue lambda. The report describes the pivoting strategy in the reduction and the method for preserving symmetry in submatrices at each reduction step. Along with the approximate triangular reduction, the report extends some techniques used in the method of inverse subspace iteration. Examples are included for problems of varying complexity.

Thurston, G. A.↗
NASA NTRS1987

A processing method and results of meteor shower radar observations

Studies of meteor showers permit the solving of some principal problems of meteor astronomy: to obtain the structure of a stream in cross section and along its orbits; to retrace the evolution of particle orbits of the stream taking into account gravitational and nongravitational forces and to discover the orbital elements of its parent body; to find out the total mass of solid particles ejected from the parent body taking into account physical and chemical evolution of meteor bodies; and to use meteor streams as natural probes for investigation of the average characteristics of the meteor complex in the solar system. A simple and effective method of determining the flux density and mass exponent parameter was worked out. This method and its results are discussed.

Belkovich, O. I.↗
NASA NTRS1993

Laplace's equation and the Dirichlet-Neumann map in multiply connected domains

A variety of problems in material science and fluid dynamics require the solution of Laplace's equation in multiply connected domains. Integral equation methods are natural candidates for such problems, since they discretize the boundary alone, require no special effort for free boundaries, and achieve superalgebraic convergence rates on sufficiently smooth domains in two space dimensions, regardless of shape. Current integral equation methods for the Dirichlet problem, however, require the solution of M independent problems of dimension N, where M is the number of boundary components and N is the total number of points in the discretization. In this paper, we present a new boundary integral equation approach, valid for both interior and exterior problems, which requires the solution of a single linear system of dimension N + M. We solve this system by making use of an iterative method (GMRES) combined with the last multipole method for the rapid calculation of the necessary matrix vector products. For a two-dimensional system with 200 components and 100 points on each boundary, we gain a speedup of a factor of 100 from the new analytic formulation and a factor of 50 from the fast multipole method. The resulting scheme brings large scale calculations in extremely complex domains within practical reach.

Greenbaum, A.↗
NASA NTRS2010

Technique for Performing Dielectric Property Measurements at Microwave Frequencies

A paper discusses the need to perform accurate dielectric property measurements on larger sized samples, particularly liquids at microwave frequencies. These types of measurements cannot be obtained using conventional cavity perturbation methods, particularly for liquids or powdered or granulated solids that require a surrounding container. To solve this problem, a model has been developed for the resonant frequency and quality factor of a cylindrical microwave cavity containing concentric cylindrical samples. This model can then be inverted to obtain the real and imaginary dielectric constants of the material of interest. This approach is based on using exact solutions to Maxwell s equations for the resonant properties of a cylindrical microwave cavity and also using the effective electrical conductivity of the cavity walls that is estimated from the measured empty cavity quality factor. This new approach calculates the complex resonant frequency and associated electromagnetic fields for a cylindrical microwave cavity with lossy walls that is loaded with concentric, axially aligned, lossy dielectric cylindrical samples. In this approach, the calculated complex resonant frequency, consisting of real and imaginary parts, is related to the experimentally measured quantities. Because this approach uses Maxwell's equations to determine the perturbed electromagnetic fields in the cavity with the material(s) inserted, one can calculate the expected wall losses using the fields for the loaded cavity rather than just depending on the value of the fields obtained from the empty cavity quality factor. These additional calculations provide a more accurate determination of the complex dielectric constant of the material being studied. The improved approach will be particularly important when working with larger samples or samples with larger dielectric constants that will further perturb the cavity electromagnetic fields. Also, this approach enables the ability to have a larger sample of interest, such as a liquid or powdered or granulated solid, inside a cylindrical container.

Barmatz, Martin B.↗
NASA NTRS2017

Computationally Efficient Motion Planning Algorithms for Agile Autonomous Vehicles in Cluttered Environments

Fast, real-time motion planning of an agile, autonomous vehicle in a cluttered environment, with many geometrically-fixed obstacles, is a very complex problem, especially because of the vehicle dynamics constraints and resource constrained computational capabilities onboard the vehicle. In this paper, we present computationally-efficient versions of our novel motion planning algorithm called the Spherical Expansion and Sequential Convex Programming (SE–SCP) algorithm. The SE–SCP algorithm first uses a spherical-expansion-based randomized sampling algorithm to explore the workspace. Oncea path is found from the start position to the goal position, the algorithm computes a locally optimal trajectory, within its homotopy class for a desired cost function, by solving a sequence of convex optimization problems. Thus, the SE–SCP algorithm is anytime locally optimal and the trajectory is globally optimal if the number of samples tends to infinity. In this paper, we further enhance the computational efficiency of the SE–SCP algorithm using uni-directional and bi-directional rewiring techniques. We also present a detailed proof of the local optimality characteristics of the new SE–SCP algorithms for aspecial case of vehicle dynamics. Simulation examples involving quadrotor and spacecraft help demonstrate the effectiveness of our new algorithms.

Bandyopadhyay, Saptarshi↗
NASA NTRSDate not supplied

A Physics-Based Work-Energy Formulation for Real-Time Trajectory Guidance of A Lunar Lander

Throughout the years, many researchers have calculated and optimized trajectory solutions for lunar landing systems by employing sophisticated mathematical methods, that include: Hamilton’s Principle of Variation, Pontryagin’s maximum principle, and well known convex-optimization techniques among others. Many of these approaches typically require expensive computational resources to achieve convergence in the solution. In an effort to reduce complexity and the computational load required to obtain real-time guidance commands, a simple physics-based work-energy approach has been formulated. This approach is based on the dissipation of the mechanical energy of the vehicle to its final desired energy state required to achieve a safe landing. The rocket engine(s) employed during landing (among other maneuvers) dissipates mechanical energy by both doing work against the velocity vector of the vehicle (thus defining the trajectory path), and by jettisoning mass. Therefore, by solving the energy dissipation problem at every step of the maneuver, a much simpler formulation that naturally and quickly attains convergence is obtained. This formulation is not limited to approach, landing, and divert maneuvers, but in principle it can be employed during de-orbiting, braking burn, ascent, as well as orbit insertion.

Guidance↗
NASA NTRSDate not supplied

A Physics-Based Work-Energy Formulation for Real-Time Trajectory Guidance of a Lunar Lander

Throughout the years, many researchers have calculated and optimized trajectory solutions for lunar landing systems by employing sophisticated mathematical methods, that include: Hamilton’s Principle of Variation, Pontryagin’s maximum principle, and well known convex-optimization techniques among others. Many of these approaches typically require expensive computational resources to achieve convergence in the solution. In an effort to reduce complexity and the computational load required to obtain real-time guidance commands, a simple physics-based work-energy approach has been formulated. This approach is based on the dissipation of the mechanical energy of the vehicle to its final desired energy state required to achieve a safe landing. The rocket engine(s) employed during landing (among other maneuvers) dissipates mechanical energy by both doing work against the velocity vector of the vehicle (thus defining the trajectory path), and by jettisoning mass. Therefore, by solving the energy dissipation problem at every step of the maneuver, a much simpler formulation that naturally and quickly attains convergence is obtained. This formulation is not limited to approach, landing, and divert maneuvers, but in principle it can be employed during de-orbiting, braking burn, ascent, as well as orbit insertion.

Guidance↗
NASA NTRS1992

The appliation of potential CFD methods to helicopter hover flows

Fixed-wing code development is now aimed primarily at the solution of problems dominated by separation--based on the assumptions that the ability to solve such problems implies the ability to solve all other problems and that present inviscid method are already adequate for most other problems. Neither of the above assumptions are correct for rotary wing problems. This is because of the unique and overriding importance of wake modeling to rotor problems and also due to the well-known numerical diffusion problems which convectional Eulerian Computational fluid dynamics (CFD) method encounter when called on to convect strong vortical regions for long distances. The need for accurate wake analyses is probably the most fundamental difference between rotory and fixed-wing aerodynamics. In addition, rotary wing complexity requires a much more intimate relationship between test and analysis than is common in fixed-wing work. With these issues in mind, this paper will review some of our recent experience in using a unique-Eulerian-Lagrangian Computational fluid dynamics (CFC) method for the solution of a critical rotor-wake problem--the prediction of hover performance.

Caradonna, F. X.↗
NASA NTRS1950

Subsonic Gas Flow Past A Wing Profile

The use of the linearized equations of Chaplygin to calculate the subsonic flow of a gas permits solving the problem of the flow about a wing profile for absence and presence of circulation. The solution is obtained in a practical convenient form that permits finding all the required magnitudes for the gas flow (lift, lift moment velocity distribution over the profile, and critical Mach number). This solution is not expressed in simple closed form; for a certain simplifying assumption, however, the equations of Chaplygin can be reduced to equations with constant coefficients, and solutions are obtained by using only the mathematical apparatus of the theory of functions of a complex variable. The method for simplifying the equations was pointed out by Chaplygin himself. These applied similar equations to the solution of the flow problem and obtained a solution for the case of the absence of circulation.

Christianovich, S. A.↗
NASA NTRS1989

Tele-autonomous systems: New methods for projecting and coordinating intelligent action at a distance

There is a growing need for humans to perform complex remote operations and to extend the intelligence and experience of experts to distant applications. It is asserted that a blending of human intelligence, modern information technology, remote control, and intelligent autonomous systems is required, and have coined the term tele-autonomous technology, or tele-automation, for methods producing intelligent action at a distance. Tele-automation goes beyond autonomous control by blending in human intelligence. It goes beyond tele-operation by incorporating as much autonomy as possible and/or reasonable. A new approach is discussed for solving one of the fundamental problems facing tele-autonomous systems: The need to overcome time delays due to telemetry and signal propagation. New concepts are introduced called time and position clutches, that allow the time and position frames between the local user control and the remote device being controlled, to be desynchronized respectively. The design and implementation of these mechanisms are described in detail. It is demonstrated that these mechanisms lead to substantial telemanipulation performance improvements, including the result of improvements even in the absence of time delays. The new controls also yield a simple protocol for control handoffs of manipulation tasks between local operators and remote systems.

Conway, Lynn↗
NASA NTRS1991

Low-dispersion finite difference methods for acoustic waves in a pipe

A new algorithm for computing one-dimensional acoustic waves in a pipe is demonstrated by solving the acoustic equations as an initial-boundary-value problem. Conventional dissipation-free second-order finite difference methods suffer severe phase distortion for grids with less that about ten mesh points per wavelength. Using the signal generation by a piston in a duct as an example, transient acoustic computations are presented using a new compact three-point algorithm which allows about 60 percent fewer mesh points per wavelength. Both pulse and harmonic excitation are considered. Coupling of the acoustic signal with the pipe resonant modes is shown to generate a complex transient wave with rich harmonic content.

Davis, Sanford↗
NASA NTRS1993

Toward an embedded training tool for Deep Space Network operations

There are three issues to consider when building an embedded training system for a task domain involving the operation of complex equipment: (1) how skill is acquired in the task domain; (2) how the training system should be designed to assist in the acquisition of the skill, and more specifically, how an intelligent tutor could aid in learning; and (3) whether it is feasible to incorporate the resulting training system into the operational environment. This paper describes how these issues have been addressed in a prototype training system that was developed for operations in NASA's Deep Space Network (DSN). The first two issues were addressed by building an executable cognitive model of problem solving and skill acquisition of the task domain and then using the model to design an intelligent tutor. The cognitive model was developed in Soar for the DSN's Link Monitor and Control (LMC) system; it led to several insights about learning in the task domain that were used to design an intelligent tutor called REACT that implements a method called 'impasse-driven tutoring'. REACT is one component of the LMC training system, which also includes a communications link simulator and a graphical user interface. A pilot study of the LMC training system indicates that REACT shows promise as an effective way for helping operators to quickly acquire expert skills.

Hill, Randall W., Jr.↗
NASA NTRS1994

A workstation based simulator for teaching compressible aerodynamics

A workstation-based interactive flow simulator has been developed to aid in the teaching of undergraduate compressible aerodynamics. By solving the equations found in NACA 1135, the simulator models three basic fluids problems encountered in supersonic flow: flow past a compression corner, flow past two wedges in series, and flow past two opposed wedges. The study can vary the geometry or flow conditions through a graphical user interface and the new conditions are calculated immediately. Various graphical formats present the results of the flow calculations to the student. The simulator includes interactive questions and answers to aid in both the use of the tool and to develop an understanding of some of the complexities of compressible aerodynamics. A series of help screens make the simulator easy to learn and use.

Benson, Thomas J.↗
NASA NTRS1996

Algorithms for Automatic Alignment of Arrays

Aggregate data objects (such as arrays) are distributed across the processor memories when compiling a data-parallel language for a distributed-memory machine. The mapping determines the amount of communication needed to bring operands of parallel operations into alignment with each other. A common approach is to break the mapping into two stages: an alignment that maps all the objects to an abstract template, followed by a distribution that maps the template to the processors. This paper describes algorithms for solving the various facets of the alignment problem: axis and stride alignment, static and mobile offset alignment, and replication labeling. We show that optimal axis and stride alignment is NP-complete for general program graphs, and give a heuristic method that can explore the space of possible solutions in a number of ways. We show that some of these strategies can give better solutions than a simple greedy approach proposed earlier. We also show how local graph contractions can reduce the size of the problem significantly without changing the best solution. This allows more complex and effective heuristics to be used. We show how to model the static offset alignment problem using linear programming, and we show that loop-dependent mobile offset alignment is sometimes necessary for optimum performance. We describe an algorithm with for determining mobile alignments for objects within do loops. We also identify situations in which replicated alignment is either required by the program itself or can be used to improve performance. We describe an algorithm based on network flow that replicates objects so as to minimize the total amount of broadcast communication in replication.

Chatterjee, Siddhartha↗
NASA NTRS1993

Toward an Embedded Training Tool for Deep Space Network Operations

There are three issues to consider when building an embedded training system for a task domain involving the operation of complex equipment: (1) how skill is acquired in the task domain; (2) how the training system should be designed to assist in the acquisition of the skill, and more specifically, how an intelligent tutor could aid in learning; and (3) whether it is feasible to incorporate the resulting training system into the operational environment. This paper describes how these issues have been addressed in a prototype training system that was developed for operations in NASA's Deep Space Network (DSN). The first two issues were addressed by building an executable cognitive model of problem solving and skill acquisition of the task domain and then using the model to design an intelligent tutor.

Johnson, W. Lewis↗