Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear system”

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

Identification of general linear mechanical systems

Previous work in identification theory has been concerned with the general first order time derivative form. Linear mechanical systems, a large and important class, naturally have a second order form. This paper utilizes this additional structural information for the purpose of identification. A realization is obtained from input-output data, and then knowledge of the system input, output, and inertia matrices is used to determine a set of linear equations whereby we identify the remaining unknown system matrices. Necessary and sufficient conditions on the number, type and placement of sensors and actuators are given which guarantee identificability, and less stringent conditions are given which guarantee generic identifiability. Both a priori identifiability and a posteriori identifiability are considered, i.e., identifiability being insured prior to obtaining data, and identifiability being assured with a given data set.

Sirlin, S. W.↗

Efficient Space–Time Reduced Order Model for Linear Dynamical Systems in Python Using Less than 120 Lines of Code

A classical reduced order model (ROM) for dynamical problems typically involves only the spatial reduction of a given problem. Recently, a novel space–time ROM for linear dynamical problems has been developed [Choi et al., Space–tume reduced order model for large-scale linear dynamical systems with application to Boltzmann transport problems, Journal of Computational Physics, 2020], which further reduces the problem size by introducing a temporal reduction in addition to a spatial reduction without much loss in accuracy. The authors show an order of a thousand speed-up with a relative error of less than 10−5 for a large-scale Boltzmann transport problem. In this work, we present for the first time the derivation of the space–time least-squares Petrov–Galerkin (LSPG) projection for linear dynamical systems and its corresponding block structures. Utilizing these block structures, we demonstrate the ease of construction of the space–time ROM method with two model problems: 2D diffusion and 2D convection diffusion, with and without a linear source term. For each problem, we demonstrate the entire process of generating the full order model (FOM) data, constructing the space–time ROM, and predicting the reduced-order solutions, all in less than 120 lines of Python code. We compare our LSPG method with the traditional Galerkin method and show that the space–time ROMs can achieve O(10−3) to O(10−4) relative errors for these problems. Depending on parameter–separability, online speed-ups may or may not be achieved. For the FOMs with parameter–separability, the space–time ROMs can achieve O(10) online speed-ups. Finally, we present an error analysis for the space–time LSPG projection and derive an error bound, which shows an improvement compared to traditional spatial Galerkin ROM methods.

97 MATHEMATICS AND COMPUTING↗

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗

Modelling the human operator of slowly responding systems using linear models

Control of slowly responding systems, such as, helmsman steering a large ship, is examined. It is shown that the describing function techniques are useful in analyzing the control behavior of the helmsman. Models are developed to describe the helmsman's control behavior. It is shown that the cross over model is applicable to the analysis of control of slowly responding systems.

Veldhuyzen, W.↗

Versatile Low Level RF System For Linear Accelerators

The Low Level RF (LLRF) system is the source of all of the rf signals required for an rf linear accelerator. These signals are amplified to drive accelerator and buncher cavities. It can even provide the synchronizing signal for the rf power for a synchrotron. The use of Direct Digital Synthesis (DDS) techniques results in a versatile system that can provide multiple coherent signals at the same or different frequencies with adjustable amplitudes and phase relations. Pulsing the DDS allows rf switching with an essentially infinite on/off ratio. The LLRF system includes a versatile phase detector that allows phase-locking the rf frequency to a cavity at any phase angle over the full 360 deg. range. With the use of stepper motor driven slug tuners multiple cavity resonant frequencies can be phase locked to the rf source frequency. No external phase shifters are required and there is no feedback loop phase setup required. All that is needed is to turn the frequency feedback on. The use of Digital Signal Processing (DSP) allows amplitude and phase control over the entire rf pulse. This paper describes the basic principles of a LLRF system that has been used for both proton accelerators and electron accelerators, including multiple tank accelerators, sub-harmonic and fundamental bunchers, and synchrotrons.

43 PARTICLE ACCELERATORS↗

Stabilization of linear multivariable systems by output feedback.

A method is developed for improving the stability of linear multivariable systems using output feedback. The technique, which utilizes a gradient approach, has been mechanized in a digital computer program. Illustrative results are given for a seven-state two-feedback model of the Saturn V booster.

Mcbrinn, D. E.↗

Robust decoupled servomechanism theory for linear multivariable systems

Decoupling theory and robust servomechanism theory are applied to the design of linear multivariable systems with large parameter variations. In addition to being approximately decoupled in the transient period, the over-all system achieves tracking and disturbance rejection robustly in the steady state.

Wang, S.-H.↗

Transformation of two and three-dimensional regions by elliptic systems

A reliable linear system is presented for grid generation in 2-D and 3-D. The method is robust in the sense that convergence is guaranteed but is not as reliable as other nonlinear elliptic methods in generating nonfolding grids. The construction of nonfolding grids depends on having reasonable approximations of cell aspect ratios and an appropriate distribution of grid points on the boundary of the region. Some guidelines are included on approximating the aspect ratios, but little help is offered on setting up the boundary grid other than to say that in 2-D the boundary correspondence should be close to that generated by a conformal mapping. It is assumed that the functions which control the grid distribution depend only on the computational variables and not on the physical variables. Whether this is actually the case depends on how the grid is constructed. In a dynamic adaptive procedure where the grid is constructed in the process of solving a fluid flow problem, the grid is usually updated at fixed iteration counts using the current value of the control function. Since the control function is not being updated during the iteration of the grid equations, the grid construction is a linear procedure. However, in the case of a static adaptive procedure where a trial solution is computed and used to construct an adaptive grid, the control functions may be recomputed at every step of the grid iteration.

Mastin, C. Wayne↗

Data-driven Resilience Characterization of Control Dynamical Systems

In this paper, we define and quantify resiliency of a power network and propose data-driven algorithms for computing the same for the power grid. To do this, we use the Koopman operator framework to lift the controlled dynamical system to an abstract (possibly higher) dimensional space, where the evolution is linear. The linear system representation allows us to relate small time local controllability and observability of a general nonlinear control system to the controllability and observability of the lifted linear system. Finally, we define the resiliency of the underlying power grid in terms of the controllability and observability gramians of the lifted linear system. We illustrate the proposed approach to compute the resiliency metrics on time-series data obtained from a microgrid.

koopman operator, resilience, control↗

On the computation of minimal indices for linear multivariable systems

This paper presents an algorithm for the computation of the minimal indices for linear multivariable systems. The same algorithm can be used to determine the rank of a transfer function. As an application, this algorithm is shown to be useful in the design of non-interacting control systems.

Wang, S. H.↗

Design And Analysis Of Linear Control Systems

Package of five computer programs developed to assist in design and analysis of linear control systems by use of root-locus and frequency-response methods. Package written in FORTRAN (BODE, TPEAK) and BASIC (LOCUS, KTUNE, and POLYROOT).

Jamison, John W.↗

On the invertibility of linear multivariable systems

Some results concerning invertibility of a class of linear, time-invariant systems are presented. It is shown that by an appropriate factorization of the transfer matrix of such a system, the problem of checking its invertibility can be reduced to that of checking the invertibility of a lower-order system. A sufficient condition for invertibility is also obtained.

Patel, R. V.↗

Multigrid approaches to non-linear diffusion problems on unstructured meshes

The efficiency of three multigrid methods for solving highly non-linear diffusion problems on two-dimensional unstructured meshes is examined. The three multigrid methods differ mainly in the manner in which the nonlinearities of the governing equations are handled. These comprise a non-linear full approximation storage (FAS) multigrid method which is used to solve the non-linear equations directly, a linear multigrid method which is used to solve the linear system arising from a Newton linearization of the non-linear system, and a hybrid scheme which is based on a non-linear FAS multigrid scheme, but employs a linear solver on each level as a smoother. Results indicate that all methods are equally effective at converging the non-linear residual in a given number of grid sweeps, but that the linear solver is more efficient in cpu time due to the lower cost of linear versus non-linear grid sweeps.

Mavriplis, Dimitri J.↗