Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 433 records · Page 24

Time-series forecasting using manifold learning, radial basis function interpolation, and geometric harmonics

We address a three-tier numerical framework based on nonlinear manifold learning for the forecasting of high-dimensional time series, relaxing the “curse of dimensionality” related to the training phase of surrogate/machine learning models. At the first step, we embed the high-dimensional time series into a reduced low-dimensional space using nonlinear manifold learning (local linear embedding and parsimonious diffusion maps). Then, we construct reduced-order surrogate models on the manifold (here, for our illustrations, we used multivariate autoregressive and Gaussian process regression models) to forecast the embedded dynamics. Finally, we solve the pre-image problem, thus lifting the embedded time series back to the original high-dimensional space using radial basis function interpolation and geometric harmonics. The proposed numerical data-driven scheme can also be applied as a reduced-order model procedure for the numerical solution/propagation of the (transient) dynamics of partial differential equations (PDEs). In conclusion, we assess the performance of the proposed scheme via three different families of problems: (a) the forecasting of synthetic time series generated by three simplistic linear and weakly nonlinear stochastic models resembling electroencephalography signals, (b) the prediction/propagation of the solution profiles of a linear parabolic PDE and the Brusselator model (a set of two nonlinear parabolic PDEs), and (c) the forecasting of a real-world data set containing daily time series of ten key foreign exchange rates spanning the time period 3 September 2001–29 October 2020.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient kinetic thermal inverse modeling for organic material decomposition

The prevalent use of organic materials in manufacturing is a fire safety concern, and motivates the need for predictive thermal decomposition models. A critical component of predictive modeling is numerical inference of kinetic parameters from bench scale data. Currently, an active area of computational pyrolysis research focuses on identifying efficient, robust methods for optimization. This paper demonstrates that kinetic parameter calibration problems can successfully be solved using classical gradient-based optimization. We explore calibration examples that exhibit characteristics of concern: high nonlinearity, high dimensionality, complicated schemes, overlapping reactions, noisy data, and poor initial guesses. The examples demonstrate that a simple, non-invasive change to the problem formulation can simultaneously avoid local minima, avoid computation of derivative matrices, achieve a computational efficiency speedup of 10x, and make optimization robust to perturbations of parameter components. Techniques from the mathematical optimization and inverse problem communities are employed. By re-examining gradient-based algorithms, we highlight opportunities to develop kinetic parameter calibration methods that should outperform current methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On relaxations of the max k -cut problem formulations

Here, a tight continuous relaxation is a crucial factor in solving mixed integer formulations of many NP-hard combinatorial optimization problems. The (weighted) max k-cut problem is a fundamental combinatorial optimization problem with multiple notorious mixed integer optimization formulations. In this paper, we explore four existing mixed integer optimization formulations of the max k-cut problem. Specifically, we show that the continuous relaxation of a binary quadratic optimization formulation of the problem is: (i) stronger than the continuous relaxation of two mixed integer linear optimization formulations and (ii) at least as strong as the continuous relaxation of a mixed integer semidefinite optimization formulation. We also conduct a set of experiments on multiple sets of instances of the max k-cut problem using state-of-the-art solvers that empirically confirm the theoretical results in item (i). Furthermore, these numerical results illustrate the advances in the efficiency of global non-convex quadratic optimization solvers and more general mixed integer nonlinear optimization solvers. As a result, these solvers provide a promising option to solve combinatorial optimization problems. Our codes and data are available on GitHub.

97 MATHEMATICS AND COMPUTING↗

Modal analysis of the behavior of inertial particles in turbulence subjected to Stokes drag

The clustering of small heavy inertial particles subjected to Stokes drag in turbulence, which is the concern of present study, is known to be minimal at small and large Stokes number and substantial at St = $\textit{O}$(1). This nonmonotonic trend, which has been shown computationally and experimentally, is yet to be explained analytically. In this study, we obtain an analytical expression for the Lyapunov exponents that quantitatively predicts this trend. The sum of the exponents, which is the normalized rate of change of the signed volume of a small cloud of particles, is correctly predicted to be negative and positive at small and large Stokes numbers, respectively, asymptoting to $\textit{τQ}$ as $\textit{τ}$ → 0 and $τ^{–1/2}|Q|^{1/4}$ as $\textit{τ} → ∞$, where $\textit{τ}$ is the particle relaxation time and $\textit{Q(τ)}$ is the difference between the norm of the rotation- and strain-rate tensors computed along the particle trajectory, which remains negative at all $\textit{τ}$ in turbulent flows. Additionally, the trajectory crossing is predicted only in hyperbolic flows where Q < 0 for sufficiently inertial particles with a $\textit{τ}$ that scales with $|Q|^{–1/2}$. Following the onset of crossovers, a transition from clustering to dispersion is predicted correctly. We show these behaviors are not unique to three-dimensional isotropic turbulence and can be reproduced closely by a one-dimensional mono-harmonic flow, which appears as a fundamental canonical problem in the study of particle clustering. Analysis of this one-dimensional canonical flow shows that the rate of clustering, quantified as the product of the Lyapunov exponent and particle relaxation time, is bounded by –1/2, behaving with extreme nonlinearity in the hyperbolic flows and always remaining positive in the elliptic flows. Finally, this model problem also confirms that dispersion in a hyperbolic flow will occur only if particles' trajectory cross. These findings, which stem from our analysis, are corroborated by the direct numerical simulations.

42 ENGINEERING↗

Scalable Techniques for Stochastic Power Flow Problems (Final Report)

The proposed research focuses on developing scalable algorithms for two-stage security-constrained OPF problems with AC power flow constraints, a class of problems complicated by (i) scale arising from a scenario representation; and (ii) the presence of nonlinearity, nonconvexity, and possibly second-stage discreteness or complementarity. Unfortunately, most existing solvers cannot contend with both challenges simultaneously; accordingly, the proposed research focuses on developing solution techniques that can both scale with the number of scenarios and contend with nonconvexity and second-stage complementarity. We consider three avenues for addressing such problems: (i) Variable sample-size SQP (VS-SQP) methods that combine sparse Quasi-Newton updates with a scalable variance-reduced stochastic gradient scheme for stochastic QP subproblems, allowing for contending with second-stage complementarity via regularization; (ii) Variable sample-size stochastic Interior-point (VS-sIP) schemes that propose a sampling-based regularized (to allow for contending with complementarity) interior-point schemes in which a Schur-complement technique is employed for decomposing the Newton direction computation step; (iii) Variable sample-size tractable ADMM (VS-tADMM) schemes combine variable sample-sizes with carefully designed techniques for resolving each of the nonconvex updates (by leveraging the QCQP structures). We intend to compare the three schemes using performance profiles in terms of solution quality, scalability, etc. and then select one scheme which will then be developed and further refined in Python for purposes of the GO competition.

42 ENGINEERING↗

Extremized nonlinear and linearized responses in soft metamaterials enabled by gradient-based design and grayscale digital light processing

In this study, we develop a gradient-based design approach that exploits grayscale digital light processing (DLP) 3D printing for extremizing the nonlinear and linearized response of soft metamaterials — materials that harness engineered geometric instabilities to undergo large and programmable changes in configuration. Grayscale DLP approaches modulate local mechanical properties at the pixel scale by tuning the light intensity within a single grayscale image, unlocking an exceptionally large design space. To effectively navigate this space, we develop smooth mappings between local light intensity values and global quantities of interest that characterize the behavior of soft metamaterials. Enabling these smooth mappings are robust and differentiable nonlinear finite element simulations powered by a trust region solver. A PDE-constrained optimization problem is then solved to invert these mappings and produce light intensity distributions that endow the printed part with varying stiffness and flexibility in distinctive regions. It is shown that optimizing the distribution of soft and stiff phases throughout a metamaterial structure results in markedly different buckling and self-contact configurations to drive extremized nonlinear compression and linearized vibration responses. Optimized light intensity distributions are translated to grayscale images and directly used to print soft metamaterial samples, showing remarkable agreement between the buckling and self-contact response in simulated and measured deformed configurations.

Additive manufacturing↗

On parallel laser beam merger in plasmas

Self-focusing instability is a well-known phenomenon of nonlinear optics, which is of great importance in the field of laser–plasma interactions. Self-focusing instability leads to beam focusing and, consequently, breakup into multiple laser filaments. The majority of applications tend to avoid a laser filamentation regime due to its detrimental role on laser spot profile and peak intensity. In our work, using nonlinear Schrödinger equation solver and particle-in-cell simulations, we address the problem of interaction of multiple parallel beams in plasmas. We consider both non-relativistic and moderately relativistic regimes and demonstrate how the physics of parallel beam interaction transitions from the familiar self- and mutual-focusing instabilities in the non-relativistic regime to a moderately relativistic regime, where an analytical description of filament interaction is not available.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Generative Adversarial Networks and Mixture Density Networks-Based Inverse Modeling for Microstructural Materials Design

Abstract There are two broad modeling paradigms in scientific applications: forward and inverse. While forward modeling estimates the observations based on known causes, inverse modeling attempts to infer the causes given the observations. Inverse problems are usually more critical as well as difficult in scientific applications as they seek to explore the causes that cannot be directly observed. Inverse problems are used extensively in various scientific fields, such as geophysics, health care and materials science. Exploring the relationships from properties to microstructures is one of the inverse problems in material science. It is challenging to solve the microstructure discovery inverse problem, because it usually needs to learn a one-to-many nonlinear mapping. Given a target property, there are multiple different microstructures that exhibit the target property, and their discovery also requires significant computing time. Further, microstructure discovery becomes even more difficult because the dimension of properties (input) is much lower than that of microstructures (output). In this work, we propose a framework consisting of generative adversarial networks and mixture density networks for inverse modeling of structure–property linkages in materials, i.e., microstructure discovery for a given property. The results demonstrate that compared to baseline methods, the proposed framework can overcome the above-mentioned challenges and discover multiple promising solutions in an efficient manner.

36 MATERIALS SCIENCE↗

A Full-Induction Magnetohydrodynamics Solver for Liquid Metal Fusion Blankets in Vertex-CFD

Multiphysics modeling of liquid metal fusion blankets, which produce tritium and convert energy of neutrons created via fusion reactions into heat, is crucial for predicting performance, ensuring structural integrity, and optimizing energy production. While traditional blanket modeling of liquid metal flows during normal steady operating conditions commonly employs the inductionless approximation of the magnetohydrodynamics (MHD) equations, transient scenarios, when the plasma-confining magnetic field varies on millisecond time scales, require a full-induction MHD approach that dynamically evolves the magnetic field via the time-dependent induction equation. This paper presents the formulation, implementation, and initial verification of a full-induction MHD solver integrated within the open-source Vertex-CFD framework, which aims to achieve tight multiphysics coupling, a flexible software design enabling easy extension and addition of physics models, and performance portability across computing platforms. The solver utilizes finite element spatial discretization, implicit Runge–Kutta time integration, and an inexact Newton method to solve the resulting discrete nonlinear system, leveraging Trilinos packages for efficient computation. Verification against selected benchmark problems demonstrates accuracy and robustness of the solver. Furthermore, when the solver is applied to an idealized blanket model in 2.5D and full 3D, results obtained with Vertex-CFD are in good agreement with recently published quasi-2D simulations. These findings establish a computational foundation for future simulations of transient MHD phenomena in liquid metal blankets with Vertex-CFD, and open avenues for future extensions and performance optimizations.

Endeve, Eirik [ORNL] (ORCID:0000000312519507)↗

Vibrational sum frequency generation spectroscopy reveals the inertness of chromium oxide (001) surfaces

Nanoengineered metal oxides such as Cr(III)-oxide (chromia) films have diverse potential applications in corrosion inhibition, remediation, energy generation, catalysis, data storage, and biological and environmental systems. Concerns about material degradation or oxidation to toxic chromate necessitate an understanding of chromia/aqueous interfaces, beginning with their hydroxylation and hydration behavior. Vibrational sum-frequency generation spectroscopy (vSFG) provides specific molecular-level information about water at the oxide/aqueous junction with high surface selectivity. To overcome the strong absorber problem typical of certain metal oxides in the UV–visible range during nonlinear optical studies, we employed molecular beam epitaxy to deposit transparent, epitaxial nanofilms of Cr 2 O 3 with (001) crystalline orientation on sapphire (Al 2 O 3 (001)) substrates, as confirmed by atomic force microscopy and X-ray diffraction. vSFG spectra of the air and water interfaces of the Cr 2 O 3 (001) films reveal hydroxyl features corresponding to both dissociated and molecular water on the surface. In contrast to the dangling hydroxyls found on the bare Al 2 O 3 (001) substrate, the hydroxyl groups on the deposited Cr 2 O 3 (001) nanofilm do not readily undergo isotopic H/D exchange when exposed to varying forms of D 2 O under ambient conditions. When considering the chemistries of the corresponding trivalent cations in aqueous solution, the finding is at variance with their similar acidities and proton exchange dynamics but consistent with markedly slower inner-sphere water ligand exchange of hexaquo Cr 3+ . This finding challenges the idea that proton and water exchange at the water/Cr₂O₃(001) interface are solely correlated, driven by the strength of metal-bridging oxygen bonds and surface hydroxyl distribution, without direct causation.

Boamah-Agyemang, Mavis D. [Pacific Northwest Natio↗

An efficient explicit implementation of a near-optimal quantum algorithm for simulating linear dissipative differential equations

We propose an efficient block-encoding technique for the implementation of the Linear Combination of Hamiltonian Simulations (LCHS) for simulating dissipative initial-value problems. This algorithm approximates a target nonunitary operator as a weighted sum of Hamiltonian evolutions, thereby emulating a dissipative problem by mixing various time scales. We introduce an efficient encoding of the LCHS into a quantum circuit based on a simple coordinate transformation that turns the dependence on the summation index into a trigonometric function. Classically, this method is equivalent to the use of a highly accurate Fejér-Clenshaw-Curtis quadrature formula. Quantumly, this significantly simplifies block-encoding of a dissipative problem and allows one to perform an exponential number of Hamiltonian simulations by a single Quantum Signal Processing (QSP) circuit. The resulting LCHS circuit has high success probability and the selector scales logarithmically with the number of terms in the LCHS sum and linearly with time. Careful analysis of error convergence proves that this method is more efficient than other LCHS circuits that have recently appeared in the literature. We verify the quantum circuit and its scaling by simulating it on a digital emulator of fault-tolerant quantum computers and, as a test problem, solve the advection-diffusion equation. The proposed algorithm can be used for simulating a wide class of nonunitary initial-value problems including the Liouville equation with added dissipation and linear embeddings of nonlinear systems, such as the Koopman-von Neumann and Carleman embeddings.

Novikau, I [Lawrence Livermore National Laboratory↗

2-D soil zymography: Accounting for the spatial variation of pH

Soil zymography is commonly used to quantify spatial distribution of hydrolytic enzyme activities on soil and plant root surfaces. It is recommended to adjust pH in zymography substrates and calibration solutions with respect to soil/root pH. However, pH values may vary greatly within a few mm of plant rhizosphere, potentially altering the distribution of pH in zymography membranes. Despite the fact that the effect of pH on the calibration of zymography membranes is generally known, its potential impact on zymography results is unaccounted for in processing zymography images and calculations of enzyme activity. In this study we assessed the effect of pH variations on the persistency of the methylumbelliferone (MUF) calibration. The studied pH values ranged from 4.5 to 7.5. The MUF calibration curves greatly deviated from that at a reference pH of 6.5, with a marked nonlinear increase of deviation with greater membrane brightness. We suggest that the problem can be partially alleviated by reducing the membrane incubation time. However, such deviations suggest the need for a more comprehensive resolution via mapping pH and using pH-specific calibrations to process zymography images. Here, we developed a MATLAB code to implement a pixel-based correction of enzyme activity for pH in processing time-lapse zymography images.

59 BASIC BIOLOGICAL SCIENCES↗

Superconvergence of Online Optimization for Model Predictive Control

We develop a one-Newton-step-per-horizon, online, lag-L, model predictive control (MPC) algorithm for solving discrete-time, equality-constrained, nonlinear dynamic programs. Based on recent sensitivity analysis results for the target problems class, we prove that the approach exhibits a behavior that we call superconvergence; that is, the tracking error with respect to the full horizon solution is not only stable for successive horizon shifts, but also decreases with increasing shift order to a minimum value that decays exponentially in the length of the receding horizon. The key analytical step is the decomposition of the one-step error recursion of our algorithm into algorithmic error and perturbation error. We show that the perturbation error decays exponentially with the lag between two consecutive receding horizons, while the algorithmic error, determined by Newton’s method, achieves quadratic convergence instead. Overall this approach induces our local exponential convergence result in terms of the receding horizon length for suitable values of L. In conclusion, numerical experiments validate our theoretical findings.

97 MATHEMATICS AND COMPUTING↗

The Computational Capacity of Mem-LRC Reservoirs

Reservoir computing has a emerged as a powerful tool in data-driven time series analysis. The possibility of utilizing hardware reservoirs as specialized co-processors has generated interest in the properties of electronic reservoirs, especially those based on memristors as the nonlinearity of these devices should translate to an improved nonlinear computational capacity of the reservoir. However, designing these reservoirs requires a detailed understanding of how memristive networks process information which has thus far been lacking. In this work, we derive an equation for general memristor-inductor-resistor-capacitor (MEM-LRC) reservoirs that includes all network and dynamical constraints explicitly. Utilizing this we undertake a study of the computational capacity of these reservoirs. We demonstrate that hardware reservoirs may be constructed with extensive memory capacity and that the presence of memristors enacts a tradeoff between memory capacity and nonlinear computational capacity. Here, using these principles, we design reservoirs to tackle problems in signal processing, paving the way for applying hardware reservoirs to high-dimensional spatiotemporal systems.

Circuits with memory↗

Effectively using multifidelity optimization for wind turbine design

Abstract. Wind turbines are complex multidisciplinary systems that are challenging to design because of the tightly coupled interactions between different subsystems. Computational modeling attempts to resolve these couplings so we can efficiently explore new wind turbine systems early in the design process. Low-fidelity models are computationally efficient but make assumptions and simplifications that limit the accuracy of design studies, whereas high-fidelity models capture more of the actual physics but with increased computational cost. This paper details the use of multifidelity methods for optimizing wind turbine designs by using information from both low- and high-fidelity models to find an optimal solution at reduced cost. Specifically, a trust-region approach is used with a novel corrective function built from a nonlinear surrogate model. We find that for a diverse set of design problems – with examples given in rotor blade geometry design, wind turbine controller design, and wind power plant layout optimization – the multifidelity method finds the optimal design using 38 %–58 % of the computational cost of the high-fidelity-only optimization. The success of the multifidelity method in disparate applications suggests that it could be more broadly applied to other wind energy or otherwise generic applications.

17 WIND ENERGY↗

Regularization by denoising diffusion models for solving inverse PDE problems with application to full waveform inversion

Partial differential equation (PDE)-governed inverse problems are fundamental across various scientific and engineering applications; yet they face significant challenges due to nonlinearity, ill-posedness, and sensitivity to noise. Here, we introduce a computational framework, regularization by denoising using diffusion models for partial differential equations (RED-DiffEq), by integrating physics-driven inversion and data-driven learning. RED-DiffEq leverages pretrained diffusion models as a regularization mechanism for PDE-governed inverse problems. We apply RED-DiffEq to solve the full waveform inversion problem in geophysics, a challenging seismic imaging technique that seeks to reconstruct high-resolution subsurface velocity models from seismic measurement data. Our method shows enhanced accuracy and robustness compared to benchmark methods. Additionally, it exhibits strong generalization and domain decomposition capacity, enabling the inversion of more complex velocity models with larger domains than those used in training the diffusion model. Our framework can also be directly applied to diverse PDE-governed inverse problems.

Shan, Siming [Yale University, New Haven, CT (Unit↗

A gradient-based deep neural network model for simulating multiphase flow in porous media

We report simulation of multiphase flow in porous media is crucial for the effective management of subsurface energy and environment-related activities. The numerical simulators used for modeling such processes rely on spatial and temporal discretization of the governing mass and energy balance partial-differential equations (PDEs) into algebraic systems via finite-difference/volume/element methods. These simulators usually require dedicated software development and maintenance, and suffer low efficiency from a runtime and memory standpoint for problems with multi-scale heterogeneity, coupled-physics processes or fluids with complex phase behavior. Therefore, developing cost-effective, data-driven models can become a practical choice, and in this work, we choose deep learning approaches as they can handle high dimensional data and accurately predict state variables with strong nonlinearity. In this paper, we describe a gradient-based deep neural network (GDNN) constrained by the physics related to multiphase flow in porous media. We tackle the nonlinearity of flow in porous media induced by rock heterogeneity, fluid properties, and fluid-rock interactions by decomposing the nonlinear PDEs into a dictionary of elementary differential operators. We use a combination of operators to handle rock spatial heterogeneity and fluid flow by advection. Since the augmented differential operators are inherently related to the physics of fluid flow, we treat them as first principles prior knowledge to regularize the GDNN training. We use the example of pressure management at geologic CO 2 storage sites, where CO 2 is injected in saline aquifers and brine is produced, and apply GDNN to construct a predictive model that is trained with physics-based simulation data and emulates the physics process. We demonstrate that GDNN can effectively predict the nonlinear patterns of subsurface responses, including the temporal and spatial evolution of the pressure and saturation plumes. We also successfully extend the GDNN to convolutional neural network (CNN), namely gradient-based CNN (GCNN), and validate its capability to improve the prediction accuracy. GDNN has great potential to tackle challenging problems that are governed by highly nonlinear physics and enable the development of data-driven models with higher fidelity.

42 ENGINEERING↗

Integral Kernel Methods for Nonlinear Parabolic-Elliptic Systems

Nonlinear parabolic-elliptic systems arise in many physical, biological, and chemical phenomena such as chemotaxis, ion transport, self-gravitating particles, and Brownian vortices. Existing methods struggle with the strong coupling and high nonlinearity and nonlocality of some of these systems, especially the ill-conditioned, convection-dominated problems. To overcome numerical difficulties, current approaches rely on initial guesses, preconditioning, or iterative techniques with no convergence guarantees. They might suffer from poor scalability, large memory usage, and difficulty to parallelize. Inspired by the connection of parabolic-elliptic systems to stochastic processes, we introduce a novel meshless, monolithic, and fully explicit method that naturally encapsulates the elliptic and parabolic operators into a single step which updates each node deterministically with global information. By being fully quadrature-based, it avoids solving systems of discretized equations and does not utilize initial guesses or preconditioning, while requiring little memory and being easy to parallelize. We first derive the method in an integral kernel formulation with quadratic complexity in the number of integration nodes and then leverage kernel-independent fast multipole methods (FMM) to present a scalable algorithm with linear complexity. We provide numerical examples for the Poisson-Nernst-Planck equations in one, two, and three dimensions, together with the derivation of the integral kernel for each case. Furthermore, the examples demonstrate the fast convergence and scalability of the FMM-accelerated algorithm, as well as its suitability for convection-dominated problems, making it competitive against traditional PDE solvers.

PDE systems↗