Search NASA⌕ Search

SEARCH · Search NASA

Results for “node nonlinearity”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

A quantum Monte Carlo study of systems with effective core potentials and node nonlinearities

In this report we study beryllium dihydride (BeH2) and acetylene (C2H2) molecules using real-space diffusion Monte Carlo (DMC) method. The molecules serve as perhaps the simplest prototypes that illustrate the difficulties with biases in the fixed-node DMC calculations that might appear with the use of effective core potentials (ECPs) or other nonlocal operators. This is especially relevant for the recently introduced correlation consistent ECPs (ccECPs) for 2s2p elements. Corresponding ccECPs exhibit deeper potential functions due to higher fidelity to all-electron counterparts, which could lead to larger local energy fluctuations. We point out that the difficulties stem from issues that are straightforward to address by upgrades of basis sets, use of T-moves for nonlocal terms, inclusion of a few configurations into the trial function and similar. The resulting accuracy corresponds to the ccECP target (chemical accuracy) and it is in consistent agreement with independent correlated calculations. Further possibilities for upgrading the reliability of the DMC algorithm and considerations for better adapted and more robust Jastrow factors are discussed as well.

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

Topological enhancement of nonlinear transport in unconventional point-node semimetals

The topological singularity of the Bloch states close to the Fermi level significantly enhances nonlinear electric responses in topological semimetals. Here, we systematically characterize this enhancement for a large class of topological nodal-point fermions, including those with linear, linear-quadratic, and quadratic dispersions. Specifically, we determine the leading power-law dependence of the nonlinear response functions on the chemical potential μ defined relative to the nodal point. We identify two characteristics that qualitatively improve nonlinear transports compared to those of conventional Dirac and Weyl fermions. First, the type-II (overtilted) spectrum leads to the log μ enhancement of nonlinear response functions having zero scaling dimension with respect to μ, which is not seen in a type-I (moderately or not tilted) spectrum. Second, the anisotropic linear-quadratic dispersion increases the power of small-μ divergence for the nonlinear response tensors along the linearly dispersing direction. Furthermore, our work reveals new experimental signatures of unconventional nodal points in topological semimetals as well as provides a guiding principle for giant nonlinear electric responses.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Deep Factorization Machine Learning for Disaggregation of Transmission Load Profiles with High Penetration of Behind-The-Meter Solar

The ever-growing integration of distributed energy resources (DERs), especially behind-the-meter (BTM) solar generations, poses imperative operational challenges to system operators such as regional transmission organizations (RTOs). It is important for RTOs to effectively and accurately extract actual load profiles at the transmission level for a single node with significant BTM solar injection. This paper first illustrates the necessity of disaggregating the daily actual load profile of a single node. Furthermore, by segmenting nodes with selected timeseries features, nodes with significant BTM solar generation are identified. Lastly, a bi-level framework is proposed, comprising reference node disaggregation and DeepFM nodal disaggregation, aimed at disaggregating the nodal load profiles from which system operators require more information. By adopting a hybrid Deep Factorization Machine (DeepFM) model, the model achieve accurate results by extracting both linear and nonlinear relations between nodes in the same region and the zonal load and nodal load profile. To overcome the lack of ground truth, this paper segments the load profile into daytime, nighttime, and zero-crossing points and utilizes the latter two for evaluation purposes. The proposed disaggregation procedure is validated using real world, minute-level, normalized, and anonymized nodal data in the PJM service territory.

42 ENGINEERING↗
DOE OSTI2024

Nonlinear optical diode effect in a magnetic Weyl semimetal

Diode effects are of great interest for both fundamental physics and modern technologies. Electrical diode effects (nonreciprocal transport) have been observed in Weyl systems. Optical diode effects arising from the Weyl fermions have been theoretically considered but not probed experimentally. Here, we report the observation of a nonlinear optical diode effect (NODE) in the magnetic Weyl semimetal CeAlSi, where the magnetization introduces a pronounced directionality in the nonlinear optical second-harmonic generation (SHG). We demonstrate a six-fold change of the measured SHG intensity between opposite propagation directions over a bandwidth exceeding 250 meV. Supported by density-functional theory, we establish the linearly dispersive bands emerging from Weyl nodes as the origin of this broadband effect. We further demonstrate current-induced magnetization switching and thus electrical control of the NODE. Our results advance ongoing research to identify novel nonlinear optical/transport phenomena in magnetic topological materials and further opens new pathways for the unidirectional manipulation of light.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Neural Ordinary Differential Equations for Nonlinear System Identification

Neural ordinary differential equations (NODE) have been recently proposed as a promising approach for nonlinear system identification tasks. In this work, we systematically compare their predictive performance with current state-of-the-art nonlinear and classical linear methods. In particular, we present a quantitative study comparing NODE's performance against neural state-space models and classical linear system identification methods and evaluate their inference speed and prediction performance on open-loop errors across eight different dynamical systems. The experiments show that NODEs can consistently improve the prediction accuracy by order of magnitude compared to benchmark methods. Besides improved accuracy, we also observed that NODEs are less sensitive to hyperparameters compared to neural state-space models by paying the cost of increased computation at the inference time.

machine leaning, system identification, physics in↗
DOE OSTI2023

Attention for Causal Relationship Discovery from Biological Neural Dynamics

This paper explores the potential of the transformer models for learning Granger causality in networks with complex nonlinear dynamics at every node, as in neurobiological and biophysical networks. Our study primarily focuses on a proof-of-concept investigation based on simulated neural dynamics, for which the ground-truth causality is known through the underlying connectivity matrix. For transformer models trained to forecast neuronal population dynamics, we show that the cross-attention module effectively captures the causal relationship among neurons, with an accuracy equal to or superior to that of the most popular Granger causality discovery method. While we acknowledge that real-world neurobiology data will bring further challenges, including dynamic connectivity and unobserved variability, this research offers an encouraging preliminary glimpse into the utility of the transformer model for causal representation learning in neuroscience.

Lu, Ziyu↗
DOE OSTI2021

Pyomo.GDP: an ecosystem for logic based modeling and optimization development

We present three core principles for engineering-oriented integrated modeling and optimization tool sets—intuitive modeling contexts, systematic computer-aided reformulations, and flexible solution strategies—and describe how new developments in Pyomo.GDP for Generalized Disjunctive Programming (GDP) advance this vision. We describe a new logical expression system implementation for Pyomo.GDP allowing for a more intuitive description of logical propositions. The logical expression system supports automated reformulation of these logical constraints to linear constraints. We also describe two new logic-based global optimization solver implementations built on Pyomo.GDP that exploit logical structure to avoid “zero-flow” numerical difficulties that arise in nonlinear network design problems when nodes or streams disappear. These new solvers also demonstrate the capability to link to external libraries for expanded functionality within an integrated implementation. We present these new solvers in the context of a flexible array of solution paths available to GDP models. Finally, we present results on a new library of GDP models demonstrating the value of multiple solution approaches.

42 ENGINEERING↗
DOE OSTI2024

Divide and conquer: Learning chaotic dynamical systems with multistep penalty neural ordinary differential equations

Forecasting high-dimensional dynamical systems is a fundamental challenge in various fields, such as geosciences and engineering. Neural Ordinary Differential Equations (NODEs), which combine the power of neural networks and numerical solvers, have emerged as a promising algorithm for forecasting complex nonlinear dynamical systems. However, classical techniques used for NODE training are ineffective for learning chaotic dynamical systems. In this work, we propose a novel NODE-training approach that allows for robust learning of chaotic dynamical systems. Here, our method addresses the challenges of non-convexity and exploding gradients associated with underlying chaotic dynamics. Training data trajectories from such systems are split into multiple, non-overlapping time windows. In addition to the deviation from the training data, the optimization loss term further penalizes the discontinuities of the predicted trajectory between the time windows. The window size is selected based on the fastest Lyapunov time scale of the system. Multi-step penalty(MP) method is first demonstrated on Lorenz equation, to illustrate how it improves the loss landscape and thereby accelerates the optimization convergence. MP method can optimize chaotic systems in a manner similar to least-squares shadowing with significantly lower computational costs. Our proposed algorithm, denoted the Multistep Penalty NODE, is applied to chaotic systems such as the Kuramoto-Sivashinsky equation, the two-dimensional Kolmogorov flow, and ERA5 reanalysis data for the atmosphere. It is observed that MP-NODE provide viable performance for such chaotic systems, not only for short-term trajectory predictions but also for invariant statistics that are hallmarks of the chaotic nature of these dynamics.

Chaotic dynamical systems↗
DOE OSTI2022

Accelerating high-order mesh optimization using finite element partial assembly on GPUs

In this paper we present a new GPU-oriented mesh optimization method based on high order finite elements. Our approach relies on node movement with fixed topology, through the Target-Matrix Optimization Paradigm (TMOP) and uses a global nonlinear solve over the whole computational mesh, i.e., all mesh nodes are moved together. A key property of the method is that the mesh optimization process is recast in terms of finite element operations, which allows us to utilize recent advances in the field of GPU-accelerated high order finite element algorithms. For example, we reduce data motion by using tensor factorization and matrix-free methods, which have superior performance characteristics compared to traditional full finite element matrix assembly and offer advantages for GPU based HPC hardware. Furthermore, we describe the major mathematical components of the method along with their efficient GPU-oriented implementation. In addition, we propose an easily reproducible mesh optimization test that can serve as a performance benchmark for the mesh optimization community.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Visualization of bulk and edge photocurrent flow in anisotropic Weyl semimetals

Materials that rectify light into current in their bulk are desired for optoelectronic applications. In Weyl semimetals that break inversion symmetry, bulk photocurrents may arise due to nonlinear optical processes that are enhanced near the Weyl nodes. However, the photoresponse of these materials is commonly studied by scanning photocurrent microscopy, which convolves the effects of photocurrent generation and collection. Here we directly image the photocurrent flow inside the type-II Weyl semimetals WTe 2 and TaIrTe 4 using high-sensitivity quantum magnetometry with nitrogen-vacancy centre spins. We elucidate a mechanism for bulk photocurrent generation, which we call the anisotropic photothermoelectric effect, where unequal thermopowers along different crystal axes drive intricate circulations of photocurrent around the photoexcitation. Using overlapping scanning photocurrent microscopy and magnetic imaging at the interior and edges of the sample, we visualize how the anisotropic photothermoelectric effect stimulates the long-range photocurrent collected in our WTe 2 and TaIrTe 4 devices through the Shockley–Ramo mechanism. Furthermore, our results highlight a widely relevant source of current flow and will inspire photodetectors that utilize bulk materials with thermoelectric anisotropy.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Central Compact Finite‐Difference Scheme With High Spectral Resolution for KdV Equation

This work presents a combination of cell‐node and cell‐centered compact finite difference scheme for the approximation of third derivatives involved in Korteweg–de Vries (KdV) equations. This approach employs a half‐shifted derivative construction at cell centers, avoiding the need for compact interpolation, thereby removing transfer errors; hence, it improves spectral resolution and maintains high‐order accuracy. Fourier analysis is performed to show the spectral properties of the proposed formulation, which provides higher spectral resolutions as compared to node‐based compact schemes. A filtering strategy is incorporated to suppress high‐frequency oscillations without compromising the accuracy of the numerical scheme, and the total variation diminishing Runge Kutta (TVDRK3) method is applied for time integration. Numerical experiments on linear, nonlinear, and coupled KdV systems are conducted, and a comparative analysis with cell‐node compact schemes confirms that the proposed scheme consistently reduces errors by up to an order of magnitude and achieves high spectral resolution properties.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Order conditions for nonlinearly partitioned Runge-Kutta methods

Recently, a new class of nonlinearly partitioned Runge–Kutta (NPRK) methods was proposed for nonlinearly partitioned systems of autonomous ordinary differential equations y' = F(y, y). The target class of problems are those in which different scales, stiffnesses, or physics are coupled in a nonlinear way, wherein the desired partition cannot be written in a classical additive or component-wise fashion. Here we use a rooted-tree analysis to derive full-order conditions for NPRKM methods, where M denotes the number of nonlinear partitions. Due to the nonlinear coupling and thereby the mixed product differentials, it turns out that the standard node-colored rooted tree analysis used in analyzing ODE integrators does not naturally apply. Instead we develop a new edge-colored rooted-tree framework to address the nonlinear coupling. The resulting order conditions are enumerated, are provided directly for up to fourth order with M = 2 and third order with M = 3, and are related to existing order conditions of additive and partitioned RK methods. We conclude with an example that shows how the nonlinear order conditions can be used to obtain an embedded estimate of the state-dependent nonlinear coupling strength in a dynamical system.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Robust trajectory-constrained frequency control for microgrids considering model linearization error

Grid supportive modes integrated within inverter-based resources can improve the frequency response of renewable-rich microgrids. The synthesis of grid supportive modes to guarantee frequency trajectory constraints under a predefined disturbance set is challenging but essential. To tackle this challenge, a numerical optimal control (NOC)-based control synthesis methodology is proposed. Without loss of generality, a wind-diesel fed microgrid is studied, where we aim to design grid supportive functions in the wind turbine. In the control design, linearized models are used, and the linearization-induced errors are quantitatively analyzed by reachability and interval arithmetics and represented in the form of interval uncertainties. Then, the NOC problem can be formulated into a robust mixed-integer linear program. The control structure is strategically configured into two levels to realize online deployment. The proposed control is verified on the modified 33-node microgrid with a full-order three-phase nonlinear model in Simulink. In conclusion, the simulation results show the effectiveness of the proposed control paradigm and the necessity of considering linearization-induced uncertainty.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Learning Symbolic Expressions: Mixed-Integer Formulations, Cuts, and Heuristics

Here, in this paper, we consider the problem of learning a regression function without assuming its functional form. This problem is referred to as symbolic regression. An expression tree is typically used to represent a solution function, which is determined by assigning operators and operands to the nodes. Cozad and Sahinidis propose a nonconvex mixed-integer nonlinear program (MINLP), in which binary variables are used to assign operators and nonlinear expressions are used to propagate data values through nonlinear operators, such as square, square root, and exponential. We extend this formulation by adding new cuts that improve the solution of this challenging MINLP. We also propose a heuristic that iteratively builds an expression tree by solving a restricted MINLP. We perform computational experiments and compare our approach with a mixed-integer program–based method and a neural network–based method from the literature.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Gaussian processes meet NeuralODEs: a Bayesian framework for learning the dynamics of partially observed systems from scarce and noisy data

We present a machine learning framework (GP-NODE) for Bayesian model discovery from partial, noisy and irregular observations of nonlinear dynamical systems. The proposed method takes advantage of differentiable programming to propagate gradient information through ordinary differential equation solvers and perform Bayesian inference with respect to unknown model parameters using Hamiltonian Monte Carlo sampling and Gaussian Process priors over the observed system states. This allows us to exploit temporal correlations in the observed data, and efficiently infer posterior distributions over plausible models with quantified uncertainty. The use of the Finnish Horseshoe as a sparsity-promoting prior for free model parameters also enables the discovery of parsimonious representations for the latent dynamics. A series of numerical studies is presented to demonstrate the effectiveness of the proposed GP-NODE method including predator–prey systems, systems biology and a 50-dimensional human motion dynamical system. This article is part of the theme issue ‘Data-driven prediction in dynamical systems’.

Science & Technology - Other Topics↗
DOE OSTI2021

Learning Optimal Power Flow Solutions using Linearized Models in Power Distribution Systems

Solving nonlinear optimal power flow (OPF) problem is computationally expensive, and poses scalability challenges for power distribution networks. An alternative to solving the original nonlinear OPF is the linear approximated OPF models. Although, these linear approximated OPF models are fast, the resulting solutions may result in significant optimality gap. Lately, the application of machine learning (ML) methods in successfully solving the nonlinear OPF has been reported. These methods learn and estimate the nonlinear control policies using a purely data-driven approach. In this paper, we propose an approach to complements the ML based approach to solving OPF using solutions from known linearized OPF model. Specifically, we use supervised learning to map the solutions of linear OPF to nonlinear control variables. Unlike, the traditional ML based methods for OPF that approximate the full distribution feeder model using function approximation, our approach uses a two-node approximation of radial networks. The proposed approach is validated using IEEE 123 bus test system for OPF solutions obtained using the nonlinear OPF models.

optimal power flow, power distribution systems, su↗
DOE OSTI2022

A Julia Framework for Graph-Structured Nonlinear Optimization

Graph theory provides a convenient framework for modeling and solving structured optimization problems. Under this framework, the modeler can arrange/assemble the components of an optimization model (variables, constraints, objective functions, and data) within nodes and edges of a graph, and this representation can be used to visualize, manipulate, and solve the problem. In this work, we present a Julia framework for modeling and solving graph-structured nonlinear optimization problems. Our framework integrates the modeling package Plasmo.jl (which facilitates the construction and manipulation of graph models) and the nonlinear optimization solver MadNLP.jl (which provides capabilities for exploiting graph structures to accelerate solution). We illustrate with a simple example how model construction and manipulation can be performed in an intuitive manner using Plasmo.jl and how the model structure can be exploited by MadNLP.jl. We also demonstrate the scalability of the framework by targeting a large-scale, stochastic gas network problem that contains over 1.7 million variables.

Cole, David↗
DOE OSTI2023

A comparative study of two numerical approaches for solving Kim–Kim–Suzuki phase-field models

Among the standard multi-phase multi-component phase-field (PF) methods, the Kim–Kim–Suzuki (KKS) method has the advantage of decoupling interfacial energy from bulk energy and solving concentration as the conserved variable. There are two approaches to numerically solving a KKS method: the global solution approach (GSA) solves all variables in a global system simultaneously, and the local solution approach (LSA) solves phase concentrations locally using a Newton solver. This work compares the performance of LSA and GSA for solving four KKS models of increasing complexity with the finite element method using the MOOSE framework. The solution accuracy, degrees of freedom (DOFs), memory usage, and computational efficiency are compared. We find that GSA and LSA generate similar solutions, with a maximum difference of only 0.34%. For each model, LSA has a lower number of DOFs, utilizes less memory, and less wall time. Additionally, the savings of memory and wall time in LSA increase with increasing mesh density of the same model and are more pronounced in models with higher dimensionality and more nodes. However, GSA is easier to implement in existing codes and can better solve highly nonlinear systems by utilizing sophisticated solvers.

36 MATERIALS SCIENCE↗