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 1,099 records · Page 61

Five basic steps to problem trending

Five basic steps to problem trending evolved from experience in trending problems on Space Shuttle hardware are discussed: extracting data; constructing a Pareto chart of all failure modes; constructing normalized subsystem, component, and failure-mode trend charts; identifying trend direction; and providing a summary assessment. The five-step method has been useful for identifying failure modes of concern, evaluating the effectiveness of corrective actions, and determining funding allocation.

Bombara, Elwood L.↗

Eigenvalue and eigenvector sensitivity and approximate analysis for repeated eigenvalue problems

A set of computationally efficient equations for eigenvalue and eigenvector sensitivity analysis are derived, and a method for eigenvalue and eigenvector approximate analysis in the presence of repeated eigenvalues is presented. The method developed for approximate analysis involves a reparamaterization of the multivariable structural eigenvalue problem in terms of a single positive-valued parameter. The resulting equations yield first-order approximations of changes in both the eigenvalues and eigenvectors associated with the repeated eigenvalue problem. Examples are given to demonstrate the application of such equations for sensitivity and approximate analysis.

Hou, Gene J. W.↗

Solution adaptive local rectangular grid refinement for transonic aerodynamic flow problems

This paper describes the use of solution-adaptive local grid refinement in a numerical method for solving transonic flow problems about complex three-dimensional aircraft configurations. The method is implemented in the TRANAIR code, which has been applied to help solve many practical engineering problems. Attention is focused here on the principal components of the solution-adaptive grid algorithms currently being developed and on two applications that demonstrate the capabilities of the algorithms.

Bieterman, Michael B.↗

The mode III crack problem in bonded materials with a nonhomogeneous interfacial zone

The mode 3 crack problem for two bonded homogeneous half planes was considered. The interfacial zone was modelled by a nonhomogeneous strip in such a way that the shear modulus is a continuous function throughout the composite medium and has discontinuous derivatives along the boundaries of the interfacial zone. The problem was formulated for cracks perpendicular to the nominal interface and was solved for various crack locations in and around the interfacial region. The asymptotic stress field near the tip of a crack terminating at an interface was examined and it was shown that, unlike the corresponding stress field in piecewise homogeneous materials, in this case the stresses have the standard square root singularity and their angular variation was identical to that of a crack in a homogeneous medium. With application to the subcritical crack growth process in mind, the results given include mostly the stress intensity factors for some typical crack geometries and various material combinations.

Erdogan, F.↗

Solving constrained minimum-time robot problems using the sequential gradient restoration algorithm

Three constrained minimum-time control problems of a two-link manipulator are solved using the Sequential Gradient and Restoration Algorithm (SGRA). The inequality constraints considered are reduced via Valentine-type transformations to nondifferential path equality constraints. The SGRA is then used to solve these transformed problems with equality constraints. The results obtained indicate that at least one of the two controls is at its limits at any instant in time. The remaining control then adjusts itself so that none of the system constraints is violated. Hence, the minimum-time control is either a pure bang-bang control or a combined bang-bang/singular control.

Lee, Allan Y.↗

Symplectic maps for the n-body problem

The present study generalizes the mapping method of Wisdom (1982) to encompass all gravitational n-body problems with a dominant central mass. The rationale for the generalized mapping method is discussed as well as details for the mapping for the n-body problem. Some refinements of the method are considered, and the relationship of the mapping method to other symplectic integration methods is shown. The method is used to compute the evolution of the outer planets for a billion years. The resulting evolution is compared to the 845 million year evolution of the outer planets performed on the Digital Orerry using standard numerical integration techniques. This calculation provides independent numerical confirmation of the result of Sussman and Wisdom (1988) that the motion of the planet Pluto is chaotic.

Wisdom, Jack↗

Dynamic Restructuring Of Problems In Artificial Intelligence

"Dynamic tradeoff evaluation" (DTE) denotes proposed method and procedure for restructuring problem-solving strategies in artificial intelligence to satisfy need for timely responses to changing conditions. Detects situations in which optimal problem-solving strategies cannot be pursued because of real-time constraints, and effects tradeoffs among nonoptimal strategies in such way to minimize adverse effects upon performance of system.

Schwuttke, Ursula M.↗

Model problem

Our purpose in examining this test problem is to measure directly the effect of mesh refinement and the resulting mesh interfaces on a known wave that is sensitive to phase errors, while concurrently being able to visually display a meaningful picture of the effects of the refinement induced error on the solution. The refined mesh must be able to adequately capture the diffraction behavior, so that the plane wave front bends as it passes through the slit. Given that the coarse and refined meshes are sufficiently accurate, the phase errors introduced during the problem solution will be a function of th sound speed on the two grids plus the coarse/refined grid interaction errors.

Perkins, A. Louise↗

An unconditionally stable staggered algorithm for transient finite element analysis of coupled thermoelastic problems

An unconditionally stable second order accurate implicit-implicit staggered procedure for the finite element solution of fully coupled thermoelasticity transient problems is proposed. The procedure is stabilized with a semi-algebraic augmentation technique. A comparative cost analysis reveals the superiority of the proposed computational strategy to other conventional staggered procedures. Numerical examples of one and two-dimensional thermomechanical coupled problems demonstrate the accuracy of the proposed numerical solution algorithm.

Farhat, C.↗

Numerical identification of boundary conditions on nonlinearly radiating inverse heat conduction problems

An explicit and unconditionally stable finite difference method for the solution of the transient inverse heat conduction problem in a semi-infinite or finite slab mediums subject to nonlinear radiation boundary conditions is presented. After measuring two interior temperature histories, the mollification method is used to determine the surface transient heat source if the energy radiation law is known. Alternatively, if the active surface is heated by a source at a rate proportional to a given function, the nonlinear surface radiation law is then recovered as a function of the interface temperature when the problem is feasible. Two typical examples corresponding to Newton cooling law and Stefan-Boltzmann radiation law respectively are illustrated. In all cases, the method predicts the surface conditions with an accuracy suitable for many practical purposes.

Murio, Diego A.↗

Variational formulation of hybrid problems for fully 3-D transonic flow with shocks in rotor

Based on previous research, the unified variable domain variational theory of hybrid problems for rotor flow is extended to fully 3-D transonic rotor flow with shocks, unifying and generalizing the direct and inverse problems. Three variational principles (VP) families were established. All unknown boundaries and flow discontinuities (such as shocks, free trailing vortex sheets) are successfully handled via functional variations with variable domain, converting almost all boundary and interface conditions, including the Rankine Hugoniot shock relations, into natural ones. This theory provides a series of novel ways for blade design or modification and a rigorous theoretical basis for finite element applications and also constitutes an important part of the optimal design theory of rotor bladings. Numerical solutions to subsonic flow by finite elements with self-adapting nodes given in Refs., show good agreement with experimental results.

Liu, Gao-Lian↗

Central difference TVD and TVB schemes for time dependent and steady state problems

We use central differences to solve the time dependent Euler equations. The schemes are all advanced using a Runge-Kutta formula in time. Near shocks, a second difference is added as an artificial viscosity. This reduces the scheme to a first order upwind scheme at shocks. The switch that is used guarantees that the scheme is locally total variation diminishing (TVD). For steady state problems it is usually advantageous to relax this condition. Then small oscillations do not activate the switches and the convergence to a steady state is improved. To sharpen the shocks, different coefficients are needed for different equations and so a matrix valued dissipation is introduced and compared with the scalar viscosity. The connection between this artificial viscosity and flux limiters is shown. Any flux limiter can be used as the basis of a shock detector for an artificial viscosity. We compare the use of the van Leer, van Albada, mimmod, superbee, and the 'average' flux limiters for this central difference scheme. For time dependent problems, we need to use a small enough time step so that the CFL was less than one even though the scheme was linearly stable for larger time steps. Using a total variation bounded (TVB) Runge-Kutta scheme yields minor improvements in the accuracy.

Jorgenson, P.↗

Simplified computational methods for elastic and elastic-plastic fracture problems

This paper presents an overview of some of the recent (1984-1991) developments in computational/analytical methods in the mechanics of fracture: (i) analytical solutions for elliptical or circular cracks embedded in isotropic or transversely isotropic solids (the crack-plane being at an arbitrary angle to the axis of transverse isotropy), with crack-faces being subjected to arbitrary tractions; (ii) finite-element or boundary-element alternating methods for two- and three-dimensional crack problems; (iii) a "direct-stiffness" method for stiffened panels with flexible fasteners and with multiple cracks, using the alternating method; (iv) multiplesite-damage near a row of fastener holes; (v) analysis of cracks with bonded repair patches; (vi) methods for generation of weight-functions for 2- and 3-D crack problems, and (vii) domain-integral methods for elastic-plastic or inelastic crack mechanics.

Aging Aircraft↗

Boundary-element shape sensitivity analysis for thermal problems with nonlinear boundary conditions

Implicit differentiation of the discretized boundary integral equations governing the conduction of heat in solid objects subjected to nonlinear boundary conditions is shown to generate an accurate and economical approach for the computation of shape sensitivities for this class of problems. This approach involves the employment of analytical derivatives of boundary-element kernel functions with respect to shape design variables. A formulation is presented that can consistently account for both temperature-dependent convection and radiation boundary conditions. Several iterative strategies are presented for the solution of the resulting sets of nonlinear equations and the computational performances examined in detail. Multizone analysis and zone condensation strategies are demonstrated to provide substantive computational economies in this process for models with either localized nonlinear boundary conditions or regions of geometric insensitivity to design variables. A series of nonlinear example problems are presented that have closed-form solutions.

Kane, James H.↗

A global nonlinear tracking problem

The tracking problem for a globally minimum phase nonlinear system is considered. It is assumed that the signal to be tracked is slowly varying and a priori bounds on its magnitude are known. It is shown that if the system has bounded derivatives and exponentially stable zero dynamics then the system admits an output feedback controller which solves the tracking problem.

Dayawansa, W. P.↗

Solving unstructured grid problems on massively parallel computers

A highly parallel graph mapping technique that enables one to efficiently solve unstructured grid problems on massively parallel computers is presented. Many implicit and explicit methods for solving discretized partial differential equations require each point in the discretization to exchange data with its neighboring points every time step or iteration. The cost of this communication can negate the high performance promised by massively parallel computing. To eliminate this bottleneck, the graph of the irregular problem is mapped into the graph representing the interconnection topology of the computer such that the sum of the distances that the messages travel is minimized. It is shown that using the heuristic mapping algorithm significantly reduces the communication time compared to a naive assignment of processes to processors.

Hammond, Steven W.↗

Problem solving with genetic algorithms and Splicer

Genetic algorithms are highly parallel, adaptive search procedures (i.e., problem-solving methods) loosely based on the processes of population genetics and Darwinian survival of the fittest. Genetic algorithms have proven useful in domains where other optimization techniques perform poorly. The main purpose of the paper is to discuss a NASA-sponsored software development project to develop a general-purpose tool for using genetic algorithms. The tool, called Splicer, can be used to solve a wide variety of optimization problems and is currently available from NASA and COSMIC. This discussion is preceded by an introduction to basic genetic algorithm concepts and a discussion of genetic algorithm applications.

Bayer, Steven E.↗

Central difference TVD and TVB schemes for time dependent and steady state problems

We use central differences to solve the time dependent Euler equations. The schemes are all advanced using a Runge-Kutta formula in time. Near shocks, a second difference is added as an artificial viscosity. This reduces the scheme to a first order upwind scheme at shocks. The switch that is used guarantees that the scheme is locally total variation diminishing (TVD). For steady state problems it is usually advantageous to relax this condition. Then small oscillations do not activate the switches and the convergence to a steady state is improved. To sharpen the shocks, different coefficients are needed for different equations and so a matrix valued dissipation is introduced and compared with the scalar viscosity. The connection between this artificial viscosity and flux limiters is shown. Any flux limiter can be used as the basis of a shock detector for an artificial viscosity. We compare the use of the van Leer, van Albada, mimmod, superbee, and the 'average' flux limiters for this central difference scheme. For time dependent problems, we need to use a small enough time step so that the CFL was less than one even though the scheme was linearly stable for larger time steps. Using a total variation bounded (TVB) Runge-Kutta scheme yields minor improvements in the accuracy.

Jorgenson, P.↗