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 1,603 records · Page 89

Robot-Arm Dynamic Control by Computer

Feedforward and feedback schemes linearize responses to control inputs. Method for control of robot arm based on computed nonlinear feedback and state tranformations to linearize system and decouple robot end-effector motions along each of cartesian axes augmented with optimal scheme for correction of errors in workspace. Major new feature of control method is: optimal error-correction loop directly operates on task level and not on joint-servocontrol level.

Bejczy, Antal K.↗

Fourier analysis of the SOR iteration

The SOR iteration for solving linear systems of equations depends upon an overrelaxation factor omega. It is shown that for the standard model problem of Poisson's equation on a rectangle, the optimal omega and corresponding convergence rate can be rigorously obtained by Fourier analysis. The trick is to tilt the space-time grid so that the SOR stencil becomes symmetrical. The tilted grid also gives insight into the relation between convergence rates of several variants.

Leveque, R. J.↗

Analysis of the SOR iteration for the 9-point Laplacian

The SOR iteration for solving linear systems of equations depends upon an overrelaxation factor omega. A theory for determining omega was given by Young (1950) for consistently ordered matrices. Here the optimal omega is determined for the 9-point stencil for the model problem of Laplace's equation on a square. Several orderings of the equations are considered, including the natural rowwise and multicolor orderings, all of which lead to non-consistently ordered matrices, and two equivalence classes of orderings are found with different convergence behavior and optimal omega's. The results for the natural rowwise ordering are compared to those of Garabedian (1956) and it is explained why both results are, in a sense, correct, even though they differ. Also analyzed is a pseudo SOR method for the model problem and it is shown that it is not as effective as the SOR methods. Finally, the point SOR methods are compared to known results for line SOR methods for this problem.

Loyce M. Adams↗

Mean-square error bounds for reduced-error linear state estimators

The mean-square error of reduced-order linear state estimators for continuous-time linear systems is investigated. Lower and upper bounds on the minimal mean-square error are presented. The bounds are readily computable at each time-point and at steady state from the solutions to the Ricatti and the Lyapunov equations. The usefulness of the error bounds for the analysis and design of reduced-order estimators is illustrated by a practical numerical example.

Baram, Y.↗

Non-linear performance of a three-bearing rotor incorporating a squeeze-film damper

This paper is concerned with the non-linear vibration performance of a rigid rotor supported on three bearings, one being surrounded by a squeeze-film damper. This damper relies on the pressure built up in the squeeze film to help counter-act external forces arising from unbalance and other effects. As a result a vibration orbit of a certain magnetude results. Such vibration orbits illustrate features found in other non-linear systems, in particular sub-harmonic resonances and jump phenomena. Comparisons between theoretical prediction and experimental observations of these phenomena are made.

Holmes, R.↗

MPF: A portable message passing facility for shared memory multiprocessors

The design, implementation, and performance evaluation of a message passing facility (MPF) for shared memory multiprocessors are presented. The MPF is based on a message passing model conceptually similar to conversations. Participants (parallel processors) can enter or leave a conversation at any time. The message passing primitives for this model are implemented as a portable library of C function calls. The MPF is currently operational on a Sequent Balance 21000, and several parallel applications were developed and tested. Several simple benchmark programs are presented to establish interprocess communication performance for common patterns of interprocess communication. Finally, performance figures are presented for two parallel applications, linear systems solution, and iterative solution of partial differential equations.

Malony, Allen D.↗

Temporal sensitivity

Human visual temporal sensitivity is examined. The stimuli used to measure temporal sensitivity are described and the linear systems theory is reviewed in terms of temporal sensitivity. A working model which represents temporal sensitivity is proposed. The visibility of a number of temporal wave forms, sinusoids, rectangular pulses, and pulse pairs, is analyzed. The relation between spatial and temporal effects is studied. Temporal variations induced by image motion and the effects of light adaptation on temporal sensitivity are considered.

Watson, Andrew B.↗

Stability and resonance in grooved-channel flows

Numerical simulation using the spectral element method is used to study the stability and resonant response of incompressible moderate-Reynolds-number flows in periodically-grooved channels. For Reynolds numbers below a critical value, the flow is shown to approach a stable steady-state, and the least stable modes resemble Tollmien-Schlichting channel waves. For Reynolds numbers greater than the critical value, self-sustained oscillations result. Oscillatory perturbation of the grooved-channel flow at the frequency of the least stable mode of the linearized system is found to result in subcritical resonant excitation as the critical Reynolds number is approached. The importance of nonhomogeneous geometry in the forced response of the flow is discussed.

Ghaddar, Nasreen K.↗

Principles for problem aggregation and assignment in medium scale multiprocessors

One of the most important issues in parallel processing is the mapping of workload to processors. This paper considers a large class of problems having a high degree of potential fine grained parallelism, and execution requirements that are either not predictable, or are too costly to predict. The main issues in mapping such a problem onto medium scale multiprocessors are those of aggregation and assignment. We study a method of parameterized aggregation that makes few assumptions about the workload. The mapping of aggregate units of work onto processors is uniform, and exploits locality of workload intensity to balance the unknown workload. In general, a finer aggregate granularity leads to a better balance at the price of increased communication/synchronization costs; the aggregation parameters can be adjusted to find a reasonable granularity. The effectiveness of this scheme is demonstrated on three model problems: an adaptive one-dimensional fluid dynamics problem with message passing, a sparse triangular linear system solver on both a shared memory and a message-passing machine, and a two-dimensional time-driven battlefield simulation employing message passing. Using the model problems, the tradeoffs are studied between balanced workload and the communication/synchronization costs. Finally, an analytical model is used to explain why the method balances workload and minimizes the variance in system behavior.

Nicol, David M.↗

Development of a technique for estimating noise covariances using multiple observers

Friedland's technique for estimating the unknown noise variances of a linear system using multiple observers has been extended by developing a general solution for the estimates of the variances, developing the statistics (mean and standard deviation) of these estimates, and demonstrating the solution on two examples.

Bundick, W. Thomas↗

Total Variation Diminishing (TVD) schemes of uniform accuracy

Explicit second-order accurate finite-difference schemes for the approximation of hyperbolic conservation laws are presented. These schemes are nonlinear even for the constant coefficient case. They are based on first-order upwind schemes. Their accuracy is enhanced by locally replacing the first-order one-sided differences with either second-order one-sided differences or central differences or a blend thereof. The appropriate local difference stencils are selected such that they give TVD schemes of uniform second-order accuracy in the scalar, or linear systems, case. Like conventional TVD schemes, the new schemes avoid a Gibbs phenomenon at discontinuities of the solution, but they do not switch back to first-order accuracy, in the sense of truncation error, at extrema of the solution. The performance of the new schemes is demonstrated in several numerical tests.

Hartwich, PETER-M.↗

Adaptive control with saturating inputs

An extension of the results from Goodwin, Ramadge and Caines (1980) to the case where the input of the linear system saturates is presented. A necessary condition for closed loop stability of such a system is shown to be that the system must remain in a region from which y(t) = 0 is reachable with saturating inputs. With a slight modification of the original algorithm, the closed loop system is shown to be stable whenever the plant is exponentially stable.

Abramovitch, Daniel Y.↗

Optimal output fast feedback in two-time scale control of flexible arms

Control of lightweight flexible arms moving along predefined paths can be successfully synthesized on the basis of a two-time scale approach. A model following control can be designed for the reduced order slow subsystem. The fast subsystem is a linear system in which the slow variables act as parameters. The flexible fast variables which model the deflections of the arm along the trajectory can be sensed through strain gage measurements. For full state feedback design the derivatives of the deflections need to be estimated. The main contribution of this work is the design of an output feedback controller which includes a fixed order dynamic compensator, based on a recent convergent numerical algorithm for calculating LQ optimal gains. The design procedure is tested by means of simulation results for the one link flexible arm prototype in the laboratory.

Siciliano, B.↗

Order reduction in linear state estimation under performance constraints

The design and analysis of minimal-order state estimators for possibly time-varying linear systems, under constraints on the maximal allowable mean-square error, are considered. A global lower bound on the optimal error is derived, along with a lower bound on the minimal estimator order, needed for meeting the performance constraint. The ideal reduced-order estimator which satisfies the lower bound is derived, along with conditions for its realizability. When the ideal estimator is not realizable, its structure forms a suboptimal estimator, which maintains, in some sense, a local optimality property and is called the pseudoideal estimator. The mean-square error of the pseudoideal estimator defines upper bounds on the optimal error and on the estimator order needed for meeting the performance constraint. The lower and the upper bounds on the order define a reduced search set for the design problem. When the distance between the ideal and the pseudoideal estimators is sufficiently small in a certain numerical sense, the pseudoideal estimator may be considered optimal for practical purposes.

Baram, Yoram↗

Mean-square-error bounds for reduced-order linear state estimators

The mean-square error of reduced-order linear state estimators for continuous-time linear systems is investigated. Lower and upper bounds on the minimal mean-square error are presented. The bounds are readily computable at each time-point and at steady state from the solutions to the Ricatti and the Liapunov equations. The usefulness of the error bounds for the analysis and design of reduced-order estimators is illustrated by a practical numerical example.

Baram, Y.↗

Derivation and definition of a linear aircraft model

A linear aircraft model for a rigid aircraft of constant mass flying over a flat, nonrotating earth is derived and defined. The derivation makes no assumptions of reference trajectory or vehicle symmetry. The linear system equations are derived and evaluated along a general trajectory and include both aircraft dynamics and observation variables.

Duke, Eugene L.↗

Totally parallel multilevel algorithms

Four totally parallel algorithms for the solution of a sparse linear system have common characteristics which become quite apparent when they are implemented on a highly parallel hypercube such as the CM2. These four algorithms are Parallel Superconvergent Multigrid (PSMG) of Frederickson and McBryan, Robust Multigrid (RMG) of Hackbusch, the FFT based Spectral Algorithm, and Parallel Cyclic Reduction. In fact, all four can be formulated as particular cases of the same totally parallel multilevel algorithm, which are referred to as TPMA. In certain cases the spectral radius of TPMA is zero, and it is recognized to be a direct algorithm. In many other cases the spectral radius, although not zero, is small enough that a single iteration per timestep keeps the local error within the required tolerance.

Frederickson, Paul O.↗

On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices

Conjugate gradient type methods are considered for the solution of large linear systems Ax = b with complex coefficient matrices of the type A = T + i(sigma)I where T is Hermitian and sigma, a real scalar. Three different conjugate gradient type approaches with iterates defined by a minimal residual property, a Galerkin type condition, and an Euclidian error minimization, respectively, are investigated. In particular, numerically stable implementations based on the ideas behind Paige and Saunder's SYMMLQ and MINRES for real symmetric matrices are proposed. Error bounds for all three methods are derived. It is shown how the special shift structure of A can be preserved by using polynomial preconditioning. Results on the optimal choice of the polynomial preconditioner are given. Also, some numerical experiments for matrices arising from finite difference approximations to the complex Helmholtz equation are reported.

Freund, Roland↗