SEARCH · Search NASA

Results for “mathematical programming formulations”

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.

SourceResearch connectionFrom yearThrough year

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

At least 307 records · Page 17

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Domain Aware Deep-learning Algorithms Integrated with Scientific-computing Technologies (DADAIST)

This technical report summarized the contribution of the DADAIST project funded by the Data Model Convergence Initiative via the Laboratory Directed Research and Development (LDRD) investments at Pacific Northwest National Laboratory (PNNL). Specifically, we report the development of the NeuroMANCER (Neural Modules with Adaptive Nonlinear Constraints and Efficient Regularizations), a new open-source Scientific Machine Learning library for formulating and solving parametric constrained optimization problems, physics-informed system identification, and parametric optimal control problems. NeuroMANCER is using differentiable programming to combine modern data-driven models and optimization modeling language into a coherent algorithmic and software framework. NeuroMANCER is a Pytorch-based framework and adopts much of its philosophy focused on research and development, rapid prototyping, and streamlined deployment. Strong emphasis is given to extensibility, interoperability with the PyTorch ecosystem, and quick adaptability to custom domain problems. Neuromancer repository contains a comprehensive library of differentiable modules, including custom activation functions, matrix factorizations, deep learning architectures, neural differential equations, differential equation solvers, implicit layers such as iterative solvers, high-level API for symbolic expressions, API for modeling and control of dynamical systems, and extensive set of tutorial code examples in the form of python scripts and jupyter notebooks.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1996

The fragmentation of 510 MeV/nucleon iron-56 in polyethylene. II. Comparisons between data and a model

The results of a Monte Carlo model for calculating fragment fluences and LET spectra are compared to data taken with 600 MeV/nucleon iron ions incident on an accelerator beamline configured for irradiation of biological samples, with no target and with 2, 5 and 8 cm of polyethylene. The model uses a multi-generation nuclear fragmentation code, coupled with a formulation of ionization energy loss based on the Bethe-Bloch equation. In the region where the data are reliable and the experimental acceptance is well understood, many of the features of the experimental spectra are well replicated by the model. To obtain good agreement with the experimental data, the model must allow for at least two generations of fragment production in the target.

NASA Discipline Number 99-99↗

NASA NTRS2004

A Method for Calculating the Probability of Successfully Completing a Rocket Propulsion Ground Test

Propulsion ground test facilities face the daily challenges of scheduling multiple customers into limited facility space and successfully completing their propulsion test projects. Due to budgetary and schedule constraints, NASA and industry customers are pushing to test more components, for less money, in a shorter period of time. As these new rocket engine component test programs are undertaken, the lack of technology maturity in the test articles, combined with pushing the test facilities capabilities to their limits, tends to lead to an increase in facility breakdowns and unsuccessful tests. Over the last five years Stennis Space Center's propulsion test facilities have performed hundreds of tests, collected thousands of seconds of test data, and broken numerous test facility and test article parts. While various initiatives have been implemented to provide better propulsion test techniques and improve the quality, reliability, and maintainability of goods and parts used in the propulsion test facilities, unexpected failures during testing still occur quite regularly due to the harsh environment in which the propulsion test facilities operate. Previous attempts at modeling the lifecycle of a propulsion component test project have met with little success. Each of the attempts suffered form incomplete or inconsistent data on which to base the models. By focusing on the actual test phase of the tests project rather than the formulation, design or construction phases of the test project, the quality and quantity of available data increases dramatically. A logistic regression model has been developed form the data collected over the last five years, allowing the probability of successfully completing a rocket propulsion component test to be calculated. A logistic regression model is a mathematical modeling approach that can be used to describe the relationship of several independent predictor variables X(sub 1), X(sub 2),..,X(sub k) to a binary or dichotomous dependent variable Y, where Y can only be one of two possible outcomes, in this case Success or Failure. Logistic regression has primarily been used in the fields of epidemiology and biomedical research, but lends itself to many other applications. As indicated the use of logistic regression is not new, however, modeling propulsion ground test facilities using logistic regression is both a new and unique application of the statistical technique. Results from the models provide project managers with insight and confidence into the affectivity of rocket engine component ground test projects. The initial success in modeling rocket propulsion ground test projects clears the way for more complex models to be developed in this area.

Messer, Bradley P.↗

DOE OSTI2023

Lagrangian large eddy simulations via physics-informed machine learning

High-Reynolds number homogeneous isotropic turbulence (HIT) is fully described within the Navier–Stokes (NS) equations, which are notoriously difficult to solve numerically. Engineers, interested primarily in describing turbulence at a reduced range of resolved scales, have designed heuristics, known as large eddy simulation (LES). LES is described in terms of the temporally evolving Eulerian velocity field defined over a spatial grid with the mean-spacing correspondent to the resolved scale. This classic Eulerian LES depends on assumptions about effects of subgrid scales on the resolved scales. Here, we take an alternative approach and design LES heuristics stated in terms of Lagrangian particles moving with the flow. Our Lagrangian LES, thus L-LES, is described by equations generalizing the weakly compressible smoothed particle hydrodynamics formulation with extended parametric and functional freedom, which is then resolved via Machine Learning training on Lagrangian data from direct numerical simulations of the NS equations. The L-LES model includes physics-informed parameterization and functional form, by combining physics-based parameters and physics-inspired Neural Networks to describe the evolution of turbulence within the resolved range of scales. The subgrid-scale contributions are modeled separately with physical constraints to account for the effects from unresolved scales. We build the resulting model under the differentiable programming framework to facilitate efficient training. We experiment with loss functions of different types, including physics-informed ones accounting for statistics of Lagrangian particles. We show that our L-LES model is capable of reproducing Eulerian and unique Lagrangian turbulence structures and statistics over a range of turbulent Mach numbers.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2016

Variational Nodal 2D/1D Transport/Diffusion Solutions of the C5G7 Benchmark Problems

This work is the continuation of our effort to generalize the variational nodal method (VNM) for application to pin resolved whole-core PWR problems. To this end, a 2D/1D VNM method without spatial homogenization is formulated and implemented in the PANX code. We employ diffusion theory in the axial direction combined with two-dimensional transport in the x-y plane. In our initial work, we employed the standard spherical harmonics method. To increase accuracy and reduce computational effort, we present two refinements: First, the even-parity integral method within the nodes reduces the computational effort required to form the response matrices. Second, the use of quasi-reflected interface conditions reduces the dimension of the resulting response matrices and therefore the CPU time required to solve the equations. We apply the method to the three-dimensional, unrodded C5G7 benchmark problem.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

A time-parallel method for the solution of PDE-constrained optimization problems

We study a time-parallel approach to solving quadratic optimization problems with linear time-dependent partial differential equation (PDE) constraints. These problems arise in formulations of optimal control, optimal design and inverse problems that are governed by parabolic PDE models. They may also arise as subproblems in algorithms for the solution of optimization problems with nonlinear time-dependent PDE constraints, e.g., in sequential quadratic programming methods. We apply a piecewise linear finite element discretization in space to the PDE constraint, followed by the Crank-Nicolson discretization in time. The objective function is discretized using finite elements in space and the trapezoidal rule in time. At this point in the discretization, auxiliary state variables are introduced at each discrete time interval, with the goal to enable: (i) a decoupling in time; and (ii) a fixed-point iteration to recover the solution of the discrete optimality system. The fixed-point iterative schemes can be used either as preconditioners for Krylov subspace methods or as smoothers for multigrid (in time) schemes. We present promising numerical results for both use cases.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Proactive Data Containers for Scientific Storage (Final Report)

Emerging HPC systems are expected to be deployed with an unprecedented level of complexity, due to a deep system memory/storage hierarchy and heterogeneity of the storage hardware. This hierarchy is expected to range from CPU cache through several levels of volatile memory to nonvolatile memory, traditional hard disks, and tape. Simple and efficient methods of data management and movement through this hierarchy is critical for scientific applications using exascale systems. Existing storage system and I/O (SSIO) technologies face severe challenges in dealing with these requirements. POSIX and MPI I/O standards that are the basis for existing I/O libraries and parallel file systems present fundamental challenges in the areas of scalable metadata operations, semantics-based data movement performance tuning, asynchronous operation, and support for scalable consistency of distributed operations. Moving toward new paradigms for SSIO in the extreme-scale era, we have proposed to investigate novel object-based data abstractions and storage mechanisms that take advantage of the deep storage hierarchy and enable proactive automated performance tuning. In order to achieve these overarching goals, we initiated an effort to develop a fundamental new data abstraction, called Proactive Data Containers (PDC). A PDC is a container within a locus of storage (memory, NVRAM, disk, etc.) that stores science data in an object-centric manner. Managing data as objects enables powerful optimization opportunities for data movement and transformations. The R&D focus of this project are: 1) formulation of object-oriented PDCs and their mapping in different levels of the exascale storage hierarchy; 2) efficient strategies for moving data in deep storage hierarchies using PDCs; 3) techniques for transforming and reorganizing data based on application requirements; and 4) novel analysis paradigms for enabling data transformations and user-defined analysis on data in PDCs. Toward achieving these overarching goals, we designed an object-centric application programing interface (API) for HPC, scalable metadata management for object-centric storage systems, and data movement optimizations such as Data Elevator for moving data between two levels of storage devices and TAPIOCA for efficient aggregation of data on compute nodes. We then implemented several components of the PDC system. They include metadata management, data placement services, remote procedure calls, data aggregation, etc. We have put them together into the overall PDC framework.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Summary of Development for Structural Component Modeling in Fiscal Year 2022

This report summarizes efforts performed during Fiscal Year 2022 to develop capabilities for modeling structural component degradation in support of the U.S. Department of Energy's Nuclear Energy Advanced Modeling and Simulation Program. These efforts were centered around development of capabilities for the Grizzly code. Efforts focused both on foundational engineering-scale analysis capabilities for damage and shell formulations and on material-scale tools for accounting for irradiation effects in Grade 91 steel. A major outcome of this effort was the development of a general-purpose tool for nonlocal averaging of material properties, which enabled nonlocal damage models. In addition, the applicability of the shell elements in MOOSE has been expanded to allow modeling a wider range of component geometries and using a wide variety of material models. For irradiation effects on materials, a previously developed cluster dynamics model for light water reactor pressure vessel steels has been adapted for application to Grade 91 alloy. This work builds on prior efforts to build a flexible, capable code for addressing a variety of aging and component performance issues in nuclear power plant structural components.

36 MATERIALS SCIENCE↗

DOE OSTI2016

Graphical models for optimal power flow

Optimal power flow (OPF) is the central optimization problem in electric power grids. Although solved routinely in the course of power grid operations, it is known to be strongly NP-hard in general, and weakly NP-hard over tree networks. In this paper, we formulate the optimal power flow problem over tree networks as an inference problem over a tree-structured graphical model where the nodal variables are low-dimensional vectors. We adapt the standard dynamic programming algorithm for inference over a tree-structured graphical model to the OPF problem. Combining this with an interval discretization of the nodal variables, we develop an approximation algorithm for the OPF problem. Further, we use techniques from constraint programming (CP) to perform interval computations and adaptive bound propagation to obtain practically efficient algorithms. Compared to previous algorithms that solve OPF with optimality guarantees using convex relaxations, our approach is able to work for arbitrary tree-structured distribution networks and handle mixed-integer optimization problems. Further, it can be implemented in a distributed message-passing fashion that is scalable and is suitable for “smart grid” applications like control of distributed energy resources. In conclusion, numerical evaluations on several benchmark networks show that practical OPF problems can be solved effectively using this approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2025

Multistage economic MPC for systems with a cyclic steady state: A gas network case study

Multistage model predictive control (MPC) provides a robust control strategy for dynamic systems with uncertainties and a setpoint tracking objective. Moreover, extending MPC to minimize an economic cost instead of tracking a pre-calculated optimal setpoint improves controller performance. This paper presents a novel multistage economic nonlinear model predictive control (E-NMPC) framework for dynamic systems operating under uncertainty, with specific application to natural gas transmission networks. A key innovation lies in the integration of cyclic steady-state (CSS) constraints within the multistage MPC formulation, enabling the controller to manage periodic operating conditions commonly observed in energy systems. A Lyapunov-based descent condition is enforced to ensure robust stability of the controller. The multistage economic MPC framework is validated on two gas pipeline case studies, where it successfully minimizes net energy consumption, respects operational constraints under uncertain demand profiles, and guides the network to optimal cyclic operation. The Lyapunov function remains bounded in both case studies, validating the robust stability of multistage E-NMPC.

03 NATURAL GAS↗

DOE OSTI2023

Interface Problem Formulation Improvements with Application to Nuclear Fuel Performance Analysis

The U.S. Department of Energy’s Nuclear Energy Advanced Modeling and Simulation Program aims to develop predictive capabilities by applying computational methods to the analysis and design of advanced reactor and fuel cycle systems. This program has been providing engineering scale support for the development of BISON, a high-fidelity and high-resolution fuel performance tool. This report documents new developments and robustness improvements in mechanical and thermal (gap heat transfer) contact formulations. The improvements range from the migration of industrial level (“assessment”) nuclear fuel model setups to the usage of mortar formulations, the addition of frictional contact to one-dimensional layered representations of fuel and cladding components, and the addition of the Petrov-Galerkin approach to dual mortar, which improves performance on curved, relatively coarse meshes. In addition, the Lagrange-multiplier enforcement of mechanical mortar contact constraints has been extended to two additional types of enforcement: penalty and augmented Lagrange-Uzawa. We show that the latter approach yields the same interface results as dual mortar in the Multiphysics Object-Oriented Simulation Environment, with the advantage of not worsening the condition number of the system matrix—thereby enabling the use of some general implementations of iterative preconditioners, at the expense of additional system evaluations (i.e., augmentations).

42 ENGINEERING↗

DOE OSTI2020

Refueling infrastructure planning in intercity networks considering route choice and travel time delay for mixed fleet of electric and conventional vehicles

The range anxiety has been a major factor that affects the market acceptance of electric vehicles. Even with the recent development of battery technologies, a lack of charging stations and range anxiety are still significant concerns, specifically for intercity trips. This calls for more investments in building charging stations and advancing battery technologies to increase the market share of electric vehicles and improve sustainability. This study suggests a configuration for plug-in electric vehicle charging infrastructure to support long-distance intercity trips of electric vehicles at the network level. A model is proposed to minimize the total system cost including infrastructure investment (building charging stations/spots) and travel time delays (charging time, waiting time in the queue, and detour time to access charging stations). This study fills existing gaps in the literature by capturing realistic patterns of travel demand and considering flow-dependent charging delays at charging stations. Furthermore, the proposed model, which is formulated as a mixed-integer program with nonlinear constraints, solves the optimization problem at the network level. At the network level, impacts of charging station locations on the traffic assignment problem with a mixed fleet of electric and conventional vehicles need to be considered. To this end, a traffic assignment module is integrated with a simulated annealing algorithm. The numerical experiments show a satisfactory application of the model for a full-scale case study (intercity network in Michigan). The solution quality and efficiency of the proposed solution algorithm are evaluated against those of an enumeration approach for a small case study. The results suggest that even for the current market share and charging stations’ setting, a significant investment is needed to support intercity trips without range anxiety issues and with acceptable delays. Additionally, through sensitivity analyses, the required infrastructure and battery investments to support intercity trips with acceptable delays are established for hypothetical increased market shares and battery size in the future.

42 ENGINEERING↗

DOE OSTI2021

A compute-bound formulation of Galerkin model reduction for linear time-invariant dynamical systems

This work aims to advance computational methods for projection-based reduced-order models (ROMs) of linear time-invariant (LTI) dynamical systems. For such systems, current practice relies on ROM formulations expressing the state as a rank-1 tensor (i.e., a vector), leading to computational kernels that are memory bandwidth bound and, therefore, ill-suited for scalable performance on modern architectures. This weakness can be particularly limiting when tackling many-query studies, where one needs to run a large number of simulations. This work introduces a reformulation, called rank-2 Galerkin, of the Galerkin ROM for LTI dynamical systems which converts the nature of the ROM problem from memory bandwidth to compute bound. We present the details of the formulation and its implementation, and demonstrate its utility through numerical experiments using, as a test case, the simulation of elastic seismic shear waves in an axisymmetric domain. We quantify and analyze performance and scaling results for varying numbers of threads and problem sizes. In conclusion, we present an end-to-end demonstration of using the rank-2 Galerkin ROM for a Monte Carlo sampling study. We show that the rank-2 Galerkin ROM is one order of magnitude more efficient than the rank-1 Galerkin ROM (the current practice) and about 970 times more efficient than the full-order model, while maintaining accuracy in both the mean and statistics of the field.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

A transmission line model for propagation in elliptical core optical fibers

The calculation of mode propagation constants of elliptical core fibers has been the purpose of extended research leading to many notable methods, with the classic step index solution based on Mathieu functions. This paper seeks to derive a new innovative method for the determination of mode propagation constants in single mode fibers with elliptic core by modeling the elliptical fiber as a series of connected coupled transmission line elements. We develop a matrix formulation of the transmission line and the resonance of the circuits is used to calculate the mode propagation constants. The technique, used with success in the case of cylindrical fibers, is now being extended for the case of fibers with elliptical cross section. The advantage of this approach is that it is very well suited to be able to calculate the mode dispersion of arbitrary refractive index profile elliptical waveguides. The analysis begins with the deployment Maxwell’s equations adjusted for elliptical coordinates. Further algebraic analysis leads to a set of equations where we are faced with the appearance of harmonics. Taking into consideration predefined fixed number of harmonics simplifies the problem and enables the use of the resonant circuits approach. According to each case, programs have been created in Matlab, providing with a series of results (mode propagation constants) that are further compared with corresponding results from the ready known Mathieu functions method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2018

sympl (v. 0.4.0) and climt (v. 0.15.3) – towards a flexible framework for building model hierarchies in Python

sympl (System for Modelling Planets) andclimt (Climate Modelling and Diagnostics Toolkit) are anattempt to rethink climate modelling frameworks from the ground up. The aimis to use expressive data structures available in the scientific Pythonecosystem along with best practices in software design to allow scientists toeasily and reliably combine model components to represent the climate systemat a desired level of complexity and to enable users to fully understandwhat the model is doing. sympl is a framework which formulates the model in terms of astate that gets evolved forward in time or modified within a specifictime by well-defined components. sympl's design facilitates buildingmodels that are self-documenting, are highly interoperable, and providefine-grained control over model components and behaviour. symplcomponents contain all relevant information about the input they expect andoutput that they provide. Components are designed to be easily interchanged,even when they rely on different units or array configurations.sympl provides basic functions and objects which could be used inany type of Earth system model. climt is an Earth system modelling toolkit that contains scientificcomponents built using sympl base objects. These include both purePython components and wrapped Fortran libraries. climt providesfunctionality requiring model-specific assumptions, such as stateinitialization and grid configuration. climt's programming interfacedesigned to be easy to use and thus appealing to a wide audience. Model building, configuration and execution are performed through a Pythonscript (or Jupyter Notebook), enabling researchers to build an end-to-endPython-based pipeline along with popular Python data analysis andvisualization tools.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

Exploring Two Approaches for an End-to-End Scientific Analysis Workflow

The advance of the scientific discovery process is accomplished by the integration of independently-developed programs run on disparate computing facilities into coherent workflows usable by scientists who are not experts in computing. For such advancement, we need a system which scientists can use to formulate analysis workflows, to integrate new components to these workflows, and to execute different components on resources that are best suited to run those components. In addition, we need to monitor the status of the workflow as components get scheduled and executed, and to access the intermediate and final output for visual exploration and analysis. Finally, it is important for scientists to be able to share their workflows with collaborators. Moreover we have explored two approaches for such an analysis framework for the Large Synoptic Survey Telescope (LSST) Dark Energy Science Collaboration (DESC), the first one is based on the use and extension of Galaxy, a web-based portal for biomedical research, and the second one is based on a programming language, Python. In our paper, we present a brief description of the two approaches, describe the kinds of extensions to the Galaxy system we have found necessary in order to support the wide variety of scientific analysis in the cosmology community, and discuss how similar efforts might be of benefit to the HEP community.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

DOE-EM/HBCU Projects for Environmental Management Research and Workshop Development at SCSU [Conference Papers/Proceedings]. Final Report

The Department of Energy’s Office of Environmental Management (DOE-EM) established a Memorandum of Understanding (MOU) with nine HBCUs in South Carolina and Northeast Georgia. The nine HBCUs (Allen University, Benedict College, Claflin University, Clinton Junior College, Demark Technical College, Morris College, South Carolina State University, Voorhees College and Paine College of Northeast Georgia) have formulated a consortium to address the technical and workforce development needs of the DOE’s Office of Environmental Management. These institutions have the qualifications and expertise to provide the technical cooperation and operations support in the areas of environmental remediation, nuclear regulatory and transportation safety, modeling, technology transfer and workforce development. Several of the HBCUs have received awards from the DOE to address issues related to ground water, surface water, plant communities, the development of an interdisciplinary waste management institute, and the establishment of an environmental science field station. Also, the acquisition of these grant awards have afforded the participating institutions with the ability to instruct students by providing them with the appropriate skill sets to address the future employment needs of DOE to include: Hands-on field experiences; Classroom demonstrations; and, Research and education experiences. South Carolina State University will build upon its existing relationships with DOE-EM by creating a "pipeline" for minorities in Mathematics, Science & Technology, Engineering, Research, and other related fields. Students will be specifically trained and mentored to enter the DOE workforce in these technical areas of need. The integration of technology in research and education is essential for meeting the demanding need to develop a workable mechanism to optimize the effectiveness of research and education in this nation. This is extremely critical in this age of unprecedented technological advances when information delivery, training, and continuous research to improve performance and skill enhancement hold the key to competition. This development relies on a program of applied science to identify and help implement the technologies, as well as programs that energize and mentor the next generation of scientists and engineers. To foster these goals, SCSU proposes research and educational projects that will support the integration of technology in research and education.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2022

Quantum Distributed Unit Commitment: An Application in Microgrids

The dawn of quantum computing brings on a revolution in the way combinatorially complex power system problems such as Unit Commitment are solved. The Unit Commitment problem complexity is expected to increase in the future because of the trend toward the increase of penetration of intermittent renewables. Even though quantum computing has proven effective for solving a host of problems, its applications for power systems’ problems have been rather limited. Here, in this paper, a quantum unit commitment is innovatively formulated and the quantum version of the decomposition and coordination alternate direction method of multipliers (ADMM) is established. The above is achieved by devising quantum algorithms and by exploiting the superposition and entanglement of quantum bits (qubits) for solving subproblems, which are then coordinated through ADMM to obtain feasible solutions. The main contributions of this paper include: 1) the innovative development of a quantum model for Unit Commitment; 2) development of decomposition and coordination-supported framework which paves the way for the utilization of limited quantum resources to potentially solve the large-scale discrete optimization problems; 3) devising the novel quantum distributed unit commitment (QDUC) to solve the problem in a larger scale than currently available quantum computers are capable of solving. The QDUC results are compared with those from its classical counterpart, which validate the efficacy of quantum computing.

97 MATHEMATICS AND COMPUTING↗