Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational optimization”

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 91 records · Page 5

Optimized collectives using a DMA on a parallel computer

Optimizing collective operations using direct memory access controller on a parallel computer, in one aspect, may comprise establishing a byte counter associated with a direct memory access controller for each submessage in a message. The byte counter includes at least a base address of memory and a byte count associated with a submessage. A byte counter associated with a submessage is monitored to determine whether at least a block of data of the submessage has been received. The block of data has a predetermined size, for example, a number of bytes. The block is processed when the block has been fully received, for example, when the byte count indicates all bytes of the block have been received. The monitoring and processing may continue for all blocks in all submessages in the message.

97 MATHEMATICS AND COMPUTING↗

The Efficiency of Various Computers and Optimizations in Performing Finite Element Computations

With the advent of computers with many processors, it becomes unclear how to best exploit this advantage. For example, matrices can be inverted by applying several processors to each vector operation, or one processor can be applied to each matrix. The former approach has diminishing returns beyond a handful of processors, but how many processors depends on the computer architecture. Applying one processor to each matrix is feasible with enough ram memory and scratch disk space, but the speed at which this is done is found to vary by a factor of three depending on how it is done. The cost of the computer must also be taken into account. A computer with many processors and fast interprocessor communication is much more expensive than the same computer and processors with slow interprocessor communication. Consequently, for problems that require several matrices to be inverted, the best speed per dollar for computers is found to be several small workstations that are networked together, such as in a Beowulf cluster. Since these machines typically have two processors per node, each matrix is most efficiently inverted with no more than two processors assigned to it.

Marcus, Martin H.↗

Numerical Optimization Using Computer Experiments

Engineering design optimization often gives rise to problems in which expensive objective functions are minimized by derivative-free methods. We propose a method for solving such problems that synthesizes ideas from the numerical optimization and computer experiment literatures. Our approach relies on kriging known function values to construct a sequence of surrogate models of the objective function that are used to guide a grid search for a minimizer. Results from numerical experiments on a standard test problem are presented.

Trosset, Michael W.↗

Computational wing optimization and wind tunnel test of semi-span model

A computational transonic wing design procedure has been developed and verified by a wind tunnel test of a variable camber semi-span wing model. The Bailey-Ballhaus transonic potential flow analysis code linked to Vanderplaat's constrained minimization routine was used to optimize test configurations at 0.9 Mach number. Based on wind tunnel test results, computationally optimized designs were as efficient as the best configurations determined by previous parametric testing and performed better at off-design points. Wind tunnel wing pressures agreed well with predictions from the improved Bailey-Ballhaus code at moderate CL's. Computational optimization was shown to be an effective transonic wing design tool.

Haney, H. P.↗

TAOI B- Computational Microstructural Optimization Design Tool for High Temperature Structural Materials

The objectives of this research were two-fold: (a) develop a methodology for microstructural optimization of alloys - genetic algorithm approach for alloy microstructural optimization using theoretical models based on fundamental micro-mechanisms, and (b) develop a new computationally designed Ni-Cr alloy for coal-fired power plant applications. The broader outcome of these objectives is expected to be creation of an integrated approach for ‘structural materials by microstructural design’. Three alloy systems were considered for computational optimization and validation, (i) Ni-20Cr (wt.%) base alloy using only solid solution strengthening, (ii) nano-Y 2 O 3 containing Ni-20Cr-1.2Y 2 O 3 (wt.%) alloy for dispersion strengthening and (iii) a sub-micron Al 2 O 3 for composite strengthening, Ni-20Cr-1.2Y 2 O 3 -5.0Al 2 O 3 (wt.%). The specimens were synthesized by mechanical alloying and consolidated using spark plasma sintering. Detailed microstructural characterization was done along with initial mechanical properties to validate the computational prediction. A key target property is to have creep rate of 1x10 -9 s -1 at 100 MPa and 800°C. The initial results were quite promising and require additional quantification of strengthening contributions from dislocation-particle attractive interaction and load transfer. The observed creep rate was in order of 10 -9 s -1 for longer time creep test of Ni-20Cr -1.2Y 2 O 3 -5Al 2 O 3 , lending support to the overall approach pursued in this project.

36 MATERIALS SCIENCE↗

Optimal control computer programs

The solution of the optimal control problem, even with low order dynamical systems, can usually strain the analytical ability of most engineers. The understanding of this subject matter, therefore, would be greatly enhanced if a software package existed that could simulate simple generic problems. Surprisingly, despite a great abundance of commercially available control software, few, if any, address the part of optimal control in its most generic form. The purpose of this paper is, therefore, to present a simple computer program that will perform simulations of optimal control problems that arise from the first necessary condition and the Pontryagin's maximum principle.

Kuo, F.↗

Applying optimization software libraries to engineering problems

Nonlinear programming, preliminary design problems, performance simulation problems trajectory optimization, flight computer optimization, and linear least squares problems are among the topics covered. The nonlinear programming applications encountered in a large aerospace company are a real challenge to those who provide mathematical software libraries and consultation services. Typical applications include preliminary design studies, data fitting and filtering, jet engine simulations, control system analysis, and trajectory optimization and optimal control. Problem sizes range from single-variable unconstrained minimization to constrained problems with highly nonlinear functions and hundreds of variables. Most of the applications can be posed as nonlinearly constrained minimization problems. Highly complex optimization problems with many variables were formulated in the early days of computing. At the time, many problems had to be reformulated or bypassed entirely, and solution methods often relied on problem-specific strategies. Problems with more than ten variables usually went unsolved.

Healy, M. J.↗

Trace-Driven Memory Access Pattern Recognition in Computational Kernels. In: WOSC '14 Proceedings of the Second Workshop on Optimizing Stencil Computations

Classifying memory access patterns is paramount to the selection of the right set of optimizations and determination of the parallelization strategy. Static analyses suffer from ambiguities present in source code, which modern compilation techniques, such as profile-guided optimization, alleviate by observing runtime behavior and feeding back into the compilation flow. This paper discusses a dynamic analysis technique for recognizing memory access patterns, with application to the stencils domain, and presents our design and C++ implementation using the memory-tracing tool Gleipnir. Finally, we evaluate and discuss the performance and matching capability of our classifiers in the context of the Polybench scientific benchmark suite, which includes both stencil and matrix computations.

Park, Eunjung↗

Stored program concept for analog computers

Optimization of three-stage matrices, modularization, and black boxes design techniques provides for automatically interconnecting computing component inputs and outputs in general purpose analog computer. Design also produces relatively inexpensive and less complex automatic patching system.

Hannauer, G., III↗

What Composition of High-Energy Physics Collaborations is Epistemically Optimal?

Computer simulations have recently come to the fore as a crucial tool for studying epistemic dynamics of scientific collectives. One pressing issue in big-ticket, long-term, and crowded particle physics research is the optimal organization of collaborations. This research developed a computation model of collaborations in high-energy physics and performed simulations to investigate the epistemic efficiency of groups and its dependence on the size of such groups and their composition: namely, percentages of pure, partially theoretically competent, and fully theoretically competent experimentalists. The present study reveals that in both small (100-member) and large (3000-member) groups, epistemic payoff as the measure of epistemic efficiency of collaborations is, generally, positively correlated with an increase in both the number of theoretically fully competent and pure (incompetent) experimentalists. Here, we are less certain of such conclusion in the case of the small collaborations. Although the subcommunity of experimentalists who are partially expert is not found to be immediately epistemically beneficial for collaborations, nevertheless they also crucially serve as a transitional community between the theorists and the experimentalists. Predicated on the toy model simulations, I suggest that institutions should provide measures to assist members of the latter subgroup in progressing toward developing a full theoretical expertise.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Computer program optimizes design of nuclear radiation shields

Computer program, OPEX 2, determines minimum weight, volume, or cost for shields. Program incorporates improved coding, simplified data input, spherical geometry, and an expanded output. Method is capable of altering dose-thickness relationship when a shield layer has been removed.

Lahti, G. P.↗

Computational wing optimization and comparisons with experiment for a semi-span wing model

A computational wing optimization procedure was developed and verified by an experimental investigation of a semi-span variable camber wing model in the NASA Ames Research Center 14 foot transonic wind tunnel. The Bailey-Ballhaus transonic potential flow analysis and Woodward-Carmichael linear theory codes were linked to Vanderplaats constrained minimization routine to optimize model configurations at several subsonic and transonic design points. The 35 deg swept wing is characterized by multi-segmented leading and trailing edge flaps whose hinge lines are swept relative to the leading and trailing edges of the wing. By varying deflection angles of the flap segments, camber and twist distribution can be optimized for different design conditions. Results indicate that numerical optimization can be both an effective and efficient design tool. The optimized configurations had as good or better lift to drag ratios at the design points as the best designs previously tested during an extensive parametric study.

Waggoner, E. G.↗