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 685 records · Page 38

Development of an integrated BEM approach for hot fluid structure interaction

The progress made toward the development of a boundary element formulation for the study of hot fluid-structure interaction in Earth-to-Orbit engine hot section components is reported. The convective viscous integral formulation was derived and implemented in the general purpose computer program GP-BEST. The new convective kernel functions, in turn, necessitated the development of refined integration techniques. As a result, however, since the physics of the problem is embedded in these kernels, boundary element solutions can now be obtained at very high Reynolds number. Flow around obstacles can be solved approximately with an efficient linearized boundary-only analysis or, more exactly, by including all of the nonlinearities present in the neighborhood of the obstacle. The other major accomplishment was the development of a comprehensive fluid-structure interaction capability within GP-BEST. This new facility is implemented in a completely general manner, so that quite arbitrary geometry, material properties and boundary conditions may be specified. Thus, a single analysis code (GP-BEST) can be used to run structures-only problems, fluids-only problems, or the combined fluid-structure problem. In all three cases, steady or transient conditions can be selected, with or without thermal effects. Nonlinear analyses can be solved via direct iteration or by employing a modified Newton-Raphson approach.

Dargush, G. F.↗

Critical issues in viscous flow computations

In developing computer programs to numerically solve the Navier-Stokes equations, the purpose of the computation must be clearly kept in mind. In the Air Force, the purpose is to provide design information on non-linear aerodynamic phenomenon for aircraft that perform throughout the flight corridor. This translates into the requirement for a computer program which can solve the time averaged compressible Navier-Stokes equations (with a turbulence model) in three dimensions for generalized geometries. The intended application of the results then controls the priorities in addressing critical issues. Recurrent problem areas encountered in the study of viscous flow include: (1) grid generation for arbitrary geometry; (2) numerical difficulties; (3) turbulence models; (4) accuracy and efficiency; and (5) smearing of discontinuities.

Hankey, W. L., Jr.↗

Next-generation Algorithms for Assessing Infrastructure Vulnerability and Optimizing System Resilience

This report summarizes the work performed under the project project Next-Generation Algorithms for Assessing Infrastructure Vulnerability and Optimizing System Resilience. The goal of the project was to improve mathematical programming-based optimization technology for infrastructure protection. In general, the owner of a network wishes to design a network a network that can perform well when certain transportation channels are inhibited (e.g. destroyed) by an adversary. These are typically bi-level problems where the owner designs a system, an adversary optimally attacks it, and then the owner can recover by optimally using the remaining network. This project funded three years of Deon Burchett's graduate research. Deon's graduate advisor, Professor Jean-Philippe Richard, and his Sandia advisors, Richard Chen and Cynthia Phillips, supported Deon on other funds or volunteer time. This report is, therefore. essentially a replication of the Ph.D. dissertation it funded in a format required for project documentation. The thesis had some general polyhedral research. This is the study of the structure of the feasible region of mathematical programs, such as integer programs. For example, an integer program optimizes a linear objective function subject to linear constraints, and (nonlinear) integrality constraints on the variables. The feasible region without the integrality constraints is a convex polygon. Careful study of additional valid constraints can significantly improve computational performance. Here is the abstract from the dissertation: We perform a polyhedral study of a multi-commodity generalization of variable upper bound flow models. In particular, we establish some relations between facets of single- and multi- commodity models. We then introduce a new family of inequalities, which generalizes traditional flow cover inequalities to the multi-commodity context. We present encouraging numerical results. We also consider the directed edge-failure resilient network design problem (DRNDP). This problem entails the design of a directed multi-commodity flow network that is capable of fulfilling a specified percentage of demands in the event that any G arcs are destroyed, where G is a constant parameter. We present a formulation of DRNDP and solve it in a branch-column-cut framework. We present computational results.

97 MATHEMATICS AND COMPUTING↗

Stochastic pre-event preparation for enhancing resilience of distribution systems

Extreme weather events are the common causes for power supply interruptions and power outages in electrical distribution systems. Improving the distribution system and enhancing its resilience is becoming crucial due to the increased frequency of extreme weather events. Preparation and allocation of multiple flexible resources, such as mobile resources, fuel resources, and labor resources before extreme weather events can mitigate the effects of extreme weather events and enhance the resilience of power distribution systems. Here, in this paper, a two-stage stochastic mixed-integer linear programming (SMILP) is proposed to optimize the preparation and resource allocation process for upcoming extreme weather events, which leads to faster and more efficient post-event restoration. The objective of the proposed two-stage SMILP is to maximize the served load and minimize the operating cost of flexible resources. The first stage in the optimization problem selects the amounts and locations of different resources. The second stage considers the operational constraints of the distribution system and repair crew scheduling constraints. The proposed stochastic pre-event preparation model is solved by a scenario decomposition method, Progressive Hedging (PH), to ease the computational complexity introduced by a large number of scenarios. Furthermore, to show the impact of solar photovoltaic (PV) generation on system resilience, three types of PV systems are considered during a power outage and the resilience improvements with different PV penetration levels are compared. Numerical results from simulations on a large-scale (more than 10,000 nodes) distribution feeder have been used to validate the effectiveness and scalability of the proposed method.

24 POWER TRANSMISSION AND DISTRIBUTION↗

SU-E-T-48: Automated Quality Assurance for XML Controlled Linacs

Purpose: To automate routine imaging QA procedures so that complying with TG 142 and TG 179 can be efficient and reliable. Methods: Two QA tests for a True Beam Linac were automatized. A Winston Lutz test as described by Lutz et al{sup 1} using the Winston Lutz test kit from BrainLab, Germany and a CBCT Image Quality test as described in TG 179 using the EMMA phantom, Siemens Medical Physics, Germany were performed in our True Beam. For each QA procedure tested, a 3 step paradigm was used. First, the data was automatically acquired using True Beam Developer Mode and XML scripting. Second, the data acquired in the first step was automatically processed using in-home grown Matlab GUIs. Third, Machine Learning algorithms were used to automatically classify the processed data and reports generated. Results: The Winston Luzt test could be performed by an experienced medical physicist in 29.0 ± 8.0 min. The same test, if automated using our paradigm, could be performed in 3.0 ± 0.1 min. In the same lieu, time could be substantially saved for image quality tests. In this case, the amount of time saved will depend on the phantoms used and the initial localization method. Additionally, machine learning algorithms could automatically identify the roots of the problems if any and possibly help reduce machine down time. Conclusion: Modern linear accelerators are equipped with advanced 2D and 3D imaging that are used for patient alignment substantially improving IGRT protocols. However, this extra complexity exponentially increases the number of QA tests needed. Using the new paradigm described above, not only bare minimum but best practice QA programs could be implemented with the same manpower. This work is supported by Varian, Palo Alto, CA.

60 APPLIED LIFE SCIENCES↗

Proceedings of the 1998 International Computational Accelerator Physics Conference

The 1998 International Computational Accelerator Physics Conference, ICAP’98, was held September 14-18, 1998, at the Monterey Convention Center in Monterey, California. The meeting continued the tradition of four earlier Computational Accelerator Physics conferences, held in La Jolla, California (1988), Los Alamos, New Mexico (1990), Pleasanton, California (1993), and Williamsburg, Virginia (1996). ICAP’98 was organized by the Stanford Linear Accelerator Center (SLAC), Los Alamos National Laboratory (LANL), and the National Energy Research Scientific Computing Center (NERSC), and received support from the U.S. Department of Energy. The aim of this conference series is to discuss recent advances in Computational Accelerator Physics and their applications to solving important problems related to present and future accelerators. The ICAP’98 program included plenary sessions on modeling challenges in next-generation accelerators, state-of-the art methods in computational accelerator physics, and a view of what high-end computing would be like in the 21st century. There were also focused sessions on accelerator design and control, modeling high intensity beam phenomena, electromagnetic modeling, advanced algorithms, software environments and libraries, visualization and graphic interfaces, modeling advanced accelerator concepts, modeling the beam-beam interaction, computing wakefields, and combined particle/field simulations. In addition to these oral sessions there was a poster session and a vendor display. Prior to the start of the technical program, a half-day tutorial on High Performance Computing was hosted by NERSC. The ICAP series recognizes that computing and, in particular, advanced computing, is playing an increasingly important role in the successful design and development of major accelerator facilities, and in research and development leading to advances in accelerator technology. We expect that this new emphasis on high-end computing will continue in future ICAP conferences.

Ko, Kwok↗

Coupled bending-torsion steady-state response of pretwisted, nonuniform rotating beams using a transfer-matrix method

Using the Newtonian method, the equations of motion are developed for the coupled bending-torsion steady-state response of beams rotating at constant angular velocity in a fixed plane. The resulting equations are valid to first order strain-displacement relationships for a long beam with all other nonlinear terms retained. In addition, the equations are valid for beams with the mass centroidal axis offset (eccentric) from the elastic axis, nonuniform mass and section properties, and variable twist. The solution of these coupled, nonlinear, nonhomogeneous, differential equations is obtained by modifying a Hunter linear second-order transfer-matrix solution procedure to solve the nonlinear differential equations and programming the solution for a desk-top personal computer. The modified transfer-matrix method was verified by comparing the solution for a rotating beam with a geometric, nonlinear, finite-element computer code solution; and for a simple rotating beam problem, the modified method demonstrated a significant advantage over the finite-element solution in accuracy, ease of solution, and actual computer processing time required to effect a solution.

Gray, Carl E., Jr.↗

Application of a new finite difference algorithm for computational aeroacoustics

Acoustic problems have become extremely important in recent years because of research efforts such as the High Speed Civil Transport program. Computational aeroacoustics (CAA) requires a faithful representation of wave propagation over long distances, and needs algorithms that are accurate and boundary conditions that are unobtrusive. This paper applies a new finite difference method and boundary algorithm to the Linearized Euler Equations (LEE). The results demonstrate the ability of a new fourth order propagation algorithm to accurately simulate the genuinely multidimensional wave dynamics of acoustic propagation in two space dimensions with the LEE. The results also show the ability of a new outflow boundary condition and fourth order algorithm to pass the evolving solution from the computational domain with no perceptible degradation of the solution remaining within the domain.

Goodrich, John W.↗

Bidding strategy for microgrid in day-ahead market based on hybrid stochastic/robust optimization

In this paper, we propose an optimal bidding strategy in the day-ahead market of a microgrid consisting of intermittent distributed generation (DG), storage, dispatchable DG and price responsive loads. The microgrid coordinates the energy consumption or production of its components and trades electricity in both the day-ahead and real-time markets to minimize its operating cost as a single entity. The bidding problem is challenging due to a variety of uncertainties, including power output of intermittent DG, load variation, day-ahead and real-time market prices. A hybrid stochastic/robust optimization model is proposed to minimize the expected net cost, i.e., expected total cost of operation minus total benefit of demand. This formulation can be solved by mixed integer linear programming. The uncertain output of intermittent DG and day-ahead market price are modeled via scenarios based on forecast results, while a robust optimization is proposed to limit the unbalanced power in real-time market taking account of the uncertainty of real-time market price. Numerical simulations on a microgrid consisting of a wind turbine, a PV panel, a fuel cell, a micro-turbine, a diesel generator, a battery and a responsive load show the advantage of stochastic optimization in addition to robust optimization.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Portable parallel stochastic optimization for the design of aeropropulsion components

This report presents the results of Phase 1 research to develop a methodology for performing large-scale Multi-disciplinary Stochastic Optimization (MSO) for the design of aerospace systems ranging from aeropropulsion components to complete aircraft configurations. The current research recognizes that such design optimization problems are computationally expensive, and require the use of either massively parallel or multiple-processor computers. The methodology also recognizes that many operational and performance parameters are uncertain, and that uncertainty must be considered explicitly to achieve optimum performance and cost. The objective of this Phase 1 research was to initialize the development of an MSO methodology that is portable to a wide variety of hardware platforms, while achieving efficient, large-scale parallelism when multiple processors are available. The first effort in the project was a literature review of available computer hardware, as well as review of portable, parallel programming environments. The first effort was to implement the MSO methodology for a problem using the portable parallel programming language, Parallel Virtual Machine (PVM). The third and final effort was to demonstrate the example on a variety of computers, including a distributed-memory multiprocessor, a distributed-memory network of workstations, and a single-processor workstation. Results indicate the MSO methodology can be well-applied towards large-scale aerospace design problems. Nearly perfect linear speedup was demonstrated for computation of optimization sensitivity coefficients on both a 128-node distributed-memory multiprocessor (the Intel iPSC/860) and a network of workstations (speedups of almost 19 times achieved for 20 workstations). Very high parallel efficiencies (75 percent for 31 processors and 60 percent for 50 processors) were also achieved for computation of aerodynamic influence coefficients on the Intel. Finally, the multi-level parallelization strategy that will be needed for large-scale MSO problems was demonstrated to be highly efficient. The same parallel code instructions were used on both platforms, demonstrating portability. There are many applications for which MSO can be applied, including NASA's High-Speed-Civil Transport, and advanced propulsion systems. The use of MSO will reduce design and development time and testing costs dramatically.

Sues, Robert H.↗

Towards High-Assurance High-Performance Program Synthesis

Domain-specific automatic program synthesis tools, also called application generators, are playing an ever-increasing role in software development. However, high-performance application generators require difficult manual construction, and are very difficult to verify correct. This paper describes research and an implemented system that transforms program synthesis tools based on deductive synthesis into high-performance application generators. Deductive synthesis uses theorem-proving to construct solutions when given problem specifications. The verification condition for a deductive synthesis tool is essentially the soundness of the implemented inference rules. Theory Operationalization for Program Synthesis (TOPS) synergistically combines reformulation, automated mathematical classification, and compilation through partial deduction to decision procedures. It transforms general-purpose deductive synthesis, with exponential performance, into efficient special-purpose deductive synthesis, with near-linear performance. This paper describes our experience with and empirical results of PD(TH) theory-based partial deduction - in which partial deduction of a set of first-order formulae is performed within the context of a background theory. The implemented TOPS system currently performs a special variant of PD(TH) in which the compilation process results in the transformation of a set of first order formulae into the theory of an instantiated library decision procedure augmented by a compiled unit theory.

Lowry, Michael↗

Bi-Level Dynamic Optimization with Feedback

This paper considers a bi-level real-time algorithmic framework for networked systems, consisting of several local controllers and a central controller. The central controller issues setpoints to the local controllers to optimize their operational objectives while satisfying system-wide constraints. In this context, the paper develops an online algorithm for tracking the optimal solution of the underlying dynamic optimization problem. The design of the algorithm is based on a projected-gradient method, suitably modified to accommodate appropriate measurements (i.e., feedback). Optimality claims are established in terms of the dynamic regret of the algorithm; the latter is a natural performance criterion in nonstationary environments associated with real-time control problems. Finally, the application of the algorithm to real-time control of power setpoints in an electrical grid is illustrated.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Semidefinite programming algorithm for the quantum mechanical bootstrap

Here, we present a semidefinite programming algorithm to find eigenvalues of Schrödinger operators within the bootstrap approach to quantum mechanics. The bootstrap approach involves two ingredients: a nonlinear set of constraints on the variables (expectation values of operators in an energy eigenstate), plus positivity constraints (unitarity) that need to be satisfied. By fixing the energy we linearize all the constraints and show that the feasibility problem can be presented as an optimization problem for the variables that are not fixed by the constraints and one additional slack variable that measures the failure of positivity. To illustrate the method we are able to obtain high-precision, sharp bounds on eigenenergies for arbitrary confining polynomial potentials in one dimension.

97 MATHEMATICS AND COMPUTING↗

BUCLAP2: A computer program for instability analysis of laminated long plates subjected to combined inplane loads. User's manual

The usage of the computer program BUCLAP2 is described. The program is intended for linear instability analysis of long, rectangular flat and curved laminated plates with arbitrary orientation of orthotropic axes in each layer. The loadings considered are combinations of inplane normal and shear loads. Arbitray elastic boundary conditions are included for the sides of the plate Instructions for use of the program are included along with Input data requirements, output information, and sample problems. For program description, see .

Halstead, D. W.↗

A finite difference method for the solution of the transonic flow around harmonically oscillating wings

A finite difference method for the solution of the transonic flow about a harmonically oscillating wing is presented. The partial differential equation for the unsteady transonic flow was linearized by dividing the flow into separate steady and unsteady perturbation velocity potentials and by assuming small amplitudes of harmonic oscillation. The resulting linear differential equation is of mixed type, being elliptic or hyperbolic whereever the steady flow equation is elliptic or hyperbolic. Central differences were used for all derivatives except at supersonic points where backward differencing was used for the streamwise direction. Detailed formulas and procedures are described in sufficient detail for programming on high speed computers. To test the method, the problem of the oscillating flap on a NACA 64A006 airfoil was programmed. The numerical procedure was found to be stable and convergent even in regions of local supersonic flow with shocks.

Ehlers, E. F.↗

An outflow acoustic boundary condition for internal duct flows

A boundary condition for the linear acoustic equation has been developed that allows the acoustic pressure waves to propagate out of the computational domain boundary, just as they would propagate in an infinitely long duct. The problem is divided into two domains: numerical and analytical. The boundary condition provides a matching of the two domains. Examples show this method works well in an acoustic panel program for a model problem (simple source in a rectangular duct with several propagating modes present). The boundary condition is described so that it can be used with various duct various duct geometries and numerical methods.

Mosher, M.↗

Probabilistic finite elements for transient analysis in nonlinear continua

The probabilistic finite element method (PFEM), which is a combination of finite element methods and second-moment analysis, is formulated for linear and nonlinear continua with inhomogeneous random fields. Analogous to the discretization of the displacement field in finite element methods, the random field is also discretized. The formulation is simplified by transforming the correlated variables to a set of uncorrelated variables through an eigenvalue orthogonalization. Furthermore, it is shown that a reduced set of the uncorrelated variables is sufficient for the second-moment analysis. Based on the linear formulation of the PFEM, the method is then extended to transient analysis in nonlinear continua. The accuracy and efficiency of the method is demonstrated by application to a one-dimensional, elastic/plastic wave propagation problem. The moments calculated compare favorably with those obtained by Monte Carlo simulation. Also, the procedure is amenable to implementation in deterministic FEM based computer programs.

Liu, W. K.↗

Monolithic ceramic analysis using the SCARE program

The Structural Ceramics Analysis and Reliability Evaluation (SCARE) computer program calculates the fast fracture reliability of monolithic ceramic components. The code is a post-processor to the MSC/NASTRAN general purpose finite element program. The SCARE program automatically accepts the MSC/NASTRAN output necessary to compute reliability. This includes element stresses, temperatures, volumes, and areas. The SCARE program computes two-parameter Weibull strength distributions from input fracture data for both volume and surface flaws. The distributions can then be used to calculate the reliability of geometrically complex components subjected to multiaxial stress states. Several fracture criteria and flaw types are available for selection by the user, including out-of-plane crack extension theories. The theoretical basis for the reliability calculations was proposed by Batdorf. These models combine linear elastic fracture mechanics (LEFM) with Weibull statistics to provide a mechanistic failure criterion. Other fracture theories included in SCARE are the normal stress averaging technique and the principle of independent action. The objective of this presentation is to summarize these theories, including their limitations and advantages, and to provide a general description of the SCARE program, along with example problems.

Manderscheid, Jane M.↗