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 415 records · Page 23

Nonlinear transformat

A technique for designing automatic flight controllers for aircraft which utilizes the transformation theory of nonlinear systems to linear systems is presently being developed at NASA Ames Research Center. A method is considered in which a given nonlinear is transformed to a controllable linear system in Brunovsky canonical form. A linear approximation is introduced to the nonlinear system called the modified tangent model. This model is easily computed. Constructing the transformation for this model enables the designer to find an approximate transformation for the nonlinear system.

Ford, H.↗

Oscillation, Rotation, and Wandering of Solutions to Linear Differential Systems

For solutions of a linear system on the semi-axis, we introduce a series of Lyapunov exponents that describe the oscillation, rotation, and wandering properties of these solutions. In the case of systems with constant matrices, these exponents are closely related to the imaginary parts of the eigenvalues. We examine the problem on the existence of a similar relationship in the case of piecewise constant of arbitrary systems.

97 MATHEMATICS AND COMPUTING↗

Comparative kinetics and reciprocal inhibition of nitrate and nitrite uptake in roots of uninduced and induced barley (Hordeum vulgare L.) seedlings

Nitrate and NO2- transport by roots of 8-day-old uninduced and induced intact barley (Hordeum vulgare L. var CM 72) seedlings were compared to kinetic patterns, reciprocal inhibition of the transport systems, and the effect of the inhibitor, p-hydroxymercuribenzoate. Net uptake of NO3- and NO2- was measured by following the depletion of the ions from the uptake solutions. The roots of uninduced seedlings possessed a low concentration, saturable, low Km, possibly a constitutive uptake system, and a linear system for both NO3- and NO2-. The low Km system followed Michaelis-Menten kinetics and approached saturation between 40 and 100 micromolar, whereas the linear system was detected between 100 and 500 micromolar. In roots of induced seedlings, rates for both NO3- and NO2- uptake followed Michaelis-Menten kinetics and approached saturation at about 200 micromolar. In induced roots, two kinetically identifiable transport systems were resolved for each anion. At the lower substrate concentrations, less than 10 micromolar, the apparent low Kms of NO3- and NO2- uptake were 7 and 9 micromolar, respectively, and were similar to those of the low Km system in uninduced roots. At substrate concentrations between 10 and 200 micromolar, the apparent high Km values of NO3- uptake ranged from 34 to 36 micromolar and of NO2- uptake ranged from 41 to 49 micromolar. A linear system was also found in induced seedlings at concentrations above 500 micromolar. Double reciprocal plots indicated that NO3- and NO2- inhibited the uptake of each other competitively in both uninduced and induced seedlings; however, Ki values showed that NO3- was a more effective inhibitor than NO2-. Nitrate and NO2- transport by both the low and high Km systems were greatly inhibited by p-hydroxymercuribenzoate, whereas the linear system was only slightly inhibited.

NASA Program CELSS↗

Final Report - Summer Visit 2010

During my visit to LLNL during the summer of 2010, I worked on algebraic multilevel solvers for large sparse systems of linear equations arising from discretizations of partial differential equations. The particular solver of interest is based on ILU decomposition. The setup phase for this AMG solve is just the single ILU decomposition, and its corresponding error matrix. Because the ILU uses a minimum degree or similar sparse matrix ordering, most of the fill-in, and hence most of the error, is concentrated in the lower right corner of the factored matrix. All of the major multigrid components - the smoother, the coarse level correction matrices, and the fine-to-coarse and coarse-to-fine rectangular transfer matrices, are defined in terms of various blocks of the ILU factorization. Although such a strategy is not likely to be optimal in terms of convergence properties, it has a relatively low setup cost, and therefore is useful in situations where setup costs for more traditional AMG approaches cannot be amortized over the solution of many linear systems using the same matrix. Such a situation arises in adaptive methods, where often just one linear system is solved at each step of an adaptive feedback loop, or in solving nonlinear equations by approximate Newton methods, where the approximate Jacobian might change substantially from iteration to iteration. In general terms, coarse levels are defined in terms of successively smaller lower right blocks of the matrix, typically decreasing geometrically in order. The most difficult issue was the coarse grid correction matrix. The preconditioner/smoother for a given level is just the corresponding lower right blocks of the ILU factorization. The coarse level matrix itself is just the Schur complement; this matrix is not known exactly using just the ILU decomposition in the setup phase. Thus we approximate this matrix using various combinations of the preconditioning matrix and the error matrix. During my visit, several approximations of this type were implemented and tested. While some improved the convergence rate of the overall method, these gains had to be balanced against the additional costs involved in creating and applying these matrices. By this more stringent criterion, none of the improved approximations could be characterized as an unqualified success.

97 MATHEMATICS AND COMPUTING↗

Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark

The LINPACK benchmark reports the performance of a computer for solving a system of linear equations with dense random matrices. Although this task was not designed with a real application directly in mind, the LINPACK benchmark has been used to define the list of TOP500 supercomputers since the debut of the list in 1993. We propose that a similar benchmark, called the quantum LINPACK benchmark, could be used to measure the whole machine performance of quantum computers. The success of the quantum LINPACK benchmark should be viewed as the minimal requirement for a quantum computer to perform a useful task of solving linear algebra problems, such as linear systems of equations. We propose an input model called the Random Circuit Block-Encoded Matrix (RACBEM), which is a proper generalization of a dense random matrix in the quantum setting. The RACBEM model is efficient to be implemented on a quantum computer and can be designed to optimally adapt to any given quantum architecture, with relying on a black-box quantum compiler. Besides solving linear systems, the RACBEM model can be used to perform a variety of linear algebra tasks relevant to many physical applications, such as computing spectral measures, time series generated by a Hamiltonian simulation, and thermal averages of the energy. We implement these linear algebra operations on IBM Q quantum devices as well as quantum virtual machines, and demonstrate their performance in solving scientific computing problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Asynchronous Task-based Fan-Both Sparse Cholesky Solver

Systems of linear equations arise at the heart of many scientific and engineering applications. Many of these linear systems are sparse; i.e., most of the elements in the coefficient matrix are zero. Direct methods based on matrix factorizations are sometimes needed to ensure accurate solutions. For example, accurate solution of sparse linear systems is needed in shift-invert Lanczos to compute interior eigenvalues. The performance and resource usage of sparse matrix factorizations are critical to time-to-solution and maximum problem size solvable on a given platform. In many applications, the coefficient matrices are symmetric, and exploiting symmetry will reduce both the amount of work and storage cost required for factorization. When the factorization is performed on large-scale distributed memory platforms, communication cost is critical to the performance of the algorithm. At the same time, network topologies have become increasingly complex, so that modern platforms exhibit a high level of performance variability. This makes scheduling of computations an intricate and performance-critical task. In this paper, we investigate the use of an asynchronous task paradigm, one-sided communication and dynamic scheduling in implementing sparse Cholesky factorization (symPACK) on large-scale distributed memory platforms. Our solver symPACK relies on efficient and flexible communication primitives provided by the UPC++ library. Performance evaluation shows good scalability and that symPACK outperforms state-of-the-art parallel distributed memory factorization packages, validating our approach on practical cases.

Jacquelin, Mathias↗

Linear delta systems, hexapod systems, and related methods

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.↗

Modal interaction in linear dynamic systems near degenerate modes

In various problems in structural dynamics, the eigenvalues of a linear system depend on a characteristic parameter of the system. Under certain conditions, two eigenvalues of the system approach each other as the characteristic parameter is varied, leading to modal interaction. In a system with conservative coupling, the two eigenvalues eventually repel each other, leading to the curve veering effect. In a system with nonconservative coupling, the eigenvalues continue to attract each other, eventually colliding, leading to eigenvalue degeneracy. Modal interaction is studied in linear systems with conservative and nonconservative coupling using singularity theory, sometimes known as catastrophe theory. The main result is this: eigenvalue degeneracy is a cause of instability; in systems with conservative coupling, it induces only geometric instability, whereas in systems with nonconservative coupling, eigenvalue degeneracy induces both geometric and elastic instability. Illustrative examples of mechanical systems are given.

Afolabi, D.↗

A Signal Transmission Technique for Stability Analysis of Multivariable Non-Linear Control Systems

Among the difficulties associated with multivariable, non-linear control systems is the problem of assessing closed-loop stability. Of particular interest is the class of non-linear systems controlled with on/off actuators, such as spacecraft thrusters or electrical relays. With such systems, standard describing function techniques are typically too conservative, and time-domain simulation analysis is prohibitively extensive, This paper presents an open-loop analysis technique for this class of non-linear systems. The technique is centered around an innovative use of multivariable signal transmission theory to quantify the plant response to worst case control commands. The technique has been applied to assess stability of thruster controlled flexible space structures. Examples are provided for Space Shuttle attitude control with attached flexible payloads.

Jackson, Mark↗

Time-delay control of a magnetic levitated linear positioning system

In this paper, a high accuracy linear positioning system with a linear force actuator and magnetic levitation is proposed. By locating a permanently magnetized rod inside a current-carrying solenoid, the axial force is achieved by the boundary effect of magnet poles and utilized to power the linear motion, while the force for levitation is governed by Ampere's Law supplied with the same solenoid. With the levitation in a radial direction, there is hardly any friction between the rod and the solenoid. The high speed motion can hence be achieved. Besides, the axial force acting on the rod is a smooth function of rod position, so the system can provide nanometer resolution linear positioning to the molecule size. Since the force-position relation is highly nonlinear, and the mathematical model is derived according to some assumptions, such as the equivalent solenoid of the permanently magnetized rod, so there exists unknown dynamics in practical application. Thus 'robustness' is an important issue in controller design. Meanwhile the load effect reacts directly on the servo system without transmission elements, so the capability of 'disturbance rejection; is also required. With the above consideration, a time-delay control scheme is chosen and applied. By comparing the input-output relation and the mathematical model, the time-delay controller calculates an estimation of unmodeled dynamics and disturbances and then composes the desired compensation into the system. Effectiveness of the linear positioning system and control scheme are illustrated with simulation results.

Tarn, J. H.↗