Search NASA⌕ Search

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.

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

At least 289 records · Page 16

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↗

Analysis of spectral projectors in one-dimensional domains

A class of projection operators with values in a subspace of polynomials is analyzed. These projection operators are related to the Hilbert spaces involved in the numerical analysis of spectral methods. They are, in the first part of the paper, the standard Sobolev spaces and, in the second part, some weighted Sobolev spaces, the weight of which is related to the orthoronality relation satisfied by the Chebyshev polynomials. These results are used to study the approximation of a model fourth-order problem.

Maday, Y.↗

Real-time image processing II; Proceedings of the Meeting, Orlando, FL, Apr. 16-18, 1990

The present conference discusses topics in the fields of feature extraction and implementation, filter and correlation algorithms, optical correlators, high-level algorithms, and digital image processing for ranging and remote driving. Attention is given to a nonlinear filter derived from topological image features, IR image segmentation through iterative thresholding, orthogonal subspaces for correlation masking, composite filter trees and image recognition via binary search, and features of matrix-coherent optical image processing. Also discussed are multitarget tracking via hybrid joint transform correlator, binary joint Fourier transform correlator considerations, global image processing operations on parallel architectures, real-time implementation of a differential range finder, and real-time binocular stereo range and motion detection.

Juday, Richard D.↗

SIAM Conference on Parallel Processing for Scientific Computing, 4th, Chicago, IL, Dec. 11-13, 1989, Proceedings

Attention is given to such topics as an evaluation of block algorithm variants in LAPACK and presents a large-grain parallel sparse system solver, a multiprocessor method for the solution of the generalized Eigenvalue problem on an interval, and a parallel QR algorithm for iterative subspace methods on the CM2. A discussion of numerical methods includes the topics of asynchronous numerical solutions of PDEs on parallel computers, parallel homotopy curve tracking on a hypercube, and solving Navier-Stokes equations on the Cedar Multi-Cluster system. A section on differential equations includes a discussion of a six-color procedure for the parallel solution of elliptic systems using the finite quadtree structure, data parallel algorithms for the finite element method, and domain decomposition methods in aerodynamics. Topics dealing with massively parallel computing include hypercube vs. 2-dimensional meshes and massively parallel computation of conservation laws. Performance and tools are also discussed.

Dongarra, Jack↗

Stability analysis of position and force control problems for robot arms

A stability analysis for robot manipulators under the influence of external forces is presented. Several control objectives are considered: rejecting the external force as a source of disturbance, complying to the external force as a generalized mass-spring-damper system, and actively controlling the external force when a dynamic model for the environment is available. An explanation of instability is given for the case in which the environment has flexibility and the gains are inappropriately chosen. When the environment is stiff in the force control subspace, robust stability can be achieved via the integral force feedback.

Wen, John T.↗

Use of reduced basis technique in the inverse dynamics of large space cranes

The inverse dynamics of adaptive structures used as space cranes can prove computationally expensive in the case of large structures, due to the large number of degrees of freedom involved. Consequently, reduced basis techniques (reduction techniques) are frequently used to reduce the problem size to a time manageable level (for possible use in real time control). A reduced basis technique is proposed which is different from, but related to, the path-derivatives reduction technique. A linearly independent set of deflection n-tuples is used, chosen at the beginning of the time range in which it is wished to reduce the equations, in whose subspace it is assumed that the deflection vectors of the unreduced problem will lie (approximately).

Das, S. K.↗

Numerical methods in Markov chain modeling

Several methods for computing stationary probability distributions of Markov chains are described and compared. The main linear algebra problem consists of computing an eigenvector of a sparse, usually nonsymmetric, matrix associated with a known eigenvalue. It can also be cast as a problem of solving a homogeneous singular linear system. Several methods based on combinations of Krylov subspace techniques are presented. The performance of these methods on some realistic problems are compared.

Philippe, Bernard↗

Large-scale sparse singular value computations

Four numerical methods for computing the singular value decomposition (SVD) of large sparse matrices on a multiprocessor architecture are presented. Lanczos and subspace iteration-based methods for determining several of the largest singular triplets (singular values and corresponding left and right-singular vectors) for sparse matrices arising from two practical applications: information retrieval and seismic reflection tomography are emphasized. The target architectures for implementations are the CRAY-2S/4-128 and Alliant FX/80. The sparse SVD problem is well motivated by recent information-retrieval techniques in which dominant singular values and their corresponding singular vectors of large sparse term-document matrices are desired, and by nonlinear inverse problems from seismic tomography applications which require approximate pseudo-inverses of large sparse Jacobian matrices.

Berry, Michael W.↗

Implementation details of the coupled QMR algorithm

The original quasi-minimal residual method (QMR) relies on the three-term look-ahead Lanczos process, to generate basis vectors for the underlying Krylov subspaces. However, empirical observations indicate that, in finite precision arithmetic, three-term vector recurrences are less robust than mathematically equivalent coupled two-term recurrences. Therefore, we recently proposed a new implementation of the QMR method based on a coupled two-term look-ahead Lanczos procedure. In this paper, we describe implementation details of this coupled QMR algorithm, and we present results of numerical experiments.

Freund, Roland W.↗

Efficient solution of parabolic equations by Krylov approximation methods

Numerical techniques for solving parabolic equations by the method of lines is addressed. The main motivation for the proposed approach is the possibility of exploiting a high degree of parallelism in a simple manner. The basic idea of the method is to approximate the action of the evolution operator on a given state vector by means of a projection process onto a Krylov subspace. Thus, the resulting approximation consists of applying an evolution operator of a very small dimension to a known vector which is, in turn, computed accurately by exploiting well-known rational approximations to the exponential. Because the rational approximation is only applied to a small matrix, the only operations required with the original large matrix are matrix-by-vector multiplications, and as a result the algorithm can easily be parallelized and vectorized. Some relevant approximation and stability issues are discussed. We present some numerical experiments with the method and compare its performance with a few explicit and implicit algorithms.

Gallopoulos, E.↗

Design of fuzzy system by NNs and realization of adaptability

The issue of designing and tuning fuzzy membership functions by neural networks (NN's) was started by NN-driven Fuzzy Reasoning in 1988. NN-driven fuzzy reasoning involves a NN embedded in the fuzzy system which generates membership values. In conventional fuzzy system design, the membership functions are hand-crafted by trial and error for each input variable. In contrast, NN-driven fuzzy reasoning considers several variables simultaneously and can design a multidimensional, nonlinear membership function for the entire subspace.

Takagi, Hideyuki↗

Implementation of the block-Krylov boundary flexibility method of component synthesis

A method of dynamic substructuring is presented which utilizes a set of static Ritz vectors as a replacement for normal eigenvectors in component mode synthesis. This set of Ritz vectors is generated in a recurrence relationship, which has the form of a block-Krylov subspace. The initial seed to the recurrence algorithm is based on the boundary flexibility vectors of the component. This algorithm is not load-dependent, is applicable to both fixed and free-interface boundary components, and results in a general component model appropriate for any type of dynamic analysis. This methodology was implemented in the MSC/NASTRAN normal modes solution sequence using DMAP. The accuracy is found to be comparable to that of component synthesis based upon normal modes. The block-Krylov recurrence algorithm is a series of static solutions and so requires significantly less computation than solving the normal eigenspace problem.

Carney, Kelly S.↗

Binary tree eigen solver in finite element analysis

This paper presents a transputer-based binary tree eigensolver for the solution of the generalized eigenproblem in linear elastic finite element analysis. The algorithm is based on the method of recursive doubling, which parallel implementation of a number of associative operations on an arbitrary set having N elements is of the order of o(log2N), compared to (N-1) steps if implemented sequentially. The hardware used in the implementation of the binary tree consists of 32 transputers. The algorithm is written in OCCAM which is a high-level language developed with the transputers to address parallel programming constructs and to provide the communications between processors. The algorithm can be replicated to match the size of the binary tree transputer network. Parallel and sequential finite element analysis programs have been developed to solve for the set of the least-order eigenpairs using the modified subspace method. The speed-up obtained for a typical analysis problem indicates close agreement with the theoretical prediction given by the method of recursive doubling.

Akl, F. A.↗

A Lanczos algorithm for vibration, suckling and termal analysis

This paper reviews an eigensolver algorithm based on the Lanczos Method for vibration, buckling and thermal analysis. The original code was written for inclusion in the Computational Mechanics Testbed (COMET), a general purpose finite element code. A portable version of the Lanczos code that is optimized for high-performance supercomputers has been developed. Special features of the algorithm include the capability to compute rigid body modes, thermal modes and Lanczos vectors that are derived from the applied load vector. The latter is necessary when using the Lanczos vectors as reduced-basis vectors in transient structural response and transient heat conduction calculations. The modularity of the code allows the user the option of including the most up-to-date utilities, such as the equation solver best suited for the application. The algorithm is discussed in detail and results of several applications are presented. Timing results for a vibration application indicate that the Lanczos algorithm is twenty times faster than the subspace iteration method which has been extensively used in the past.

Bostic, Susan W.↗

Iterative solution of linear systems

Recent advances in the field of iterative methods for solving large linear systems are reviewed. The main focus is on developments in the area of conjugate gradient-type algorithms and Krylov subspace methods for nonHermitian matrices.

Freund, Roland W.↗

Analysis of the anisotropic viscoplastic-damage response of composite laminates - Continuum basis and computational algorithms

The mathematical structure underlying the rate equations of a recently-developed constitutive model for the coupled viscoplastic-damage response of anisotropic composites is critically examined. In this regard, a number of tensor projection operators have been identified, and their properties were exploited to enable the development of a general computational framework for their numerical implementation using the Euler fully-implicit integration method. In particular, this facilitated (i) the derivation of explicit expressions of the (consistent) material tangent stiffnesses that are valid for both three-dimensional as well as subspace (e.g. plane stress) formulations, (ii) the implications of the symmetry or unsymmetry properties of these tangent operators from a thermodynamic standpoint, and (iii) the development of an effective time-step control strategy to ensure accuracy and convergence of the solution. In addition, the special limiting case of inviscid elastoplasticity is treated. The results of several numerical simulations are given to demonstrate the effectiveness of the schemes developed.

Saleeb, A. F.↗

On the superconvergence of Galerkin methods for hyperbolic IBVP

Finite element Galerkin methods for periodic first order hyperbolic equations exhibit superconvergence on uniform grids at the nodes, i.e., there is an error estimate 0(h(sup 2r)) instead of the expected approximation order 0(h(sup r)). It will be shown that no matter how the approximating subspace S(sup h) is chosen, the superconvergence property is lost if there are characteristics leaving the domain. The implications of this result when constructing compact implicit difference schemes is also discussed.

Gottlieb, David↗

On the Daubechies-based wavelet differentiation matrix

The differentiation matrix for a Daubechies-based wavelet basis is constructed and superconvergence is proven. That is, it will be proven that under the assumption of periodic boundary conditions that the differentiation matrix is accurate of order 2M, even though the approximation subspace can represent exactly only polynomials up to degree M-1, where M is the number of vanishing moments of the associated wavelet. It is illustrated that Daubechies-based wavelet methods are equivalent to finite difference methods with grid refinement in regions of the domain where small-scale structure is present.

Jameson, Leland↗