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 703 records · Page 39

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.↗

3-D Deep Penetration Neutron Imaging of Thick Absorgin and Diffusive Objects Using Transport Theory

A current area of research interest in national security is to effectively and efficiently determine the contents of the many shipping containers that enter ports in the United States. This interest comes as a result of the 9/11 Commission Act passed by Congress in 2007 that requires 100% of inbound cargo to be scanned by 2012. It appears that this requirement will be achieved by 2012, but as of February of 2009 eighty percent of the 11.5 million inbound cargo containers were being scanned. The systems used today in all major U.S. ports to determine the presence of radioactive material within cargo containers are Radiation Portal Monitors (RPM). These devices generally exist in the form of a gate or series of gates that the containers can be driven through and scanned. The monitors are effective for determining the presence of radiation, but offer little more information about the particular source. This simple pass-fail system leads to many false alarms as many everyday items emit radiation including smoke detectors due to the Americium-241 source contained inside, bananas, milk, cocoa powder and lean beef due to the trace amounts of Potassium-40, and fire brick and kitty litter due to their high clay content which often contains traces of uranium and thorium. In addition, if an illuminating source is imposed on the boundary of the container, the contents of the container may become activated. These materials include steel, aluminum and many agricultural products. Current portal monitors also have not proven to be that effective at identifying natural or highly enriched uranium (HEU). In fact, the best available Advanced Spectroscopic Portal Monitors (ASP) are only capable of identifying bare HEU 70-88% of the time and masked HEU and depleted uranium (DU) only 53 percent of the time. Therefore, a better algorithm that uses more information collected from better detectors about the specific material distribution within the container is desired. The work reported here explores the inverse problem of optical tomography applied to heterogeneous domains. The neutral particle transport equation was used as the forward model for how neutral particles stream through and interact within these heterogeneous domains. A constrained optimization technique that uses Newtons method served as the basis of the inverse problem. Optical tomography aims at reconstructing the material properties using (a) illuminating sources and (b) detector readings. However, accurate simulations for radiation transport require that the particle (gamma and/or neutron) energy be appropriate discretize in the multigroup approximation. This, in turns, yields optical tomography problems where the number of unknowns grows (1) about quadratically with respect to the number of energy groups, G, (notably to reconstruct the scattering matrix) and (2) linearly with respect to the number of unknown material regions. As pointed out, a promising approach could rely on algorithms to appropriately select a material type per material zone rather than G2 values. This approach, though promising, still requires further investigation: (a) when switching from cross-section values unknowns to material type indices (discrete integer unknowns), integer programming techniques are needed since derivative information is no longer available; and (b) the issue of selecting the initial material zoning remains. The work reported here proposes an approach to solve the latter item, whereby a material zoning is proposed using one-group or few-groups transport approximations. The capabilities and limitations of the presented method were explored; they are briefly summarized next and later described in fuller details in the Appendices. The major factors that influenced the ability of the optimization method to reconstruct the cross sections of these domains included the locations of the sources used to illuminate the domains, the number of separate experiments used in the reconstruction, the locations where measurements were collected, the optical thickness of the domain, the amount of signal noise and signal bias applied to the measurements and the initial guess for the cross section distribution. All of these factors were explored for problems with and without scattering. Increasing the number of source and measurement locations and experiments generally was more successful at reconstructing optically thicker domains while producing less error in the image. The maximum optical thickness that could be reconstructed with this method was ten mean free paths for pure absorber and two mean free paths for scattering problems. Applying signal noise and signal bias to the measured fluxes produced more error in the produced image. Generally, Newtons method was more successful at reconstructing domains from an initial guess for the cross sections that was greater in magnitude than their true values than from an initial guess that was lower in magnitude.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Control design variable linking for optimization of structural/control systems

A method is presented to integrate the design space of structural/control system optimization problems in the case of linear state feedback control. Conventional structural sizing variables and elements of the feedback gain matrix are both treated as strictly independent design variables in optimization by extending design variable linking concepts to the control gains. Several approximation concepts including new control design variable linking schemes are used to formulate the integrated structural/control optimization problem as a sequence of explicit nonlinear mathematical programming problems. Examples which involve a variety of behavior constraints, including constraints on dynamic stability, damped frequencies, control effort, peak transient displacement, acceleration, and control force limits, are effectively solved by using the method presented.

Jin, Ik Min↗

Data-driven modeling and control of dynamical systems using Koopman and Perron-Frobenius operators

This dissertation studies the data-driven modeling and control problem of nonlinear systems by exploiting the linear operator theoretic framework involving Koopman and Perro-Frobenius operator. A systematic linear-operator based controller design procedure has been established, which can be used to solve a variety of nonlinear control problems, including feedback stabilization using control Lyapunov functions, optimal quadratic regulation using Koopman eigenfunctions and convex optimization formulation of optimal control problem using P-F and Koopman operator approximation. As the core of data-driven modeling, we first propose a new algorithm for the finite-dimensional approximation of the linear transfer Koopman and Perron-Frobenius operator from time-series data. We argue that the existing approach for the finite-dimensional approximation of these transfer operators such as Dynamic Mode Decomposition (DMD) and Extended Dynamic Mode Decomposition (EDMD) do not capture two important properties of these operators, namely positivity and Markov property. The algorithm we propose preserves these two properties. We call the proposed algorithm as naturally structured DMD (NSDMD) since it retains the inherent properties of these operators. Naturally structured DMD algorithm leads to a better approximation of the steady-state dynamics of the system regarding computing Koopman and Perron- Frobenius operator eigenfunctions and eigenvalues. However, preserving positivity property is critical for capturing the real transient dynamics of the system. This positivity property of the transfer operators and it's finite-dimensional approximation play an important role for controller and estimator design of nonlinear systems. To solve the feedback stabilization problem for nonlinear control systems, we tried to take advantage of the Koopman operator framework. The Koopman operator approach provides a linear representation for a nonlinear dynamical system and a bilinear representation for a nonlinear control system. The problem of feedback stabilization of a nonlinear control system is then transformed to the stabilization of a bilinear control system. We propose a control Lyapunov function (CLF)-based approach for the design of stabilizing feedback controllers for the bilinear system. The search for finding a CLF for the bilinear control system is formulated as a convex optimization problem. This leads to a schematic procedure for designing CLF-based stabilizing feedback controllers for the bilinear system and hence the original nonlinear system. Another advantage of the proposed controller design approach outlined in this dissertation is that it does not require explicit knowledge of system dynamics. In particular, the bilinear representation of a nonlinear control system in the Koopman eigenfunction space can be obtained from time-series data. Next, we study the optimal quadratic regulation problem for nonlinear systems. The linear operator theoretic framework involving the Koopman operator is used to lift the dynamics of nonlinear control system to an infinite-dimensional bilinear system. The optimal quadratic regulation problem for nonlinear system is formulated in terms of the finite-dimensional approximation of the bilinear system. A convex optimization-based approach is proposed for solving the quadratic regulator problem for bilinear system. We applied a variety of examples and compared the simulation results between our framework and conventional LQR control using linearized model. For more general optimal control problems, we provide a density-function based convex formulation for the optimal control problem of the nonlinear system. The convex formulation relies on the duality result in the stability theory of a dynamical system involving density function and Perron-Frobenius operator. The optimal control problem is formulated as an infinite-dimensional convex optimization program. The finite-dimensional approximation of the optimization problem relies on the recent advances made in the data-driven computation of the Koopman operator, which is dual to the Perron-Frobenius operator. Simulation results are presented to demonstrate the application of the developed framework.

Huang, Bowen↗

Krylov methods preconditioned with incompletely factored matrices on the CM-2

The performance is measured of the components of the key interative kernel of a preconditioned Krylov space interative linear system solver. In some sense, these numbers can be regarded as best case timings for these kernels. Sweeps were timed over meshes, sparse triangular solves, and inner products on a large 3-D model problem over a cube shaped domain discretized with a seven point template. The performance of the CM-2 is highly dependent on the use of very specialized programs. These programs mapped a regular problem domain onto the processor topology in a careful manner and used the optimized local NEWS communications network. The rather dramatic deterioration in performance was documented when these ideal conditions no longer apply. A synthetic workload generator was developed to produce and solve a parameterized family of increasingly irregular problems.

Berryman, Harry↗

Probabilistic Structural Analysis Program

NASA/NESSUS 6.2c is a general-purpose, probabilistic analysis program that computes probability of failure and probabilistic sensitivity measures of engineered systems. Because NASA/NESSUS uses highly computationally efficient and accurate analysis techniques, probabilistic solutions can be obtained even for extremely large and complex models. Once the probabilistic response is quantified, the results can be used to support risk-informed decisions regarding reliability for safety-critical and one-of-a-kind systems, as well as for maintaining a level of quality while reducing manufacturing costs for larger-quantity products. NASA/NESSUS has been successfully applied to a diverse range of problems in aerospace, gas turbine engines, biomechanics, pipelines, defense, weaponry, and infrastructure. This program combines state-of-the-art probabilistic algorithms with general-purpose structural analysis and lifting methods to compute the probabilistic response and reliability of engineered structures. Uncertainties in load, material properties, geometry, boundary conditions, and initial conditions can be simulated. The structural analysis methods include non-linear finite-element methods, heat-transfer analysis, polymer/ceramic matrix composite analysis, monolithic (conventional metallic) materials life-prediction methodologies, boundary element methods, and user-written subroutines. Several probabilistic algorithms are available such as the advanced mean value method and the adaptive importance sampling method. NASA/NESSUS 6.2c is structured in a modular format with 15 elements.

Pai, Shantaram S.↗

An integrated approach to the synthesis of geometrically non-linear structures

An integrated approach to the minimum weight design of geometrically nonlinear three-dimensional truss structures with geometric imperfections, subject to inequality constraints on static displacements, stresses, local buckling and cross sectional areas, is investigated. The integrated structural synthesis problem involves design and response quantities as independent variables and equilibrium equations, describing the finite element model, as equality constraints. The nonlinear structural analysis and the optimization are thus merged together into a single process. A computer program developed to compute the constraint values and analytical gradients is coupled with a generalized reduced gradient algorithm to solve the integrated problem. Numerical results for a geometrically nonlinear shallow dome example problem are presented for various types of imperfections. Furthermore, it is found that the algorithm is capable of detecting and guarding against system as well as element elastic instability using equilibrium information only, that is, without imposing system and local buckling inequality constraints.

Smaoui, H.↗

Max-Plus Stochastic Control and Risk-Sensitivity

In the Maslov idempotent probability calculus, expectations of random variables are defined so as to be linear with respect to max-plus addition and scalar multiplication. This paper considers control problems in which the objective is to minimize the max-plus expectation of some max-plus additive running cost. Such problems arise naturally as limits of some types of risk sensitive stochastic control problems. The value function is a viscosity solution to a quasivariational inequality (QVI) of dynamic programming. Equivalence of this QVI to a nonlinear parabolic PDE with discontinuous Hamiltonian is used to prove a comparison theorem for viscosity sub- and super-solutions. An example from mathematical finance is given, and an application in nonlinear H-infinity control is sketched.

97 MATHEMATICS AND COMPUTING↗

Performance Evaluation of District Energy Microgrids Planning Tool for Non-Technical Users

Community Microgrids are increasingly gaining popularity worldwide for their efficiency, cost-effectiveness, and local resilience improvement. Microgrid planning tools play a crucial role in their deployment. In the process, tentative designs of the microgrid are simulated, analyzed, and optimized. Due to the complexity of the problem, planning tools must carefully balance computational efficiency while seeking the most optimal solutions. This paper investigates the impact of algorithm selection on CPU and memory utilization of a Community Microgrid planning tool that is specifically designed for non-technical users. We compare two version of the code with two alternatives for Community Microgrid planning tools: a Greedy Algorithm, and a Linear Programming Approach. This comparison examines scenarios spanning from 2 to 50 buildings. Our findings revealed a significant difference in performance between the two algorithms, underscoring the critical role of algorithm selection in optimizing the efficiency of Community Microgrid Planning Tools.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Inverse methods for assessing ship-of-opportunity networks and estimating circulation and winds from tropical expendable bathythermograph data

Inverse methods for estimating the surface ciculation of the equatorial Pacific by combining a linear reduced-gravity shallow-water model with the Tropical Ocean-Global Atmosphere ship-of-opportunity expendable bathythermograph (TOGA SOP XBT) observing program are examined. It is demonstrated that a simple linear model of the upper circulation of the equatorial Pacific can be successfully used as a weak constraint when smoothing the TOGA SOP XBT data. A circulation is sought as the weighted least squares fit to the dynamics and the data. The solution method is an expansion in representer functions, and the generalized inverse problem is thereby reduced from a functional problem to an algebraic problem for the coefficients of the representer. A specific inverse calculation using synthetic forcing and data is presented.

Bennett, Andrew F.↗

Comparative Evaluation of Different Optimization Algorithms for Structural Design Applications

Non-linear programming algorithms play an important role in structural design optimization. Fortunately, several algorithms with computer codes are available. At NASA Lewis Research Centre, a project was initiated to assess the performance of eight different optimizers through the development of a computer code CometBoards. This paper summarizes the conclusions of that research. CometBoards was employed to solve sets of small, medium and large structural problems, using the eight different optimizers on a Cray-YMP8E/8128 computer. The reliability and efficiency of the optimizers were determined from the performance of these problems. For small problems, the performance of most of the optimizers could be considered adequate. For large problems, however, three optimizers (two sequential quadratic programming routines, DNCONG of IMSL and SQP of IDESIGN, along with Sequential Unconstrained Minimizations Technique SUMT) outperformed others. At optimum, most optimizers captured an identical number of active displacement and frequency constraints but the number of active stress constraints differed among the optimizers. This discrepancy can be attributed to singularity conditions in the optimization and the alleviation of this discrepancy can improve the efficiency of optimizers.

Patnaik, Surya N.↗

Accelerating DCA++ (Dynamical Cluster Approximation) Scientific Application on the Summit supercomputer

Optimizing scientific applications on today’s accelerator-based high performance computing systems can be challenging, especially when multiple GPUs and CPUs with heterogeneous memories and persistent non-volatile memories are present. An example is Summit, an accelerator-based system at the Oak Ridge Leadership Computing Facility (OLCF) that is rated as the world’s fastest supercomputer to-date. New strategies are thus needed to expose the parallelism in legacy applications, while being amenable to efficient mapping to the underlying architecture.In this paper we discuss our experiences and strategies to port a scientific application, DCA++, to Summit. DCA++ is a highperformance research application that solves quantum manybody problems with a cutting edge quantum cluster algorithm, the dynamical cluster approximation.Our strategies aim to synergize the strengths of the different programming models in the code. These include: (a) streamlining the interactions between the CPU threads and the GPUs, (b) implementing computing kernels on the GPUs and decreasing CPU-GPU memory transfers, (c) allowing asynchronous GPU communications, and (d) increasing compute intensity by combining linear algebraic operations.Full-scale production runs using all 4600 Summit nodes attained a peak performance of 73.5 PFLOPS with a mixed precision implementation.We observed a perfect strong and weak scaling for the quantum Monte Carlo solver in DCA++, while encountering about 2× input/output (I/O) and MPI communication overhead on the time-to-solution for the full machine run. Our hardware agnostic optimizations are designed to alleviate the communication and I/O challenges observed, while improving the compute intensity and obtaining optimal performance on a complex, hybrid architecture like Summit.

Balduzzi, Giovanni↗

An iterative approach to the feature selection problem

The B-average divergence for m-distinct classes, resulting from the linear transformation y = Bx, is proposed as a feature selection criterion, where B is a k by n matrix of rank k not greater than n. It is shown that if the B-average divergence resulting from B is large enough, then the probability of misclassification, considered as a function f the class of all k by n matrices, is essentially minimized by B. A computer program, utilizing a gradient procedure, is developed to numerically maximize the B-average divergence and results are presented for the Cl flight line. For this example, corresponding to 9-distinct classes, most of the discriminatory information is found to lie in a 3-dimensional subspace, defined by an appropriately chosen 3 by 12 matrix B.

Decell, H. P., Jr.↗

Aircraft model prototypes which have specified handling-quality time histories

Several techniques for obtaining linear constant-coefficient airplane models from specified handling-quality time histories are discussed. One technique, the pseudodata method, solves the basic problem, yields specified eigenvalues, and accommodates state-variable transfer-function zero suppression. The method is fully illustrated for a fourth-order stability-axis small-motion model with three lateral handling-quality time histories specified. The FORTRAN program which obtains and verifies the model is included and fully documented.

Johnson, S. H.↗

Stacking-sequence optimization for buckling of laminated plates by integer programming

Integer-programming formulations for the design of symmetric and balanced laminated plates under biaxial compression are presented. Both maximization of buckling load for given total thickness, and the minimization of total thickness subject to a buckling constraint are formulated. The design variables that define the stacking sequence of the laminate are zero-one integers. It is shown that the formulation results in a linear optimization problem that can be solved on readily aviable software. Constraints on the stacking sequence such as a limit on the number of contiguous plies of the same orientation and limits on in-plane stiffnesses are easily accommodated. Examples are presented for graphite-epoxy plates under uniaxial and biaxial compression using a commercial software package based on the branch-and-bound algorithm.

Haftka, Raphael T.↗

Assessment of PCMI Simulation Using the Multidimensional Multiphysics BISON Fuel Performance Code

Since 2008, the Idaho National Laboratory (INL) has been developing a next-generation nuclear fuel performance code called BISON. BISON is built using INL’s Multiphysics Object-Oriented Simulation Environment, or MOOSE. MOOSE is a massively parallel, finite element-based framework to solve systems of coupled non-linear partial differential equations using the Jacobian-FreeNewton Krylov (JFNK) method. MOOSE supports the use of complex two- and three-dimensional meshes and uses implicit time integration, which is important for the widely varied time scales in nuclear fuel simulation. MOOSE’s object-oriented architecture minimizes the programming required to add new physics models. BISON has been applied to various nuclear fuel problems to assess the accuracy of its 2D and 3D capabilities. The benchmark results used in this assessment range from simulation results from other fuel performance codes to measurements from well-known and documented reactor experiments. An example of a well-documented experiment used in this assessment is the Third Risø Fission Gas Project, referred to as “Bump Test GE7”, which was performed on rod ZX115. This experiment was chosen because it allows for an evaluation of several aspects of the code, including fully coupled thermo-mechanics, contact, and several nonlinear material models. Bump Test GE7 consists of a base-irradiation period of a full-length rod in the Quad-Cities-1 BWR for nearly 7 years to a burnup of 4.17% FIMA. The base irradiation test is followed by a “bump test” of a sub-section of the original rod. The bump test takes place in the test reactor DR3 at Risø in a water-cooled HP1 rig under BWR conditions where the power level is increased by about 50% over base irradiation levels in the span of several hours. During base irradiation, the axial power profile is flat. During the bump test, the axial power profile changes so that the bottom half of the rod is at approximately 50% higher power than at the base irradiation level, while the power at the top of the rod is at about 20% of the base irradiation power level. 2D BISON simulations of the Bump Test GE7 were run using both discrete and smeared pellet geometry. Comparisons between these calculations and experimental measurements are presented for clad diameter and elongation after the base irradiation and clad profile along the length of the test section after the bump test. Preliminary comparisons between calculations and measurements are favorable, supporting the use of BISON as an accurate multiphysics fuel simulation tool.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

SU-E-T-234: Modulated Photon Radiotherapy (XMRT):The Impact of Incorporating Energy Modulation Into Intensity Modulated Radiotherapy (IMRT) Optimization

Purpose: To develop a new radiotherapy plan optimization technique that, for a given organ geometry, will find the optimal photon beam energies and fluences to produce a desirable dose distribution. This new modulated (both in energy and fluence) photon radiotherapy (XMRT) was compared with intensity modulated radiotherapy (IMRT) for a simple organ geometry. Methods: The XMRT optimization was formulated using a linear programming approach where the objective function is the mean dose to the healthy organs and dose-point constraints were assigned to each organ of interest. The organ geometry consisted of a target, two organs at risk (OARs), and normal tissue. A seven-equispaced-coplanar beam arrangement was used. For conventional IMRT, only 6 MV beams were available, while XMRT was optimized using 6 and 18 MV beams. A prescribed dose (PD) of 72 GY was assigned to the target, with upper and lower bounds of 110% and 95% of the PD, respectively. Both OARs were assigned a maximum dose of 64 Gy, while the normal tissue was assigned a maximum dose of 66 Gy. A numerical solver, Gurobi, generated solutions for the XMRT and IMRT problems. The dose-volume histograms from IMRT and XMRT solutions were compared. Results: The maximum, minimum, mean, and homogeneity of the dose to the target were comparable between IMRT and XMRT. Though IMRT had improved dose conformity relative to XMRT, XMRT reduced the mean dose to both OARs by more than 1 Gy. For normal tissue, an increase of 5 Gy in mean dose and 27 percent in integral dose was seen for IMRT relative to XMRT. Conclusion: This work demonstrates the benefits of simultaneously modulating photon beam energy and fluence using our XMRT approach in a given phantom geometry. While target coverage was comparable, dose to healthy structures was reduced using XMRT.

07 ISOTOPE AND RADIATION SOURCES↗

Numerical study of hydrogen-air supersonic combustion by using elliptic and parabolized equations

The two-dimensional Navier-Stokes and species continuity equations are used to investigate supersonic chemically reacting flow problems which are related to scramjet-engine configurations. A global two-step finite-rate chemistry model is employed to represent the hydrogen-air combustion in the flow. An algebraic turbulent model is adopted for turbulent flow calculations. The explicit unsplit MacCormack finite-difference algorithm is used to develop a computer program suitable for a vector processing computer. The computer program developed is then used to integrate the system of the governing equations in time until convergence is attained. The chemistry source terms in the species continuity equations are evaluated implicitly to alleviate stiffness associated with fast chemical reactions. The problems solved by the elliptic code are re-investigated by using a set of two-dimensional parabolized Navier-Stokes and species equations. A linearized fully-coupled fully-implicit finite difference algorithm is used to develop a second computer code which solves the governing equations by marching in spce rather than time, resulting in a considerable saving in computer resources. Results obtained by using the parabolized formulation are compared with the results obtained by using the fully-elliptic equations. The comparisons indicate fairly good agreement of the results of the two formulations.

Chitsomboon, T.↗