SEARCH · Search NASA

Results for “subspace”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 271 records · Page 15

All sources NASA NTRS DOE OSTI

NASA NTRS1989

Flutter suppression using eigenspace freedoms to meet requirements

A constrained optimization methodology has been developed which allows specific use of eigensystem freedoms to meet design requirements. A subset of the available eigenvector freedoms was employed. The eigenvector freedoms associated with a particular closed-loop eigenvalue are coefficients of basis vectors which span the subspace in which that closed-loop vector must lie. Design requirements are included as a vector of inequality constraints. The procedure was successfully applied to develop an unscheduled controller which stabilizes symmetric flutter of an aeroelastic vehicle to a dynamic pressure 44 percent above the open-loop flutter point. The design process proceeded from full-state feedback to the inclusion of a full-order observer to the selection of an eighth-order controller which preserved the full-state sensitivity characteristics. Only a subset of the design freedoms was utilized (i.e., assuming full-state feedback only four out of 26 eigenvectors were used, and no variations were made in the closed-loop eigenvalues). Utilization of additional eigensystem freedoms could further improve the controller.

Adams, William M., Jr.↗

NASA NTRS1988

Solving large sparse eigenvalue problems on supercomputers

An important problem in scientific computing consists in finding a few eigenvalues and corresponding eigenvectors of a very large and sparse matrix. The most popular methods to solve these problems are based on projection techniques on appropriate subspaces. The main attraction of these methods is that they only require the use of the matrix in the form of matrix by vector multiplications. The implementations on supercomputers of two such methods for symmetric matrices, namely Lanczos' method and Davidson's method are compared. Since one of the most important operations in these two methods is the multiplication of vectors by the sparse matrix, methods of performing this operation efficiently are discussed. The advantages and the disadvantages of each method are compared and implementation aspects are discussed. Numerical experiments on a one processor CRAY 2 and CRAY X-MP are reported. Possible parallel implementations are also discussed.

Philippe, Bernard↗

NASA NTRS1987

Chaos motion in robot manipulators

It is shown that a simple two-link planar manipulator exhibits a phenomenon of global instability in a subspace of its configuration space. A numerical example, as well as results of a graphic simulation, is given.

Lokshin, A.↗

NASA NTRS1988

Stability analysis of multiple rigid robot manipulators holding a common rigid object

The authors consider several possible control structures for multiple-arm systems by regarding either joint torques, tip force, or a generalized acceleration of the control input. They emphasize the first case, since a class of relatively model-independent control laws can be generated for both motion and internal force control. The recently developed move/squeeze orthogonal subspace decomposition coupled with the energy Lyapunov function formulation provides a basic analytical framework within which motion and force control are considered as independent problems. Simulation results of two three-link planar arms are included to demonstrate good transient performance for both motion and force that can be attained with the full dynamics control paradigm.

Wen, John T.↗

NASA NTRS1989

Failure detection and identification

Using the geometric concept of an unobservability subspace, a solution is given to the problem of detecting and identifying control system component failures in linear, time-invariant systems. Conditions are developed for the existence of a causal, linear, time-invariant processor that can detect and uniquely identify a component failure, first for the case where components can fail simultaneously, and then for the case where they fail only one at a time. Explicit design algorithms are provided when these conditions are satisfied. In addition to time-domain solvability conditions, frequency-domain interpretations of the results are given, and connections are drawn with results already available in the literature.

Massoumnia, Mohammad-Ali↗

NASA NTRS1989

Eigensolution of finite element problems in a completely connected parallel architecture

A parallel algorithm is presented for the solution of the generalized eigenproblem in linear elastic finite element analysis. The algorithm is based on a completely connected parallel architecture in which each processor is allowed to communicate with all other processors. The algorithm is successfully implemented on a tightly coupled MIMD parallel processor. A finite element model is divided into m domains each of which is assumed to process n elements. Each domain is then assigned to a processor or to a logical processor (task) if the number of domains exceeds the number of physical processors. The effect of the number of domains, the number of degrees-of-freedom located along the global fronts, and the dimension of the subspace on the performance of the algorithm is investigated. For a 64-element rectangular plate, speed-ups of 1.86, 3.13, 3.18, and 3.61 are achieved on two, four, six, and eight processors, respectively.

Akl, F.↗

NASA NTRS1989

Robust eigenstructure assignment by a projection method - Applications using multiple optimization criteria

A methodology for robust eigenstructure assignment for multivariable feedback systems is presented. The algorithm is based upon a pole placement technique using projections onto subspaces of admissible eigenvectors. New ideas are introduced to generate target (desired) sets of unitary eigenvectors and determine optimal feasible eigenvectors in a least-square sense. Useful connections are established between the pole-placement by independent modal space control and the method introduced in this paper. A multicriterion optimization algorithm is also presented, which takes efficient advantage of the present eigenstructure assignment method. These developments show significant improvement over an earlier version of this algorithm in both computational cost and accuracy. This optimization process appears to be numerically robust and suitable for high-dimensional multicriterion optimizations; it is especially attractive for computer-aided design of control systems.

Rew, D. W.↗

NASA NTRS1989

Unsupervised learning in neurodynamics using example-interaction approach

A new concept for unsupervised learning based upon examples introduced to the neural network is proposed. Each example is considered as an interpolation node of the velocity field in the phase space. The velocities at these nodes are selected such that all the streamlines diverge to an attracting set imbedded in the subspace occupied by the cluster of examples. The synaptic interconnections are found from the minimization of the strength energy, while the node velocities play the role of constraints.

Zak, Michail↗

NASA NTRS1989

Controller reduction by preserving impulse response energy

A model order reduction algorithm based on a Krylov recurrence formulation is developed to reduce order of controllers. The reduced-order controller is obtained by projecting the full-order LQG controller onto a Krylov subspace in which either the controllability or the observability grammian is equal to the identity matrix. The reduced-order controller preserves the impulse response energy of the full-order controller and has a parameter-matching property. Two numerical examples drawn from other controller reduction literature are used to illustrate the efficacy of the proposed reduction algorithm.

Craig, Roy R., Jr.↗

NASA NTRS1989

On eigensystem assignment with output feedback

A new approach for the eigenvalue assignment of linear, first-order, time-invariant systems using output feedback is developed. The approach can assign the maximum allowable number of closed-loop eigenvalues through output feedback provided that the system is fully controllable and observable, and both the input influence and output influence matrices are full rank. First, a collection of bases for the space of attainable closed-loop eigenvectors is generated using the Singular Value Decomposition or QR Decomposition techniques. Then, an algorithm based on subspace intersections is developed and used to compute the corresponding coefficients of the bases, and the required output feedback gain matrix. Moreover, the additional freedom provided by the multi-inputs and multi-outputs beyond the eigenvalue assignment is characterized for possible exploitation. A numerical example is given to demonstrate the viability of the proposed approach.

Maghami, Peiman G.↗

NASA NTRS1989

The use of Lanczos's method to solve the large generalized symmetric definite eigenvalue problem

The generalized eigenvalue problem, Kx = Lambda Mx, is of significant practical importance, especially in structural enginering where it arises as the vibration and buckling problem. A new algorithm, LANZ, based on Lanczos's method is developed. LANZ uses a technique called dynamic shifting to improve the efficiency and reliability of the Lanczos algorithm. A new algorithm for solving the tridiagonal matrices that arise when using Lanczos's method is described. A modification of Parlett and Scott's selective orthogonalization algorithm is proposed. Results from an implementation of LANZ on a Convex C-220 show it to be superior to a subspace iteration code.

Jones, Mark T.↗

NASA NTRS1989

Eigensolution of finite element problems in a completely connected parallel architecture

A parallel algorithm for the solution of the generalized eigenproblem in linear elastic finite element analysis, (K)(phi)=(M)(phi)(omega), where (K) and (M) are of order N, and (omega) is of order q is presented. The parallel algorithm is based on a completely connected parallel architecture in which each processor is allowed to communicate with all other processors. The algorithm has been successfully implemented on a tightly coupled multiple-instruction-multiple-data (MIMD) parallel processing computer, Cray X-MP. A finite element model is divided into m domains each of which is assumed to process n elements. Each domain is then assigned to a processor, or to a logical processor (task) if the number of domains exceeds the number of physical processors. The macro-tasking library routines are used in mapping each domain to a user task. Computational speed-up and efficiency are used to determine the effectiveness of the algorithm. The effect of the number of domains, the number of degrees-of-freedom located along the global fronts and the dimension of the subspace on the performance of the algorithm are investigated. For a 64-element rectangular plate, speed-ups of 1.86, 3.13, 3.18 and 3.61 are achieved on two, four, six and eight processors, respectively.

Akl, Fred A.↗

NASA NTRS1990

Application of the TRANAIR rectangular grid approach to the aerodynamic analysis of complex configurations

A numerical method is described which uses a rectangular grid to solve the nonlinear full potential equation about complex configurations. The grid is locally refined to resolve high velocity gradients arising from leading edge expansions or shock waves. The grid penetrates the boundary (described by networks of quadrilateral panels) and is generated automatically. Discrete operators are constructed using the finite element method. The system of nonlinear discrete equations is solved iteratively using a Krylov subspace method preconditioned by an exterior Poisson solver and a direct sparse solver. The primary emphasis is to provide design engineers with an aerodynamic analysis tool (the TRANAIR code) which is accurate, reliable, economical, and flexible to use. Computational results for many interesting configurations are presented.

Johnson, Forrester T.↗

NASA NTRS1989

Accurate quantum chemical calculations

An important goal of quantum chemical calculations is to provide an understanding of chemical bonding and molecular electronic structure. A second goal, the prediction of energy differences to chemical accuracy, has been much harder to attain. First, the computational resources required to achieve such accuracy are very large, and second, it is not straightforward to demonstrate that an apparently accurate result, in terms of agreement with experiment, does not result from a cancellation of errors. Recent advances in electronic structure methodology, coupled with the power of vector supercomputers, have made it possible to solve a number of electronic structure problems exactly using the full configuration interaction (FCI) method within a subspace of the complete Hilbert space. These exact results can be used to benchmark approximate techniques that are applicable to a wider range of chemical and physical problems. The methodology of many-electron quantum chemistry is reviewed. Methods are considered in detail for performing FCI calculations. The application of FCI methods to several three-electron problems in molecular physics are discussed. A number of benchmark applications of FCI wave functions are described. Atomic basis sets and the development of improved methods for handling very large basis sets are discussed: these are then applied to a number of chemical and spectroscopic problems; to transition metals; and to problems involving potential energy surfaces. Although the experiences described give considerable grounds for optimism about the general ability to perform accurate calculations, there are several problems that have proved less tractable, at least with current computer resources, and these and possible solutions are discussed.

Bauschlicher, Charles W., Jr.↗

NASA NTRS1989

Parallel iterative methods for sparse linear and nonlinear equations

As three-dimensional models are gaining importance, iterative methods will become almost mandatory. Among these, preconditioned Krylov subspace methods have been viewed as the most efficient and reliable, when solving linear as well as nonlinear systems of equations. There has been several different approaches taken to adapt iterative methods for supercomputers. Some of these approaches are discussed and the methods that deal more specifically with general unstructured sparse matrices, such as those arising from finite element methods, are emphasized.

Saad, Youcef↗

NASA NTRS1990

Semigroup theory and numerical approximation for equations in linear viscoelasticity

A class of abstract integrodifferential equations used to model linear viscoelastic beams is investigated analytically, applying a Hilbert-space approach. The basic equation is rewritten as a Cauchy problem, and its well-posedness is demonstrated. Finite-dimensional subspaces of the state space and an estimate of the state operator are obtained; approximation schemes for the equations are constructed; and the convergence is proved using the Trotter-Kato theorem of linear semigroup theory. The actual convergence behavior of different approximations is demonstrated in numerical computations, and the results are presented in tables.

Fabiano, R. H.↗

NASA NTRS1989

Unsupervised learning in neurodynamics using example-interaction approach

Zak, Michail↗

NASA NTRS1990

North Atlantic weather regimes: A synoptic study of phase space

In the phase space of weather, low frequency variability (LFV) of the atmosphere can be captured in a large scale subspace, where a trajectory connects consecutive large scale weather maps, thus revealing flow changes and recurrences. Using this approach, Vautard applied the trajectory speed minimization method (Vautard and Legras) to atmospheric data. From 37 winters of 700 mb geopotential height anomalies over the North Atlantic and the adjacent land masses, four persistent and recurrent weather patterns, interpreted as weather regimes, were discernable: a blocking regime, a zonal regime, a Greenland anticyclone regime, and an Atlantic regime. These regimes are studied further in terms of maintenance and transitions. A regime survey unveils preferences regarding event durations and precursors for the onset or break of an event. The transition frequencies between regimes vary, and together with the transition times, suggest the existence of easier transition routes. These matters are more systematically studied using complete synoptic map sequences from a number of events.

Orrhede, Anna Karin↗