Search NASA⌕ Search

SEARCH · Search NASA

Results for “nonlinear problems”

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

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.13 User's Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a user’s manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.15 User's Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Theory Manual (V.6.15)

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis (V.6.16 User's Manual)

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a user's manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.16 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota’s iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Hybrid AI/ML and Computational Mechanics Based Approach for Time-Series State and Fatigue Life Estimation of Nuclear Reactor Components

Environmental fatigue modeling is a complex problem due to multiple failure modes and their intermixing. The failure modes are function of various underlying causes in addition to the corrosive effect of reactor coolant environment. Some of the major causes are time-dependence of material associated with cyclic loading, load sequence effect associated with random/variable amplitude loading, effect of strain amplitude and rates, effect of varying temperature (along both temporal and spatial directions) and the effect of mean strain and stress. The nonlinear intermixing of failure modes associated with above mentioned causing parameters makes the environmental fatigue modeling is a challenging task. Because of this challenge, fatigue is traditionally being modeled based on experimental data. However, test based empirical approach often requires hundreds of fatigue tests to model the above-mentioned intermixing failure causes even for a single material system. The problem is further exaggerated for reactor component made from multi-material systems such as made from both carbon and stainless-steel base metals and their similar and dissimilar metal welds. With the difficulty of conducting hundreds of fatigue tests to capture the above-mentioned intermixing failure causes, fatigue modeling approaches often depends on empirical models based on limited available test data such as available through ASME code and NUREG 6909. However, these limited test-data-based models may not be enough to accurately predict the life of reactor components. Accurate prediction of life of reactor component would become a necessity, particularly when the license of the reactors to be extended for long-term-operation (LTO) that is for well beyond its original design life of 40 years. The requirement of extending the license of reactor under LTO requires hundreds of fatigue tests to be conducted to understand the mechanism associated with the above-mentioned interdependent failure causes. However, conducting large number of fatigue tests is not a feasibility due to the cost involved. To address this issues Argonne National Laboratory (ANL) with the sponsorship of DOE Light Water Reactor Sustainability (LWRS) program trying to develop a hybrid predictive modeling approach. This is based on limited experiment-data, Artificial-intelligence (AI) – Machine-Learning (ML) - Deep-Learning (DL) based techniques and Multiphysics-computational-mechanics based modeling tools. The hybrid approach not-only can improve the accuracy of the existing stress analysis and fatigue modeling approach but also can reduce the over-dependency on test-based approach. Towards this goal following are some of the major contributions based on ANL’s FY-20 environmental fatigue modeling activities: 1) A cyclic plasticity material model database for 82/182 dissimilar metal weld, which can be readily shared with US nuclear industry and regulatory agency on request. 2) A well validated analytical modeling methodology to perform cycle-by-cycle stress prediction under both constant amplitude fatigue loading and variable amplitude fatigue loading (with load-sequence effect). 3) An AI/ML/DL based methodology to predict unmeasurable cyclic strain based on other available sensor signals. This type of approach can be used for estimating strain in real reactor components from other sensor readings. 4) An AI/ML based approach to improve the US capability on environmental fatigue testing. This is by improving ANL’s existing environmental fatigue testing capacity to conduct ASME required strain-controlled tests (by controlling strain amplitudes and its rate), while not measuring the strain (due to the difficulty of placing an extensometer in a narrow autoclave in a PWR-water-test system). 5) A simulation and experiment based probabilistic modeling methodology for time-series fatigue state and life estimation of reactor metal such as dissimilar metal weld.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Polyhedral Relaxations for Optimal Pump Scheduling of Potable Water Distribution Networks

The classic pump scheduling or optimal water flow (OWF) problem for water distribution networks (WDNs) minimizes the cost of power consumption for a given WDN over a fixed time horizon. In its exact form, the OWF is a computationally challenging mixed-integer nonlinear program (MINLP). It is complicated by nonlinear equality constraints that model network physics, discrete variables that model operational controls, and intertemporal constraints that model changes to storage devices. To address the computational challenges of the OWF, this paper develops tight polyhedral relaxations of the original MINLP, derives novel valid inequalities (or cuts) using duality theory, and implements novel optimization-based bound tightening and cut generation procedures. The efficacy of each new method is rigorously evaluated by measuring empirical improvements in OWF primal and dual bounds over 45 literature instances. The evaluation suggests that our relaxation improvements, model strengthening techniques, and a thoughtfully selected polyhedral relaxation partitioning scheme can substantially improve OWF primal and dual bounds, especially when compared with similar relaxation-based techniques that do not leverage these new methods.

bound tightening↗
DOE OSTI2022

Turbulent Regimes in Collisions of 3D Alfvén-wave Packets

Using three-dimensional gyrofluid simulations, we revisit the problem of Alfvén-wave (AW) collisions as building blocks of the Alfvénic turbulent cascade and their interplay with magnetic reconnection at magnetohydrodynamic (MHD) scales. Depending on the large-scale value of the nonlinearity parameter χ 0 (the ratio between the AW linear propagation time and nonlinear turnover time), different regimes are observed. For strong nonlinearities (χ 0 ~ 1), turbulence is consistent with a dynamically aligned, critically balanced cascade—fluctuations exhibit a scale-dependent alignment $\sin {\theta }_{{k}_{\perp }}\propto {k}_{\perp }^{-1/4}$, resulting in a ${k}_{\perp }^{-3/2}$ spectrum and ${k}_{\parallel }\propto {k}_{\perp }^{1/2}$ spectral anisotropy. At weaker nonlinearities (small χ 0 ), a spectral break marking the transition between a large-scale weak regime and a small-scale ${k}_{\perp }^{-11/5}$ tearing-mediated range emerges, implying that dynamic alignment occurs also for weak nonlinearities. At χ 0 < 1 the alignment angle ${\theta }_{{k}_{\perp }}$ shows a stronger scale dependence than in the χ 0 ~ 1 regime, namely $\sin {\theta }_{{k}_{\perp }}\propto {k}_{\perp }^{-1/2}$ at χ 0 ~ 0.5, and $\sin {\theta }_{{k}_{\perp }}\propto {k}_{\perp }^{-1}$ at χ 0 ~ 0.1. Dynamic alignment in the weak regime also modifies the large-scale spectrum, scaling approximately as ${k}_{\perp }^{-3/2}$ for χ 0 ~ 0.5 and as ${k}_{\perp }^{-1}$ for χ 0 ~ 0.1. A phenomenological theory of dynamically aligned turbulence at weak nonlinearities that can explain these spectra and the transition to the tearing-mediated regime is provided; at small χ 0 , the strong scale dependence of the alignment angle combines with the increased lifetime of turbulent eddies to allow tearing to onset and mediate the cascade at scales that can be larger than those predicted for a critically balanced cascade by several orders of magnitude. Such a transition to tearing-mediated turbulence may even supplant the usual weak-to-strong transition.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

D2NO: Efficient handling of heterogeneous input function spaces with distributed deep neural operators

Neural operators have been applied in various scientific fields, such as solving parametric partial differential equations, dynamical systems with control, and inverse problems. However, challenges arise when dealing with input functions that exhibit heterogeneous properties, requiring multiple sensors to handle functions with minimal regularity. To address this issue, discretization-invariant neural operators have been used, allowing the sampling of diverse input functions with different sensor locations. However, existing frameworks still require an equal number of sensors for all functions. We propose a novel distributed approach to further relax the discretization requirements and solve the heterogeneous dataset challenges. Our method involves partitioning the input function space and processing individual input functions using independent and separate neural networks. A centralized neural network is used to handle shared information across all output functions. This distributed methodology reduces the number of gradient descent back-propagation steps, improving efficiency while maintaining accuracy. Here, we demonstrate that the corresponding neural network is a universal approximator of continuous nonlinear operators and present three numerical examples to validate its performance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Multi-fidelity Bayesian neural networks: Algorithms and applications

Here we propose a new class of Bayesian neural networks (BNNs) that can be trained using noisy data of variable fidelity, and we apply them to learn function approximations as well as to solve inverse problems based on partial differential equations (PDEs). These multi-fidelity BNNs consist of three neural networks: The first is a fully connected neural network, which is trained following the maximum a posteriori probability (MAP) method to fit the low-fidelity data; the second is a Bayesian neural network employed to capture the cross-correlation with uncertainty quantification between the low- and high-fidelity data; and the last one is the physics-informed neural network, which encodes the physical laws described by PDEs. For the training of the last two neural networks, we first employ the mean-field variational inference (VI) to maximize the evidence lower bound (ELBO) to obtain informative prior distributions for the hyperparameters in the BNNs, and subsequently we use the Hamiltonian Monte Carlo (HMC) method to estimate accurately the posterior distributions for the corresponding hyperparameters. We demonstrate the accuracy of the present method using synthetic data as well as real measurements. Specifically, we first approximate a one- and four-dimensional function, and then infer the reaction rates in one- and two-dimensional diffusion-reaction systems. Moreover, we infer the sea surface temperature (SST) in the Massachusetts and Cape Cod Bays using satellite images and in-situ measurements. Taken together, our results demonstrate that the present method can capture both linear and nonlinear correlation between the low- and high-fidelity data adaptively, identify unknown parameters in PDEs, and quantify uncertainties in predictions, given a few scattered noisy high-fidelity data. Finally, we demonstrate that we can effectively and efficiently reduce the uncertainties and hence enhance the prediction accuracy with an active learning approach, using as examples a specific one-dimensional function approximation and an inverse PDE problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

An augmented Lagrangian filter method

Here, we introduce a filter mechanism to enforce convergence for augmented Lagrangian methods for nonlinear programming. In contrast to traditional augmented Lagrangian methods, our approach does not require the use of forcing sequences that drive the first-order error to zero. Instead, we employ a filter to drive the optimality measures to zero. Our algorithm is flexible in the sense that it allows for equality-constrained quadratic programming steps to accelerate local convergence. We also include a feasibility restoration phase that allows fast detection of infeasible problems. We provide a convergence proof that shows that our algorithm converges to first-order stationary points. We provide preliminary numerical results that demonstrate the effectiveness of our proposed method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Optimizing the fuel efficiency of an opposed piston engine for electric power generation

This paper investigates the optimal crankshaft motion for an opposed piston (OP) engine in a novel hybrid architecture to maximize fuel efficiency. The OP engine was selected for this work due to its inherent thermodynamic benefits and the balanced nature of the engine which can achieve downsizing through reducing the number of cylinders rather than the individual cylinder volume. The typical geartrain required on an OP engine was exchanged for two electric motors, reducing friction loss and decoupling the crankshafts. Using the motors to control the crankshaft motion profiles, this architecture introduces capabilities to dynamically vary compression ratio, combustion volume, and scavenging dynamics. To leverage these opportunities, an optimization scheme was developed utilizing nonlinear optimization of a 0-D model to compute the crankshaft motion profile that maximizes the work generated by the system. This optimization was then iteratively coupled with a high fidelity model which supplies the cylinder flow boundary conditions. This iterative approach reduces the model complexity used in the optimal control problem (OCP) while capturing the gas exchange dynamics critical to the 2-stroke cycle of the OP engine. By using the rate of change of motor torque as the input to the OCP, the torque fluctuation in a single cycle can be limited to ensure tracking feasibility. The results show crankshaft velocity slows during the compression stroke and conversely accelerates during the expansion stroke, reducing the peak motor torque required for control and thus reducing the motor losses. The extended residence time at top dead center, however, leads to an increase in heat transfer, illustrating the trade-off between the work extraction efficiency and the indicated engine efficiency.

Engineering↗
DOE OSTI2021

Reconstructing magnetic deflections from sets of proton images using differential evolution

Proton imaging is a powerful technique for imaging electromagnetic fields within an experimental volume, in which spatial variations in proton fluence are a result of deflections to proton trajectories due to interaction with the fields. When deflections are large, proton trajectories can overlap, and this nonlinearity creates regions of greatly increased proton fluence on the image, known as caustics. The formation of caustics has been a persistent barrier to reconstructing the underlying fields from proton images. We have developed a new method for reconstructing the path-integrated magnetic fields, which begins to address the problem posed by caustics. Our method uses multiple proton images of the same object, each image at a different energy, to fill in the information gaps and provide some uniqueness when reconstructing caustic features. We use a differential evolution algorithm to iteratively estimate the underlying deflection function, which accurately reproduces the observed proton fluence at multiple proton energies simultaneously. We test this reconstruction method using synthetic proton images generated for three different, cylindrically symmetric field geometries at various field amplitudes and levels of proton statistics and present reconstruction results from a set of experimental images. Here, the method we propose requires no assumption of deflection linearity and can reliably solve for fields underlying linear, nonlinear, and caustic proton image features for the selected geometries and is shown to be fairly robust to noise in the input proton intensity.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Evaluating the demand response potential of ammonia plants

Demand-side management/demand response (DSM/DR) are key strategies for mitigating the inherent variability in electricity generation rates by renewable sources. This article represents—to our knowledge—the first foray into assessing the DR potential of ammonia plants. Ammonia plants are interesting candidates for DR initiatives because of their significant electricity use (for operating compressors driving the synthesis loop) and the ability to store the ammonia product relatively easily and safely. Our approach is based on formulating and solving an optimal DR scheduling problem for an ammonia plant while accounting for the process dynamics. To this end, we introduce a new Hammerstein–Wiener-inspired modeling framework based on injecting linear dynamics in a first-principles static nonlinear model of the process. The results are encouraging; for the cases considered, peak-time power consumption decreases between 3.57% and 7.40%, coupled with 1.39% to 3.70% reductions in operating cost.

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

A learning-augmented approach for AC optimal power flow

Because of the high nonlinearity of AC optimal power flow (OPF), numerous efforts have been made in recent decades to find efficient methods. Machine learning (ML) has proven to significantly reduce the computational costs in many real-world problems. Thus, this paper develops a learning-augmented method for solving AC OPF, which integrates both power network equations and ML to yield near-optimal solutions. More specifically, ML models are developed to first predict bus voltage magnitudes and angles. Then, physics-based network equations are employed to calculate the power injection at different buses. Three ML algorithms, i.e., random forest, multi-target decision tree, and extreme learning machine, are explored and compared. To evaluate the efficiency of the proposed learning-augmented AC OPF solver, the MATPOWER Interior Point Solver is adopted as a baseline. Case studies on both 500-bus and 4918-bus test networks show that the proposed learning-augmented method has reduced the computational time by 15–100 times depending on the network size with a minimal loss in optimality.

42 ENGINEERING↗
DOE OSTI2024

Optimal experimental design: Formulations and computations

Questions of ‘how best to acquire data’ are essential to modelling and prediction in the natural and social sciences, engineering applications, and beyond. Optimal experimental design (OED) formalizes these questions and creates computational methods to answer them. This article presents a systematic survey of modern OED, from its foundations in classical design theory to current research involving OED for complex models. We begin by reviewing criteria used to formulate an OED problem and thus to encode the goal of performing an experiment. We emphasize the flexibility of the Bayesian and decision-theoretic approach, which encompasses information-based criteria that are well-suited to nonlinear and non-Gaussian statistical models. We then discuss methods for estimating or bounding the values of these design criteria; this endeavour can be quite challenging due to strong nonlinearities, high parameter dimension, large per-sample costs, or settings where the model is implicit. A complementary set of computational issues involves optimization methods used to find a design; we discuss such methods in the discrete (combinatorial) setting of observation selection and in settings where an exact design can be continuously parametrized. Finally we present emerging methods for sequential OED that build non-myopic design policies, rather than explicit designs; these methods naturally adapt to the outcomes of past experiments in proposing new experiments, while seeking coordination among all experiments to be performed. Throughout, we highlight important open questions and challenges.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A Hierarchical OPF Algorithm with Improved Gradient Evaluation in Three-Phase Networks

Linear approximation commonly used in solving alternating-current optimal power flow (AC-OPF) simplifies the system models but incurs accumulated voltage errors in large power networks. Such errors will make the primal-dual type gradient algorithms converge to solutions with voltage violation. In this paper, we improve a recent hierarchical OPF algorithm that rested on primal-dual gradients evaluated with a linearized distribution power flow model. Specifically, we propose a more accurate gradient evaluation method based on an unbalanced three-phase nonlinear distribution power flow model to mitigate the errors arising from linearization. The resultant gradients feature a blocked structure that enables our development of an improved hierarchical primal-dual algorithm to solve the OPF problem. Numerical results on the IEEE 123-bus test feeder and a 4,518-node test feeder show that the proposed method can enhance voltage safety at comparable computational efficiency with the linearized algorithm.

approximation algorithms↗
DOE OSTI2025

Learning Physically Interpretable Atmospheric Models From Data With WSINDy

The multiscale and turbulent nature of Earth's atmosphere has historically rendered accurate weather modeling a hard problem. Recently, there has been an explosion of interest surrounding data-driven approaches to weather modeling, which in many cases show improved forecasting accuracy and computational efficiency when compared to traditional methods. However, many of the current data-driven approaches employ highly parameterized neural networks, often resulting in uninterpretable models and limited gains in scientific understanding. In this work, we address the interpretability problem by explicitly discovering partial differential equations governing atmospheric phenomena, identifying symbolic mathematical models with direct physical interpretations. The purpose of this paper is to demonstrate that, in particular, the weak-form sparse identification of nonlinear dynamics (WSINDy) algorithm can learn effective atmospheric models from both simulated and assimilated data. Our approach adapts the standard WSINDy algorithm to work with high-dimensional fluid data of arbitrary spatial dimension.

58 GEOSCIENCES↗