Search NASA⌕ Search

SEARCH · Search NASA

Results for “nonlinear programming”

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

SIERRA Multimechanics Module: Aria Thermal Theory Manual (V.4.56)

Aria is a Galerkin finite element based program for solving coupled-physics problems described by systems of PDEs and is capable of solving nonlinear, implicit, transient and direct-to-steady state problems in two and three dimensions on parallel architectures. The suite of physics currently supported by Aria includes thermal energy transport, species transport, and electrostatics as well as generalized scalar, vector and tensor transport equations. Additionally, Aria includes support for manufacturing process flows via the incompressible Navier-Stokes equations specialized to a low Reynolds number ( Re < 1) regime. Enhanced modeling support of manufacturing processing is made possible through use of either arbitrary Lagrangian-Eulerian (ALE) and level set based free and moving boundary tracking in conjunction with quasi-static nonlinear elastic solid mechanics for mesh control. Coupled physics problems are solved in several ways including fully-coupled Newton’s method with analytic or numerical sensitivities, fully-coupled Newton-Krylov methods and a loosely-coupled nonlinear iteration about subsets of the system that are solved using combinations of the aforementioned methods. Error estimation, uniform and dynamic h -adaptivity and dynamic load balancing are some of Aria’s more advanced capabilities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Implicit shock tracking for unsteady flows by the method of lines

Here, a recently developed high-order implicit shock tracking (HOIST) framework for resolving discontinuous solutions of inviscid, steady conservation laws is extended to the unsteady case. Central to the framework is an optimization problem which simultaneously computes a discontinuity-aligned mesh and the corresponding high-order approximation to the flow, which provides nonlinear stabilization and a high-order approximation to the solution. This work extends the implicit shock tracking framework to the case of unsteady conservation laws using a method of lines discretization via a diagonally implicit Runge-Kutta method by “solving a steady problem at each timestep”. We formulate and solve an optimization problem that produces a feature-aligned mesh and solution at each Runge-Kutta stage of each timestep, and advance this solution in time by standard Runge-Kutta update formulas. A Rankine-Hugoniot based prediction of the shock location together with a high-order, untangling mesh smoothing procedure provides a high-quality initial guess for the optimization problem at each time, which results in rapid convergence of the sequential quadratic programing (SQP) optimization solver. This method is shown to deliver highly accurate solutions on coarse, high-order discretizations without nonlinear stabilization and recover the design accuracy of the Runge-Kutta scheme. We demonstrate this framework on a series of inviscid, unsteady conservation laws in both one- and two- dimensions. We also verify that our method is able to recover the design order of accuracy of our time integrator in the presence of a strong discontinuity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints

Here we present a new algorithm for infinite-dimensional optimization with general constraints, called ALESQP. In short, ALESQP is an augmented Lagrangian method that penalizes inequality constraints and solves equality-constrained nonlinear optimization subproblems at every iteration. The subproblems are solved using a matrix-free trust-region sequential quadratic programming (SQP) method that takes advantage of iterative, i.e., inexact linear solvers, and is suitable for large-scale applications. A key feature of ALESQP is a constraint decomposition strategy that allows it to exploit problem-specific variable scalings and inner products. We analyze convergence of ALESQP under different assumptions. We show that strong accumulation points are stationary. Consequently, in finite dimensions ALESQP converges to a stationary point. In infinite dimensions we establish that weak accumulation points are feasible in many practical situations. Under additional assumptions we show that weak accumulation points are stationary. We present several infinite-dimensional examples where ALESQP shows remarkable discretization-independent performance in all of its iterative components, requiring a modest number of iterations to meet constraint tolerances at the level of machine precision. Also, we demonstrate a fully matrix-free solution of an infinite-dimensional problem with nonlinear inequality constraints.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Pyomo.DOE: An open-source package for model-based design of experiments in Python

Predictive mathematical models are a cornerstone of science and engineering. Yet selecting, calibrating, and validating said science-based models often remains an art in practice. Model-based design of experiments (MBDoE) provides a systematic framework to maximize information gain from experiments while minimizing time and resource costs. But MBDoE remains limited to niche application areas, in part because practitioners must integrate expertise in statistics, computational optimization, and modeling. To help reduce this barrier, we introduce Pyomo.DOE, an open-source package for MBDoE. Pyomo.DOE uses a nonlinear sensitivity analysis code k_aug to quickly approximate the Fisher information matrix and leverages a new stochastic programming abstraction. We demonstrate Pyomo.DOE with the first application of MBDoE to fixed-bed breakthrough experiments, which highlights the power of Pyomo.DOE to quantify the value of experimental modifications a priori for large-scale partial differential-algebraic equation (PDAE) models. Here we also provide a mathematical primer on MBDoE targeted at general chemical engineers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2018

Optimal design of microtube recuperators for an indirect supercritical carbon dioxide recompression closed Brayton cycle

This paper presents a baseline design and optimization approach developed in Aspen Custom Modeler (ACM) for microtube shell-and-tube exchangers (MSTEs) used for high- and low-temperature recuperation in a 10 MWe indirect supercritical carbon dioxide (sCO 2 ) recompression closed Brayton cycle (RCBC). The MSTE-type recuperators are designed using one-dimensional models with thermal-hydraulic correlations appropriate for sCO 2 and properties models that capture considerable nonlinear changes in CO 2 properties near the critical and pseudo-critical points. Using the successive quadratic programming (SQP) algorithm in ACM, optimal recuperator designs are obtained for either custom or industry-standard microtubes considering constraints based on current advanced manufacturing techniques. The three decision variables are the number of tubes, tube pitch-to-diameter ratio, and tube diameter. Five different objective functions based on different key design measures are considered: minimization of total heat transfer area, heat exchanger volume, metal weight, thermal residence time, and maximization of compactness. Sensitivities studies indicate the constraint on the maximum number of tubes per shell does affect the number of parallel heat exchanger trains but not the tube selection, total number of tubes, tube length and other key design measures in the final optimal design when considering industry-standard tubes. In this study, the optimally designed high- and low-temperature recuperators have 47,000 3/32 inch tubes and 63,000 1/16 inch tubes, respectively. In addition, sensitivities to the design temperature approach and maximum allowable pressure drop are studied, since these specifications significantly impact the optimal design of the recuperators as well as the thermal efficiency and the economic performance of the entire sCO 2 Brayton cycle.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2019

Distributed Load Restoration in Unbalanced Active Distribution Systems

We present that the resilience of modern power systems has been constantly threatened by various natural disasters and manmade attacks. Under those threats, fast and automatic restoration actions are critical for restoring impacted systems to normal operating conditions and preventing from additional disastrous consequences. Smart grid technologies, such as distributed energy resources (DERs) and microgrids, provide both opportunities and challenges for distribution system restoration. In this paper, distributed load restoration (DLR), in unbalanced active distribution networks is developed using the alternating direction method of multipliers (ADMM) algorithm. The step-by-step restoration actions are provided to schedule the output of DERs and distribution system control devices, as well as the power consumption from transmission system restoration. The nonlinearities from three-phase unbalanced power flow and distribution components modeling are relaxed into a convex quadratic programming model. Then, the problem is decomposed into subproblems for each node by applying ADMM-DLR; and solves through each agent by exchanging limited information with neighboring nodes in an iterative procedure. The developed models and algorithms are validated and demonstrated through testing of the IEEE 13-node and 123-node test feeders. Lastly, simulation results demonstrate the effectiveness of restoring unbalanced distribution system with the hybrid bottom-up and top-down restoration strategies.

14 SOLAR ENERGY↗
DOE OSTI2018

A family of second-order fully explicit time integration schemes

A new family of fully explicit time integration methods is proposed, which has second-order accuracy for structures with and without damping. Using a diagonal mass matrix, the suggested scheme remains fully explicit not only for structures with a non-diagonal damping matrix, but also when the internal force vector is a nonlinear function of velocity. The present algorithm has an acceptable domain of stability, and it is self-starting. This technique introduces effectively numerical dissipation to suppress the high-frequency spurious modes, while at the same time the lower modes are not affected too much. In addition, numerical dispersion error of the scheme is considerably smaller than that of the central difference method. Solving several linear and nonlinear problems highlights the superior performance of the authors’ approach. Findings demonstrate that solution time for the suggested scheme is much less than that of the central difference technique. The related algorithm can be easily implemented into programs, which already contain the central difference method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Assessment of drug-induced arrhythmic risk using limit cycle and autocorrelation analysis of human iPSC-cardiomyocyte contractility

Cardiac safety assays incorporating label-free detection of human stem-cell derived cardiomyocyte contractility provide human relevance and medium throughput screening to assess compound-induced cardiotoxicity. In an effort to provide quantitative analysis of the large kinetic datasets resulting from these real-time studies, we applied bioinformatic approaches based on nonlinear dynamical system analysis, including limit cycle analysis and autocorrelation function, to systematically assess beat irregularity. The algorithms were integrated into a software program to seamlessly generate results for 96-well impedance-based data. Our approach was validated by analyzing dose- and time-dependent changes in beat patterns induced by known proarrhythmic compounds and screening a cardiotoxicity library to rank order compounds based on their proarrhythmic potential. We demonstrate a strong correlation for dose-dependent beat irregularity monitored by electrical impedance and quantified by autocorrelation analysis to traditional manual patch clamp potency values for hERG blockers. In addition, our platform identifies non-hERG blockers known to cause clinical arrhythmia. Our method provides a novel suite of medium-throughput quantitative tools for assessing compound effects on cardiac contractility and predicting compounds with potential proarrhythmia and may be applied to in vitro paradigms for pre-clinical cardiac safety evaluation. - Highlights: • Impedance-based monitoring of human iPSC-derived cardiomyocyte contractility • Limit cycle analysis of impedance data identifies aberrant oscillation patterns. • Nonlinear autocorrelation function quantifies beat irregularity. • Identification of hERG and non-hERG inhibitors with known risk of arrhythmia • Automated software processes limit cycle and autocorrelation analyses of 96w data.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2017

Single-particle dynamics in a nonlinear accelerator lattice: attaining a large tune spread with octupoles in IOTA

Fermilab is constructing the Integrable Optics Test Accelerator (IOTA) as the centerpiece of the Accelerator R&D Program towards high-intensity circular machines. One of the factors limiting the beam intensity in present circular accelerators is collective instabilities, which can be suppressed by a spread of betatron frequencies (tunes) through the Landau damping mechanism or by an external damper, if the instability is slow enough. The spread is usually created by octupole magnets, which introduce the tune dependence on the amplitude and, in some cases, by a chromatic spread (tune dependence on particle's momentum). The introduction of octupoles usually lead to a resonant behavior and a reduction of the dynamic aperture. One of the goals of the IOTA research program is to achieve a high betatron tune spread, while retaining a large dynamic aperture using conventional octupole magnets in a special but realistic accelerator configuration. In this report, we present results of computer simulations of an electron beam in the IOTA by particle tracking and the Frequency Map Analysis. The results show that the ring's octupole magnets can be configured to provide a betatron tune shift of 0.08 (for particles at large amplitudes) with the dynamical aperture of over 20 beam sigma for a 150-MeV electron beam. The influence of the synchrotron motion, lattice errors, and magnet imperfections is insignificant for the parameters and levels of tolerances set by the design of the ring. Here, the described octupole insert could be beneficial for suppression of space-charge induced instabilities in high intensity machines.

43 PARTICLE ACCELERATORS↗
DOE OSTI2020

Experimental Studies of Single Invariant Quasi-Integrable Nonlinear Optics at IOTA

The Integrable Optics Test Accelerator is a research electron and proton storage ring recently commissioned at the Fermilab Accelerator Science and Technology facility. Its research program is focused on testing novel techniques for improving beam stability and quality, notably the concept of non-linear integrable optics. In this paper, we report on run 1 results of experimental studies of a quasi-integrable transverse focusing system with one invariant of motion, a Henon-Heiles type system implemented with octupole magnets. Good agreement with simulations is demonstrated on key parameters of achievable tune spread, dynamic aperture, and invariant conservation. We also outline current simulation and hardware improvement efforts for run 2, planned for fall of 2019.

43 PARTICLE ACCELERATORS↗
DOE OSTI2023

Applying Quantum Computing to Simulate Power System Dynamics

Power system dynamics are generally modeled by high dimensional nonlinear differential-algebraic equations due to a large number of generators, loads, and transmission lines. Thus, its computational complexity grows exponentially with the system size. This paper demonstrates the potential use of quantum computing algorithms to model the power system dynamics. Leveraging a symbolic programming framework, we equivalently convert the power system dynamics’ differential algebraic equations (DAEs) into ordinary differential equations (ODEs), where the data of the state vector can be encoded into quantum computers via amplitude encoding. The system's nonlinearity is captured by Taylor polynomial expansion, the quantum state tensor, and Hamiltonian simulation, whereas state variables can be updated by a quantum linear equation solver. Our results show that quantum computing can simulate the dynamics of the power system with high accuracy, whereas its complexity is polynomial in the logarithm of the system dimension. Our work also illustrates the use of scientific machine learning tools for implementing scientific computing concepts, e.g., Taylor expansion, DAEs/ODEs transform, and quantum computing solver, in the field of power engineering.

Tran, Huynh↗
DOE OSTI2019

Pseudo-spectral method to control three-degree-of-freedom wave energy converters

The invention provides optimal control of a three-degree-of-freedom wave energy converter using a pseudo-spectral control method. The three modes are the heave, pitch and surge. A dynamic model is characterized by a coupling between the pitch and surge modes, while the heave is decoupled. The heave, however, excites the pitch motion through nonlinear parametric excitation in the pitch mode. The invention can use a Fourier series as basis functions to approximate the states and the control. For the parametric excited case, a sequential quadratic programming approach can be implemented to numerically solve for the optimal control. The numerical results show that the harvested energy from three modes is greater than three times the harvested energy from the heave mode alone. Moreover, the harvested energy using a control that accounts for the parametric excitation is significantly higher than the energy harvested when neglecting this nonlinear parametric excitation term.

Abdelkhalik, Ossama↗
DOE OSTI2021

Iterative Linearization for Phasor-Defined Optimal Power Dispatch

Optimal power flow (OPF) problems, which dispatch power targets to controllable generating units across a network, must generally account for non-convex constraints on power flow. Furthermore, adapting those problems so as to make them solvable with convex optimization techniques is an area of much academic and operational interest. In this paper, we present a method for solving OPF as a quadratic program by iteratively refining and re-initializing a linearized model of power flow based on the outputs of an associated nonlinear solver. The linear model on which we demonstrate this method is an adapted version of an approximation designed for use with unbalanced distribution networks. As an important benefit, the model allows for the explicit inclusion of nodal voltage phasor values in both the OPF problem's objective and its constraints, which opens the door to the idea of phasor-based control (PBC) design. We show in simulations on the IEEE 13-node test feeder that our method quickly converges to a set of phasor targets that are sufficiently precise for use in operations at the distribution level.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Towards reverse mode automatic differentiation of Kokkos-based codes

Derivative computation is a key component of optimization, sensitivity analysis, uncertainty quantification, and the solving of nonlinear problems. Automatic differentiation (AD) is a powerful technique for evaluating such derivatives, and in recent years, has been integrated into programming environments such as Jax, PyTorch, and TensorFlow to support derivative computations needed for training of machine learning models, facilitating wide-spread use of these technologies. The C++ language has become the de facto standard for scientific computing due to numerous factors, yet language complexity has made the wide-spread adoption of AD technologies for C++ difficult, hampering the incorporation of powerful differentiable programming approaches into C++ scientific simulations. This is exacerbated by the increasing emergence of architectures, such as GPUs, with limited memory capabilities and requiring massive thread-level concurrency. C++ AD tools must effectively use these environments to bring novel scientific simulations to next-generation DOE experimental and observational facilities. In this project, we investigated source transformation-based automatic differentiation using LLVM compiler infrastructure to automatically generate portable and efficient gradient computations of Kokkos-based code. We have demonstrated that our proposed strategy is feasible by investigating the usage of a prototype LLVM-based source transformation tool to generate gradients of simple functions made of sequences of simple Kokkos parallel regions. Speedups of up to 500x compared to Sacado were observed on NVIDIA V100 GPU.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Advanced Simulation Tools for Muon-Based Accelerators

The project developed new software tools incorporating the most accurate theoretical calculations and experimental data available for crucial and not-yet-considered physics processes specific to muon accelerators. These new tools were applied to modeling muon ionization cooling channels for a muon collider or a neutrino factory, the facilities that have the potential to discover and explore new exciting fundamental physics but require the development of demanding technologies and innovative concepts. G4beamline, COSY Infinity, and WARP computer codes are particularly well-suited for addressing muon accelerator modeling problems. G4beamline was chosen for its flexibility and modularity, and for being one of the de facto standard codes used by the muon accelerator community. COSY was selected for speed, ability to take into account high-order nonlinear effects essential for the large beams under consideration, and availability of built-in optimization tools. WARP was chosen for its space charge calculation capabilities, speed and flexibility of implementing new lattice elements such as RF cavities. This final technical report summarizes the efforts on implementing advanced new tools in these computer codes addressing the shortcomings in modeling muon physics processes and using these tools to model muon ionization cooling channels.

43 PARTICLE ACCELERATORS↗
DOE OSTI2023

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↗
DOE OSTI2019

SUNDIALS Multiphysics+MPIManyVector Performance Testing

In this report we document performance test results on a SUNDIALS-based multiphysics demonstration application. We aim to assess the large-scale parallel performance of new capabilities that have been added to the SUNDIALS suite of time integrators and nonlinear solvers in recent years under funding from both the Exascale Computing Project (ECP) and the Scientific Discovery through Advanced Scientific (SciDAC) program, specifically: 1. SUNDIALS’ new MPIManyVector module, that allows extreme flexibility in how a solution "vector" is staged on computational resources. 2. ARKode’s new multirate integration module, MRIStep, allowing high-order accurate calculations that subcycle "fast" processes within "slow" ones. 3. SUNDIALS’ new flexible linear solver interfaces, that allow streamlined specification of problem-specific linear solvers. 4. SUNDIALS’ new N_Vector additions of "fused" vector operations (to increase arithmetic intensity) and separation of reduction operations into "local" and "global" versions (to reduce latency by combining multiple reductions into a single MPI_Allreduce call). We anticipate that subsequent reports will extend this work to investigate a variety of other new features, including SUNDIALS’ generic SUNNonlinearSolver interface and accelerator-enabled N Vector modules, and upcoming MRIStep extensions to support custom "fast" integrators (that leverage problem structure) and IMEX integration of the "slow" time scale (to add diffusion).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Riemannian Optimization Applied to AC Optimal Power Flow

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. This is done by using the Julia programming language and the Julia packages PowerModels.jl and Manopt.jl.

AC optimal power flow↗