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 487 records · Page 27

Creating large Fock states and massively squeezed states in optics using systems with nonlinear bound states in the continuum

The quantization of the electromagnetic field leads directly to the existence of quantum mechanical states, called Fock states, with an exact integer number of photons. Despite these fundamental states being long-understood, and despite their many potential applications, generating them is largely an open problem. For example, at optical frequencies, it is challenging to deterministically generate Fock states of order two and beyond. Here, we predict the existence of an effect in nonlinear optics, which enables the deterministic generation of large Fock states at arbitrary frequencies. The effect, which we call an n-photon bound state in the continuum, is one in which a photonic resonance (such as a cavity mode) becomes lossless when a precise number of photons n is inside the resonance. Based on analytical theory and numerical simulations, we show that these bound states enable a remarkable phenomenon in which a coherent state of light, when injected into a system supporting this bound state, can spontaneously evolve into a Fock state of a controllable photon number. This effect is also directly applicable for creating (highly) squeezed states of light, whose photon number fluctuations are (far) below the value expected from classical physics (i.e., shot noise). In conclusion, we suggest several examples of systems to experimentally realize the effects predicted here in nonlinear nanophotonic systems, showing examples of generating both optical Fock states with large n (n > 10), as well as more macroscopic photonic states with very large squeezing, with over 90% less noise (10 dB) than the classical value associated with shot noise.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

CoSyR: A novel beam dynamics code for the modeling of synchrotron radiation effects

The self-consistent nonlinear dynamics of a relativistic charged particle beam interacting with its complete self-fields is a fundamental problem underpinning many of the accelerator design issues in high brightness beam applications, as well as the development of advanced accelerators. Particularly, synchrotron radiation induced effects in a magnetic dispersive beamline element can lead to collective beam instabilities and emittance growth. A novel beam dynamics code is developed based on a Lagrangian method for the calculation of the particles’ radiation near-fields using wavefront/wavelet meshes via the Green’s function of the Maxwell equations. These fields are then interpolated onto a moving mesh for dynamic update of the beam. This method allows radiation co-propagation and self-consistent interaction with the beam in 2D/3D simulations at greatly reduced numerical errors. Multiple levels of parallelisms are inherent in this method and implemented in our code CoSyR to enable at-scale simulations of nonlinear beam dynamics on modern computing platforms using MPI, multi-threading, and GPUs. Here, the current 2D implementation of CoSyR has been used to evaluate the transverse and longitudinal coherent radiation effects on the beam and to investigate beam optics designs proposed for mitigation of beam brightness degradation in a magnetic bunch compressor. In this paper, the design of CoSyR, as well as the benchmark with other coherent synchrotron radiation models, are described and discussed. Extension of the core algorithms to 3D is possible and planned.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Neural Network-Based Variational Methods for Solving Quadratic Porous Medium Equations in High Dimensions

Here, in this paper, we propose and study neural network-based methods for solutions of high-dimensional quadratic porous medium equation (QPME). Three variational formulations of this nonlinear PDE are presented: a strong formulation and two weak formulations. For the strong formulation, the solution is directly parameterized with a neural network and optimized by minimizing the PDE residual. It can be proved that the convergence of the optimization problem guarantees the convergence of the approximate solution in the $L^1$ sense. The weak formulations are derived following (Brenier in Examples of hidden convexity in nonlinear PDEs, 2020) which characterizes the very weak solutions of QPME. Specifically speaking, the solutions are represented with intermediate functions who are parameterized with neural networks and are trained to optimize the weak formulations. Extensive numerical tests are further carried out to investigate the pros and cons of each formulation in low and high dimensions. This is an initial exploration made along the line of solving high-dimensional nonlinear PDEs with neural network-based methods, which we hope can provide some useful experience for future investigations.

97 MATHEMATICS AND COMPUTING↗

Joint Optimization of Multimodal Transit Frequency and Shared Autonomous Vehicle Fleet Size with Hybrid Metaheuristic and Nonlinear Programming

Shared autonomous vehicles (SAVs) bring competition to traditional transit services but redesigning multimodal transit network can utilize SAVs as feeders to enhance service efficiency and coverage. This paper presents an optimization framework for the joint multimodal transit frequency and SAV fleet size problem, a variant of the transit network frequency setting problem. The objective is to maximize total transit ridership (including SAV-fed trips and subtracting boarding rejections) across multiple time periods under budget constraints, considering endogenous mode choice (transit, point-to-point SAVs, driving) and route selection, while allowing for strategic route removal by setting frequencies to zero. Due to the problem’s non-linear, non-convex nature and the computational challenges of large-scale networks, we develop a hybrid solution approach that combines a metaheuristic approach (particle swarm optimization) with nonlinear programming for local solution refinement. To ensure computational tractability, the framework integrates analytical approximation models for SAV waiting times based on fleet utilization, multimodal network assignment for route choice, and multinomial logit mode choice behavior, bypassing the need for computationally intensive simulations within the main optimization loop. Applied to the Chicago metropolitan area’s multimodal network, our method illustrates a 33.3% increase in transit ridership through optimized transit route frequencies and SAV integration, particularly enhancing off-peak service accessibility and strategically reallocating resources.

Ng, Max↗

A Performance Portable, Fully Implicit Landau Collision Operator with Batched Linear Solvers

Modern accelerators use hierarchical parallel programming models that enable massive multithreading within a processing element (PE), with multiple PEs per device driven by traditional processes. Batching is a technique for exposing PE-level parallelism in algorithms that have traditionally run on MPI processes or multiple threads within a single process. Opportunities for batching arise in, for example, kinetic discretizations of magnetized plasmas where collisions are advanced in velocity space at each spatial point independently. This paper builds on previous work on a high-performance, fully nonlinear, Landau collision operator by batching the linear solver, as well as batching the spatial point problems and adding new support for multiple grids for multiscale, multispecies problems. An anisotropic relaxation verification test that agrees well with previously published results and analytical models is presented. The performance results from NVIDIA A100 and AMD MI250X nodes are presented with hardware utilization analysis for each architecture. Finally, the entire implicit Landau operator time advance is implemented in Kokkos for performance portability, running entirely on the device and is available in the PETSc numerical library.

97 MATHEMATICS AND COMPUTING↗

Data-driven Minimum Entropy Control for Stochastic Nonlinear Systems using the Cumulant-Generating Function

Here, we present a novel minimum entropy control algorithm for a class of stochastic nonlinear systems subjected to non-Gaussian noises. The entropy control can be considered as an optimization problem for the system randomness attenuation, but the mean value has to be considered separately. To overcome this disadvantage, a new representation of the system stochastic properties was given using the cumulant-generating function based on the moment-generating function, in which the mean value and the entropy was reflected by the shape of the cumulant-generating function. Based on the samples of the system output and control input, a time-variant linear model was identified, and the minimum entropy optimization was transformed to system stabilization. Then, an optimal control strategy was developed to achieve the randomness attenuation, and the boundedness of the controlled system output was analyzed. The effectiveness of the presented control algorithm was demonstrated by a numerical example. In this paper, a data-driven minimum entropy design is presented without pre-knowledge of the system model; entropy optimization is achieved by the system stabilization approach in which the stochastic distribution control and minimum entropy are unified using the same identified structure; and a potential framework is obtained since all the existing system stabilization methods can be adopted to achieve the minimum entropy objective.

42 ENGINEERING↗

Prediction of residual stresses in additively manufactured parts using lumped capacitance and classical lamination theory

Several industries are interested in Laser Powder Bed Fusion (L-PBF) Additively Manufactured (AM) metal parts because their designs can be made arbitrarily complex while retaining bulk-type material properties. However, the residual stresses (RS) and distortions caused by the heat gradients inherent to L-PBF processes are detrimental to the structural integrity of the parts and must be taken into consideration during the part design cycle. Predicting the state of stresses in as-built 3D printed parts is a difficult problem that is typically approached with the use of transient thermomechanical Finite Element Models (FEMs). However, the nonlinearities associated with AM processes are difficult to capture in these FEMs without increasing the computational cost of the simulation, limiting their ability to be incorporated into practical design cycles. This work presents a novel analytical framework that combines lumped capacitance nonlinear heat transfer with time dependent classical lamination theory to efficiently and accurately predict RS in as-built L-PBF parts without the need of FEMs. The simulation was compared to Neutron Diffraction (ND) residual strain measurements taken at Oak Ridge National Laboratories (ORNL) as well as Synchrotron X-ray Diffraction (XRD) strain data published by the National Institute of Standards and Technology (NIST). The simulation predictions and the experimental data showed excellent agreement for the in-plane strain directions, and general agreement for the out of plane strain component, highlighting an area where further development can be implemented.

42 ENGINEERING↗

WeakIdent: Weak formulation for identifying differential equation using narrow-fit and trimming

Data-driven identification of differential equations is an interesting but challenging problem, especially when the given data are corrupted by noise. When the governing differential equation is a linear combination of various differential terms, the identification problem can be formulated as solving a linear system, with the feature matrix consisting of linear and nonlinear terms multiplied by a coefficient vector. This product is equal to the time derivative term, and thus generates dynamical behaviors. The goal is to identify the correct terms that form the equation to capture the dynamics of the given data. We propose a general and robust framework to recover differential equations using a weak formulation with two new mechanisms, narrow-fit and trimming, for both ordinary and partial differential equations (ODEs and PDEs). The weak formulation facilitates an efficient and robust way to handle noise, and two new mechanisms, narrow-fit and trimming, improve the coefficient support and value recoveries respectively. For each sparsity level, Subspace Pursuit is utilized to find an initial set of support from the large dictionary. Then, we focus on highly dynamic regions (rows of the feature matrix), and error normalize the feature matrix in the narrow-fit step. The support is further updated via trimming the terms that contribute the least. Finally, the support set of features with the smallest Cross-Validation error is chosen as the result. A comprehensive set of numerical experiments are presented for both systems of ODEs and PDEs with various noise levels. The proposed method gives a robust recovery of the coefficients, and a significant denoising effect which can handle up to 100% noise-to-signal ratio for some equations. We compare the proposed method with several state-of-the-art algorithms for the recovery of differential equations.

97 MATHEMATICS AND COMPUTING↗

Development of the Senseiver for efficient field reconstruction from sparse observations

Abstract The reconstruction of complex time-evolving fields from sensor observations is a grand challenge. Frequently, sensors have extremely sparse coverage and low-resource computing capacity for measuring highly nonlinear phenomena. While numerical simulations can model some of these phenomena using partial differential equations, the reconstruction problem is ill-posed. Data-driven-strategies provide crucial disambiguation, but these suffer in cases with small amounts of data, and struggle to handle large domains. Here we present the Senseiver, an attention-based framework that excels in reconstructing complex spatial fields from few observations with low overhead. The Senseiver reconstructs n -dimensional fields by encoding arbitrarily sized sparse sets of inputs into a latent space using cross-attention, producing uniform-sized outputs regardless of the number of observations. This allows efficient inference by decoding only a sparse set of output observations, while a dense set of observations is needed to train. This framework enables training of data with complex boundary conditions and extremely large fine-scale simulations. We build on the Perceiver IO by enabling training models with fewer parameters, which facilitates field deployment, and a training framework that allows a flexible number of sensors as input, which is critical for real-world applications. We show that the Senseiver advances the state-of-the-art of field reconstruction in many applications.

97 MATHEMATICS AND COMPUTING↗

A Mixed integer linear programming‐based distributed energy management for networked microgrids considering network operational objectives and constraints

Abstract Mixed integer linear programming (MILP)–based distributed energy management for networked microgrids embedded modern distribution systems is proposed. Considering the diverse ownership of microgrids, distributed energy resources (DERs) that interface directly with utilities and responsive loads, an alternating direction method of multipliers–based distributed framework was formulated for the scheduling of networked microgrids embedded modern distribution systems by adjusting nodal price signals iteratively. In addition, to make the formulated optimization problems resolvable through more accessible and popular MILP solvers, different linearisation techniques were employed to transform the nonlinear terms into linear or mixed integer linear formats. The proposed MILP‐based distributed method preserves all participants' autonomy (e.g., microgrids, DERs that interface directly with utilities and responsive loads), while incentivising them to actively participate in the distribution system operation with price signals. The proposed method is validated with results of numerical simulation using a modern distribution system consisting of multiple networked microgrids, DERs that interface directly with utilities, as well as responsive loads.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Three-dimensional modelling of a self-sustained atmospheric pressure glow discharge

The atmospheric pressure glow discharge (APGD) is a relatively simple and versatile plasma source used in diverse applications. Stable APGD operation at high currents, generally a challenge due to instabilities leading to glow-to-arc transition, has been demonstrated using actively-controlled cathodic cooling. This article presents the computational modelling and simulation of a self-sustained direct-current APGD in helium within a 10 mm pin-to-plate inter-electrode gap for currents ranging from 4 to 40 mA. The APGD model is comprised of the conservation equations for total mass, chemical species, momentum, thermal energy of heavy-species and of free electrons, and electric charge. The model equations are discretized using a nonlinear variational multi-scale finite element method that has demonstrated superior accuracy in other plasma flow problems, on a temporal and three-dimensional computational domain suitable to unveil the potential occurrence of instabilities. Modelling results show good agreement with experimental measurements of voltage drop and the same trend but higher values of temperature. The higher temperatures obtained by the simulations appear to be due to the absence of a near-cathode heat dissipation model. Here, the results also reveal that the distribution of electron density and of the ratio of atomic helium ions to total ions transitions from monotonically increasing away from the cathode to presenting a minimum near the centre of the gap with increasing current.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Barrier-Certificated Reinforcement Learning Approach for Enhancing Power System Transient Stability

Increasing integration of renewable resources brings more flexibility and poses new challenges to modern power systems, leading to highly nonlinear and complex dynamics. Here, this paper aims to provide a general solution framework to traditional control problems, such as frequency control and voltage control, which attempt to maintain the stability of either synchronous generators-governed or inverter-governed systems when subjected to a disturbance and simultaneously guarantee operational constraints, providing a complete complement to existing works on control design. Building on reinforcement learning (RL) and control barrier functions, the framework includes two subsystems, i.e., a model-free controller and a barrier-certification system, which discover RL-based control actions and sequentially filter them using a barrier certificate to satisfy operational constraints. Calculating a barrier function is generally challenging for a complex power system. This is addressed by representing the barrier function using neural networks (NNs) and data-based approaches. An adaptive method is introduced to certify the neural barrier function that perseveres barrier conditions, which is more compatible with online implementation. The proposed framework synthesizes a stabilizing controller that satisfies predefined safety regions. The effectiveness of the proposed framework is demonstrated via several comparative case studies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Stability analysis of the Eulerian–Lagrangian finite volume methods for nonlinear hyperbolic equations in one space dimension

In this paper, we construct a novel Eulerian–Lagrangian finite volume (ELFV) method for nonlinear scalar hyperbolic equations in one space dimension. It is well known that the exact solutions to such problems may contain shocks though the initial conditions are smooth, and direct numerical methods may suffer from restricted time step sizes. To relieve the restriction, we propose an ELFV method, where the space-time domain was separated by the partition lines originated from the cell interfaces whose slopes are obtained following the Rakine–Hugoniot junmp condition. Unfortunately, to avoid the intersection of the partition lines, the time step sizes are still limited. To fix this gap, we detect effective troubled cells (ETCs) and carefully design the influence region of each ETC, within which the partitioned space-time regions are merged together to form a new one. Then with the new partition of the space-time domain, we theoretically prove that the proposed first-order scheme with Euler forward time discretization is total-variation-diminishing and maximum-principle-preserving with at least twice larger time step constraints than the classical first order Eulerian method for Burgers’ equation. Numerical experiments verify the optimality of the designed time step sizes.

97 MATHEMATICS AND COMPUTING↗

Implicit and coupled fluid plasma solver with adaptive Cartesian mesh and its applications to non-equilibrium gas discharges

In this work, we present a new fluid plasma solver with adaptive Cartesian mesh (ACM) based on a full-Newton (nonlinear, implicit) scheme for non-equilibrium gas discharge plasma. The electrons and ions are described using drift-diffusion approximation coupled to Poisson equation for the electric field. The electron-energy transport equation is solved to account for electron thermal conductivity, Joule heating, and energy loss of electrons in collisions with neutral species. The rate of electron-induced ionization is a function of electron temperature and could also depend on electron density (important for plasma stratification). The ion and gas temperature are kept constant. The transport equations are discretized using a non-isothermal Scharfetter-Gummel scheme to resolve possible large temperature gradients in the sheaths. We demonstrate the new solver for simulations of direct current (DC) and radiofrequency (RF) discharges. The implicit treatment of the coupled equations allows using large time steps. The full-Newton method (FNM) enables fast nonlinear convergence at each time step, offering significantly improved simulation efficiency. We discuss the selection of time steps for solving different plasma problems. The new solver enables solving several problems we could not solve before with existing software: two- and three-dimensional structures of the entire DC discharges including cathode and anode regions, electric field reversals and double-layer formation, the normal cathode spot and an anode ring, moving striations in diffuse and constricted DC discharges, and standing striations in RF discharges. The developed FNM-ACM technique offers many benefits for tackling the disparity of gas discharge plasma systems' time scales and nonlinearity.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Machine-learning based model reduction for partial differential equations

We develop a novel synergistic approach between model reduction and machine learning. The specific goal of this project is to aid in the construction of reduced order models for basis functions that are custom-made to represent the solution of partial differential equations. Partial differential equations (PDEs) are one of the main mathematical tools for describing physical phenomena. However, due to either efficiency or necessity, for many real-world problems, we are interested in constructing reduced order models (ROMs) which focus only on the explicit computation of subsets of the active spatio-temporal scales in the problem, while treating the interaction with the rest of the scales approximately. The task of accurate representation of such interactions (usually called memory terms) constitutes a vast area of research known as model reduction. PI Stinis has significant expertise in the construction of ROMs for complex systems. In addition, in recent work with the project key participant Qadeer, they have utilized machine learning to acquire custom-made basis functions (CBFs) to expand the solutions of PDEs. In the proposed work, we will merge the two concepts by constructing ROMs for subsets of the CBFs needed to represent the solution of a PDE. Specifically, we will use the Mori-Zwanzig model reduction formalism to construct ROMs for subsets of CBFs for nonlinear PDEs of various complexity, as well as investigate the usage of CBFs in the spectral vanishing viscosity method for problems that can form shocks in finite time. The outcome of the research is aimed to be proof-of-concept about a novel synergistic approach between model reduction and machine learning, thus advancing the field of scientific machine learning. Such a capability will benefit the efficient modeling of physical systems appearing in various areas of interest to the DOE.

97 MATHEMATICS AND COMPUTING↗

Toward real-time optimization through model reduction and model discrepancy sensitivities

Optimization problems arise in a range of scenarios, from optimal control to model parameter estimation. In many applications, such as the development of digital twins, it is essential to solve these optimization problems within wall-clock-time limitations. However, this is often unattainable for complex systems, such as those modeled by nonlinear partial differential equations. One strategy for mitigating this issue is to construct a reduced-order model (ROM) that enables more rapid optimization. In particular, the use of nonintrusive ROMs—those that do not require access to the full-order model at evaluation time—is popular because they facilitate the computation of optimization solutions within the wall-clock time requirements. However, the optimization solution will be unreliable if the iterates move outside the ROM training data. This article proposes the use of hyper-differential sensitivity analysis with respect to model discrepancy (HDSA-MD) as a computationally efficient tool to augment ROM-constrained optimization and improve its reliability. The proposed approach consists of two phases: (i) an offline phase where several full-order model evaluations are computed to train the ROM, and (ii) an online phase where a ROM-constrained optimization problem is solved, a limited number of full-order model evaluations are computed, and HDSA-MD is used to enhance the optimization solution. Numerical results are demonstrated for two examples, atmospheric contaminant control and wildfire ignition location estimation, in which a ROM is trained offline using inaccurate atmospheric data. In conclusion, the HDSA-MD update yields a significant improvement in the ROM-constrained optimization solution using only one full-order model evaluation online with corrected atmospheric data.

PDE-constrained optimization↗

Application of Koopman operator for model-based control of fracture propagation and proppant transport in hydraulic fracturing operation

This work explores the application of the recently developed Koopman operator approach for model identification and feedback control of a hydraulic fracturing process. Controlling fracture propagation and proppant transport with precision is a challenge due in large part to the difficulty of constructing approximate models that accurately capture the characteristic moving boundary and highly-coupled dynamics exhibited by the process. Koopman operator theory is particularly attractive here as it offers a way to explicitly construct linear representations for even highly nonlinear dynamics. The method is data-driven and relies on lifting the states to an infinite-dimensional space of functions called observables where the dynamics are governed by a linear Koopman operator. Here this work considers two problems: (a) fracture geometry control, and (b) proppant concentration control. In both cases, an approximate linear model of the corresponding dynamics is constructed and used to design a model predictive controller (MPC). The manuscript shows that in the case of highly nonlinear dynamics, as observed in the proppant concentration, use of canonical functions in the observable basis fails. In such cases, a priori system knowledge can be leveraged to choose the required basis. The numerical experiments demonstrate that the Koopman linear model shows excellent agreement with the real system and successfully achieves the desired target values maximizing the oil and gas productivity. Additionally, due to its linear structure, the Koopman models allow convex MPC formulations that avoid any issues associated with nonlinear optimization.

42 ENGINEERING↗

Convergence of sum-up rounding schemes for cloaking problems governed by the Helmholtz equation

In this work, we consider the problem of designing a cloak for waves described by the Helmholtz equation from an integer programming point of view. The problem can be modeled as a PDE-constrained optimization problem with integer-valued control inputs that are distributed in the computational domain. A first-discretize-then-optimize approach results in a large-scale mixed-integer nonlinear program that is in general intractable because of the large number of integer variables that arise from the discretization of the domain. Instead, we propose an efficient algorithm that is able to approximate the local infima of the underlying nonconvex infinite-dimensional problem arbitrarily close without the need to solve the discretized finite-dimensional integer programs to optimality. We optimize only the continuous relaxations of the approximations for local minima and then apply the sum-up rounding methodology to obtain integer-valued controls. If the solutions of the discretized continuous relaxations converge to a local minimizer of the continuous relaxation, then the resulting discrete-valued control sequence converges weakly \(^*\) in \(L^\infty\) to the same local minimizer. These approximation properties follow under suitable refinements of the involved discretization grids. Our results use familiar concepts arising from the analytical properties of the underlying PDE and complement previous results, derived from a topology optimization point of view.

97 MATHEMATICS AND COMPUTING↗