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 613 records · Page 34

The Role of Analytic Methods in Computational Aeroacoustics

As air traffic grows, annoyance produced by aircraft noise will grow unless new aircraft produce no objectionable noise outside airport boundaries. Such ultra-quiet aircraft must be of revolutionary design, having unconventional planforms and most likely with propulsion systems highly integrated with the airframe. Sophisticated source and propagation modeling will be required to properly account for effects of the airframe on noise generation, reflection, scattering, and radiation. It is tempting to say that since all the effects are included in the Navier-Stokes equations, time-accurate CFD can provide all the answers. Unfortunately, the computational time required to solve a full aircraft noise problem will be prohibitive for many years to come. On the other hand, closed form solutions are not available for such complicated problems. Therefore, a hybrid approach is recommended in which analysis is taken as far as possible without omitting relevant physics or geometry. Three examples are given of recently reported work in broadband noise prediction, ducted fan noise propagation and radiation, and noise prediction for complex three-dimensional jets.

Farassat, F.↗

Automating the Process of Optimization in Spacecraft Design

Spacecraft design optimization is a difficult problem, due to the complexity of optimization cost surfaces, and human expertise in optimization that is necessary in order to achieve good results. In this paper, we propose the use of a set of generic, metaheuristic optimization algorithms (e.g., generic algorithms, simulated annealing), which is configured for a particular optimization problem by an adaptive problem solver based on artificial intelligence and machine learning techniques. We describe work in progress on OASIS, a system for adaptive problem solving based on these principles.

optimization↗

Modeling and Prediction of the Noise from Non-Axisymmetric Jets

The new source model was combined with the original sound propagation model developed for rectangular jets to produce a new version of the rectangular jet noise prediction code. This code was validated using a set of rectangular nozzles whose geometries were specified by NASA. Nozzles of aspect ratios two, four and eight were studied at jet exit Mach numbers of 0.5, 0.7 and 0.9, for a total of nine cases. Reynolds-averaged Navier-Stokes solutions for these jets were provided to the contactor for use as input to the code. Quantitative comparisons of the predicted azimuthal and polar directivity of the acoustic spectrum were made with experimental data provided by NASA. The results of these comparisons, along with a documentation of the propagation and source models, were reported in a journal article publication (Ref. 4). The complete set of computer codes and computational modules that make up the prediction scheme, along with a user's guide describing their use and example test cases, was provided to NASA as a deliverable of this task. The use of conformal mapping, along with simplified modeling of the mean flow field, for noise propagation modeling was explored for other nozzle geometries, to support the task milestone of developing methods which are applicable to other geometries and flow conditions of interest to NASA. A model to represent twin round jets using this approach was formulated and implemented. A general approach to solving the equations governing sound propagation in a locally parallel nonaxisymmetric jet was developed and implemented, in aid of the tasks and milestones charged with selecting more exact numerical methods for modeling sound propagation, and developing methods that have application to other nozzle geometries. The method is based on expansion of both the mean-flowdependent coefficients in the governing equation and the Green's function in series of orthogonal functions. The method was coded and tested on two analytically prescribed mean flows which were meant to represent noise reduction concepts being considered by NASA. Testing (Ref. 5) showed that the method was feasible for the types of mean flows of interest in jet noise applications. Subsequently, this method was further developed to allow use of mean flow profiles obtained from a Reynolds-averaged Navier-Stokes (RANS) solution of the flow. Preliminary testing of the generalized code was among the last tasks completed under this contract. The stringent noise-reduction goals of NASA's Fundamental Aeronautics Program suggest that, in addition to potentially complex exhaust nozzle geometries, next generation aircraft will also involve tighter integration of the engine with the airframe. Therefore, noise generated and propagated by jet flows in the vicinity of solid surfaces is expected to be quite significant, and reduced-order noise prediction tools will be needed that can deal with such geometries. One important source of noise is that generated by the interaction of a turbulent jet with the edge of a solid surface (edge noise). Such noise is generated, for example, by the passing of the engine exhaust over a shielding surface, such as a wing. Work under this task supported an effort to develop a RANS-based prediction code for edge noise based on an extension of the classical Rapid Distortion Theory (RDT) to transversely sheared base flows (Refs. 6 and 7). The RDT-based theoretical analysis was applied to the generic problem of a turbulent jet interacting with the trailing edge of a flat plate. A code was written to evaluate the formula derived for the spectrum of the noise produced by this interaction and results were compared with data taken at NASA Glenn for a variety of jet/plate configurations and flow conditions (Ref. 8). A longer-term goal of this task was to work toward the development of a high-fidelity model of sound propagation in spatially developing non-axisymmetric jets using direct numerical methods for solving the relevant equations. Working with NASA Glenn Acoustics Branch personnel, numerical methods and boundary conditions appropriate for use in a high-resolution calculation of the full equations governing sound propagation in a steady base flow were identified. Computer codes were then written (by NASA) and tested (by OAI) for an increasingly complex set of flow conditions to validate the methods. The NASA-supplied codes were ported to the High-End Computing resources of the NASA Advanced Supercomputing facility for testing and validation against analytical (where possible) and independent numerical solutions. The cases which were completed during the course of this contract were solutions of the two-dimensional linearized Euler equations with no mean flow, a uniform mean flow and a nonuniform mean flow representative of a parallel flow jet.

Leib, Stewart J.↗

Unsteady, Transonic Flow Around Delta Wings Undergoing Coupled and Natural Modes Response: A Multidisciplinary Problem

The unsteady, three-dimensional Navier-Stokes equations coupled with the Euler equations of rigid-body dynamics are sequentially solved to simulate and analyze the aerodynamic response of a high angle of attack delta wing undergoing oscillatory motion. The governing equations of fluid flow and dynamics of the multidisciplinary problem are solved using a time-accurate solution of the laminar, unsteady, compressible, full Navier- Stokes equations with the implicit, upwind, Roe flux-difference splitting, finite-volume scheme and a four-stage Runge-Kutta scheme, respectively. The primary model under consideration consists of a 65 deg swept, sharp-edged, cropped delta wing of zero thickness at 20 deg angle of attack. In a freestream of Mach 0.85 and Reynolds number of 3.23 x 10(exp 6), the flow over the upper surface of the wing develops a complex shock system which interacts with the leading-edge primary vortices producing vortex breakdown. The effect of the oscillatory motion of the wing on the vortex breakdown and overall aerodynamic response is detailed to provide insight to the complicated physics associated with unsteady flows and the phenomenon of wing rock. Forced sinusoidal single and coupled mode rolling and pitching motion is presented for the wing in a transonic freestream. The Reynolds number, frequency of oscillation, and the phase angle are varied. Comparison between the single and coupled mode forced rolling and pitching oscillation cases illustrate the effects of coupling the motion. This investigation shows that even when coupled, forced rolling oscillation at a reduced frequency of 2(pi) eliminates the vortex breakdown which results in an increase in lift. The coupling effect for in phase forced oscillations show that the lift coefficient of the pitching-alone case and the rolling-moment coefficient of the rolling-alone case dominate the resulting response. However, with a phase lead in the pitching motion, the coupled motion results in a non-periodic response of the rolling moment. The second class of problems involve releasing the wing in roll to respond to the flowfield. Two models of sharp-edged delta wings, the previous 65 deg swept model and an 80 deg swept, sharp-edged delta wing, are used to observe the aerodynamic response of a wing free to roll in a transonic and subsonic freestream, respectively. These cases demonstrate damped oscillations, self-sustained limit cycle oscillations, and divergent rolling oscillations. Ultimately, an active control model using a mass injection system was applied on the surface of the wing to suppress the self-sustained limit cycle oscillation known as wing rock. Comparisons with experimental investigations complete this study, validating the analysis and illustrating the complex details afforded by computational investigations.

Menzies, Margaret Anne↗

Unstructured Grid Generation for Complex 3D High-Lift Configurations

The application of an unstructured grid methodology on a three-dimensional high-lift configuration is presented. The focus of this paper is on the grid generation aspect of an integrated effort for the development of an unstructured-grid computational fluid dynamics (CFD) capability at the NASA Langley Research Center. The meshing approach is based on tetrahedral grids generated by the advancing-front and the advancing-layers procedures. The capability of the method for solving high-lift problems is demonstrated on an aircraft model referred to as the energy efficient transport configuration. The grid generation issues, including the pros and cons of the present approach, are discussed in relation to the high-lift problems. Limited viscous flow results are presented to demonstrate the viability of the generated grids. A corresponding Navier-Stokes solution capability, along with further computations on the present grid, is presented in a companion SAE paper.

Pirzadeh, Shahyar Z.↗

Conservative finite volume solutions of a linear hyperbolic transport equation in two and three dimensions using multiple grids

The feasibility of the multiple grid technique is investigated by solving linear hyperbolic equations for simple two- and three-dimensional cases. The results are compared with exact solutions and those obtained from the single grid calculations. It is demonstrated that the technique works reasonably well when two grid systems contain grid cells of comparative sizes. The study indicates that use of the multiple grid does not introduce any significant error and that it can be used to attack more complex problems.

Tiwari, Surendra N.↗

Intent Specifications

We have been investigating the implications of using abstractions based on intent rather than the aggregation and information-hiding abstractions commonly used in software en- gineering: Cognitive psychologists have shown that intent abstraction is consistent with human problem-solving processes. We believe that new types of specifications and designs based on this concept can assist in understanding and specifying requirements, capturing the most important design rationale information in an efficient and economical way, and supporting the process of identifying and analyzing required changes to minimize the introduction of errors. The goal of hierarchical abstraction is to allow both top-down and bottom-up reasoning about a complex system. In computer science, we have made much use of (1) part-whole abstractions where each level of a hierarchy represents an aggregation of the components at a lower level and of (2) information-hiding abstractions where each level contains the same conceptual information but hides some details about the concepts, that is, each level is a refinement of the information at a higher level.

Leveson, Nancy G.↗

Newton solution of inviscid and viscous problems

The application of Newton iteration to inviscid and viscous airfoil calculations is examined. Spatial discretization is performed using upwind differences with split fluxes. The system of linear equations which arises as a result of linearization in time is solved directly using either a banded matrix solver or a sparse matrix solver. In the latter case, the solver is used in conjunction with the nested dissection strategy, whose implementation for airfoil calculations is discussed. The boundary conditions are also implemented in a fully implicit manner, thus yielding quadratic convergence. Complexities such as the ordering of cell nodes and the use of a far field vortex to correct freestream for a lifting airfoil are addressed. Various methods to accelerate convergence and improve computational efficiency while using Newton iteration are discussed. Results are presented for inviscid, transonic nonlifting and lifting airfoils and also for laminar viscous cases.

Venkatakrishnan, V.↗

Wave scattering and guidance by dielectric waveguides with periodic surfaces

The extended-boundary-condition method is used to solve the wave scattering and guidance by a stratified medium with a periodic surface. First, the transition matrix for two sets of Flocquet waves incident from above and below a periodic surface separating the two media is derived. The results are applied to the diffraction of an incident plane wave by a multilayered medium having a periodic surface. The theoretical results can easily be applied to the guidance problem for which the complex guiding constant of the periodic structure is obtained. Numerical results for both the scattering and the guidance problems are obtained. The theory is compared with experiment for metallic gratings with surface-plasmon excitations. The calculated guiding constants of a thin film with a periodic sinusoidal surface are also compared with other numerical methods.

Chuang, S. L.↗

Numerical modeling of multidimensional flow in seals and bearings used in rotating machinery

The rotordynamic behavior of turbomachinery is critically dependent on fluid dynamic rotor forces developed by various types of seals and bearings. The occurrence of self-excited vibrations often depends on the rotor speed and load. Misalignment and rotor wobbling motion associated with differential clearance were often attributed to stability problems. In general, the rotative character of the flowfield is a complex three dimensional system with secondary flow patterns that significantly alter the average fluid circumferential velocity. A multidimensional, nonorthogonal, body-fitted-grid fluid flow model is presented that describes the fluid dynamic forces and the secondary flow pattern development in seals and bearings. Several numerical experiments were carried out to demonstrate the characteristics of this complex flowfield. Analyses were performed by solving a conservation form of the three dimensional Navier-Stokes equations transformed to those for a rotating observer and using the general-purpose computer code PHOENICS with the assumptions that the rotor orbit is circular and that static eccentricity is zero. These assumptions have enabled a precise steady-state analysis to be used. Fluid injection from ports near the seal or bearing center increased fluid-film direct dynamic stiffness and, in some cases, significantly increased quadrature dynamic stiffness. Injection angle and velocity could be used for active rotordynamic control; for example, injection, when compared with no injection, increased direct dynamic stiffness, which is an important factor for hydrostatic bearings.

Hendricks, R. C.↗

Computations of Complex Three-Dimensional Turbulent Free Jets

Three-dimensional, incompressible turbulent jets with rectangular and elliptical cross-sections are simulated with a finite-difference numerical method. The full Navier- Stokes equations are solved at low Reynolds numbers, whereas at high Reynolds numbers filtered forms of the equations are solved along with a sub-grid scale model to approximate the effects of the unresolved scales. A 2-N storage, third-order Runge-Kutta scheme is used for temporary discretization and a fourth-order compact scheme is used for spatial discretization. Although such methods are widely used in the simulation of compressible flows, the lack of an evolution equation for pressure or density presents particular difficulty in incompressible flows. The pressure-velocity coupling must be established indirectly. It is achieved, in this study, through a Poisson equation which is solved by a compact scheme of the same order of accuracy. The numerical formulation is validated and the dispersion and dissipation errors are documented by the solution of a wide range of benchmark problems. Three-dimensional computations are performed for different inlet conditions which model the naturally developing and forced jets. The experimentally observed phenomenon of axis-switching is captured in the numerical simulation, and it is confirmed through flow visualization that this is based on self-induction of the vorticity field. Statistical quantities such as mean velocity, mean pressure, two-point velocity spatial correlations and Reynolds stresses are presented. Detailed budgets of the mean momentum and Reynolds stresses are presented. Detailed budgets of the mean momentum and Reynolds stress equations are presented to aid in the turbulence modeling of complex jets. Simulations of circular jets are used to quantify the effect of the non-uniform curvature of the non-circular jets.

Wilson, Robert V.↗

Optimal placement of excitations and sensors for verification of large dynamical systems

The computationally difficult problem of the optimal placement of excitations and sensors to maximize the observed measurements is studied within the framework of combinatorial optimization, and is solved numerically using a variation of the simulated annealing heuristic algorithm. Results of numerical experiments including a square plate and a 960 degrees-of-freedom Control of Flexible Structure (COFS) truss structure, are presented. Though the algorithm produces suboptimal solutions, its generality and simplicity allow the treatment of complex dynamical systems which would otherwise be difficult to handle.

Salama, M.↗

An Integrated Framework for Model-Based Distributed Diagnosis and Prognosis

Diagnosis and prognosis are necessary tasks for system reconfiguration and fault-adaptive control in complex systems. Diagnosis consists of detection, isolation and identification of faults, while prognosis consists of prediction of the remaining useful life of systems. This paper presents a novel integrated framework for model-based distributed diagnosis and prognosis, where system decomposition is used to enable the diagnosis and prognosis tasks to be performed in a distributed way. We show how different submodels can be automatically constructed to solve the local diagnosis and prognosis problems. We illustrate our approach using a simulated four-wheeled rover for different fault scenarios. Our experiments show that our approach correctly performs distributed fault diagnosis and prognosis in an efficient and robust manner.

Bregon, Anibal↗

Parallel algorithms for placement and routing in VLSI design

The computational requirements for high quality synthesis, analysis, and verification of very large scale integration (VLSI) designs have rapidly increased with the fast growing complexity of these designs. Research in the past has focused on the development of heuristic algorithms, special purpose hardware accelerators, or parallel algorithms for the numerous design tasks to decrease the time required for solution. Two new parallel algorithms are proposed for two VLSI synthesis tasks, standard cell placement and global routing. The first algorithm, a parallel algorithm for global routing, uses hierarchical techniques to decompose the routing problem into independent routing subproblems that are solved in parallel. Results are then presented which compare the routing quality to the results of other published global routers and which evaluate the speedups attained. The second algorithm, a parallel algorithm for cell placement and global routing, hierarchically integrates a quadrisection placement algorithm, a bisection placement algorithm, and the previous global routing algorithm. Unique partitioning techniques are used to decompose the various stages of the algorithm into independent tasks which can be evaluated in parallel. Finally, results are presented which evaluate the various algorithm alternatives and compare the algorithm performance to other placement programs. Measurements are presented on the parallel speedups available.

Brouwer, Randall Jay↗

Dissolving variables in connectionist combinatory logic

A connectionist system which can represent and execute combinator expressions to elegantly solve the variable binding problem in connectionist networks is presented. This system is a graph reduction machine utilizing graph representations and traversal mechanisms similar to ones described in the BoltzCONS system of Touretzky (1986). It is shown that, as combinators eliminate variables by introducing special functions, these functions can be connectionistically implemented without reintroducing variable binding. This approach 'dissolves' an important part of the variable binding problem, in that a connectionist system still has to manipulate complex data structures, but those structures and their manipulations are rendered more uniform.

Barnden, John↗

Parallel execution of a three-dimensional, chemically reacting, Navier-Stokes code on distributed-memory machines

This paper describes the parallel version of the three-dimensional, chemically reacting, computational fluid dynamics (CFD) code, SPARK. This work was performed on the Intel iPSC/860-based parallel computers. The SPARK code utilizes relatively simple explicit numerical algorithms, but models complex chemical reactions. The code solves the equations over a regular structured mesh so a simple dam decomposition is used to assign work to the individual processors. The explicit nature of the algorithm, combined with the computational intensity of the chemistry calculations, results in a very low communication-to-computation ratio when compared to typical CFD codes. The efficiency of the parallel code is examined and shown to be about 65 percent when the problem size is scaled with the number of processors. Two low-angle wall-jet injection cases are solved to demonstrate the capability of the parallel code for solving large problems efficiently.

Otto, John C.↗

A Study of Penalty Function Methods for Constraint Handling with Genetic Algorithm

COMETBOARDS (Comparative Evaluation Testbed of Optimization and Analysis Routines for Design of Structures) is a design optimization test bed that can evaluate the performance of several different optimization algorithms. A few of these optimization algorithms are the sequence of unconstrained minimization techniques (SUMT), sequential linear programming (SLP) and the sequential quadratic programming techniques (SQP). A genetic algorithm (GA) is a search technique that is based on the principles of natural selection or "survival of the fittest". Instead of using gradient information, the GA uses the objective function directly in the search. The GA searches the solution space by maintaining a population of potential solutions. Then, using evolving operations such as recombination, mutation and selection, the GA creates successive generations of solutions that will evolve and take on the positive characteristics of their parents and thus gradually approach optimal or near-optimal solutions. By using the objective function directly in the search, genetic algorithms can be effectively applied in non-convex, highly nonlinear, complex problems. The genetic algorithm is not guaranteed to find the global optimum, but it is less likely to get trapped at a local optimum than traditional gradient-based search methods when the objective function is not smooth and generally well behaved. The purpose of this research is to assist in the integration of genetic algorithm (GA) into COMETBOARDS. COMETBOARDS cast the design of structures as a constrained nonlinear optimization problem. One method used to solve constrained optimization problem with a GA to convert the constrained optimization problem into an unconstrained optimization problem by developing a penalty function that penalizes infeasible solutions. There have been several suggested penalty function in the literature each with there own strengths and weaknesses. A statistical analysis of some suggested penalty functions is performed in this study. Also, a response surface approach to robust design is used to develop a new penalty function approach. This new penalty function approach is then compared with the other existing penalty functions.

Ortiz, Francisco↗

On Expected Value Strong Controllability

The Probabilistic Simple Temporal Network (PSTN) generalizes Simple Temporal Networks with Uncertainty (STNUs) by introducing probability distributions over the timing of uncontrollable timepoints. PSTNs are controllable if there is a strategy to execute the controllable timepoints while bounding the risk of violating any constraint to a small value. If this risk bound can't be satisfied, PSTNs are not considered controllable. We introduce the Expected Value Probabilistic SimpleTemporal Network (EPSTN), which extends PSTNs by including a benefit to the satisfaction of temporal constraints. We study the problem of Expected Value Strong Controllability (EvSC) of EPSTNs, which seeks a schedule maximizing the expected value of satisfied constraints. We solve the EvSC problem by extending a previously developed linear program, combined with search over constraints to violate at execution time. We describe conditions under which the solution to this linear program is the maximum expected value schedule. We then show how to search for constraints to discard, using the linear program at the core of the search. While the general problem is shown to be exponential, we conclude by providing several methods to bound the complexity of search.

Planning↗