Optimal nonlinear dynamic sparse model selection and Bayesian parameter estimation for nonlinear systems
Not provided.
Computer Science↗
SEARCH · Search NASA
Results for “nonlinear systems”
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.
Multi-modality deep learning for pulse prediction in homogeneous nonlinear systems via parametric conversion
In this Letter, we introduce FusionNet, a multi-modality deep learning framework designed to predict and analyze output pulses in high-power rare-earth-doped laser systems driving parametric conversion in homogeneous guided nonlinear media. FusionNet integrates temporal, spectral, and physical experimental conditions to model ultrafast nonlinear phenomena, including parametric nonlinear frequency conversion, self-phase modulation, and cross-phase modulation in homogeneous guided systems such as gas-filled hollow-core fibers. These systems bridge physical models with experimental data, advancing our understanding of light-guiding principles and nonlinear interactions while expediting the design and optimization of on-demand high-power, high-brightness systems. Our results demonstrate a 73% reduction in prediction error and an 83% improvement in computational efficiency compared to conventional neural networks. This work establishes a new paradigm for accelerating parametric simulations and optimizing experimental designs in high-power laser systems, with further implications for high-precision spectroscopy, quantum information science, and distributed entangled interconnects.
47 OTHER INSTRUMENTATION↗
Resilient Consensus State Observer for Nonlinear Systems and Against Attacks
Herein, we investigate the design of a resilient consensus observer that yields correct and continuous state estimates of a nonlinear control system whose state observations are subject to attacks. The observations are assumed to be obtained from multiple sensors and/or communication channels employed to provide redundancy. It is shown that, in an attack-free setting, individual globally convergent observers can be designed for each sensor/channel using the corresponding state-dependent Jacobian system. To counter attacks, a resilient consensus observer is then designed by merging the observers estimates to produce a smooth consensus estimate. Resilient convergence of the consensus estimate to the true state is ensured under the condition that the sparsity of the attacks being less than a half of the number of redundant channels. As an illustrative example, the proposed scheme is successfully applied to the chaotic circuit synchronization problem in which their synchronization has been attacked.
97 MATHEMATICS AND COMPUTING↗
Bayesian learning with Gaussian processes for low-dimensional representations of time-dependent nonlinear systems
This work presents a data-driven method for learning low-dimensional time-dependent physics-based surrogate models whose predictions are endowed with uncertainty estimates. We use the operator inference approach to model reduction that poses the problem of learning low-dimensional model terms as a regression of state space data and corresponding time derivatives by minimizing the residual of reduced system equations. Standard operator inference models perform well with accurate training data that are dense in time, but producing stable and accurate models when the state data are noisy and/or sparse in time remains a challenge. Another challenge is the lack of uncertainty estimation for the predictions from the operator inference models. Our approach addresses these challenges by incorporating Gaussian process surrogates into the operator inference framework to (1) probabilistically describe uncertainties in the state predictions and (2) procure analytical time derivative estimates with quantified uncertainties. The formulation leads to a generalized least-squares regression and, ultimately, reduced-order models that are described probabilistically with a closed-form expression for the posterior distribution of the operators. The resulting probabilistic surrogate model propagates uncertainties from the observed state data to reduced-order predictions. Furthermore, we demonstrate the method is effective for constructing low-dimensional models of two nonlinear partial differential equations representing a compressible flow and a nonlinear diffusion–reaction process, as well as for estimating the parameters of a low-dimensional system of nonlinear ordinary differential equations representing compartmental models in epidemiology.
Data-driven model reduction↗
VpROM: a novel variational autoencoder-boosted reduced order model for the treatment of parametric dependencies in nonlinear systems
Reduced Order Models (ROMs) are of considerable importance in many areas of engineering in which computational time presents difficulties. Established approaches employ projection-based reduction, such as Proper Orthogonal Decomposition. The limitation of the linear nature of such operators is typically tackled via a library of local reduction subspaces, which requires the assembly of numerous local ROMs to address parametric dependencies. Our work attempts to define a more generalisable mapping between parametric inputs and reduced bases for the purpose of generative modeling. We propose the use of Variational Autoencoders (VAEs) in place of the typically utilised clustering or interpolation operations, for inferring the fundamental vectors, termed as modes, which approximate the manifold of the model response for any and each parametric input state. The derived ROM still relies on projection bases, built on the basis of full-order model simulations, thus retaining the imprinted physical connotation. However, it additionally exploits a matrix of coefficients that relates each local sample response and dynamics to the global phenomena across the parametric input domain. The VAE scheme is utilised for approximating these coefficients for any input state. This coupling leads to a high-precision low-order representation, which is particularly suited for problems where model dependencies or excitation traits cause the dynamic behavior to span multiple response regimes. Moreover, the probabilistic treatment of the VAE representation allows for uncertainty quantification on the reduction bases, which may then be propagated to the ROM response. The performance of the proposed approach is validated on an open-source simulation benchmark featuring hysteresis and multi-parametric dependencies, and on a large-scale wind turbine tower characterised by nonlinear material behavior and model uncertainty.
Conditional VAEs↗
A Simple Linearization Method of Nonlinear Systems Based on Fuzzy Logic
Not Available
Perdukova, Daniela↗
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↗
Statistical mechanics and pressure of composite multimoded weakly nonlinear optical systems
Statistical mechanics can provide a versatile theoretical framework for investigating the collective dynamics of weakly nonlinear-wave settings that can be utterly complex to describe otherwise. In optics, composite systems arise due to interactions between different frequencies and polarizations. The purpose of this work is to develop a thermodynamic theory that takes into account the synergistic action of multiple components. We find that the type of the nonlinearity involved can have important implications in the thermalization process and, hence, can lead to different thermal equilibrium conditions. Importantly, we derive closed-form expressions for the actual optomechanical pressure that is exerted on the system. In particular, the total optomechanical pressure is the sum of the partial pressures due to each component. Our results can be applied to a variety of weakly nonlinear optical settings such as multimode fibers, bulk waveguides, photonic lattices, and coupled microresonators. We present two specific examples, where two colors interact in a one-waveguide array with either a cubic or quadratic nonlinearity.
Efremidis, Nikolaos K. (ORCID:0000000298300268)↗
Experimental Demonstration of a Two-Dimensional Nonlinear Integrable System in a Particle Accelerator
A two-dimensional nonlinear integrable system was experimentally demonstrated at the Fermilab Integrable Optics Test Accelerator. The system was implemented by inserting a special nonlinear magnet in a conventional accelerator lattice. We characterized the system by measuring lifetimes, transverse profiles and transverse oscillation frequencies of the 150-MeV electron beam as a function of the strength of the nonlinear insert. The measured shift of the working point and the amplitude-dependent detuning were consistent with theoretical predictions. We also observed the predicted bifurcation of the stable closed orbit. A striking consequence of the system's implementation was the possibility to operate the storage ring with integer tunes without lifetime degradation. This research opens up novel ways to design particle accelerators and to stabilize particle beams.
Wieland, John [Fermilab] (ORCID:0000000289718523)↗
Classifying photonic topology using the spectral localizer and numerical K -theory
Recently, the spectral localizer framework has emerged as an efficient approach for classifying topology in photonic systems featuring local nonlinearities and radiative environments. In nonlinear systems, this framework provides rigorous definitions for concepts such as topological solitons and topological dynamics, where a system’s occupation induces a local change in its topology due to nonlinearity. For systems embedded in radiative environments that do not possess a shared bulk spectral gap, this framework enables the identification of local topology and shows that local topological protection is preserved despite the lack of a common gap. However, as the spectral localizer framework is rooted in the mathematics of C*-algebras, and not vector bundles, understanding and using this framework requires developing intuition for a somewhat different set of underlying concepts than those that appear in traditional approaches for classifying material topology. In this tutorial, we introduce the spectral localizer framework from a ground-up perspective and provide physically motivated arguments for understanding its local topological markers and associated local measure of topological protection. In doing so, we provide numerous examples of the framework’s application to a variety of topological classes, including crystalline and higher-order topology. We then show how Maxwell’s equations can be reformulated to be compatible with the spectral localizer framework, including the possibility of radiative boundary conditions. To aid in this introduction, we also provide a physics-oriented introduction to multi-operator pseudospectral methods and numerical K-theory, two mathematical concepts that form the foundation for the spectral localizer framework. Finally, we provide some mathematically oriented comments on the C*-algebraic origins of this framework, including a discussion of real C*-algebras and graded C*-algebras that are necessary for incorporating physical symmetries. Looking forward, we hope that this tutorial will serve as an approachable starting point for learning the foundations of the spectral localizer framework.
97 MATHEMATICS AND COMPUTING↗
An eigenvalue-based method for computing the relaxed pressure in compressible multiphase flow with N phases
The modeling of compressible multiphase flows is a decades-old area of study with many applications across various fields. Many of these application areas use stiff pressure relaxation. This process involves the solution of a nonlinear system with N + 1 equations and N + 1 unknowns, where N is the number of phases. The resolution of this system with general equations of state (EOSs) is difficult. Furthermore, nonlinear systems can admit multiple solutions, and current solution methods do not address this possibility. Very recently, a thermodynamic relaxation method was introduced, which effectively maps a relatively simple predictor equation of state onto a more complex target equation of state. In this context, the target EOSs are the chosen EOSs for the thermodynamic model. Furthermore, this thermodynamic relaxation has the benefit of simplifying the stiff pressure relaxation system of equations. In this article, we show this system reduces to a polynomial of degree N, which can be recast as an eigenvalue problem through the use of the associated companion matrix. We show that although this eigenvalue method is generally less efficient than Newton–Raphson iteration, it does not suffer from convergence issues and finds all N roots of the polynomial. Hence, the method provides a fail-safe for root-finding iterative methods and a way to address the issue of multiple solutions to the nonlinear system of equations in stiff pressure relaxation.
Eigenvalue algorithm↗
On the Existence of Steady-State Solutions to the Equations Governing Fluid Flow in Networks
The steady-state solution of fluid flow in pipeline infrastructure networks driven by junction/node potentials is a crucial ingredient in various decision-support tools for system design and operation. While the nonlinear system is known to have a unique solution (when one exists), the absence of a definite result on the existence of solutions hobbles the development of computational algorithms, for it is not possible to distinguish between algorithm failure and non-existence of a solution. In this letter, we show that for any fluid whose equation of state is a scaled monomial, a unique solution exists for such nonlinear systems if the term solution is interpreted in terms of potentials and flows rather than pressures and flows. However, for gases following the CNGA equation of state, while the question of existence remains open, we construct an alternative system that always has a unique solution and show that the solution to this system is a good approximant of the true solution. Further, the existence result for flow of natural gas in networks also applies to other fluid flow networks such as water distribution networks or networks that transport carbon dioxide in carbon capture and sequestration. Most importantly, our result enables correct diagnosis of algorithmic failure, problem stiffness, and non-convergence in computational algorithms.
42 ENGINEERING↗
Neural operators for stochastic modeling of nonlinear structural system response to natural hazards
Traditionally, neural networks have been employed to learn the mapping between finite-dimensional Euclidean spaces. However, recent research has opened up new horizons, focusing on the utilization of deep neural networks to learn operators capable of mapping infinite-dimensional function spaces. Here, in this work, we employ two state-of-the-art neural operators, the deep operator network (DeepONet) and the Fourier neural operator (FNO) for the prediction of the nonlinear time history response of structural systems exposed to natural hazards, such as earthquakes and windstorms. Specifically, we propose two architectures, a self-adaptive FNO and a fast Fourier transform-based DeepONet (DeepFNOnet), where we employ a FNO beyond the DeepONet to learn the discrepancy between the ground truth and the solution predicted by the DeepONet. To demonstrate the efficiency and applicability of the architectures, two problems are considered. In the first, we use the proposed model to predict the seismic nonlinear dynamic response of a six-story shear building subject to stochastic ground motions. In the second problem, we employ the operators to predict the wind-induced nonlinear dynamic response of a high-rise building while explicitly accounting for the stochastic nature of the wind excitation. In both cases, the trained metamodels achieve high accuracy while being orders of magnitude faster than their corresponding high-fidelity models.
DeepONet↗
Reduced Order Modeling conditioned on monitored features for response and error bounds estimation in engineered systems
Reduced Order Models (ROMs) form essential tools across engineering domains by virtue of their function as surrogates for computationally intensive digital twinning simulators. Although purely data-driven methods are available for ROM construction, schemes that allow to retain a portion of the physics tend to enhance the interpretability and generalization of ROMs. However, physics-based techniques can adversely scale when dealing with nonlinear systems that feature parametric dependencies. This study introduces a generative physics-based ROM that is suited for nonlinear systems with parametric dependencies and is additionally able to provide numerical error bounds associated with the respective estimates. A main contribution of this work is the conditioning of these parametric ROMs to features that can be derived from monitoring measurements, feasibly in an online fashion. This is contrary to most existing ROM schemes, which remain restricted to the prescription of the physics-based, and usually a priori unknown, system parameters. Our work utilizes conditional Variational Autoencoders to continuously map the required reduction bases to a feature vector extracted from limited output measurements, while additionally allowing for a probabilistic assessment of the ROM-estimated Quantities of Interest. An auxiliary task using a neural network-based parametrization of suitable probability distributions is introduced to re-establish the link with physical model parameters. We verify the proposed scheme on a series of simulated case studies incorporating effects of geometric and material nonlinearity under parametric dependencies related to system properties and input load characteristics.
Conditional VAEs↗
Physics-aware adaptive checkpointing with shadow systems for nonlinear PDE simulations
Large-scale simulations of nonlinear partial differential equations (PDEs) that exhibit strongly transient behavior and pattern-forming dynamics produce enormous amounts of data, which, even with modern storage systems, cannot be stored for later curation. Current I/O strategies either write dense time series of snapshots, which is often prohibitive in I/O and storage, or store a few checkpoints that enable restart but incur expensive recomputation cost and provide no control over post-restart error growth, especially when lossy compression is used. Moreover, most, if not all, existing strategies take no account of the actual physical state of the system. Here, we present a simple physics-aware I/O framework in which a low-cost shadow system adaptively triggers lossy checkpoints when the shadow system deviates from the fine-scale simulation. The shadow system can be a coarsened replica of the fine-scale simulation that evolves concurrently. This means that checkpoints are taken based on the physical state of the system: fewer checkpoints are triggered when the system is quiescent while more are taken when the system undergoes a rapid change. This type of behavior is observed in many systems such as Brusselator and FitzHugh–Nagumo. We illustrate that our framework maintains stable restarts, keeps fine-scale restart errors bounded by shadow errors, and reconstructs the time history with significantly lower error and storage than interpolating fixed-interval snapshots, with low-cost shadow replay and modest online synchronization overhead.
Gong, Qian [ORNL] (ORCID:0000000235704142)↗
Online regularization of Poincaré map of storage rings with Shannon entropy
A measurable chaos indicator is used as the online optimization objective in tuning a complicated nonlinear system—the National Synchrotron Light Source-II storage ring. Through analyzing the Shannon entropy in measured Poincaré maps, not only can the commonly used nonlinear characterizations be extracted, but more importantly, the chaos can be quantified and then used for an online regularization of these maps. The method itself is general and applicable to other tunable nonlinear systems as well. Published by the American Physical Society 2025
36 MATERIALS SCIENCE↗
Dynamically reconfigurable topological routing in nonlinear photonic systems
The propagation path of topologically protected states is bound to the interface between regions with different topology, and as such, the functionality of linear photonic devices leveraging these states is fixed during fabrication. Here, we propose a mechanism for dynamic control over a driven dissipative system’s local topology, yielding reconfigurable topological interfaces and thus tunable paths for protected routing. We illustrate our approach in non-resonantly pumped polariton lattices, where the nonlinear interaction between the polaritons and the exciton reservoir due to non-resonant pumping can yield picosecond-scale changes in the propagation paths of the chiral edge states. To analytically confirm the numerically observed topological dynamics, we generalize the spectral localizer framework to non-linear non-Hermitian Chern materials and apply this framework to a continuous model of the polariton system based on a driven-dissipative Gross-Pitaevskii equation. In doing so, we show that the local changes in the polariton lattice’s topology are captured by a local Chern marker. Looking forward, we anticipate such reconfigurable topological routing will enable the realization of novel classes of topological photonic devices.
Wong, Stephan [Sandia National Laboratories (SNL-N↗
Robust Iterative Method for Symmetric Quantum Signal Processing in All Parameter Regimes
Here, this paper addresses the problem of solving nonlinear systems in the context of symmetric quantum signal processing (QSP), a powerful technique for implementing matrix functions on quantum computers. Symmetric QSP focuses on representing target polynomials as products of matrices in SU(2) that possess symmetry properties. We present a novel Newton’s method tailored for efficiently solving the nonlinear system involved in determining the phase factors within the symmetric QSP framework. Our method demonstrates rapid and robust convergence in all parameter regimes, including the challenging scenario with ill-conditioned Jacobian matrices, using standard double precision arithmetic operations. For instance, solving symmetric QSP for a highly oscillatory target function α cos(1000x) (polynomial degree ≈ 1433) takes 6 iterations to converge to machine precision when α = 0.9, and the number of iterations only increases to 18 iterations when α = 1 – 10 -9 with a highly ill-conditioned Jacobian matrix. Leveraging the matrix product state structure of symmetric QSP, the computation of the Jacobian matrix incurs a computational cost comparable to a single function evaluation. Moreover, we introduce a reformulation of symmetric QSP using real-number arithmetics, further enhancing the method’s efficiency. Extensive numerical tests validate the effectiveness and robustness of our approach, which has been implemented in the QSPPACK software package.
97 MATHEMATICS AND COMPUTING↗