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 541 records · Page 30
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Nonlinear nanoelectrodynamics of a Weyl metal

Chiral Weyl fermions with linear energy-momentum dispersion in the bulk accompanied by Fermi-arc states on the surfaces prompt a host of enticing optical effects. While new Weyl semimetal materials keep emerging, the available optical probes are limited. In particular, isolating bulk and surface electrodynamics in Weyl conductors remains a challenge. We devised an approach to the problem based on near-field photocurrent imaging at the nanoscale and applied this technique to a prototypical Weyl semimetal TaIrTe 4 . As a first step, we visualized nano-photocurrent patterns in real space and demonstrated their connection to bulk nonlinear conductivity tensors through extensive modeling augmented with density functional theory calculations. Notably, our nanoscale probe gives access to not only the in-plane but also the out-of-plane electric fields so that it is feasible to interrogate all allowed nonlinear tensors including those that remained dormant in conventional far-field optics. Surface- and bulk-related nonlinear contributions are distinguished through their “symmetry fingerprints” in the photocurrent maps. Robust photocurrents also appear at mirror-symmetry breaking edges of TaIrTe 4 single crystals that we assign to nonlinear conductivity tensors forbidden in the bulk. Here, nano-photocurrent spectroscopy at the boundary reveals a strong resonance structure absent in the interior of the sample, providing evidence for elusive surface states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Influence of initial conditions on data-driven model identification and information entropy for ideal mhd problems

Data-driven methods of model identification are able to discern governing dynamics of a system from data. Such methods are well suited to help us learn about systems with unpredictable evolution or systems with ambiguous governing dynamics given our current understanding. Many plasma problems of interest fall into these categories as there are a wide range of models that exist, however each model is only useful in a certain regime and often limited by computational complexity. To ensure data-driven methods align with theory, they must be consistent and predictable when acting on data whose governing dynamics are known. Weak Sparse Identification of Nonlinear Dynamics (WSINDy) is a recently developed data-driven method that has shown promise in learning governing dynamics from data with high noise levels [1]. This work examines how WSINDy acts on ideal MHD test problems as the initial conditions are varied and specifies limiting requirements for successful equation identification. Furthermore, it is hard to recover the governing dynamics from data that emphasize a single dominant behavior. In these low information cases, Shannon information entropy is able to pick up on the redundancies in the data that affect recoverability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Multidisciplinary benchmarks of a conservative spectral solver for the nonlinear Boltzmann equation

The Boltzmann equation describes the evolution of the phase-space probability distribution of classical particles under binary collisions. Approximations to it underlie the basis for several scholarly fields, including aerodynamics and plasma physics. While these approximations are appropriate in their respective domains, they can be violated in niche but diverse applications which require direct numerical solution of the original nonlinear Boltzmann equation. An expanded implementation of the Galerkin–Petrov conservative spectral algorithm is employed to study a wide variety of physical problems. Enabled by distributed precomputation, solutions of the spatially homogeneous Boltzmann equation can be achieved in seconds on modern personal hardware, while spatially-inhomogeneous problems are solvable in minutes. Here, several benchmarks are presented focusing on accuracy compared to both analytic theoretical predictions and other Boltzmann solvers. These benchmarks span several physical domains including weakly ionized plasma, gaseous fluids, and atomic-plasma interaction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Discovery of Probabilistic Dirichlet-to-Neumann Maps on Graphs

Dirichlet-to-Neumann maps enable the coupling of multiphysics simulations across computational subdomains by ensuring continuity of state variables and fluxes at artificial interfaces. We present a novel method for learning Dirichlet-to-Neumann maps on graphs using Gaussian processes, specifically for problems where the data obey a conservation law arising from an underlying partial differential equation. Our approach combines discrete exterior calculus and nonlinear optimal recovery to infer relationships between vertex and edge values. This framework yields data-driven predictions with uncertainty quantification across the entire graph, even when observations are limited to a subset of vertices and edges. By minimizing the reproducing kernel Hilbert space norm while penalizing kernel complexity through maximum likelihood estimation, our method ensures that the resulting surrogate strictly enforces conservation laws without overfitting. We demonstrate our method on two representative applications: subsurface flow in fracture networks and arterial blood flow. Finally, the results demonstrate that the method maintains high accuracy and well-calibrated uncertainty estimates even under severe data scarcity, highlighting its potential for scientific applications where limited data and reliable uncertainty quantification are critical.

Dirichlet-to-Neumann map↗
DOE OSTI2020

Bilevel optimization, deep learning and fractional Laplacian regularization with applications in tomography

Here we consider a generalized bilevel optimization framework for solving inverse problems. We introduce fractional Laplacian as a regularizer to improve the reconstruction quality, and compare it with the total variation regularization. We emphasize that the key advantage of using fractional Laplacian as a regularizer is that it leads to a linear operator, as opposed to the total variation regularization which results in a nonlinear degenerate operator. Inspired by residual neural networks, to learn the optimal strength of regularization and the exponent of fractional Laplacian, we develop a dedicated bilevel optimization neural network with a variable depth for a general regularized inverse problem. We illustrate how to incorporate various regularizer choices into our proposed network. As an example, we consider tomographic reconstruction as a model problem and show an improvement in reconstruction quality, especially for limited data, via fractional Laplacian regularization. We successfully learn the regularization strength and the fractional exponent via our proposed bilevel optimization neural network. We observe that the fractional Laplacian regularization outperforms total variation regularization. This is specially encouraging, and important, in the case of limited and noisy data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A Bilevel Voltage Regulation Operation for Distribution Systems With Self-Operated Microgrids

The emerging of microgrids in distribution systems has significantly enhanced the resilience of power grids. However, the operators of a distribution system and microgrids therein can be different and have accessibility to different devices. To model the operation of such a grid, this work proposes a bilevel formulation and probes into the voltage regulation operation, considering the interaction between different systems. The proposed bilevel formulation considers the cooperation of active energy resources (AER), transformer tap-changers, and capacitor banks that are controlled by different operators. To facilitate the solution time of the target bilevel optimization, the lower-level problems with different objectives are modeled using deep neural networks (DNNs) which are then converted into a set of constraints. Hence, the bilevel problem can be reformed to a single-level problem. Lastly, the proposed solution procedures are validated using a customized joint system constructed by the IEEE 123-bus system and a real distribution system in Iowa. According to the numerical validation results, the solution time of the proposed nonlinear activation function based DNN model is 69 times faster than other methods in solving voltage regulation with a bilevel structure.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Multilevel Spectral Coarsening for Graph Laplacian Problems with Application to Reservoir Simulation

We extend previously developed two-level coarsening procedures for graph Laplacian problems written in a mixed saddle point form to the fully recursive multilevel case. The resulting hierarchy of discretizations gives rise to a hierarchy of upscaled models, in the sense that they provide approximation in the natural norms (in the mixed setting). This property enables us to utilize them in three applications: (i) as an accurate reduced model, (ii) as a tool in multilevel Monte Carlo simulations (in application to finite volume discretizations), and (iii) for providing a sequence of nonlinear operators in a full approximation scheme for solving nonlinear pressure equations discretized by the conservative two-point flux approximation. Finally, we illustrate the potential of the proposed multilevel technique in all three applications on a number of popular benchmark problems used in reservoir simulation.

multilevel Monte Carlo↗
DOE OSTI2023

Piecewise linear approximation with minimum number of linear segments and minimum error: A fast approach to tighten and warm start the hierarchical mixed integer formulation

In several areas of economics and engineering, it is often necessary to fit discrete data points or approximate nonlinear functions with continuous functions. Piecewise linear (PWL) functions are a convenient way to achieve this. PWL functions can be modeled in mathematical problems using only linear and integer variables. Moreover, there is a computational benefit in using PWL functions that have the least possible number of segments. This work proposes a novel hierarchical mixed integer linear programming (MILP) formulation that identifies a continuous PWL approximation with minimum number of linear segments for a given target maximum error. The proposed MILP formulation also identifies the solution with the least maximum error among the solutions with minimum number of segments. Then, this work proposes a fast iterative algorithm that identifies non necessarily continuous PWL approximations by solving O(S log N) linear programming (LP) problems, where N is the number of data points and S is the minimum number of segments in the non necessarily continuous case. This work demonstrates that tight bounds for the MILP problem can be derived from these approximations. Next, a fast algorithm is introduced to transform a non necessarily continuous PWL approximation into a continuous one. Finally, the tight bounds and the continuous PWL approximations are used to tighten and warm start the MILP problem. The tightened formulation is shown in experimental results to be more efficient, especially for large data sets, with a solution time that is up to two orders of magnitude less than the existing literature.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Goal-oriented a-posteriori estimation of model error as an aid to parameter estimation

In this work, a Bayesian model calibration framework is presented that utilizes goal-oriented a-posterior error estimates in quantities of interest (QoIs) for classes of high-fidelity models characterized by PDEs. It is shown that for a large class of computational models, it is possible to develop a computationally inexpensive procedure for calibrating parameters of high-fidelity models of physical events when the parameters of low-fidelity (surrogate) models are known with acceptable accuracy. The main ingredients in the proposed model calibration scheme are goal-oriented a-posteriori estimates of error in QoIs computed using a so-called lower fidelity model compared to those of an uncalibrated higher fidelity model. The estimates of error in QoIs are used to define likelihood functions in Bayesian inversion analysis. A standard Bayesian approach is employed to compute the posterior distribution of model parameters of high-fidelity models. As applications, parameters in a quasi-linear second-order elliptic boundary-value problem (BVP) are calibrated using a second-order linear elliptic BVP. In a second application, parameters of a tumor growth model involving nonlinear time-dependent PDEs are calibrated using a lower fidelity linear tumor growth model with known parameter values.

A-posterior estimates↗
DOE OSTI2020

Recent advances in computational mathematics and applications

We are honored to bring you this special issue dedicated to recent advances in computational mathematics and applications in science and engineering. The papers in this special issue were presented in ”Conference on Computational Mathematics and Applications (CCMA)” held at the University of Nevada Las Vegas (UNLV) during October 25–27, 2019. The conference has attracted about 90 attendees from six countries. The 15 papers in the special issue comprise a diverse collection of theoretical numerical analysis as well as applications in various subjects. Topics cover optimal control of PDEs, discontinuous Galerkin methods, fluid flow in porous media, turbulence flow, static and moving interface problems, complex fluids composed by the mixture of Newtonian fluid and nematic (liquid crystal) flows, modeling of ocean–atmosphere system, image segmentation algorithm, uncertainty quantification problems for turbulence model and Maxwell’s equations, iterative solver for systems resulting from mixed methods, and novel methods for solving systems of nonlinear equations. As the Guest Editors we would like to thank Dr. Leland Jameson at NSF (National Science Foundation) for kindly supporting our conference proposal which made this conference possible. We would also like to thank Darren Sugrue from Elsevier who provided partial support for our conference, and Thennarasu Gunasekaran and his production team from Elsevier who produced this nice special issue. We are grateful to many people (Dr. Zhijian Wu, Lori Ornelas, Elsa Juarez, and many Ph.D. students) at the Department of Mathematical Sciences of UNLV who provided tremendous support for the conference. Finally, we very much appreciate all authors who contributed their precious results to this special issue.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Classification of four-qubit entangled states via machine learning

We apply the support vector machine (SVM) algorithm to derive a set of entanglement witnesses (EW) to identify entanglement patterns in families of four-qubit states. The effectiveness of SVM for practical EW implementations stems from the coarse-grained description of families of equivalent entangled quantum states. The equivalence criteria in our work is based on the stochastic local operations and classical communication classification and the description of the four-qubit entangled Werner states. We numerically verify that the SVM approach provides an effective tool to address the entanglement witness problem when the coarse-grained description of a given family state is available. Here, we also discuss and demonstrate the efficiency of nonlinear kernel SVM methods as applied to four-qubit entangled state classification.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

PETSc/TAO Users Manual V.3.21

This manual describes the use of the Portable, Extensible Toolkit for Scientific Computation (PETSc) and the Toolkit for Advanced Optimization (TAO) for the numerical solution of partial differential equations (PDEs) and related problems on high-performance computers. PETSc/TAO is a suite of data structures and routines that provide the building blocks for implementing large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all distributed memory communication. PETSc/TAO includes a large suite of parallel linear solvers, nonlinear solvers, time integrators, and optimizers that may be used in application codes written in Fortran, C, C++, and Python (via petsc4py; see Getting Started ). The library is organized hierarchically, enabling users to employ the abstraction level most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

ARKODE: A Flexible IVP Solver Infrastructure for One-step Methods

We describe the ARKODE library of one-step time integration methods for ordinary differential equation (ODE) initial-value problems (IVPs). In addition to providing standard explicit and diagonally implicit Runge–Kutta methods, ARKODE supports one-step methods designed to treat additive splittings of the IVP, including implicit-explicit (ImEx) additive Runge–Kutta methods and multirate infinitesimal (MRI) methods. We present the role of ARKODE within the SUNDIALS suite of time integration and nonlinear solver libraries, the core ARKODE infrastructure for utilities common to large classes of one-step methods, as well as its use of “time stepper” modules enabling easy incorporation of novel algorithms into the library. Numerical results show example problems of increasing complexity, highlighting the algorithmic flexibility afforded through this infrastructure, and include a larger multiphysics application leveraging multiple algorithmic features from ARKODE and SUNDIALS.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Inference of neutrino flavor evolution through data assimilation and neural differential equations

The evolution of neutrino flavor in dense environments such as core-collapse supernovae and binary compact object mergers constitutes an important and unsolved problem. Its solution has potential implications for the dynamics and heavy-element nucleosynthesis in these environments. In this paper, we build upon recent work to explore inference-based techniques for the estimation of model parameters and neutrino flavor evolution histories. Here, we combine data assimilation, ordinary differential equation solvers, and neural networks to craft an inference approach tailored for nonlinear dynamical systems. Using this architecture, and a simple two-neutrino-beam, two-flavor model, we compare the performances of nine different optimization algorithms and expand upon previous assessments of the efficacy of inference for tackling problems in flavor evolution. We find that employing this new architecture, together with evolutionary optimization algorithms, accurately captures flavor histories in the small-scale model and allows us to quickly explore both model parameters and initial flavor content. In future work we plan to extend these inference techniques to large numbers of neutrinos.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Model predictive control for optimal dispatch of chillers and thermal energy storage tank in airports

Cost of energy consumption is one of the biggest operational cost for airports, and it is increasing from time to time as airports expand to support growing number of passengers. Various factors affect the energy consumption including efficiency of airport Heating Ventilation and Air conditioning (HVAC) systems, which in turn depends on the efficiency of individual subsystems. Here, in this paper, we present an optimal scheduling method for the central plant system at Dallas Fort Worth airport, involving chillers, pumps, and a thermal energy storage (TES) system. A model predictive control (MPC) problem is formulated to minimize both energy and demand charge costs while satisfying the cooling needs of the airport. The proposed Mixed-Integer Nonlinear Programming (MINLP) formulation includes performance curve based models for chillers and pumps and a simplified state of charge model for TES. The formulation also includes predictions of cooling load and chilled water return temperature. Simulation results for a month in summer show savings around 10% compared to the baseline. Initial recommendations based on insights from simulation results to the manual operation procedures resulted in significant savings. Field test results show a 7% chiller efficiency improvement.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

Real-time Optimal Dispatch of Behind-the-Meter DERs for Secondary Frequency Regulation

Active distribution networks (ADNs) can provide grid services such as peak load shaving, loss reduction, VoltNar control, congestion management, and frequency regulation. The fast response of inverter-based distributed energy resources (DERs) and battery storage systems enables them to provide ramping support and frequency control. This paper proposes a real-time optimization approach for behind-the-meter DERs to participate in the secondary frequency regulation. The proposed approach determines optimal set-points of output power of DERs to respond to requests from system operators (SOs) in realtime to maintain the frequency of the system at the nominal value. To satisfy the real-time requirement for the secondary frequency control, the nonlinear AC power flow model is linearized considering power losses in the system to achieve both high computational speed and acceptable accuracy. The optimization problem is rerun in a closed loop manner until the mismatch between the requested power by the system operators and actual delivered power at the substation reaches an acceptable tolerance. Furthermore, the proposed approach is validated using modified versions of the IEEE 33-bus and IEEE 69-bus distribution systems. Although the contribution of a single distribution system in the frequency regulation may not be significant, stacked and coordinated contributions from several distribution systems can provide frequency regulation and other grid services at scale.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Consistent linearization of micromorphic continuum theories

We outline the procedure of consistent linearization and apply it to the micromorphic, microstretch, and micropolar theories of continua. This yields tractable linear theories for nonlinearly elastic microstructured materials undergoing finite deformations. The results may be readily utilized in computational mechanics, stability and bifurcation analyses, and small-deformation problems in the context of these types of continua. Our results generalize those existing in current literature and facilitate their recovery upon incorporating appropriate kinematic and constitutive assumptions.

McAvoy, Ryan C.↗
DOE OSTI2021

Porting the Nonlinear Optimization Library HiOp to Accelerator-Based Hardware Architectures

While interior point method has been the centerpiece of nonlinear programming tools used in science and engineering, its reliance on linear solvers that can tackle sparse symmetric indefinite and highly ill-conditioned problems made it difficult to implement it effectively on hardware accelerators. HiOp optimization package attempts to provide an implementation of the interior point method suitable for hardware accelerators by compressing the original sparse problem to produce an underlying linear problem that is dense and of manageable size. Implementations of dense linear solvers are more mature and utilize hardware accelerators better than their sparse counterparts. There is a number of important domain problems, such as optimal power flow analysis for power grids, where the sparse problem can be effectively compressed and deploying dense linear solver within the interior point method can improve performance. Here we describe a portable implementation of HiOp optimization engine, which uses a linear solver from Magma library and runs entirely on hardware accelerators. To compress the problem, HiOp uses customized mixed dense-sparse linear algebra. All HiOp kernels are implemented using Umpire and RAJA portability libraries. We describe details of the implementation and discuss trade-offs between performance, portability and development cost.

97 MATHEMATICS AND COMPUTING↗