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 883 records · Page 49

Synthesis of multiple shaped beam antenna patterns

Results are presented of research into the problem of finding an excitation of a given antenna such that the desired radiation pattern is approximated to within acceptable limits. This is to be done in such a fashion that boundary conditions involving hardware limitations may be inserted into the problem. The intended application is synthesis of multiple shaped beam antennas. Since this is perhaps the most difficult synthesis problem an antenna engineer is likely to encounter, the approach taken was to include as a by-product capability for synthesizing simpler patterns. The synthesis technique has been almost totally computerized. The class of antennas which may be synthesized with the computer program are those which may be represented as planar (continuous or discrete) current distributions. The technique is not limited in this sense and could indeed by extended to include, for example, the synthesis of conformal arrays or current distributions on the surface of reflectors. The antenna types which the program is set up to synthesize are: line source, rectangular aperture, circular aperture, linear array, rectangular array, and arbitrary planar array.

Stutzman, W. L.↗

Extending quantum operations

For a given set of input-output pairs of quantum states or observables, we ask the question whether there exists a physically implementable transformation that maps each of the inputs to the corresponding output. The physical maps on quantum states are trace-preserving completely positive maps, but we also consider variants of these requirements. We generalize the definition of complete positivity to linear maps defined on arbitrary subspaces, then formulate this notion as a semidefinite program, and relate it by duality to approximative extensions of this map. This gives a characterization of the maps which can be approximated arbitrarily well as the restriction of a map that is completely positive on the whole algebra, also yielding the familiar extension theorems on operator spaces. For quantum channel extensions and extensions by probabilistic operations we obtain semidefinite characterizations, and we also elucidate the special case of Abelian inputs or outputs. Finally, revisiting a theorem by Alberti and Uhlmann, we provide simpler and more widely applicable conditions for certain extension problems on qubits, and by using a semidefinite programming formulation we exhibit counterexamples to seemingly reasonable but false generalizations of the Alberti-Uhlmann theorem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A communication-avoiding 3D sparse triangular solver

We present a novel distributed memory algorithm to improve the strong scalability of the solution of a sparse triangular system. This operation appears in the solve phase of direct methods for solving general sparse linear systems, Ax = b. Our 3D sparse triangular solver employs several techniques, including a 3D MPI process grid, elimination tree parallelism, and data replication, all of which reduce the per-process communication when combined. We present analytical models to understand the communication cost of our algorithm and show that our 3D sparse triangular solver can reduce the per-process communication volume asymptotically by a factor of O(n1/4) and O(n1/6) for problems arising from the finite element discretizations of 2D "planar" and 3D "non-planar" PDEs, respectively. We implement our algorithm for use in SuperLU_DIST3D, using a hybrid MPI+OpenMP programming model. Our 3D triangular solve algorithm, when run on 12k cores of Cray XC30, outperforms the current state-of-the-art 2D algorithm by 7.2x for planar and 2.7x for the non-planar sparse matrices, respectively.

Sao, Piyush↗

Sensitivity Analysis of Flutter Response of a Wing Incorporating Finite-Span Corrections

Flutter analysis of a wing is performed in compressible flow using state-space representation of the unsteady aerodynamic behavior. Three different expressions are used to incorporate corrections due to the finite-span effects of the wing in estimating the lift-curve slope. The structural formulation is based on a Rayleigh-Pitz technique with Chebyshev polynomials used for the wing deflections. The aeroelastic equations are solved as an eigen-value problem to determine the flutter speed of the wing. The flutter speeds are found to be higher in these cases, when compared to that obtained without accounting for the finite-span effects. The derivatives of the flutter speed with respect to the shape parameters, namely: aspect ratio, area, taper ratio and sweep angle, are calculated analytically. The shape sensitivity derivatives give a linear approximation to the flutter speed curves over a range of values of the shape parameter which is perturbed. Flutter and sensitivity calculations are performed on a wing using a lifting-surface unsteady aerodynamic theory using modules from a system of programs called FAST.

Issac, Jason Cherian↗

Balancing Power Absorption Against Structural Loads With Viscous Drag and Power-Takeoff Efficiency Considerations

The focus of this paper is to balance power absorption against structural loading for a novel fixed-bottom oscillating surge wave energy converter in both regular and irregular wave environments. The power-to-load ratio will be evaluated using pseudospectral control (PSC) to determine the optimum power-takeoff (PTO) torque based on a multiterm objective function. This paper extends the pseudospectral optimal control problem to not just maximize the time-averaged absorbed power but also include measures for the surge-foundation force and PTO torque in the optimization. The objective function may now potentially include three competing terms that the optimizer must balance. Separate weighting factors are attached to the surge-foundation force and PTO control torque that can be used to tune the optimizer performance to emphasize either power absorption or load shedding. To correct the pitch equation of motion, derived from linear hydrodynamic theory, a quadratic-viscous-drag torque has been included in the system dynamics; however, to continue the use of quadratic programming solvers, an iteratively obtained linearized drag coefficient was utilized that provided good accuracy in the predicted pitch motion. Furthermore, the analysis considers the use of a nonideal PTO unit to more accurately evaluate controller performance. The PTO efficiency is not directly included in the objective function but rather the weighting factors are utilized to limit the PTO torque amplitudes, thereby reducing the losses resulting from the bidirectional energy flow through a nonideal PTO. Furthermore, results from PSC show that shedding a portion of the available wave energy can lead to greater reductions in structural loads, peak-to-average power ratio, and reactive power requirement.

16 TIDAL AND WAVE POWER↗

Systems identification using a modified Newton-Raphson method: A FORTRAN program

A FORTRAN program is offered which computes a maximum likelihood estimate of the parameters of any linear, constant coefficient, state space model. For the case considered, the maximum likelihood estimate can be identical to that which minimizes simultaneously the weighted mean square difference between the computed and measured response of a system and the weighted square of the difference between the estimated and a priori parameter values. A modified Newton-Raphson or quasilinearization method is used to perform the minimization which typically requires several iterations. A starting technique is used which insures convergence for any initial values of the unknown parameters. The program and its operation are described in sufficient detail to enable the user to apply the program to his particular problem with a minimum of difficulty.

Taylor, L. W., Jr.↗

Juqbox.jl

The Juqbox.jl package implements functionality for solving the quantum optimal control problem for realizing logical gates in closed quantum systems. The dynamics of the quantum system is modeled by Schroedinger's equation, which takes to form of a linear system of ordinary differential equations (ODE). Juqbox.jl solves this ODE by numerical time stepping and applies a gradient-based optimization technique to determine control pulses for driving an initial state to a final state, according to the desired logical gate transformation. To evaluate the gradient, Juqbox.jl applies the ``first discretize, then optimize'' approach based on a discrete adjoint time stepping technique. The actual optimization is performed by the open source Ipopt libaray. Juqbox.jl is written in the Julia programming language which, among many other features, provides a convenient interface to the Ipopt library.

PETERSSON, NILSA.↗

Cascade Optimization for Aircraft Engines With Regression and Neural Network Analysis - Approximators

The NASA Engine Performance Program (NEPP) can configure and analyze almost any type of gas turbine engine that can be generated through the interconnection of a set of standard physical components. In addition, the code can optimize engine performance by changing adjustable variables under a set of constraints. However, for engine cycle problems at certain operating points, the NEPP code can encounter difficulties: nonconvergence in the currently implemented Powell's optimization algorithm and deficiencies in the Newton-Raphson solver during engine balancing. A project was undertaken to correct these deficiencies. Nonconvergence was avoided through a cascade optimization strategy, and deficiencies associated with engine balancing were eliminated through neural network and linear regression methods. An approximation-interspersed cascade strategy was used to optimize the engine's operation over its flight envelope. Replacement of Powell's algorithm by the cascade strategy improved the optimization segment of the NEPP code. The performance of the linear regression and neural network methods as alternative engine analyzers was found to be satisfactory. This report considers two examples-a supersonic mixed-flow turbofan engine and a subsonic waverotor-topped engine-to illustrate the results, and it discusses insights gained from the improved version of the NEPP code.

Patnaik, Surya N.↗

On Deployment of Multiple Base Stations for Energy-Efficient Communication in Wireless Sensor Networks

Data transmission from sensor nodes to a base station or a sink node often incurs significant energy consumption, which critically affects network lifetime. We generalize and solve the problem of deploying multiple base stations to maximize network lifetime in terms of two different metrics under one-hop and multihop communication models. In the one-hop communication model, the sensors far away from base stations always deplete their energy much faster than others. We propose an optimal solution and a heuristic approach based on the minimal enclosing circle algorithm to deploy a base station at the geometric center of each cluster. In the multihop communication model, both base station location and data routing mechanism need to be considered in maximizing network lifetime. We propose an iterative algorithm based on rigorous mathematical derivations and use linear programming to compute the optimal routing paths for data transmission. Simulation results show the distinguished performance of the proposed deployment algorithms in maximizing network lifetime.

Lin, Yunyue↗

Development of a moderately sized finite element program for nonlinear structural analysis

AGGIE 1 is a computer program for predicting the linear and nonlinear, static and dynamic structural response of two- and three-dimensional continuum solids. The program is based on isoparametric finite elements and allows for 2-D plane stress, plane strain, and axisymmetric analyses and general 3-D analyses. Large strain kinematics is based on the total Lagrangian formulation. Materially nonlinear models include several elastic-plastic work-hardening models as well as an incompressible Mooney-Rivlin model. Included in this report is a brief description of the theoretical bases of the program, the material models used, the element library and the overall program organization. Instructions for data input preparation are given in detail. Several sample problems are given along with the required program input and program generated solutions.

Haisler, W. E.↗

High Performance Computing Modeling Advances Accelerator Science for High-Energy Physics

The development and optimization of particle accelerators are essential for advancing our understanding of the properties of matter, energy, space, and time. Particle accelerators are complex devices whose behavior involves many physical effects on multiple scales. Therefore, advanced computational tools utilizing high-performance computing are essential for accurately modeling them. In the past decade, the US Department of Energy's SciDAC program has produced accelerator-modeling tools that have been employed to tackle some of the most difficult accelerator science problems. The authors discuss the Synergia framework and its applications to high-intensity particle accelerator physics. Synergia is an accelerator simulation package capable of handling the entire spectrum of beam dynamics simulations. Our authors present Synergia's design principles and its performance on HPC platforms.

43 PARTICLE ACCELERATORS↗

Automatic Code Generation for High-Performance Graph Algorithms

Graph problems are common across fields of scientific computing and social sciences. However, despite their importance, implementing graph algorithms effectively on modern computing systems is a challenging task that requires significant programming effort and generally results in customized implementations. Current computing and memory hierarchies are not architected for irregular computations resulting in challenges for graph algorithms to achieve high performance on those architectures. In this paper, we present GraphX, a novel compiler framework and DSL designed to simplify the development of efficient graph algorithms and achieve high performance on modern computing systems. GraphX consists of a DSL for efficient implementation of graph algorithms, various optimizations, such as support for sparse linear algebra and workspace transformations, optimized graph primitives, including semiring and masking, and a high-performance code generation engine. Using GraphX, users can implement graph algorithms using a semantically-rich language with graph-oriented operators. GraphX uses these semantics to automatically generate efficient code for target architectures, increasing performance and portability across architectures. The composable nature of GraphX makes it possible to extend the set of optimizations and architectures without modifying the source code. We demonstrate GraphX outperforms state-of-the-art graph libraries, such as LAGraph, up to $3.7 speedup in semiring operations, $2.19 speedup in an important sparse computational kernel, and $9.05 speedup in graph processing algorithms.

compiler, graph algorithms, semiring, masking, wor↗

The expanded LaGrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrainted optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗

The expanded Lagrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrained optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗

RF Breakdown in Magnetic Fields: Previous Work, Recent Theory, and Future Plans

Recent experiments on the breakdown of rf cavities revealed severe surface damage and a reduction of the maximum accelerating gradient after operation in an external magnetic field. This finding implies the possibility of serious problems for cooling lattices wherein rf cavities and external magnetic fields coexist, such as those of the proposed neutrino factory and muon collider. An experimental program that could study those problems and their possible solutions is discussed. Emphasis is given to a magnetically insulated cavity design in which the walls are parallel to the magnetic field lines and consequently damage from field emission is expected to be suppressed.

43 PARTICLE ACCELERATORS↗

TOUGHREACT User's Guide: A Simulation Program for Non-isothermal Multiphase Reactive Geochemical Transport in Variably Saturated Geologic Media, V1.2.1

Coupled modeling of subsurface multiphase fluid and heat flow, solute transport, and chemical reactions can be applied to many geologic systems and environmental problems, including geothermal systems, diagenetic and weathering processes, subsurface waste disposal, acid mine drainage remediation, contaminant transport, and groundwater quality. TOUGHREACT has been developed as a comprehensive non-isothermal multi-component reactive fluid flow and geochemical transport simulator to investigate these and other problems. A number of subsurface thermo-physical-chemical processes are considered under various thermohydrological and geochemical conditions of pressure, temperature, water saturation, and ionic strength. TOUGHREACT can be applied to one-, two- or three-dimensional porous and fractured media with physical and chemical heterogeneity. The code can accommodate any number of chemical species present in liquid, gas and solid phases. A variety of equilibrium chemical reactions are considered, such as aqueous complexation, gas dissolution/exsolution, and cation exchange. Mineral dissolution/precipitation can take place subject to either local equilibrium or kinetic controls, with coupling to changes in porosity and permeability and capillary pressure in unsaturated systems. Chemical components can also be treated by linear adsorption and radioactive decay. The first version of the non-isothermal reactive geochemical transport code TOUGHREACT was developed (Xu and Pruess, 1998) by introducing reactive geochemistry into the framework of the existing multi-phase fluid and heat flow code TOUGH2 (Pruess, 1991). TOUGHREACT was further enhanced with the addition of (1) treatment of mineral-water-gas reactive-transport under boiling conditions, (2) an improved HKF activity model for aqueous species, (3) gas species diffusion coefficients calculated as a function of pressure, temperature, and molecular properties, (4) mineral reactive surface area formulations for fractured and porous media, and (5) porosity, permeability, and capillary pressure changes owing to mineral precipitation/dissolution (Sonnenthal et al., 1998, 2000, 2001; Spycher et al., 2003a). Subsequently, TOUGH2 V2 was released with additional EOS modules and features (Pruess et al., 1999). The present version of TOUGHREACT includes all of the previous extensions to the original version, along with the replacement of the original TOUGH2 (Pruess, 1991) by TOUGH2 V2 (Pruess et al., 1999). TOUGHREACT has been applied to a wide variety of problems, some of which are included as examples, such as: (1) Supergene copper enrichment (Xu et al., 2001); (2) Mineral alteration in hydrothermal systems (Xu and Pruess, 2001a; Xu et al., 2004b; Dobson et al., 2004); (3) Mineral trapping for CO{sub 2} disposal in deep saline aquifers (Xu et al., 2003b and 2004a); (4) Coupled thermal, hydrological, and chemical processes in boiling unsaturated tuff for the proposed nuclear waste emplacement site at Yucca Mountain, Nevada (Sonnenthal et al., 1998, 2001; Sonnenthal and Spycher, 2000; Spycher et al., 2003a, b; Xu et al., 2001); (5) Modeling of mineral precipitation/dissolution in plug-flow and fracture-flow experiments under boiling conditions (Dobson et al., 2003); (6) Calcite precipitation in the vadose zone as a function of net infiltration (Xu et al., 2003); and (7) Stable isotope fractionation in unsaturated zone pore water and vapor (Singleton et al., 2004). The TOUGHREACT program makes use of 'self-documenting' features. It is distributed with a number of input data files for sample problems. Besides providing benchmarks for proper code installation, these can serve as a self-teaching tutorial in the use of TOUGHREACT, and they provide templates to help jump-start new applications. The fluid and heat flow part of TOUGHREACT is derived from TOUGH2 V2, so in addition to the current manual, users must have the manual of the TOUGH2 V2 (Pruess et al., 1999). The present version of TOUGHREACT provides the following TOUGH2 fluid property or 'EOS' (equation-of-state) modules: (1) EOS1 for water, or two waters with typical applications to hydrothermal problems, (2) EOS2 for multiphase mixtures of water and CO{sub 2} also with typical applications to hydrothermal problems, (3) EOS3 for multiphase mixtures of water and air with typical applications to vadose zone and nuclear waste disposal problems, (4) EOS4 that has the same capabilities as EOS3 but with vapor pressure lowering effects due to capillary pressure, (5) EOS9 for single phase water (Richards equation) with typical applications to ambient temperature and pressure reactive geochemical transport problems, and (6) ECO2N for multiphase mixtures of water, CO{sub 2} and NaCl with typical applications to CO{sub 2} disposal in deep brine aquifers.

54 ENVIRONMENTAL SCIENCES↗

Coordination of Wind Farm and Pumped-Storage Hydro for a Self-Healing Power Grid

The increasing penetration of wind energy poses great challenges to the operation of power systems in normal and emergency states. However, energy storage technologies can help accommodate wind power uncertainty and variability due to their flexible characteristics. This paper focuses on the restoration phase, and provides a novel coordination strategy of wind and pumped-storage hydro (PSH) units for a faster and reliable self-healing process. The wind-PSH assisted power system restoration is formulated as a two-stage adaptive robust optimization problem. The first-stage problem determines the start-up sequence of generators and the energization times of transmission paths; and the second-stage problem decides load pickup sequences, wind power dispatch levels, and PSH units' operating modes. The column-and-constraint generation decomposition algorithm is applied to solve the two-stage adaptive robust optimization problem, which has a mixed-integer optimization in the inner-level problem. The developed coordination strategy is tested on the modified IEEE 39-bus system. Numerical results demonstrate that the coordinated wind and PSH units can increase the total energy served, enhance wind power dispatchability, and reduce wind power curtailment.

17 WIND ENERGY↗

Integrated Composite Analyzer (ICAN): Users and programmers manual

The use of and relevant equations programmed in a computer code designed to carry out a comprehensive linear analysis of multilayered fiber composites is described. The analysis contains the essential features required to effectively design structural components made from fiber composites. The inputs to the code are constituent material properties, factors reflecting the fabrication process, and composite geometry. The code performs micromechanics, macromechanics, and laminate analysis, including the hygrothermal response of fiber composites. The code outputs are the various ply and composite properties, composite structural response, and composite stress analysis results with details on failure. The code is in Fortran IV and can be used efficiently as a package in complex structural analysis programs. The input-output format is described extensively through the use of a sample problem. The program listing is also included. The code manual consists of two parts.

Murthy, P. L. N.↗