SEARCH · Engineering Papers

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

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2

All sources NASA NTRS DOE OSTI

DOE OSTI2023

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↗

DOE OSTI2021

An Analog Preconditioner for Solving Linear Systems [Slides]

This presentation concludes in situ computation enables new approaches to linear algebra problems which can be both more effective and more efficient as compared to conventional digital systems. Preconditioning is well-suited to analog computation due to the tolerance for approximate solutions. When combined with prior work on in situ MVM for scientific computing, analog preconditioning can enable significant speedups for important linear algebra applications.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Reinforcement Learning of Structured Stabilizing Control for Linear Systems With Unknown State Matrix

This paper delves into designing feedback control gains for a continuous-time linear quadratic regulator (LQR) problem that is constrained to certain predefined structure with unknown state matrix. We bring forth the ideas from reinforcement learning (RL) in conjunction with sufficient stability and performance guarantees in order to design these structured gains using the trajectory measurements of states and controls. Here we first formulate a model-based framework using dynamic programming (DP) to embed the structural constraint to the LQR gain computation in the continuous-time setting, and then subsequently, formulate a policy iteration RL algorithm that can alleviate the requirement of known state matrix in conjunction with maintaining the feedback gain structure. The design enables a distributed learning control design which is necessary for many large-scale cyber-physical systems. Theoretical guarantees are provided for stability and convergence of the structured reinforcement learning (SRL) algorithm. We validate our theoretical results with numerical simulations on a multi-agent networked linear time-invariant (LTI) dynamic system.

42 ENGINEERING↗

DOE OSTI2026

Analysis of the elliptic integrable non-linear system in IOTA using tracking of a single electron

Integrable nonlinear lattices that can be realized in practical accelerators are of great interest, as they offer the potential to support high-intensity beams via Landau damping of collective instabilities. One such system, based on an elliptic potential, has been extensively studied at the IOTA storage ring at Fermilab. The analysis of strongly nonlinear dynamics with multi-particle bunches is challenging due to the rapid decoherence of kicked beams. IOTA has the capability to track single electrons using linear multi-anode photomultiplier tubes for simultaneously measuring transverse coordinates and arrival times of synchrotron-radiation pulses. This technology enables the full reconstruction of turn-by-turn positions and momenta in all three planes for a single particle. Using this apparatus, we measured the dependence of small-amplitude tunes on the strength of the nonlinear magnet, as well as tunes dependence on oscillations amplitudes.

Romanov, A. [Fermilab]↗

DOE OSTI2025

A linear delta system includes a support frame, rails mounted to the support frame, linear actuators, each linear actuator configured to translate along a longitudinal length of a respective rail, pairs of parallel rods each coupled to the linear actuators, a platform coupled to a longitudinal end of each of the pairs of parallel rods opposite the respective linear actuator, and an object coupled to the platform. Longitudinal axes of the rails are oriented parallel to each other and lie within a common plane or an uncommon plane. A method of forming a linear delta system includes mounting rails to a support frame, the rails having longitudinal axes that are parallel to each other and lying within a common plane, coupling a linear actuator to each of the rails, coupling a pair of parallel rods to each linear actuator, and coupling a platform to the pairs of parallel rods.

Crawford, Anthony L.↗

DOE OSTI2022

Krylov subspace recycling for evolving structures

Krylov subspace recycling is a powerful tool when solving a long series of large, sparse linear systems that change only slowly over time. In PDE constrained shape optimization, these series appear naturally, as typically hundreds or thousands of optimization steps are needed with only small changes in the geometry. In this setting, however, applying Krylov subspace recycling can be a difficult task. As the geometry evolves, in general, so does the finite element mesh defined on or representing this geometry, including the numbers of nodes and elements and element connectivity. This is especially the case if re-meshing techniques are used. As a result, the number of algebraic degrees of freedom in the system changes, and in general the linear system matrices resulting from the finite element discretization change size from one optimization step to the next. Changes in the mesh connectivity also lead to structural changes in the matrices. In the case of re-meshing, even if the geometry changes only a little, the corresponding mesh might differ substantially from the previous one. Obviously, this prevents any straightforward mapping of the approximate invariant subspace of the linear system matrix (the focus of recycling in this work) from one optimization step to the next; similar problems arise for other selected subspaces. In this paper, we present an algorithm to map an approximate invariant subspace of the linear system matrix for the previous optimization step to an approximate invariant subspace of the linear system matrix for the current optimization step, for general meshes. This is achieved by exploiting the map from coefficient vectors to finite element functions on the mesh, combined with interpolation or approximation of functions on the finite element mesh. We demonstrate the effectiveness of our approach numerically with several proof of concept studies for a specific meshing technique.

42 ENGINEERING↗