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 325 records · Page 18

Euclidean controllability of linear delay systems with limited controls

For linear delay systems with limited controls the notion of a proper control system is introduced. If the uncontrolled system x(t) = Ax(t) + Bx(t - h) is uniformly asymptotically stable and the control equation x(t) = Ax(t) + Bx(t-) + Cu(t) is proper, then the control system is Euclidean null-controllable. It is noted that controllability is equivalent to the system being proper for delay systems with unlimited power.

Chukwu, E. N.↗

Synthesis of a non-linear feedback system with significant plant-ignorance for prescribed time-domain tolerances

The problem considered is the design of a feedback system containing a linear, time invariant, minimum phase plant, whose parameters are known only within given bounds, such that the time response of the system remains within specified limits. A quasi-optimal design, for given design constraints, is one which minimizes the effect of white sensor noise on the input to the plant. An investigation was conducted on the use of the non linear device known as the Clegg integrator in the design of such a system. The describing function of the Clegg integrator has the same magnitude characteristic, apart from a scale factor, as the linear integrator, but has 52 deg less phase-lag, at all frequencies, than the linear integrator; thus, when used in a feedback system, it provides a larger stability margin than the linear integrator. This property allows the nonlinear feedback system to be designed so that the sensor noise is attenuated more than in the linear design.

Krishnan, K. R.↗

Convolution feedback systems.

Linear time-invariant feedback systems with multiple inputs and multiple outputs are examined. It is demonstrated that no loss of generality takes place considering the feedback to be unity. Necessary and sufficient conditions are derived for the closed-loop impulse response to be stable in a prescribed sense.

Desoer, C. A.↗

Contrast changes in fluoroscopic imaging systems and statistical variations of these changes

Experimental studies have indicated that: (1) The response of digitized fluoroscopic imaging systems is linear systems is linear with contrast over a rather wide range of absorber and cavity thicknesses. (2) Contrast changes associated with the addition of aluminum, iodine containing contrast agents and air of thicknesses 1mm or less can be detected with a 95% confidence level. (3) The standard deviation associated with such determination using clinically available X-ray generators and video disc recording is less than 1 percent. A large flat screen X-ray image intensifier has been constructed and some preliminary results obtained. Sensitivity achieved makes dose reduction a factor often greater than previously reported for a system using a conventional X-ray image intensifier.

Bailey, N. A.↗

Reduced-order modeling on a near-term quantum computer

Quantum computing is an advancing area of research in which computer hardware and algorithms are developed to take advantage of quantum mechanical phenomena. In recent studies, quantum algorithms have shown promise in solving linear systems of equations as well as systems of linear ordinary differential equations (ODEs) and partial differential equations (PDEs). Reducedorder modeling (ROM) algorithms for studying fluid dynamics have shown success in identifying linear operators that can describe flowfields, where dynamic mode decomposition (DMD) is a particularly useful method in which a linear operator is identified from data. In this work, DMD is reformulated as an optimization problem to propagate the state of the linearized dynamical system on a quantum computer. This reformulation was chosen as a means of facilitating implementation on a near-term quantum computer. Quadratic unconstrained binary optimization (QUBO), a technique for optimizing quadratic polynomials in binary variables, allows for quantum annealing algorithms to be applied. A quantum circuit model (quantum approximation optimization algorithm, QAOA) is utilized to obtain predictions of the state trajectories. Results are shown for the quantum-ROM predictions for flow over a 2D cylinder at Re = 220 and flow over a NACA0009 airfoil at Re = 500 and α = 15°. The quantum-ROM predictions are found to depend on the number of bits utilized for a fixed point representation and the truncation level of the DMD model. Comparisons with DMD predictions from a classical computer algorithm are made, as well as an analysis of the computational complexity and prospects for future, more fault-tolerant quantum computers.

97 MATHEMATICS AND COMPUTING↗

Dynamic compensator design for robust stability of linear uncertain systems

This paper presents a robust linear dynamic compensator design algorithm for linear uncertain systems whose parameters vary within given bounded sets. The algorithm explicitly incorporates the structure of the uncertainty into the design procedure and utilizes the elemental perturbation bounds developed recently. The special cases of linear state feedback and measurement feedback controllers are considered and the relative trade offs are discussed. The design algorithm is illustrated with the help of a simple example.

Yedavalli, R. K.↗

On the identifiability of linear dynamical systems

Consider the situation in which the unknown parameters of a stationary linear system may be parametrized by a set of unknown parameters. The question thus arises of when such a set of parameters can be uniquely identified on the basis of observed data. This problem is considered here both in the case of input and output observations and in the case of output observations in the presence of a white noise input. Conditions for local identifiability are derived for both situations and a sufficient condition for global identifiability is given for the former situation, i.e., when simultaneous input and output observations are available.

Glover, K.↗

Modelling chaotic vibrations using NASTRAN

Due to the unavailability and, later, prohibitive cost of the computational power required, many phenomena in nonlinear dynamic systems have in the past been addressed in terms of linear systems. Linear systems respond to periodic inputs with periodic outputs, and may be characterized in the time domain or in the frequency domain as convenient. Reduction to the frequency domain is frequently desireable to reduce the amount of computation required for solution. Nonlinear systems are only soluble in the time domain, and may exhibit a time history which is extremely sensitive to initial conditions. Such systems are termed chaotic. Dynamic buckling, aeroelasticity, fatigue analysis, control systems and electromechanical actuators are among the areas where chaotic vibrations have been observed. Direct transient analysis over a long time period presents a ready means of simulating the behavior of self-excited or externally excited nonlinear systems for a range of experimental parameters, either to characterize chaotic behavior for development of load spectra, or to define its envelope and preclude its occurrence.

Sheerer, T. J.↗

A Performance and Energy Study of GPU-Resident Preconditioners for Conjugate Gradient Solvers: In the Context of Existing and Novel Approaches

Optimizing a particular subprogram out of the set of Basic (sparse) Linear Algebra Subprograms (BLAS) for a given architecture is a common topic of research. In applications, however, these BLAS functions rarely appear in isolation; usually, many of them are used together, in various combinations and with varying inputs. As the need to solve a large, sparse linear system is ubiquitous throughout HPC applications, linear solvers constitute a realistic, sufficiently complex and well-defined representative use case for composite BLAS routines. To this end, based on a representative set of matrices drawn from a diverse set of fields, we present a framework to study, from the performance and energy perspective, the efficacy of GPU- resident parallel Conjugate Gradient (CG) linear solver with different preconditioner options, including Gauss-Seidel, Jacobi, and incomplete Cholesky. We also propose a novel GPU-based preconditioner, in which the triangular solves are approximated by an iterative process. The development of this preconditioner was motivated by solving large graph Laplacian linear systems, for which the existing preconditioners either perform slow on GPU-based platforms or are not applicable. We compare the performance of these preconditioners on different hardware accelerator architectures, i.e., AMD MI250X, MI100, Nvidia A100, V100, and Jetson. Our experiments reveal performance trade-offs and provide information on how to select the best strategy for the given linear system, dictated by its properties, and the platform of interest. We demonstrate the application of our novel preconditioner for solving CG and graph Laplacian systems. Overall, the framework can be utilized as a benchmark to guide informed decisions in choosing a specific preconditioner, i.e., whether it is better to rely on the performance of a triangular solver or on the performance of sparse matrix-vector product. Finally, by considering power consumption to solve the linear systems, we report the energy footprint for the solvers.

Preconditioned Conjugate Gradient, GPUs, iterative↗

Isolators Including Main Spring Linear Guide Systems

Embodiments of isolators, such as three parameter isolators, including a main spring linear guide system are provided. In one embodiment, the isolator includes first and second opposing end portions, a main spring mechanically coupled between the first and second end portions, and a linear guide system extending from the first end portion, across the main spring, and toward the second end portion. The linear guide system expands and contracts in conjunction with deflection of the main spring along the working axis, while restricting displacement and rotation of the main spring along first and second axes orthogonal to the working axis.

Goold, Ryan↗

Sparse Linear Algebra Toolkit for Computational Aerodynamics

Finding solutions to sparse linear systems of equations is an essential step in Computational Engineering applications of interest to NASA. Linear systems of equations are composed and solved in almost every computational engineering application. The characteristics of linear systems vary greatly from one application to another. Accordingly, there are a wide variety of methods for the solution of linear systems of equations. The operations and methods prepared by the authors are focused on linear systems of interest to NASA, primarily those associated with Computational Fluid Dynamics (CFD), Aeroelasticity, and Aeroacoustics. The Sparse Linear Algebra Toolkit (SLAT) is a coordinated collection of software featuring operations, methods, and data structures that are useful when solving sparse linear systems of equations on modern computer architectures. The implemented operations and methods are designed and tuned for parallelism in shared memory, in distributed memory, and across the hybrid combination of distributed-shared memory. The toolkit includes novel methods and implementations for modern architectures and facilitates development of new approaches for meeting NASA’s evolving computational engineering challenges using evolving computer architectures that are not available in vendor libraries. In this paper, significant features and interfaces within SLAT are presented and verified for simulations performed with NASA’s CFD solver, FUN3D. The runtime and scaling performance of the Generalized Minimum Residual (GMRES) method implemented in SLAT is analyzed for the linear subproblems within the solution of turbulent Navier-Stokes equations employed in the simulation of high-lift configurations. Prior to this work, the SPARSKIT GMRES implementation was the only Krylov subspace method available within FUN3D. A strong scaling study shows the SLAT GMRES implementation facilitates accurate Reynolds-averaged Navier-Stokes CFD solutions between 15% and 56% faster than the SPARSKIT GMRES implementation.

Stephen L Wood↗

Global transformations of nonlinear systems

Necessary and sufficient conditions for a nonlinear system of equations to be locally equivalent, in a neighborhood of the origin in the real number system, to a controllable linear system are combined with several versions of the global inverse function theorem to define sufficient conditions for transforming the nonlinear system into a linear system. Additionally, a technique is introduced for developing a transformation under the assumptions that the columns of a controllability matrix span an n-dimensional space. Finally, the n-l form of the controllability matrix columns is demonstrated to be involutive

Hunt, L. R.↗