Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear dynamical 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.

At least 37 records · Page 2

A compute-bound formulation of Galerkin model reduction for linear time-invariant dynamical systems

This work aims to advance computational methods for projection-based reduced-order models (ROMs) of linear time-invariant (LTI) dynamical systems. For such systems, current practice relies on ROM formulations expressing the state as a rank-1 tensor (i.e., a vector), leading to computational kernels that are memory bandwidth bound and, therefore, ill-suited for scalable performance on modern architectures. This weakness can be particularly limiting when tackling many-query studies, where one needs to run a large number of simulations. This work introduces a reformulation, called rank-2 Galerkin, of the Galerkin ROM for LTI dynamical systems which converts the nature of the ROM problem from memory bandwidth to compute bound. We present the details of the formulation and its implementation, and demonstrate its utility through numerical experiments using, as a test case, the simulation of elastic seismic shear waves in an axisymmetric domain. We quantify and analyze performance and scaling results for varying numbers of threads and problem sizes. In conclusion, we present an end-to-end demonstration of using the rank-2 Galerkin ROM for a Monte Carlo sampling study. We show that the rank-2 Galerkin ROM is one order of magnitude more efficient than the rank-1 Galerkin ROM (the current practice) and about 970 times more efficient than the full-order model, while maintaining accuracy in both the mean and statistics of the field.

97 MATHEMATICS AND COMPUTING↗

Space-Split Algorithm for Sensitivity Analysis of Discrete Chaotic Systems With Multidimensional Unstable Manifolds

Accurate approximations of the change of a system's output and its statistics with respect to the input are highly desired in computational dynamics. Ruelle's linear response theory provides breakthrough mathematical machinery for computing the linear response of chaotic dynamical systems. In this paper, we propose an algorithm for sensitivity analysis of discrete chaos with an arbitrary number of positive Lyapunov exponents. We combine the concept of perturbation space-splitting, which regularizes Ruelle's original expression, together with measure-based parameterization of the expanding subspace. We use these tools to rigorously derive trajectory-following recursive relations that converge exponentially fast, and construct a memory-efficient Monte Carlo scheme for derivatives of the output statistics. Thanks to the regularization and lack of simplifying assumptions on the system's behavior, our method is immune to the common problems of other popular methods such as the exploding tangent solutions and unphysical shadowing directions. Here, we provide a ready-to-use algorithm, analyze its complexity, and demonstrate several numerical examples of sensitivity computation using physically-inspired low-dimensional systems.

97 MATHEMATICS AND COMPUTING↗

Data-Driven Distributed Algorithms for Estimating Eigenvalues and Eigenvectors of Interconnected Dynamical Systems

Here, the paper presents data-driven algorithms to estimate in a distributed manner the eigenvalues, right and left eigenvectors of an unknown linear (or linearized) interconnected dynamic system. In particular, the proposed algorithms do not require the identification of the system model in advance before performing the estimation. As a first step, we consider interconnected dynamical system with distinct eigenvalues. The proposed strategy first estimates the eigenvalues using the well-known Prony method. The right and left eigenvectors are then estimated by solving distributively a set of linear equations. One important feature of the proposed algorithms is that the topology of communication network used to perform the distributed estimation can be chosen arbitrarily, given that it is connected, and is also independent of the structure or sparsity of the system (state) matrix. The proposed distributed algorithms are demonstrated via a numerical example.

97 MATHEMATICS AND COMPUTING↗

Online real-time learning of dynamical systems from noisy streaming data

Abstract Recent advancements in sensing and communication facilitate obtaining high-frequency real-time data from various physical systems like power networks, climate systems, biological networks, etc. However, since the data are recorded by physical sensors, it is natural that the obtained data is corrupted by measurement noise. In this paper, we present a novel algorithm for online real-time learning of dynamical systems from noisy time-series data, which employs the Robust Koopman operator framework to mitigate the effect of measurement noise. The proposed algorithm has three main advantages: (a) it allows for online real-time monitoring of a dynamical system; (b) it obtains a linear representation of the underlying dynamical system, thus enabling the user to use linear systems theory for analysis and control of the system; (c) it is computationally fast and less intensive than the popular extended dynamic mode decomposition (EDMD) algorithm. We illustrate the efficiency of the proposed algorithm by applying it to identify the Van der Pol oscillator, the chaotic attractor of the Henon map, the IEEE 68 bus system, and a ring network of Van der Pol oscillators.

97 MATHEMATICS AND COMPUTING↗

Fast and Scalable FFT-Based GPU-Accelerated Algorithms for Block-Triangular Toeplitz Matrices with Application to Linear Inverse Problems Governed by Autonomous Dynamical Systems

In this work, we present an efficient and scalable algorithm for performing matrix-vector multiplications (matvecs) for block Toeplitz matrices. Such matrices, which are shift-invariant with respect to their blocks, arise in the context of solving inverse problems governed by autonomous systems, and time-invariant systems in particular. In this article, we consider inverse problems that infer unknown parameters from observational data of a linear time-invariant dynamical system given in the form of partial differential equations (PDEs). Matrix-free Newton-conjugate-gradient methods are often the gold standard for solving these inverse problems, but they require numerous actions of the Hessian on a vector. Matrix-free adjoint-based Hessian matvecs require solution of a pair of linearized forward/adjoint PDE solves per Hessian action, which may be prohibitive for large-scale inverse problems. Time invariance of the forward PDE problem leads to a block Toeplitz structure of the discretized parameter-to-observable (p2o) map defining the mapping from inputs (parameters) to outputs (observables) of the PDEs. This block Toeplitz structure enables us to exploit two key properties: (1) compact storage of the p2o map and its adjoint, and (2) efficient fast Fourier transform–based Hessian matvecs. The proposed algorithm is mapped onto large multi-GPU clusters and achieves more than 80% of peak bandwidth on NVIDIA A100 GPUs. Excellent weak scaling is shown for up to 48 A100 GPUs. For the targeted problems, the implementation executes Hessian matvecs within fractions of a second, which is orders of magnitude faster than can be achieved by conventional matrix-free Hessian matvecs via forward/adjoint PDE solves.

97 MATHEMATICS AND COMPUTING↗

Adaptive Control for Load-Following of Boiling Water Reactors Part I: Linear Systems and Fully-Observable Dynamics

Automation control is a key strategy to improve the economic competitiveness of nuclear power plants. Not only does it help reduce operational costs, but it also extends the value proposition of these plants to nontraditional markets, including unattended operations in remote villages and space. However, the dynamics of the operating environments of nuclear reactors are subject to changes over time, and there are no widely adopted methods to ensure that the automation strategy will remain effective over the extended durations required for these applications. Adaptive control is a discipline that offers the possibility to accommodate such changes online. However, it relies on mathematical assumptions that must be respected to ensure robustness and reliability. In this work, we derive an adaptive control formulation for linear systems in which all states are observable and apply it to an instance of load-follow operation for Boiling Water Reactors. We assumed uncertainty in two factors: the temperature coefficient and the control rod worth, both of which are affected over time by the evolution of the nuclear reactor core environment. With an arbitrary penalty factor of 5, we found that the mean absolute and integral time absolute errors can be reduced by more than 90%, underscoring the strength of adaptive control. To extend the application to more challenges, different uncertainties and load-follow trajectories, as well as new formulations that include non-linearity and partial observability, are currently being developed.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

Weighted Composition Operators for Learning Nonlinear Dynamics

Operator theoretic methods in dynamical system have been dominated by the use of Koopman operators and their continuous time counterparts, such as Koopman Generators and Liouville Operators. The advantage gained from their use primarily stems from the ability to extract subspaces and eigenfunctions within a space of observables that are invariant with respect to the Koopman operator over that space. When this occurs, a dynamic mode decomposition of the systems state provides a linear model for the dynamical system. Not all Koopman operators have eigenfunctions that may be exploited in this manner. However, the framework can still be leveraged for approximations using other operators. In this setting, we present a different operator for the study of dynamical systems, the weighted composition operator. These operators are compact for a wide range of dynamics and spaces, and through their interactions with occupation kernels and vector valued kernels, they admit an estimation of the underlying dynamics. Here, this manuscript presents a new algorithm for the data driven study of dynamical systems from data, and also provides two numerical experiments where convergence is achieved as a proof of concept.

97 MATHEMATICS AND COMPUTING↗

On resistive interchange, double tearing, and resonant and non-resonant infernal modes in spherical tokamak negative central shear discharges

We examine the linear and nonlinear stability of a sequence of reversed shear NSTX equilibria with the same toroidal current density and pressure profile but with different toroidal field strengths. All equilibria have two q = 2 surfaces and have q > 1 everywhere. For this sequence, which all have β P ∼ 0.5, as the minimum value of q decreases below about 1.4, the localized resistive interchange criterion is strongly violated, and the unstable mode with toroidal mode number n=1 changes its dominant poloidal mode number m from a (m,n)=(2,1) double tearing mode to a non-resonant (1,1) infernal mode. This (1,1) mode nonlinearly flattens both the current density and the pressure near the magnetic axis. The higher-n unstable modes are all resistive infernal modes localized around the surface where q has a minimum and the magnetic shear vanishes. They generally saturate nonlinearly at low amplitude but can cause magnetic surface breakup near the axis.

Spitzer resistivity↗

Computational assessment of smooth and rough parameter dependence of statistics in chaotic dynamical systems

An assumption of smooth response to small parameter changes, of statistics or long-time averages of a chaotic system, is generally made in the field of sensitivity analysis, and the parametric derivatives of statistical quantities are critically used in science and engineering. In this paper, we propose a numerical procedure to assess the differentiability of statistics with respect to parameters in chaotic systems. Here, we numerically show that the existence of the derivative depends on the Lebesgue integrability of a certain density gradient function, which we define as the derivative of logarithmic SRB density along the unstable manifold. We develop a recursive formula for the density gradient that can be efficiently computed along trajectories, and demonstrate its use in determining the differentiability of statistics. Our numerical procedure is illustrated on low-dimensional chaotic systems whose statistics exhibit both smooth and rough regions in parameter space.

42 ENGINEERING↗

Local carbon reserves are insufficient for phloem terpene induction during drought in Pinus edulis in response to bark beetle–associated fungi

Stomatal closure during drought inhibits carbon uptake and may reduce a tree's defensive capacity. Limited carbon availability during drought may increase a tree's mortality risk, particularly if drought constrains trees' capacity to rapidly produce defenses during biotic attack. We parameterized a new model of conifer defense using physiological data on carbon reserves and chemical defenses before and after a simulated bark beetle attack in mature Pinus edulis under experimental drought. Attack was simulated using inoculations with a consistent bluestain fungus (Ophiostoma sp.) of Ips confusus, the main bark beetle colonizing this tree, to induce a defensive response. Trees with more carbon reserves produced more defenses but measured phloem carbon reserves only accounted for c. 23% of the induced defensive response. Our model predicted universal mortality if local reserves alone supported defense production, suggesting substantial remobilization and transport of stored resin or carbon reserves to the inoculation site. Our results show that de novo terpene synthesis represents only a fraction of the total measured phloem terpenes in P. edulis following fungal inoculation. Without direct attribution of phloem terpene concentrations to available carbon, many studies may be overestimating the scale and importance of de novo terpene synthesis in a tree's induced defense response.

59 BASIC BIOLOGICAL SCIENCES↗

Leveraging FPGA Advantages for Quicker Data Processing for LBNF

The Long Baseline Neutrino Facility (LBNF) will deliver a 2.4 MW muon neutrino beam from Fermilab to the Deep Underground Neutrino Experiment (DUNE), requiring unprecedented precision in beamline alignment to achieve DUNE's neutrino oscillation measurement goals. Vertical misalignments of beamline components as small as 0.5 mm can contribute 6-7\% uncertainty in predicted neutrino flux, necessitating sub-0.1 mm alignment monitoring capabilities. The Horn Location Sensor (HLS) system employs frequency sweep interferometry (FSI) in a distributed hydrostatic leveling network to achieve the required precision under harsh radiation conditions up to 5000 kRad/year. Traditional FSI implementations suffer from laser sweep nonlinearities that degrade resolution and require computationally intensive post-processing corrections using gas reference cells. This work presents a real-time FPGA-based implementation of the HLS data acquisition and processing system using a sweep tracker interferometer for dynamic sweep linearization. The system utilizes a PYNQ-Z2 FPGA with programmable logic implementing parallel 16k-point FFT processing across four channels, synchronized by the sweep tracker signal to eliminate post-processing requirements. Spectral performance testing demonstrates significant improvements in peak sharpness compared to traditional fixed-frequency digitization. The FPGA implementation enables real-time displacement monitoring with processing speeds orders of magnitude faster than software-based approaches, essential for the operational requirements of LBNF's eventual distributed sensor network. This advancement in real-time FSI processing directly supports DUNE's precision neutrino physics program by providing the rapid feedback necessary for maintaining stringent beamline alignment tolerances during high-power beam operations.

Rossel, Jacob↗

Real-Time FPGA Implementation For Frequency Sweep Interferometry In The LBNF Complex

The Long Baseline Neutrino Facility (LBNF) will deliver a 2.4 MW muon neutrino beam from Fermilab to the Deep Underground Neutrino Experiment (DUNE), requiring unprecedented precision in beamline alignment to achieve DUNE's neutrino oscillation measurement goals. Vertical misalignments of beamline components as small as 0.5 mm can contribute 6-7\% uncertainty in predicted neutrino flux, necessitating sub-0.1 mm alignment monitoring capabilities. The Horn Location Sensor (HLS) system employs frequency sweep interferometry (FSI) in a distributed hydrostatic leveling network to achieve the required precision under harsh radiation conditions up to 5000 kRad/year. Traditional FSI implementations suffer from laser sweep nonlinearities that degrade resolution and require computationally intensive post-processing corrections using gas reference cells. This work presents a real-time FPGA-based implementation of the HLS data acquisition and processing system using a sweep tracker interferometer for dynamic sweep linearization. The system utilizes a PYNQ-Z2 FPGA with programmable logic implementing parallel 16k-point FFT processing across four channels, synchronized by the sweep tracker signal to eliminate post-processing requirements. Spectral performance testing demonstrates significant improvements in peak sharpness compared to traditional fixed-frequency digitization. The FPGA implementation enables real-time displacement monitoring with processing speeds orders of magnitude faster than software-based approaches, essential for the operational requirements of LBNF's eventual distributed sensor network. This advancement in real-time FSI processing directly supports DUNE's precision neutrino physics program by providing the rapid feedback necessary for maintaining stringent beamline alignment tolerances during high-power beam operations.

Rossel, A. Jacob [Fermilab; Unlisted]↗

Data-driven modeling and control of dynamical systems using Koopman and Perron-Frobenius operators

This dissertation studies the data-driven modeling and control problem of nonlinear systems by exploiting the linear operator theoretic framework involving Koopman and Perro-Frobenius operator. A systematic linear-operator based controller design procedure has been established, which can be used to solve a variety of nonlinear control problems, including feedback stabilization using control Lyapunov functions, optimal quadratic regulation using Koopman eigenfunctions and convex optimization formulation of optimal control problem using P-F and Koopman operator approximation. As the core of data-driven modeling, we first propose a new algorithm for the finite-dimensional approximation of the linear transfer Koopman and Perron-Frobenius operator from time-series data. We argue that the existing approach for the finite-dimensional approximation of these transfer operators such as Dynamic Mode Decomposition (DMD) and Extended Dynamic Mode Decomposition (EDMD) do not capture two important properties of these operators, namely positivity and Markov property. The algorithm we propose preserves these two properties. We call the proposed algorithm as naturally structured DMD (NSDMD) since it retains the inherent properties of these operators. Naturally structured DMD algorithm leads to a better approximation of the steady-state dynamics of the system regarding computing Koopman and Perron- Frobenius operator eigenfunctions and eigenvalues. However, preserving positivity property is critical for capturing the real transient dynamics of the system. This positivity property of the transfer operators and it's finite-dimensional approximation play an important role for controller and estimator design of nonlinear systems. To solve the feedback stabilization problem for nonlinear control systems, we tried to take advantage of the Koopman operator framework. The Koopman operator approach provides a linear representation for a nonlinear dynamical system and a bilinear representation for a nonlinear control system. The problem of feedback stabilization of a nonlinear control system is then transformed to the stabilization of a bilinear control system. We propose a control Lyapunov function (CLF)-based approach for the design of stabilizing feedback controllers for the bilinear system. The search for finding a CLF for the bilinear control system is formulated as a convex optimization problem. This leads to a schematic procedure for designing CLF-based stabilizing feedback controllers for the bilinear system and hence the original nonlinear system. Another advantage of the proposed controller design approach outlined in this dissertation is that it does not require explicit knowledge of system dynamics. In particular, the bilinear representation of a nonlinear control system in the Koopman eigenfunction space can be obtained from time-series data. Next, we study the optimal quadratic regulation problem for nonlinear systems. The linear operator theoretic framework involving the Koopman operator is used to lift the dynamics of nonlinear control system to an infinite-dimensional bilinear system. The optimal quadratic regulation problem for nonlinear system is formulated in terms of the finite-dimensional approximation of the bilinear system. A convex optimization-based approach is proposed for solving the quadratic regulator problem for bilinear system. We applied a variety of examples and compared the simulation results between our framework and conventional LQR control using linearized model. For more general optimal control problems, we provide a density-function based convex formulation for the optimal control problem of the nonlinear system. The convex formulation relies on the duality result in the stability theory of a dynamical system involving density function and Perron-Frobenius operator. The optimal control problem is formulated as an infinite-dimensional convex optimization program. The finite-dimensional approximation of the optimization problem relies on the recent advances made in the data-driven computation of the Koopman operator, which is dual to the Perron-Frobenius operator. Simulation results are presented to demonstrate the application of the developed framework.

Huang, Bowen↗

Network-Wide Traffic Signal Control Using Bilinear System Modeling and Adaptive Optimization

This study proposes a new multi-input multi-output optimal bilinear signal control method in which a bilinear dynamic model approximation is used to capture the nonlinear dynamics of the urban traffic networks. With signal green time splits as the control input and traffic delay changes as the output for each intersections in the network, a bilinear system model was developed, which, on the basis of linear system modeling, takes interactions among traffic delays and signal timing splits into consideration. Based on the bilinear system modeling framework, we conducted two steps in each time interval to derive traffic control strategies: (1) we used the normalized least-squared algorithm to estimate system parameters; and (2) we solved an online optimization problem to obtain the updated traffic control inputs for the signal timing that minimizes future traffic delays. We evaluated the proposed method in a microscopic traffic simulation environment (VISSIM) with a 35-intersection network of Bellevue city in Washington. Two different traffic demand patterns: (1) normal traffic demands; and (2) time-varying traffic demands were simulated to compare the performance of different control strategies. Experimental results show that (1) the proposed bilinear system model can better describe traffic system dynamics than linear-model based methods, such as our previously developed linear-quadratic regulator control; and (2) the proposed method outperforms the state-of-the-art signal control strategies, namely the max-pressure and the self-organizing traffic light control methods. We have also shown that the proposed method is applicable to all other possible network layouts and signal controller phasing structures.

42 ENGINEERING↗

Data-Driven Model Predictive Control for Temperature Management of Heat Pipe Microreactor

To enable the self-regulating capability of heat pipe (HP) microreactors, an anticipatory control strategy through model predictive control (MPC) could proactively respond to potential disturbances and deviations in operating setpoints. However, a key factor prohibiting the widespread adoption of MPCs in nuclear applications is the effort and computational costs associated with learning and calibrating first-principles-based process models when the target system is complex and when there are gaps between modeled and target reactor systems. In this paper, we demonstrate data-driven MPC using three approaches for modeling the system dynamics, including a linear state-space model, feedforward neural network, and recurrent neural networks long short-term memory. We present the development and validation process of each model and compare the performance of data-driven MPCs in controlling the temperatures of selected HPs at the evaporator and condenser regions in a 37-HP-monolith system. Our results show that, qualitatively, all data-driven MPCs are producing similar control actions, while quantitatively, with artificial neural nets (especially feedforward neural nets), MPC can better follow drastic changes in setpoints with smallest errors.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Deep-Learning-Based Koopman Modeling for Online Control Synthesis of Nonlinear Power System Transient Dynamics

Power system stability and control have become more challenging due to the increasing uncertainty associated with renewable generation. Here, the performance of conventional control is highly driven by the physics-based offline-developed dynamic models that can deviate from the actual system characteristics under different operating conditions and/or configurations. Data-driven approaches based on online measurements can be a better solution to addressing these issues by capturing real-time operation conditions. This article describes a novel fully data-driven probabilistic framework to derive a linear representation of postcontingency grid dynamics and online prescribe control based on the derived model to enhance transient stability. The complex nonlinear power system dynamics is approximated by a linear model by using multiple neural network modules that infer distributions of the observations and introducing a Koopman layer to sample possible Koopman linear models from the inferred distributions. The trained model features linearity that can be easily incorporated into the existing linear control design paradigm and ease the controller design process. The effectiveness of Koopman-based control designs is validated through comparative case studies, which demonstrate increased prediction accuracy and control performance when applied to a power system with heterogeneous generator dynamics.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Data-driven learning of Mori–Zwanzig operators for isotropic turbulence

Developing reduced-order models for turbulent flows, which contain dynamics over a wide range of scales, is an extremely challenging problem. In statistical mechanics, the Mori–Zwanzig (MZ) formalism provides a mathematically exact procedure for constructing reduced-order representations of high-dimensional dynamical systems, where the effects due to the unresolved dynamics are captured in the memory kernel and orthogonal dynamics. Turbulence models based on MZ formalism have been scarce due to the limited knowledge of the MZ operators, which originates from the difficulty in deriving MZ kernels for complex nonlinear dynamical systems. In this work, we apply a recently developed data-driven learning algorithm, which is based on Koopman's description of dynamical systems and Mori's linear projection operator, on a set of fully resolved isotropic turbulence datasets to extract the Mori–Zwanzig operators. With data augmentation using known turbulence symmetries, the extracted Markov term, memory kernel, and orthogonal dynamics are statistically converged and the generalized fluctuation–dissipation relation can be verified. The properties of the memory kernel and orthogonal dynamics, and their dependence on the choices of observables are investigated to address the modeling assumptions that are commonly used in MZ-based models. A series of numerical experiments are then constructed using the extracted kernels to evaluate the memory effects on prediction. The results show that the prediction errors are strongly affected by the choice of observables and can be further reduced by including the past history of the observables in the memory kernel.

97 MATHEMATICS AND COMPUTING↗

An analytic approach to quasinormal modes for coupled linear systems

Quasinormal modes describe the ringdown of compact objects deformed by small perturbations. In generic theories of gravity that extend General Relativity, the linearized dynamics of these perturbations is described by a system of coupled linear differential equations of second order. We first show, under general assumptions, that such a system can be brought to a Schrödinger-like form. We then devise an analytic approximation scheme to compute the spectrum of quasinormal modes. We validate our approach using a toy model with a controllable mixing parameter ε and showing that the analytic approximation for the fundamental mode agrees with the numerical computation when the approximation is justified. The accuracy of the analytic approximation is at the (sub-) percent level for the real part and at the level of a few percent for the imaginary part, even when ε is of order one. Our approximation scheme can be seen as an extension of the approach of Schutz and Will [1] to the case of coupled systems of equations, although our approach is not phrased in terms of a WKB analysis, and offers a new viewpoint even in the case of a single equation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗