Search NASA⌕ Search

SEARCH · Search NASA

Results for “Symmetric matrices”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS2016

The Relaxation Matrix for Symmetric Tops with Inversion Symmetry. I. Effects of Line Coupling on Self-Broadened v (sub 1) and Pure Rotational Bands of NH3

The Robert-Bonamy formalism has been commonly used to calculate half-widths and shifts of spectral lines for decades. This formalism is based on several approximations. Among them, two have not been fully addressed: the isolated line approximation and the neglect of coupling between the translational and internal motions. Recently, we have shown that the isolated line approximation is not necessary in developing semi-classical line shape theories. Based on this progress, we have been able to develop a new formalism that enables not only to reduce uncertainties on calculated half-widths and shifts, but also to model line mixing effects on spectra starting from the knowledge of the intermolecular potential. In our previous studies, the new formalism had been applied to linear and asymmetric-top molecules. In the present study, the method has been extended to symmetric-top molecules with inversion symmetry. As expected, the inversion splitting induces a complete failure of the isolated line approximation. We have calculated the complex relaxation matrices of selfbroadened NH3. The half-widths and shifts in the ν1 and the pure rotational bands are reported in the present paper. When compared with measurements, the calculated half-widths match the experimental data very well, since the inapplicable isolated line approximation has been removed. With respect to the shifts, only qualitative results are obtained and discussed. Calculated off-diagonal elements of the relaxation matrix and a comparison with the observed line mixing effects are reported in the companion paper (Paper II).

Trajectory models↗
NASA NTRS1979

Eigenvalues and eigenvectors for hybrid coordinate equations of motion for flexible spacecraft

The eigenvalues and eigenvectors of a system of linear time-invariant equations describing the attitude motion of flexible spacecraft in terms of hybrid coordinates are characterized in terms of literal expressions by using peculiar properties of the system parameter matrices. For the undamped case the eigenvalues are localized in terms of inertial matrices and modal parameters. A procedure for calculating the eigenvectors is proposed whereby the eigenproblem associated with the original system of dimension (2N + 6) is reduced to that of a symmetric and positive definite matrix of dimension N with the zero-damping assumption. The eigenvectors for systems of large dimension are obtained explicitly in terms of a 3x1 matrix whose elements are available from a system of three algebraic equations, which is provided.

Ohkami, Y.↗
NASA NTRS1986

Multi-color incomplete Cholesky conjugate gradient methods for vector computers

In this research, we are concerned with the solution on vector computers of linear systems of equations, Ax = b, where A is a larger, sparse symmetric positive definite matrix. We solve the system using an iterative method, the incomplete Cholesky conjugate gradient method (ICCG). We apply a multi-color strategy to obtain p-color matrices for which a block-oriented ICCG method is implemented on the CYBER 205. (A p-colored matrix is a matrix which can be partitioned into a pXp block matrix where the diagonal blocks are diagonal matrices). This algorithm, which is based on a no-fill strategy, achieves O(N/p) length vector operations in both the decomposition of A and in the forward and back solves necessary at each iteration of the method. We discuss the natural ordering of the unknowns as an ordering that minimizes the number of diagonals in the matrix and define multi-color orderings in terms of disjoint sets of the unknowns. We give necessary and sufficient conditions to determine which multi-color orderings of the unknowns correpond to p-color matrices. A performance model is given which is used both to predict execution time for ICCG methods and also to compare an ICCG method to conjugate gradient without preconditioning or another ICCG method. Results are given from runs on the CYBER 205 at NASA's Langley Research Center for four model problems.

Poole, E. L.↗
NASA NTRS1982

Numerical computation of exponential matrices using the Cayley-Hamilton theorem

A method for computing exponential matrices, which often arise naturally in the solution of systems of linear differential equations, is developed. An exponential matrix is generated as a linear combination of a finite number (equal to the matrix order) of matrices, the coefficients of which are scalar infinite sums. The method can be generalized to apply to any formal power series of matrices. Attention is focused upon the exponential function, and the matrix exponent is assumed tri-diagonal in form. In such cases, the terms in the coefficient infinite sums can be extracted, as recursion relations, from the characteristic polynomial of the matrix exponent. Two numerical examples are presented in some detail: (1) the three dimensional infinitesimal rotation rate matrix, which is skew symmetric, and (2) an N-dimensional tri-diagonal and symmetric finite difference matrix which arises in the numerical solution of the heat conduction partial differential equation. In the second example, the known eigenvalues and eigenvectors of the finite difference matrix permit an analytical solution for the exponential matrix, through the theory of diagonalization and similarity transformations, which is used for independent verification. The convergence properties of the scalar infinite summations are investigated for finite difference matrices of various orders up to ten, and it is found that the number of terms required for convergence increases slowly with the order of the matrix.

Walden, H.↗
NASA NTRS1986

Implicit, vectorizable schemes for the flux-difference split, three-dimensional Navier-Stokes equations

Two hybrid upwind models are defined for solving the Euler equations. The algorithms both employ approximate factorization (AF) in crossplane and symmetric block Gauss-Seidel relaxation in the third direction. One approach adds an additional factorization step to lower the number of required grid point operations for inversion of the block tridiagonal matrices; however, the move permits only one third of the operations to be vectorized. Finite difference solutions are calculated on a C-H-type grid, in this case enveloping a slender, sharp-edged delta wing. Sample data are provided for the calculated vortex flow for Re of 10,000, at a 20.5 deg angle of attack, represented in a crossflow velocity vector plot and in a spanwise pressure coefficient distribution. The AF scheme, without additional factorization, when used with a grid covering 51 x 51 x 72 points provides a convergent solution with no time step lasting longer than 0.00001 sec.

Liu, C. H.↗
NASA NTRS1991

Least-squares solution of incompressible Navier-Stokes equations with the p-version of finite elements

A p-version of the least squares finite element method, based on the velocity-pressure-vorticity formulation, is developed for solving steady state incompressible viscous flow problems. The resulting system of symmetric and positive definite linear equations can be solved satisfactorily with the conjugate gradient method. In conjunction with the use of rapid operator application which avoids the formation of either element of global matrices, it is possible to achieve a highly compact and efficient solution scheme for the incompressible Navier-Stokes equations. Numerical results are presented for two-dimensional flow over a backward facing step. The effectiveness of simple outflow boundary conditions is also demonstrated.

Jiang, Bo-Nan↗
NASA NTRS1983

The vibration characteristics of a coupled helicopter rotor-fuselage by a finite element analysis

The dynamic coupling between the rotor system and the fuselage of a simplified helicopter model in hover was analytically investigated. Mass, aerodynamic damping, and elastic and centrifugal stiffness matrices are presented for the analytical model; the model is based on a beam finite element, with polynomial mass and stiffness distributions for both the rotor and fuselage representations. For this analytical model, only symmetric fuselage and collective blade degrees of freedom are treated. Real and complex eigen-analyses are carried out to obtain coupled rotor-fuselage natural modes and frequencies as a function of rotor speed. Vibration response results are obtained for the coupled system subjected to a radially uniform, harmonic blade loading. The coupled response results are compared with response results from an uncoupled analysis in which hub loads for an isolated rotor system subjected to the same sinusoidal blade loading as the coupled system are applied to a free-free fuselage.

Rutkowski, M. J.↗
NASA NTRS1982

Quadratic integer programming for large scale banded matrices

This paper is concerned with the integer quadratic program where the variables are constrained to belong to a given set of discrete values. This quadratic integer program is shown to be equivalent to a problem of finding the shortest path in a particular directed graph called a trellis when the matrix is a positive-definite symmetric banded matrix. An efficient procedure for solving this shortest path problem is presented which allows the solution of the integer quadratic program. This method is particularly effective when the half-bandwidth of the matrix is significantly smaller than its dimension.

Yan, T. Y.↗
NASA NTRS1974

Estimation of elastic aircraft parameters using the maximum likelihood method

The application of the maximum likelihood method to estimate the aerodynamic parameters of elastic flight vehicles in a symmetric flight condition is discussed. In this application, particular attention is directed toward the center of mass, elastic deformation, and sensor equations of motion. It is shown that the two major computational problems to be overcome are the inversion of large-sized matrices and the time-wise integration of a large number of linear, ordinary, differential equations.

Schwanz, R. C.↗
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 NTRS1991

Krylov Subspace Methods for Complex Non-Hermitian Linear Systems

We consider Krylov subspace methods for the solution of large sparse linear systems Ax = b with complex non-Hermitian coefficient matrices. Such linear systems arise in important applications, such as inverse scattering, numerical solution of time-dependent Schrodinger equations, underwater acoustics, eddy current computations, numerical computations in quantum chromodynamics, and numerical conformal mapping. Typically, the resulting coefficient matrices A exhibit special structures, such as complex symmetry, or they are shifted Hermitian matrices. In this paper, we first describe a Krylov subspace approach with iterates defined by a quasi-minimal residual property, the QMR method, for solving general complex non-Hermitian linear systems. Then, we study special Krylov subspace methods designed for the two families of complex symmetric respectively shifted Hermitian linear systems. We also include some results concerning the obvious approach to general complex linear systems by solving equivalent real linear systems for the real and imaginary parts of x. Finally, numerical experiments for linear systems arising from the complex Helmholtz equation are reported.

Freund, Roland W.↗
NASA NTRS1992

External calibration of polarimetric radar images using distributed targets

A new technique is presented for calibrating polarimetric synthetic aperture radar (SAR) images using only the responses from natural distributed targets. The model for polarimetric radars is assumed to be X = cRST where X is the measured scattering matrix corresponding to the target scattering matrix S distorted by the system matrices T and R (in general T does not equal R(sup t)). To allow for the polarimetric calibration using only distributed targets and corner reflectors, van Zyl assumed a reciprocal polarimetric radar model with T = R(sup t); when applied for JPL SAR data, a heuristic symmetrization procedure is used by POLCAL to compensate the phase difference between the measured HV and VH responses and then take the average of both. This heuristic approach causes some non-removable cross-polarization responses for corner reflectors, which can be avoided by a rigorous symmetrization method based on reciprocity. After the radar is made reciprocal, a new algorithm based on the responses from distributed targets with reflection symmetry is developed to estimate the cross-talk parameters. The new algorithm never experiences problems in convergence and is also found to converge faster than the existing routines implemented for POLCAL. When the new technique is implemented for the JPL polarimetric data, symmetrization and cross-talk removal are performed on a line-by-line (azimuth) basis. After the cross-talks are removed from the entire image, phase and amplitude calibrations are carried out by selecting distributed targets either with azimuthal symmetry along the looking direction or with some well-known volume and surface scattering mechanisms to estimate the relative phases and amplitude responses of the horizontal and vertical channels.

Yueh, Simon H.↗
NASA NTRS1981

Transfer of line radiation in differentially expanding atmospheres. VI The plane parallel atmosphere with expanding and contracting regions

The non-LTE radiative transfer problem for a two level atom with complete redistribution over a Doppler profile is solved for a plane parallel slab (overlying a radiating photosphere) that has a velocity field which rises symmetrically from zero at either face to a central maximum. Since the velocity gradient reverses, distant layers of the slab become coupled by radiation that jumps intervening layers. The Feautrier method is used, but an iterative variant is also employed as a check in cases where poorly conditioned matrices are encountered. Approximations are developed to explain some of the principal features. It is found that the source function S tends to have two plateaus with values near 2/3 I sub 0 and 1/3 I sub 0, where I sub 0 is the photospheric continuum incident from below; the larger value lies nearer the photosphere. The upper layers sometimes exhibit a rise in S owing to interconnection by radiation to the base. It is noted that the radiation force is largest at the two faces and the midplane. Some line profiles are found to have unusually steep absorptions at rest frequency because of the low excitation in the uppermost, stationary layers.

Noerdlinger, P. D.↗
NASA NTRS1993

Design of multiple-ply laminated composite tapered beams

A study of a special case of symmetric laminated composite cantilever beams is presented. The approach models beams that are tapered both in depth and width and investigates the effect of the ply layup angle and the ply taper on bending and interlaminar shearing stresses. For the determination of stresses and deflections, the beam stiffness matrices are expressed as linear functions of the beam length. Using classical lamination theory (CLT) the stiffness matrices are determined and assembled at strategic locations along the length of the beam. They are then inverted and necessary stiffness parameters are obtained numerically and extracted for determination of design information at each location chosen. Several ply layup configurations are investigated, and design considerations are presented based on the findings. Finally, recommendations for the design of these beams are presented, and a means for anticipating the location of highest stresses is offered.

Rodriguez, P.↗
NASA NTRS1973

Eigenproblem solution by a combined Sturm sequence and inverse iteration technique.

Description of an efficient and numerically stable algorithm, along with a complete listing of the associated computer program, developed for the accurate computation of specified roots and associated vectors of the eigenvalue problem Aq = lambda Bq with band symmetric A and B, B being also positive-definite. The desired roots are first isolated by the Sturm sequence procedure; then a special variant of the inverse iteration technique is applied for the individual determination of each root along with its vector. The algorithm fully exploits the banded form of relevant matrices, and the associated program written in FORTRAN V for the JPL UNIVAC 1108 computer proves to be most significantly economical in comparison to similar existing procedures. The program may be conveniently utilized for the efficient solution of practical engineering problems, involving free vibration and buckling analysis of structures. Results of such analyses are presented for representative structures.

Gupta, K. K.↗
NASA NTRS1991

Design and test of three active flutter suppression controllers

Three flutter suppression control law design techniques are presented. Each uses multiple control surfaces and/or sensors. The first uses linear combinations of several accelerometer signals together with dynamic compensation to synthesize the modal rate of the critical mode for feedback to distributed control surfaces. The second uses traditional tools (pole/zero loci and Nyquist diagrams) to develop a good understanding of the flutter mechanism and produce a controller with minimal complexity and good robustness to plant uncertainty. The third starts with a minimum energy Linear Quadratic Gaussian controller, applies controller order reduction, and then modifies weight and noise covariance matrices to improve multi-variable robustness. The resulting designs were implemented digitally and tested subsonically on the Active Flexible Wing (AFW) wind tunnel model. Test results presented here include plant characteristics, maximum attained closed-loop dynamic pressure, and Root Mean Square control surface activity. A key result is that simultaneous symmetric and antisymmetric flutter suppression was achieved by the second control law, with a 24 percent increase in attainable dynamic pressure.

Christhilf, David M.↗
NASA NTRS1993

A least-squares finite element method for 3D incompressible Navier-Stokes equations

The least-squares finite element method (LSFEM) based on the velocity-pressure-vorticity formulation is applied to three-dimensional steady incompressible Navier-Stokes problems. This method can accommodate equal-order interpolations, and results in symmetric, positive definite algebraic system. An additional compatibility equation, i.e., the divergence of vorticity vector should be zero, is included to make the first-order system elliptic. The Newton's method is employed to linearize the partial differential equations, the LSFEM is used to obtain discretized equations, and the system of algebraic equations is solved using the Jacobi preconditioned conjugate gradient method which avoids formation of either element or global matrices (matrix-free) to achieve high efficiency. The flow in a half of 3D cubic cavity is calculated at Re = 100, 400, and 1,000 with 50 x 52 x 25 trilinear elements. The Taylor-Gortler-like vortices are observed at Re = 1,000.

Jiang, Bo-Nan↗
NASA NTRS1992

Design, test, and evaluation of three active flutter suppression controllers

Three control law design techniques for flutter suppression are presented. Each technique uses multiple control surfaces and/or sensors. The first method uses traditional tools (such as pole/zero loci and Nyquist diagrams) for producing a controller that has minimal complexity and which is sufficiently robust to handle plant uncertainty. The second procedure uses linear combinations of several accelerometer signals and dynamic compensation to synthesize the model rate of the critical mode for feedback to the distributed control surfaces. The third technique starts with a minimum-energy linear quadratic Gaussian controller, iteratively modifies intensity matrices corresponding to input and output noise, and applies controller order reduction to achieve a low-order, robust controller. The resulting designs were implemented digitally and tested subsonically on the active flexible wing wind-tunnel model in the Langley Transonic Dynamics Tunnel. Only the traditional pole/zero loci design was sufficiently robust to errors in the nominal plant to successfully suppress flutter during the test. The traditional pole/zero loci design provided simultaneous suppression of symmetric and antisymmetric flutter with a 24-percent increase in attainable dynamic pressure. Posttest analyses are shown which illustrate the problems encountered with the other laws.

Adams, William M., Jr.↗