Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear programming 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.

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

At least 919 records · Page 51

Towards Automated Memory Model Generation Via Event Tracing

The importance of memory performance and capacity is a growing concern for high performance computing laboratories around the world. It has long been recognized that improvements in processor speed exceed the rate of improvement in dynamic random access memory speed and, as a result, memory access times can be the limiting factor in high performance scientific codes. The use of multi-core processors exacerbates this problem with the rapid growth in the number of cores not being matched by similar improvements in memory capacity, increasing the likelihood of memory contention. In this paper, we present WMTools , a lightweight memory tracing tool and analysis framework for parallel codes, which is able to identify peak memory usage and also analyse per-function memory use over time. An evaluation of WMTools , in terms of its effectiveness and also its overheads, is performed using nine established scientific applications/benchmark codes representing a variety of programming languages and scientific domains. We also show how WMTools can be used to automatically generate a parameterized memory model for one of these applications, a two-dimensional non-linear magnetohydrodynamics application, Lare2D . Through the memory model we are able to identify an unexpected growth term which becomes dominant at scale. With a refined model we are able to predict memory consumption with under 7% error.

97 MATHEMATICS AND COMPUTING↗

Software Synthesis for High Productivity Exascale Computing

Over the three years of our project, we accomplished three key milestones: We demonstrated how ideas from generative programming and software synthesis can help support the development of bulk-synchronous distributed memory kernels. These ideas are realized in a new language called MSL, a C-like language that combines synthesis features with high level notations for array manipulation and bulk-synchronous parallelism to simplify the semantic analysis required for synthesis. We also demonstrated that these high level notations map easily to low level C code and show that the performance of this generated code matches that of handwritten Fortran. Second, we introduced the idea of solver-aided domain-specific languages (SDSLs), which are an emerging class of computer-aided programming systems. SDSLs ease the construction of programs by automating tasks such as verification, debugging, synthesis, and non-deterministic execution. SDSLs are implemented by translating the DSL program into logical constraints. Next, we developed a symbolic virtual machine called Rosette, which simplifies the construction of such SDSLs and their compilers. We have used Rosette to build SynthCL, a subset of OpenCL that supports synthesis. Third, we developed novel numeric algorithms that move as little data as possible, either between levels of a memory hierarchy or between parallel processors over a network. We achieved progress in three aspects of this problem. First we determined lower bounds on communication. Second, we compared these lower bounds to widely used versions of these algorithms, and noted that these widely used algorithms usually communicate asymptotically more than is necessary. Third, we identified or invented new algorithms for most linear algebra problems that do attain these lower bounds, and demonstrated large speed-ups in theory and practice.

97 MATHEMATICS AND COMPUTING↗

Integrated Transmission-Distribution Multi-Period Switching for Wildfire Risk Mitigation: Improving Speed and Scalability with Distributed Optimization: Preprint

With increasingly severe wildfire conditions driven by climate change, utilities must manage the risk of wildfire ignitions from electric power lines. During "public safety power shutoff'" events, utilities de-energize power lines to reduce wildfire ignition risk, which may result in load shedding. Distributed energy resources provide flexibility that can help support the system to reduce load shedding when lines are de-energized. We investigate a coordinated transmission-distribution optimization problem that balances wildfire risk mitigation and load shedding. We model distribution systems that include battery energy storage systems which may support loads when transmission lines are de-energized. This multi-period integrated transmission-distribution optimal switching problem jointly optimizes line switching decisions, the generators' setpoints, load shedding, and the batteries' states of charge, resulting in significant computational challenges. To improve scalability, we decompose the problem over both space and time and apply a distributed optimization algorithm. Using a large-scale synthetic California test case with realistic distribution models and real wildfire risk data, we show that distributed optimization can solve large-scale multi-period switching problems that are otherwise intractable for centralized solvers. We also discuss challenges and future directions for improving the distributed algorithm's convergence performance as the number of time periods increases.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Melt spreading code assessment, modifications, and application to the EPR core catcher design.

The Evolutionary Power Reactor (EPR) is under consideration by various utilities in the United States to provide base load electrical production, and as a result the design is undergoing a certification review by the U.S. Nuclear Regulatory Commission (NRC). The severe accident design philosophy for this reactor is based upon the fact that the projected power rating results in a narrow margin for in-vessel melt retention by external cooling of the reactor vessel. As a result, the design addresses ex-vessel core melt stabilization using a mitigation strategy that includes: (1) an external core melt retention system to temporarily hold core melt released from the vessel; (2) a layer of 'sacrificial' material that is admixed with the melt while in the core melt retention system; (3) a melt plug in the lower part of the retention system that, when failed, provides a pathway for the mixture to spread to a large core spreading chamber; and finally, (4) cooling and stabilization of the spread melt by controlled top and bottom flooding. The overall concept is illustrated in Figure 1.1. The melt spreading process relies heavily on inertial flow of a low-viscosity admixed melt to a segmented spreading chamber, and assumes that the melt mass will be distributed to a uniform height in the chamber. The spreading phenomenon thus needs to be modeled properly in order to adequately assess the EPR design. The MELTSPREAD code, developed at Argonne National Laboratory, can model segmented, and both uniform and nonuniform spreading. The NRC is thus utilizing MELTSPREAD to evaluate melt spreading in the EPR design. MELTSPREAD was originally developed to support resolution of the Mark I containment shell vulnerability issue. Following closure of this issue, development of MELTSPREAD ceased in the early 1990's, at which time the melt spreading database upon which the code had been validated was rather limited. In particular, the database that was utilized for initial validation consisted of: (1) comparison to an analytical solution for the dam break problem, (2) water spreading tests in a 1/10 linear scale model of the Mark I containment by Theofanous et al., and (3) steel spreading tests by Suzuki et al. that were also conducted in a geometry similar to the Mark I. The objective of this work was to utilize the MELTSPREAD code to check the assumption of uniform melt spreading in the EPR core catcher design. As a starting point for the project, the code was validated against the worldwide melt spreading database that emerged after the code was originally written in the very early 1990's. As part of this exercise, the code was extensively modified and upgraded to incorporate findings from these various analytical and experiment programs. In terms of expanding the ability of the code to analyze various melt simulant experiments, the options to input user-specified melt and/or substrate material properties was added. The ability to perform invisicid and/or adiabatic spreading analysis was also added so that comparisons with analytical solutions and isothermal spreading tests could be carried out. In terms of refining the capability to carry out reactor material melt spreading analyses, the code was upgraded with a new melt viscosity model; the capability was added to treat situations in which solid fraction buildup between the liquidus-solidus is non-linear; and finally, the ability to treat an interfacial heat transfer resistance between the melt and substrate was incorporated. This last set of changes substantially improved the predictive capability of the code in terms of addressing reactor material melt spreading tests. Aside from improvements and upgrades, a method was developed to fit the model to the various melt spreading tests in a manner that allowed uncertainties in the model predictions to be statistically characterized. With these results, a sensitivity study was performed to investigate the assumption of uniform spreading in the EPR core catcher that addressed parametric variations in: (1) melt pour mass, (2) melt composition, (3) melt pour rate, (4) pour configuration (i.e., homogeneous vs. stratified metal-oxide phases), (5) melt temperature, (6) cavity condition (wet vs. dry), (7) spreading channel inclination angle, and finally (8) uncertainties in the melt viscosity correlation that are based on comparisons with the reactor material melt spreading database. Although differences were found in the rate of spreading and the degree to which the sacrificial concrete in the spreading room is ablated during the transients, in all cases the melt eventually (over a period of minutes) spreads to a uniform depth in the system.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A time dependent difference theory for sound propagation in ducts with flow

A time dependent numerical solution of the linearized continuity and momentum equation is developed for sound propagation in a two-dimensional straight hard or soft wall duct with a sheared mean flow. The time dependent governing acoustic-difference equations and boundary conditions are developed along with a numerical determination of the maximum stable time increments. The analysis begins with a harmonic noise source radiating into a quiescent duct. This explicit iteration method then calculates stepwise in real time to obtain the transient as well as the 'steady' state solution of the acoustic field. Example calculations are presented for sound propagation in hard and soft wall ducts, with no flow and with plug flow. Although the problem with sheared flow has been formulated and programmed, sample calculations have not yet been examined. So far, the time dependent finite difference analysis has been found to be superior to the steady state finite difference and finite element techniques because of shorter solution times and the elimination of large matrix storage requirements.

Baumeister, K. J.↗

The Use of Efficient Broadcast Protocols in Asynchronous Distributed Systems

Reliable broadcast protocols are important tools in distributed and fault-tolerant programming. They are useful for sharing information and for maintaining replicated data in a distributed system. However, a wide range of such protocols has been proposed. These protocols differ in their fault tolerance and delivery ordering characteristics. There is a tradeoff between the cost of a broadcast protocol and how much ordering it provides. It is, therefore, desirable to employ protocols that support only a low degree of ordering whenever possible. This dissertation presents techniques for deciding how strongly ordered a protocol is necessary to solve a given application problem. It is shown that there are two distinct classes of application problems: problems that can be solved with efficient, asynchronous protocols, and problems that require global ordering. The concept of a linearization function that maps partially ordered sets of events to totally ordered histories is introduced. How to construct an asynchronous implementation that solves a given problem if a linearization function for it can be found is shown. It is proved that in general the question of whether a problem has an asynchronous solution is undecidable. Hence there exists no general algorithm that would automatically construct a suitable linearization function for a given problem. Therefore, an important subclass of problems that have certain commutativity properties are considered. Techniques for constructing asynchronous implementations for this class are presented. These techniques are useful for constructing efficient asynchronous implementations for a broad range of practical problems.

Schmuck, Frank Bernhard↗

Status and outlook for NASA's Land Remote Sensing Program

Both LANDSAT 2 and LANDSAT 3 are currently in operational status following recovery from technical problems. The LANDSAT D program continues NASA's R&D with the dual objectives of assessing the capabilities of the thematic mapper sensor and evaluating the requirements for an operational land observing system. LANDSAT D' will not be launched until LANDSAT D ceases operation, to provide data continuity through 1988. Future NASA remote sensing programs will continue to emphasize research, technology development, cooperative projects with end users of data and cooperation with the National Oceanic and Atmospheric Administration (NOAA) on transition to an operational land observing system. Technology development should extend the results of research to practical applications through improved ground data processing and information extraction techniques and development of new sensors such as the solid state multi-spectral linear array.

Weinstein, R. H.↗

The linear and nonlinear response of infinite periodic systems to static and/or dynamic electric fields. Implementation in CRYSTAL code

An implementation of the vector potential approach (VPA) for treating the response of infinite periodic systems to static and dynamic electric fields has been initiated within the CRYSTAL code. The VPA method is based on the solution of a time-dependent Hartree-Fock or Kohn-Sham equation for the crystal orbitals wherein the usual scalar potential, that describes interaction with the field, is replaced by the vector potential. This equation may be solved either by perturbation theory or by finite field methods. With some modification all the computational procedures of molecular ab initio quantum chemistry can be adapted for periodic systems. Accessible properties include the linear and nonlinear responses of both the nuclei and the electrons. The programming of static field pure electronic (hyper)polarizabilities has been successfully tested. Dynamic electronic (hyper)polarizabilities, as well as infrared and Raman intensities, are in progress while the addition of finite fields for calculation of vibrational (hyper)polarizabilities, through nuclear relaxation procedures, will begin shortly.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Scalable Solution Framework for Stochastic Transmission and Generation Planning Problems. Draft

Current commercial software tools for transmission and generation investment planning have limited stochastic modeling capabilities. Because of this limitation, electric power utilities generally rely on scenario planning heuristics to identify potentially robust and cost effective investment plans for a broad range of system, economic, and policy conditions. Several research studies have shown that stochastic models perform significantly better than deterministic or heuristic approaches, in terms of overall costs. However, there is a lack of practical solution approaches to solve such models. In this paper we propose a scalable decomposition algorithm to solve stochastic transmission and generation planning problems, respectively considering discrete and continuous decision variables for transmission and generation investments. Given stochasticity restricted to loads and wind, solar, and hydro power output, we develop a simple scenario reduction framework based on a clustering algorithm, to yield a more tractable model. The resulting stochastic optimization model is decomposed on a scenario basis and solved using a variant of the Progressive Hedging (PH) algorithm. We perform numerical experiments using a 240-bus network representation of the Western Electricity Coordinating Council in the US. Although convergence of PH to an optimal solution is not guaranteed for mixed-integer linear optimization models, we find that it is possible to obtain solutions with acceptable optimality gaps for practical applications. Our numerical simulations are performed both on a commodity workstation and on a high-performance cluster. The results indicate that large-scale problems can be solved to a high degree of accuracy in at most two hours of wall clock time.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Down-to-earth supercomputing at NASA Ames

The requirements for computers for aerospace vehicle design problems, in particular fluid dynamics, are examined. The levels of approximation to Navier-Stokes equations are: (1) linearized inviscid form, (2) nonlinear inviscid equation, (3) Reynolds-averaged Navier-Stokes equation, (4) large eddy simulation with models for subgrid scale turbulence, and (5) full Navier-Stokes equations to calculate laminar/turbulent transition and turbulence dissipation. The Cray 2 with 256 megaword memory and 4.1 nsec clock and the Cray X-MP/48 with a 128 megaword memory and a 9.5 nsec clock of the Ames facility are described, and an example revealing their applicability is presented. The use of zonal methods to simulate aerodynamic flow fields numerically is discussed. Consideration is given to the development of a program for simulation of aerodynamic flow fields, the compilers, symbolic debuggers, the scheduling of multiple CPUs, and the analysis and storage of the data.

Stevens, Kenneth G., Jr.↗

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↗

A Feasibility Study for Perioperative Ventricular Tachycardia Prognosis and Detection and Noise Detection Using a Neural Network and Predictive Linear Operators

To locate the accessory pathway(s) in preexicitation syndromes, epicardial and endocardial ventricular mapping is performed during anterograde ventricular activation via accessory pathway(s) from data originally received in signal form. As the number of channels increases, it is pertinent that more automated detection of coherent/incoherent signals is achieved as well as the prediction and prognosis of ventricular tachywardia (VT). Today's computers and computer program algorithms are not good in simple perceptual tasks such as recognizing a pattern or identifying a sound. This discrepancy, among other things, has been a major motivating factor in developing brain-based, massively parallel computing architectures. Neural net paradigms have proven to be effective at pattern recognition tasks. In signal processing, the picking of coherent/incoherent signals represents a pattern recognition task for computer systems. The picking of signals representing the onset ot VT also represents such a computer task. We attacked this problem by defining four signal attributes for each potential first maximal arrival peak and one signal attribute over the entire signal as input to a back propagation neural network. One attribute was the predicted amplitude value after the maximum amplitude over a data window. Then, by using a set of known (user selected) coherent/incoherent signals, and signals representing the onset of VT, we trained the back propagation network to recognize coherent/incoherent signals, and signals indicating the onset of VT. Since our output scheme involves a true or false decision, and since the output unit computes values between 0 and 1, we used a Fuzzy Arithmetic approach to classify data as coherent/incoherent signals. Furthermore, a Mean-Square Error Analysis was used to determine system stability. The neural net based picking coherent/incoherent signal system achieved high accuracy on picking coherent/incoherent signals on different patients. The system also achieved a high accuracy of picking signals which represent the onset of VT, that is, VT immediately followed these signals. A special binary representation of the input and output data allowed the neural network to train very rapidly as compared to another standard decimal or normalized representations of the data.

Moebes, T. A.↗

A Very High Order, Adaptable MESA Implementation for Aeroacoustic Computations

Since computational efficiency and wave resolution scale with accuracy, the ideal would be infinitely high accuracy for problems with widely varying wavelength scales. Currently, many of the computational aeroacoustics methods are limited to 4th order accurate Runge-Kutta methods in time which limits their resolution and efficiency. However, a new procedure for implementing the Modified Expansion Solution Approximation (MESA) schemes, based upon Hermitian divided differences, is presented which extends the effective accuracy of the MESA schemes to 57th order in space and time when using 128 bit floating point precision. This new approach has the advantages of reducing round-off error, being easy to program. and is more computationally efficient when compared to previous approaches. Its accuracy is limited only by the floating point hardware. The advantages of this new approach are demonstrated by solving the linearized Euler equations in an open bi-periodic domain. A 500th order MESA scheme can now be created in seconds, making these schemes ideally suited for the next generation of high performance 256-bit (double quadruple) or higher precision computers. This ease of creation makes it possible to adapt the algorithm to the mesh in time instead of its converse: this is ideal for resolving varying wavelength scales which occur in noise generation simulations. And finally, the sources of round-off error which effect the very high order methods are examined and remedies provided that effectively increase the accuracy of the MESA schemes while using current computer technology.

Dydson, Roger W.↗

Hybrid programming-model strategies for GPU offloading of electronic structure calculation kernels

To address the challenge of performance portability and facilitate the implementation of electronic structure solvers, we developed the basic matrix library (BML) and Parallel, Rapid O(N), and Graph-based Recursive Electronic Structure Solver (PROGRESS) library. The BML implements linear algebra operations necessary for electronic structure kernels using a unified user interface for various matrix formats (dense and sparse) and architectures (CPUs and GPUs). Focusing on density functional theory and tight-binding models, PROGRESS implements several solvers for computing the single-particle density matrix and relies on BML. In this paper, we describe the general strategies used for these implementations on various computer architectures, using OpenMP target functionalities on GPUs, in conjunction with third-party libraries to handle performance critical numerical kernels. In this study, we demonstrate the portability of this approach and its performance in benchmark problems.

36 MATERIALS SCIENCE↗

Inelastic strain analogy for piecewise linear computation of creep residues in built-up structures

An analogy between inelastic strains caused by temperature and those caused by creep is presented in terms of isotropic elasticity. It is shown how the theoretical aspects can be blended with existing finite-element computer programs to exact a piecewise linear solution. The creep effect is determined by using the thermal stress computational approach, if appropriate alterations are made to the thermal expansion of the individual elements. The overall transient solution is achieved by consecutive piecewise linear iterations. The total residue caused by creep is obtained by accumulating creep residues for each iteration and then resubmitting the total residues for each element as an equivalent input. A typical creep law is tested for incremental time convergence. The results indicate that the approach is practical, with a valid indication of the extent of creep after approximately 20 hr of incremental time. The general analogy between body forces and inelastic strain gradients is discussed with respect to how an inelastic problem can be worked as an elastic problem.

Jenkins, Jerald M.↗

Basic research for the geodynamics program

The mathematical models of space very long base interferometry (VLBI) observables suitable for least squares covariance analysis were derived and estimatability problems inherent in the space VLBI system were explored, including a detailed rank defect analysis and sensitivity analysis. An important aim is to carry out a comparative analysis of the mathematical models of the ground-based VLBI and space VLBI observables in order to describe the background in detail. Computer programs were developed in order to check the relations, assess errors, and analyze sensitivity. In order to investigate the estimatability of different geodetic and geodynamic parameters from the space VLBI observables, the mathematical models for time delay and time delay rate observables of space VLBI were analytically derived along with the partial derivatives with respect to the parameters. Rank defect analysis was carried out both by analytical and numerical testing of linear dependencies between the columns of the normal matrix thus formed. Definite conclusions were formed about the rank defects in the system.

Source record↗

Modeling and Control for a Flexible Inverted Pendulum Robot

This report describes the tasks accomplished during Fall 2020 at the Kennedy Space Center under the scope of the Robotic Control System Design internship project. These tasks primarily supported development of an augmented adaptive control system for an inverted pendulum (IP) robotic system on a 4-wheel mobile base (Penny). This system serves as an analogue to the control problems in the flight of rockets in the initial and latter stages of launch, and methods developed as part of this research can later be applied to more complex IP systems, such as launch vehicles. To more accurately model launch vehicles, a flexible aluminum pendulum is used both on the hardware and in the simulated models. In order to capture the flexible dynamics of the system, hardware modifications were made to Penny (including installation of a rate gyro at the tip of the pendulum). Simulink models were created to control and model the hardware system, and Simscape models were created/updated to model the system in simulation. MATLAB programs were created throughout the internship to analyze data generated from hardware and simulation runs. Linear fixed-gain controllers have been applied to the simulated and hardware system, and work continues with augmenting these controllers using sensor blending and direct output adaptive control methods to improve stabilization of system states and cancel flex dynamics. In addition to describing the work done to support these modeling efforts, an Independent Research and Technology Development (IR&TD) proposal for a lunar simulation with soil deformation modeling developed during the internship is briefly described.

Nashir A Janmohamed↗

The abundances of major elements in Cas A and Tycho supernova remnants

The objective of this program was to map the abundances of major elements such as O, Si, S, and Fe in the supernova remnants, Tycho and Cas A. The approach was based upon using archival cosmic X-ray data from several space missions, notably, the Einstein Observatory, EXOSAT, ROSAT, BBSRT, and ASCA. Two of the missions, Einstein and ROSAT, had high resolution telescopes that provided excellent images, but no spectral information. Two missions with much poorer resolution telescopes, BBXRT and ASCA, gave good spectral information through pulse height of signals in their cooled solid state detector, but rather crude spatial information. Our goal was to extract spectral information from the combined analysis of the Einstein and ROSAT images of Cas A and Tycho and to verify or refine the spectral map by checking its agreement with the BBSRT or ASCA spectra results for larger regions. In particular, we note that the Einstein and ROSAT telescopes have different spectral responses. The Einstein bandwidth includes the 2-4 keV region which is absent from ROSAT. Hence, by forming linear combinations of the Einstein and ROSAT images, we are able to resolve the contributions of the 0.5-2 keV band from the 2-4 keV band. The former contains lines of O and Fe while the latter is dominated by Si and S. We correct for the expansion that has taken place in the remnants during the ten-year interval between the Einstein and ROSAT measurements, but we must assume that no significant spectral changes have occurred during that time. The analysis of the Tycho SNR was completed and the results have been published. A copy of the paper is included. The analysis of Cas A has proved to be more complicated. It is continuing with support from another program. Part of the problem may be due to difficulties in the aspect information which is needed to precisely register the ROSAT and Einstein images.

Gorenstein, P.↗