SEARCH · Search NASA

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 613 records · Page 34

All sources NASA NTRS DOE OSTI

NASA NTRS1986

Sensitivity analysis and approximation methods for general eigenvalue problems

Optimization of dynamic systems involving complex non-hermitian matrices is often computationally expensive. Major contributors to the computational expense are the sensitivity analysis and reanalysis of a modified design. The present work seeks to alleviate this computational burden by identifying efficient sensitivity analysis and approximate reanalysis methods. For the algebraic eigenvalue problem involving non-hermitian matrices, algorithms for sensitivity analysis and approximate reanalysis are classified, compared and evaluated for efficiency and accuracy. Proper eigenvector normalization is discussed. An improved method for calculating derivatives of eigenvectors is proposed based on a more rational normalization condition and taking advantage of matrix sparsity. Important numerical aspects of this method are also discussed. To alleviate the problem of reanalysis, various approximation methods for eigenvalues are proposed and evaluated. Linear and quadratic approximations are based directly on the Taylor series. Several approximation methods are developed based on the generalized Rayleigh quotient for the eigenvalue problem. Approximation methods based on trace theorem give high accuracy without needing any derivatives. Operation counts for the computation of the approximations are given. General recommendations are made for the selection of appropriate approximation technique as a function of the matrix size, number of design variables, number of eigenvalues of interest and the number of design points at which approximation is sought.

Murthy, D. V.↗

NASA NTRS1986

Common problems and pitfalls in gear design

There are several pitfalls and problems associated with the successful design of a new gear transmission. A new design will require the knowledge and experience of several technical areas of engineering. Most of the pitfalls and problems associated with a new design are related to an inadequate evaluation of several areas, such as, the lubrication and cooling requirements, complete static and dynamic load analysis, evaluation of materials and heat treatment and the latest manufacturing technology. Some of the common problems of the gear design process are discussed with recommendations made for avoiding these conditions.

Townsend, Dennis P.↗

NASA NTRS1987

Active stability augmentation of large space structures: A stochastic control problem

A problem in SCOLE is that of slewing an offset antenna on a long flexible beam-like truss attached to the space shuttle, with rather stringent pointing accuracy requirements. The relevant methodology aspects in robust feedback-control design for stability augmentation of the beam using on-board sensors is examined. It is framed as a stochastic control problem, boundary control of a distributed parameter system described by partial differential equations. While the framework is mathematical, the emphasis is still on an engineering solution. An abstract mathematical formulation is developed as a nonlinear wave equation in a Hilbert space. That the system is controllable is shown and a feedback control law that is robust in the sense that it does not require quantitative knowledge of system parameters is developed. The stochastic control problem that arises in instrumenting this law using appropriate sensors is treated. Using an engineering first approximation which is valid for small damping, formulas for optimal choice of the control gain are developed.

Balakrishnan, A. V.↗

NASA NTRS1986

Wave envelope technique for multimode wave guide problems

A fast method for solving wave guide problems is proposed. In particular, the guide is considered to be inhomogeneous allowing propagation of waves of higher order modes. Such problems have been handled successfully for acoustic wave propagation problems with single mode and finite length. This paper extends this concept to electromagnetic wave guides with several modes and infinite length. The method is described and results of computations are presented.

Hariharan, S. I.↗

NASA NTRS1987

Phycomyces in space: A problem in bioengineering

Sustaining life with total automation is a difficult problem for GAS canisters. The length of time between setting the experiment and flight, the conditions of a completely sealed container, no guarantee on launch delay, orientation and the possibility of contamination all tend to exclude experiments with living matter. This experiment examines the growth of a nontoxic, everyday fungus, Phycomyces, in a microgravity environment. Data from this experiment will help define the mechanism by which plants determine the direction of gravity. The bioengineering problems were solved only after numerous tests and design changes. Phycomyces normally have a shelf life of approximately one week. Storing the fungus for two months, activating the fungus for growth and precise timing were the major obstacles. Solutions were found for storage by drying the fungus spores onto pieces of filter paper. Activation occurs when this filter paper is dropped onto the growth medium, via a solenoid system. The problem of timing is partially solved by growing more than one chamber of the fungus at different time intervals. This experiment proves that the simpler a design, the better it works.

Schneringer, Julie A.↗

NASA NTRS1987

Comments on the problem of turbulence in aviation

The problem of turbulence since the beginning of aviation is traced. The problem was not cured by high altitude flight and was acerbated by the downbursts associated with thunderstorms. The accidents that occurred during the period 1982 to 1984 are listed. From this is extracted the weather related accidents. Turbulence accounts for 24% of the accidents involving large commercial carriers and 54% of the weather related accidents. In spite of all the efforts to improve the forecasting and detection of turbulence, the problem is still a large one.

Mclean, James C., Jr.↗

NASA NTRS1987

Analysis of a parallelized nonlinear elliptic boundary value problem solver with application to reacting flows

A parallelized finite difference code based on the Newton method for systems of nonlinear elliptic boundary value problems in two dimensions is analyzed in terms of computational complexity and parallel efficiency. An approximate cost function depending on 15 dimensionless parameters is derived for algorithms based on stripwise and boxwise decompositions of the domain and a one-to-one assignment of the strip or box subdomains to processors. The sensitivity of the cost functions to the parameters is explored in regions of parameter space corresponding to model small-order systems with inexpensive function evaluations and also a coupled system of nineteen equations with very expensive function evaluations. The algorithm was implemented on the Intel Hypercube, and some experimental results for the model problems with stripwise decompositions are presented and compared with the theory. In the context of computational combustion problems, multiprocessors of either message-passing or shared-memory type may be employed with stripwise decompositions to realize speedup of O(n), where n is mesh resolution in one direction, for reasonable n.

Keyes, David E.↗

NASA NTRS1987

Boundary value problem for the solution of magnetic cutoff rigidities and some special applications

Since a planet's magnetic field can sometimes provide a spacecraft with some protection against cosmic ray and solar flare particles, it is important to be able to quantify this protection. This is done by calculating cutoff rigidities. An alternate to the conventional method (particle trajectory tracing) is introduced, which is to treat the problem as a boundary value problem. In this approach trajectory tracing is only needed to supply boundary conditions. In some special cases, trajectory tracing is not needed at all because the problem can be solved analytically. A differential equation governing cutoff rigidities is derived for static magnetic fields. The presense of solid objects, which can block a trajectory and other force fields are not included. A few qualititative comments, on existence and uniqueness of solutions, are made which may be useful when deciding how the boundary conditions should be set up. Also included are topics on axially symmetric fields.

Edmonds, Larry↗

NASA NTRS1985

Nonlinear acoustic wave propagation in atmosphere. Absorbing boundary conditions for exterior problems

Elliptic and hyperbolic problems in unbounded regions are considered. These problems, when one wants to solve them numerically, have the difficulty of prescribing boundary conditions at infinity. Computationally, one needs a finite region in which to solve these problems. The corresponding conditions at infinity imposed on the finite distance boundaries should dictate the boundary conditions at infinity and be accurate with respect to the interior numerical scheme. The treatment of these boundary conditions for wave-like equations is discussed.

Hariharan, S. I.↗

NASA NTRS1987

Thermo-elasto-viscoplastic analysis of problems in extension and shear

The problems of extension and shear behavior of structural elements made of carbon steel and subjected to large thermomechanical loads are investigated. The analysis is based on nonlinear geometric and constitutive relations, and is expressed in a rate form. The material constitutive equations are capable of reproducing all nonisothermal, elasto-viscoplastic characteristics. The results of the test problems show that: (1) the formulation can accommodate very large strains and rotations; (2) the model incorporates the simplification associated with rate-insensitive elastic response without losing the ability to model a rate-temperature dependent yield strength and plasticity; and (3) the formulation does not display oscillatory behavior in the stresses for the simple shear problem.

Riff, R.↗

NASA NTRS1987

The minimal residual QR-factorization algorithm for reliably solving subset regression problems

A new algorithm to solve test subset regression problems is described, called the minimal residual QR factorization algorithm (MRQR). This scheme performs a QR factorization with a new column pivoting strategy. Basically, this strategy is based on the change in the residual of the least squares problem. Furthermore, it is demonstrated that this basic scheme might be extended in a numerically efficient way to combine the advantages of existing numerical procedures, such as the singular value decomposition, with those of more classical statistical procedures, such as stepwise regression. This extension is presented as an advisory expert system that guides the user in solving the subset regression problem. The advantages of the new procedure are highlighted by a numerical example.

Verhaegen, M. H.↗

NASA NTRS1986

Numerical solution of random singular integral equation appearing in crack problems

The solution of several elasticity problems, and particularly crack problems, can be reduced to the solution of one-dimensional singular integral equations with a Cauchy-type kernel or to a system of uncoupled singular integral equations. Here a method for the numerical solution of random singular integral equations of Cauchy type is presented. The solution technique involves a Chebyshev series approximation, the coefficients of which are the solutions of a system of random linear equations. This method is applied to the problem of periodic array of straight cracks inside an infinite isotropic elastic medium and subjected to a nonuniform pressure distribution along the crack edges. The statistical properties of the random solution are evaluated numerically, and the random solution is used to determine the values of the stress-intensity factors at the crack tips. The error, expressed as the difference between the mean of the random solution and the deterministic solution, is established. Values of stress-intensity factors at the crack tip for different random input functions are presented.

Sambandham, M.↗

NASA NTRS1986

A combined integrating- and differentiating-matrix formulation for boundary-value problems on rectangular domains

Integrating and differentiating matrices allow the numerical integration and differential of functions whose values are known at points of a discrete grid. Previous derivations of these matrices were restricted to one dimensional grids or to rectangular grids with uniform spacing in at least one direction. Integrating and differentiating matrices were developed for grids with nonuniform spacing in both directions. The use of these matrices as operators to reformulate boundary value problems on rectangular domains as matrix problems for a finite dimensional solution vector is considered. The method requires nonuniform grids which include near boundary points. An eigenvalue problem for the transverse vibrations of a simply supported rectangular plate is solved to illustrate the method.

Lakin, W. D.↗

NASA NTRS1987

WHAMII - An enumeration and insertion procedure with binomial bounds for the stochastic time-constrained traveling salesman problem

This paper presents an algorithm (WHAMII) designed to solve the Artificial Intelligence Design Challenge at the 1987 AIAA Guidance, Navigation and Control Conference. The problem under consideration is a stochastic generalization of the traveling salesman problem in which travel costs can incur a penalty with a given probability. The variability in travel costs leads to a probability constraint with respect to violating the budget allocation. Given the small size of the problem (eleven cities), an approach is considered that combines partial tour enumeration with a heuristic city insertion procedure. For computational efficiency during both the enumeration and insertion procedures, precalculated binomial probabilities are used to determine an upper bound on the actual probability of violating the budget constraint for each tour. The actual probability is calculated for the final best tour, and additional insertions are attempted until the actual probability exceeds the bound.

Dahl, Roy W.↗

NASA NTRS1986

Simultaneous iterations algorithm for general eigenvalue problems on parallel processors

The method of simultaneous iteration with shift is extended to extraction of m-eigenpairs of a general eigenvalue problem of large order n in a parallel processing environment. The algorithm combines the power method and the Jacobi technique, and reduces to performing four basic operations. Parallel implementation of the algorithm is discussed in detail. The analysis accounts for computation and communication costs, and utilizes a parallel processing architecture of the ensemble type. Expressions for the computational efficiency and speedup are defined as a function of the problem and hardware parameters. Selected representative problems exhibit efficiencies ranging from 60 to 98 percent.

Utku, S.↗

NASA NTRS1988

Algorithm For The Discrete-O timal-Output-Feedback Problem

Change in cost function due to change in feedback gain calculated. Algorithm for feedback control systems considers stochastic, infinite-time, discrete-output-feedback problem for time-invariant linear systems. Optimal-output-feedback problem formulates modern control-law-design problem in which only selected number of plant-state variables used.

Halyo, Nesim↗

NASA NTRS1987

Optimal pre-scheduling of problem remappings

A large class of scientific computational problems can be characterized as a sequence of steps where a significant amount of computation occurs each step, but the work performed at each step is not necessarily identical. Two good examples of this type of computation are: (1) regridding methods which change the problem discretization during the course of the computation, and (2) methods for solving sparse triangular systems of linear equations. Recent work has investigated a means of mapping such computations onto parallel processors; the method defines a family of static mappings with differing degrees of importance placed on the conflicting goals of good load balance and low communication/synchronization overhead. The performance tradeoffs are controllable by adjusting the parameters of the mapping method. To achieve good performance it may be necessary to dynamically change these parameters at run-time, but such changes can impose additional costs. If the computation's behavior can be determined prior to its execution, it can be possible to construct an optimal parameter schedule using a low-order-polynomial-time dynamic programming algorithm. Since the latter can be expensive, the performance is studied of the effect of a linear-time scheduling heuristic on one of the model problems, and it is shown to be effective and nearly optimal.

Nicol, David M.↗

NASA NTRS1988

Search Problems in Mission Planning and Navigation of Autonomous Aircraft

An architecture for the control of an autonomous aircraft is presented. The architecture is a hierarchical system representing an anthropomorphic breakdown of the control problem into planner, navigator, and pilot systems. The planner system determines high level global plans from overall mission objectives. This abstract mission planning is investigated by focusing on the Traveling Salesman Problem with variations on local and global constraints. Tree search techniques are applied including the breadth first, depth first, and best first algorithms. The minimum-column and row entries for the Traveling Salesman Problem cost matrix provides a powerful heuristic to guide these search techniques. Mission planning subgoals are directed from the planner to the navigator for planning routes in mountainous terrain with threats. Terrain/threat information is abstracted into a graph of possible paths for which graph searches are performed. It is shown that paths can be well represented by a search graph based on the Voronoi diagram of points representing the vertices of mountain boundaries. A comparison of Dijkstra's dynamic programming algorithm and the A* graph search algorithm from artificial intelligence/operations research is performed for several navigation path planning examples. These examples illustrate paths that minimize a combination of distance and exposure to threats. Finally, the pilot system synthesizes the flight trajectory by creating the control commands to fly the aircraft.

Krozel, James A.↗