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 955 records · Page 53

Extremum seeking for optimal control problems with unknown time-varying systems and unknown objective functions

We consider the problem of optimal feedback control of an unknown, noisy, time-varying, dynamic system that is initialized repeatedly. Examples include a robotic manipulator which must perform the same motion, such as assisting a human, repeatedly and accelerating cavities in particle accelerators which are turned on for a fraction of a second with given initial conditions and vary slowly due to temperature fluctuations. In this paper, we present an approach that applies to systems of practical interest. The method presented here is model independent; does not require knowledge of the objective function; is robust to measurement noise; is applicable for any set of initial conditions; is applicable to simultaneously controlling an arbitrary number of parameters; and may be implemented with a broad range of continuous or discontinuous functions such as sine or square waves. For systems with convex cost functions we prove that our algorithm will produce controllers that approach the minimal cost. For linear systems we reproduce the cost minimizing linear quadratic regulator optimal controller that could have been designed analytically had the system and cost function been known. We demonstrate the effectiveness of the algorithm with simulation studies of noisy and time-varying systems.

42 ENGINEERING↗

Steady state likelihood ratio sensitivity analysis for stiff kinetic Monte Carlo simulations

Kinetic Monte Carlo simulation is an integral tool in the study of complex physical phenomena present in applications ranging from heterogeneous catalysis to biological systems to crystal growth and atmospheric sciences. Sensitivity analysis is useful for identifying important parameters and rate-determining steps, but the finite-difference application of sensitivity analysis is computationally demanding. Techniques based on the likelihood ratio method reduce the computational cost of sensitivity analysis by obtaining all gradient information in a single run. However, we show that disparity in time scales of microscopic events, which is ubiquitous in real systems, introduces drastic statistical noise into derivative estimates for parameters affecting the fast events. In this work, the steady-state likelihood ratio sensitivity analysis is extended to singularly perturbed systems by invoking partial equilibration for fast reactions, that is, by working on the fast and slow manifolds of the chemistry. Derivatives on each time scale are computed independently and combined to the desired sensitivity coefficients to considerably reduce the noise in derivative estimates for stiff systems. The approach is demonstrated in an analytically solvable linear system.

Núñez, M.↗

A supernodal all-pairs shortest path algorithm

We show how to exploit graph sparsity in the Floyd-Warshall algorithm for the all-pairs shortest path (Apsp) problem. Floyd-Warshall is an attractive choice for Apsp on high-performing systems due to its structural similarity to solving dense linear systems and matrix multiplication. However, if sparsity of the input graph is not properly exploited, Floyd-Warshall will perform unnecessary asymptotic work and thus may not be a suitable choice for many input graphs. To overcome this limitation, the key idea in our approach is to use the known algebraic relationship between Floyd-Warshall and Gaussian elimination, and import several algorithmic techniques from sparse Cholesky factorization, namely, fill-in reducing ordering, symbolic analysis, supernodal traversal, and elimination tree parallelism. When combined, these techniques reduce computation, improve locality and enhance parallelism. We implement these ideas in an efficient shared memory parallel prototype that is orders of magnitude faster than an efficient multi-threaded baseline Floyd-Warshall that does not exploit sparsity. Our experiments suggest that the Floyd-Warshall algorithm can compete with Dijkstra's algorithm (the algorithmic core of Johnson's algorithm) for several classes sparse graphs.

Sao, Piyush↗

Control by model error estimation

Modern control theory relies upon the fidelity of the mathematical model of the system. Truncated modes, external disturbances, and parameter errors in linear system models are corrected by augmenting to the original system of equations an 'error system' which is designed to approximate the effects of such model errors. A Chebyshev error system is developed for application to the Large Space Telescope (LST).

Likins, P. W.↗

Active control of acoustic pressure fields using smart material technologies

An overview describing the use of piezoceramic patches in reducing noise in a structural acoustics setting is presented. The passive and active contributions due to patches which are bonded to an Euler-Bernoulli beam or thin shell are briefly discussed and the results are incorporated into a 2-D structural acoustics model. In this model, an exterior noise source causes structural vibrations which in turn lead to interior noise as a result of nonlinear fluid/structure coupling mechanism. Interior sound pressure levels are reduced via patches bonded to the flexible boundary (a beam in this case) which generate pure bending moments when an out-of-phase voltage is applied. Well-posedness results for the infinite dimensional system are discussed and a Galerkin scheme for approximating the system dynamics is outlined. Control is implemented by using linear quadratic regulator (LQR) optimal control theory to calculate gains for the linearized system and then feeding these gains back into the nonlinear system of interest. The effectiveness of this strategy for this problem is illustrated in an example.

Banks, H. T.↗

Stable Inversion for Nonlinear Nonminimum-Phase Time Varying Systems

In this paper, we extend stable inversion to nonlinear time-varying systems and study computational issues; the technique is applicable to minimum-phase as well as nonminimum-phase systems. The inversion technique is new, even in the linear time-varying case, and relies on partitioning (the dichotomic split of) the linearized system dynamics into time-varying, stable, and unstable, submanifolds. This dichotomic split is used to build time-varying filters which are, in turn, the basis of a contraction used to find a bounded inverse input-state trajectory. Finding the inverse input-state trajectory allows the development or exact-output tracking controllers. The method is local to the time-varying trajectory and requires that the internal dynamics vary slowly; however, the method represents a significant advance relative to presently available tracking controllers. Present techniques are restricted to time-invariant nonlinear systems and, in the general case, track only asymptotically.

Devasia, S.↗

New frequency domain methods for system identification

This paper presents two new techniques for frequency domain identification of linear system parameters. The first technique uses the instrumental variables approach. The frequency domain formulation is shown to give a considerable insight into the selection of efficient and convergent instrumental variables. The new maximum likelihood formulation affords simplier numerical solution and provides a way to select parameter starting values in the gradient based optimization method.

Gupta, N. K.↗

A canonical form for nonlinear systems

The concepts of transformation and canonical form have been used in analyzing linear systems. These ideas are extended to nonlinear systems. A coordinate system and a corresponding canonical form are developed for general nonlinear control systems. Their usefulness is demonstrated by showing that every feedback linearizable system becomes a system with only feedback paths in the canonical form. For control design involving a nonlinear system, one approach is to put the system in its canonical form and approximate by that part having only feedback paths.

Su, R.↗

Balanced systems and structures - Reduction, assignment, and perturbations

New results on properties of balanced linear systems and structures are presented. Balanced representation is defined for systems with poles at an imaginary axis or at the origin. Grammians do not exist in this case, but antigrammians are introduced which make balanced reduction possible. System grammians of specified properties are obtained by assigning the sensor and actuator configuration. The latter is determined using input-output assignment procedures introduced for general systems and specified to structures. A system is said to be uniformly balanced if all its Hankel singular values are equal.

Gawronski, Wodek↗

Monolithic multigrid methods for two-dimensional resistive magnetohydrodynamics

Magnetohydrodynamic (MHD) representations are used to model a wide range of plasma physics applications and are characterized by a nonlinear system of partial differential equations that strongly couples a charged fluid with the evolution of electromagnetic fields. The resulting linear systems that arise from discretization and linearization of the nonlinear problem are generally difficult to solve. In this paper, we investigate multigrid preconditioners for this system. We consider two well-known multigrid relaxation methods for incompressible fluid dynamics: Braess--Sarazin relaxation and Vanka relaxation. We first extend these to the context of steady-state one-fluid viscoresistive MHD. Then we compare the two relaxation procedures within a multigrid-preconditioned GMRES method employed within Newton's method. To isolate the effects of the different relaxation methods, we use structured grids, inf-sup stable finite elements, and geometric interpolation. Furthermore, we present convergence and timing results for a two-dimensional, steady-state test problem.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Assessing Aircraft Susceptibility to Nonlinear Aircraft-Pilot Coupling/Pilot-Induced Oscillations

A unified approach for assessing aircraft susceptibility to aircraft-pilot coupling (or pilot-induced oscillations) which was previously reported in the literature and applied to linear systems is extended to nonlinear systems, with emphasis upon vehicles with actuator rate saturation. The linear methodology provided a tool for predicting: (1) handling qualities levels, (2) pilot-induced oscillation rating levels and (3) a frequency range in which pilot-induced oscillations are likely to occur. The extension to nonlinear systems provides a methodology for predicting the latter two quantities. Eight examples are presented to illustrate the use of the technique. The dearth of experimental flight-test data involving systematic variation and assessment of the effects of actuator rate limits presently prevents a more thorough evaluation of the methodology.

Hess, R.A.↗

A generalized Lyapunov theory for robust root clustering of linear state space models with real parameter uncertainty

The problem of analyzing and designing controllers for linear systems subject to real parameter uncertainty is considered. An elegant, unified theory for robust eigenvalue placement is presented for a class of D-regions defined by algebraic inequalities by extending the nominal matrix root clustering theory of Gutman and Jury (1981) to linear uncertain time systems. The author presents explicit conditions for matrix root clustering for different D-regions and establishes the relationship between the eigenvalue migration range and the parameter range. The bounds are all obtained by one-shot computation in the matrix domain and do not need any frequency sweeping or parameter gridding. The method uses the generalized Lyapunov theory for getting the bounds.

Yedavalli, R. K.↗

A scalable geometric multigrid solver for nonsymmetric elliptic systems with application to variable-density flows

A geometric multigrid algorithm is introduced for solving nonsymmetric linear systems resulting from the discretization of the variable density Navier–Stokes equations on nonuniform structured rectilinear grids and high-Reynolds number flows. The restriction operation is defined such that the resulting system on the coarser grids is symmetric, thereby allowing for the use of efficient smoother algorithms. To achieve an optimal rate of convergence, the sequence of interpolation and restriction operations are determined through a dynamic procedure. A parallel partitioning strategy is introduced to minimize communication while maintaining the load balance between all processors. To test the proposed algorithm, we consider two cases: 1) homogeneous isotropic turbulence discretized on uniform grids and 2) turbulent duct flow discretized on stretched grids. Testing the algorithm on systems with up to a billion unknowns shows that the cost varies linearly with the number of unknowns. This O (N) behavior confirms the robustness of the proposed multigrid method regarding ill-conditioning of large systems characteristic of multiscale high-Reynolds number turbulent flows. The robustness of our method to density variations is established by considering cases where density varies sharply in space by a factor of up to 104, showing its applicability to two-phase flow problems. Strong and weak scalability studies are carried out, employing up to 30,000 processors, to examine the parallel performance of our implementation. Excellent scalability of our solver is shown for a granularity as low as 104 to 105 unknowns per processor. At its tested peak throughput, it solves approximately 4 billion unknowns per second employing over 16,000 processors with a parallel efficiency higher than 50%.

Computer Science↗

Slow-scale split-step tau-leap method for stiff stochastic chemical systems

Tau-leaping is a family of algorithms for the approximate simulation of the discrete state continuous time Markov chains. A motivation for the development of such methods can be found, for instance, in the fields of chemical kinetics and systems biology. It is known that the dynamical behavior of biochemical systems is often intrinsically stiff representing a serious challenge for their numerical approximation. The naive extension of stiff deterministic solvers to stochastic integration often yields numerical solutions with either impractically large relaxation times or incorrectly resolved covariance. In this paper, we propose a splitting heuristic which helps to resolve some of these issues. The proposed integrator contains a number of unknown parameters which are estimated for each particular problem from the moment equations of the corresponding linearized system. We show that this method is able to reproduce the exact mean and variance of the linear scalar test equation and demonstrates a good accuracy for the arbitrarily stiff systems at least in the linear case. The numerical examples for both linear and nonlinear systems are also provided, and the obtained results confirm the efficiency of the considered splitting approach.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A methodology based on reduced complexity algorithm for system applications using microprocessors

The paper considers a methodology on the analysis and design of a minimum mean-square error criterion linear system incorporating a tapped delay line (TDL) where all the full-precision multiplications in the TDL are constrained to be powers of two. A linear equalizer based on the dispersive and additive noise channel is presented. This microprocessor implementation with optimized power of two TDL coefficients achieves a system performance comparable to the optimum linear equalization with full-precision multiplications for an input data rate of 300 baud.

Yan, T. Y.↗

Optimal Linear Responses for Markov Chains and Stochastically Perturbed Dynamical Systems

The linear response of a dynamical system refers to changes to properties of the system when small external perturbations are applied. We consider the little-studied question of selecting an optimal perturbation so as to (i) maximise the linear response of the equilibrium distribution of the system, (ii) maximise the linear response of the expectation of a specified observable, and (iii) maximise the linear response of the rate of convergence of the system to the equilibrium distribution. We also consider the inhomogeneous, sequential, or time-dependent situation where the governing dynamics is not stationary and one wishes to select a sequence of small perturbations so as to maximise the overall linear response at some terminal time. We develop the theory for finite-state Markov chains, provide explicit solutions for some illustrative examples, and numerically apply our theory to stochastically perturbed dynamical systems, where the Markov chain is replaced by a matrix representation of an approximate annealed transfer operator for the random dynamical system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗