SEARCH · Engineering Papers

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.

SourceResearch connectionFrom yearThrough year

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

At least 127 records · Page 7

All sources NASA NTRS DOE OSTI

NASA NTRS1981

A pad perturbation method for the dynamic coefficients of tilting-pad journal bearings

A pad assembly method for analyzing tilting-pad bearings is presented. The method results in the complete coefficient matrix for a tilting-pad bearing; the matrix is independent of the pad inertia, the pitch frequency and the number of degrees of freedom of the pad. A pad assembly method is used because it allows the collection of more bearing data with less computer time than a brute force iterative procedure. The results given show the complete dynamical matrices for a five-pad tilting-pad bearing both including and ignoring the damping effects of the unloaded (top) pads. For a symmetrical tilting-pad bearing the reduced cross-coupling coefficients are zero when the moment of inertia of the pad is ignored.

Allaire, P. E.↗

NASA NTRS1990

EZDESIT: A Computer Program for Structural Element Sizing and Vehicle Weight Prediction

A method is presented for formulating stiffness terms and thermal coefficients of fiber reinforced composite, stiffened panels for input to finite element analysis (FEA). The method is robust enough to handle panels with general cross sectional shapes, including those which are unsymmetric and/or unbalanced. New thermal coefficients are introduced to quantify panel response from through-the-thickness temperature gradients. Equations are defined for stiffness, thermal expansion, and thermal bending that consider the full complement of membrane, bending, membrane-bending coupling, and transverse shear behavior. A technique of implementing this capability with a single plane of shell finite elements using the MSC/NASTRAN™ FEA program is revealed. Finally, an example of a composite, hat-stiffened panel is included to demonstrate errors that occur when an unsymmetric panel is symmetrically formulated as traditionally done. These erroneous values and the correct ones produced from the presented method are listed for the panel's stiffness matrices, thermal expansion and bending vectors, and the forces and moments that are thermally induced from in-plane and through-the-thickness temperature gradients.

Jeffrey A Cerro↗

NASA NTRS1992

Composite Stiffened Panels: Part I - Stiffness, Thermal Expansion, and Thermal Bending Formulation for Finite Element Analysis

A method is presented for formulating stiffness terms and thermal coefficients of fiber-reinforced composite, stiffened panels for input to finite element analysis (FEA). The method is robust enough to handle panels with general cross sectional shapes, including those which are unsymmetric and/or unbalanced. New thermal coefficients are introduced to quantify panel response from through-the-thickness temperature gradients. Equations are defined for stiffness, thermal expansion, and thermal bending that consider the full complement of membrane, bending, membrane-bending coupling, and transverse shear behavior. A technique of implementing this capability with a single plane of shell finite elements using the MSC/NASTRAN(TradeMark) FEA program is revealed. Finally, an example of a composite, hat-stiffened panel is included to demonstrate errors that occur when an unsymmetric panel is symmetrically formulated as traditionally done. These erroneous values and the correct ones produced from the presented method are listed for the panel's stiffness matrices, thermal expansion and bending vectors, and the forces and moments that are thermally induced from in-plane and through-the-thickness temperature gradients.

Craig S Collier↗

NASA NTRS1989

Low-order design and high-order simulation of active closed-loop control for aerospace structures under construction

Partially constructed/assembled structures in space are complicated enough but their dynamics will also be operating in closed-loop with feedback controllers. The dynamics of such structures are modeled by large-scale finite element models. The model dimension L is extremely large (approximately 10,000) while the numbers of actuators (M) and sensors (P) are small. The model parameters M(sub m) mass matrix, D(sub o) damping matrix, and K(sub o) stiffness matrix, are all symmetric and sparse (banded). Thus simulation of open-loop structure models of very large dimension can be accomplished by special integration techniques for sparse matrices. The problem of simulation of closed-loop control of such structures is complicated by the addition of controllers. Simulation of closed-loop controlled structures is an essential part of the controller design and evaluation process. Current research in the following areas is presented: high-order simulation of actively controlled aerospace structures; low-order controller design and SCI compensation for unmodeled dynamics; prediction of closed-loop stability using asymptotic eigenvalue series; and flexible robot manipulator control experiment.

Balas, Mark J.↗

NASA NTRS1991

Second-order discrete Kalman filtering equations for control-structure interaction simulations

A general form for the first-order representation of the continuous, second-order linear structural dynamics equations is introduced in order to derive a corresponding form of first-order Kalman filtering equations (KFE). Time integration of the resulting first-order KFE is carried out via a set of linear multistep integration formulas. It is shown that a judicious combined selection of computational paths and the undetermined matrices introduced in the general form of the first-order linear structural systems leads to a class of second-order discrete KFE involving only symmetric, N x N solution matrix.

Park, K. C.↗

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↗

DOE OSTI2020

A Shift Selection Strategy for Parallel Shift-invert Spectrum Slicing in Symmetric Self-consistent Eigenvalue Computation

The central importance of large-scale eigenvalue problems in scientific computation necessitates the development of massively parallel algorithms for their solution. Recent advances in dense numerical linear algebra have enabled the routine treatment of eigenvalue problems with dimensions on the order of hundreds of thousands on the world’s largest supercomputers. In cases where dense treatments are not feasible, Krylov subspace methods offer an attractive alternative due to the fact that they do not require storage of the problem matrices. However, demonstration of scalability of either of these classes of eigenvalue algorithms on computing architectures capable of expressing massive parallelism is non-trivial due to communication requirements and serial bottlenecks, respectively. In this work, we introduce the SISLICE method: a parallel shift-invert algorithm for the solution of the symmetric self-consistent field (SCF) eigenvalue problem. The SISLICE method drastically reduces the communication requirement of current parallel shift-invert eigenvalue algorithms through various shift selection and migration techniques based on density of states estimation and k-means clustering, respectively. This work demonstrates the robustness and parallel performance of the SISLICE method on a representative set of SCF eigenvalue problems and outlines research directions that will be explored in future work.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Covariance Testing at BNL [Slides]

This presentation discusses testing implemented in FUDGE & ADVANCE in regard to proper ENDF formatting: STAN, STANEF, CHECKR, FUDGE, NJOY, convert to BOXR format, plotting, endfcovreport.py which is an overview of ENDF library’s covariance contents, and covariance Matrix class implements that are the core of all GNDS covariance. Several checks are performed, including symmetric, real, positive definite, condition # of Eigenvalues, and too big uncertainties. The presentation states that it can fix too big and/or small uncertainties and that it can plot matrices. It states that further testing is recommended by CSEWG but has not yet been implemented and suggests methods such as documentation which needs a human to execute, completeness which is partially complete, and reasonableness which has not been started. The presentation concludes by elaborating on reasonableness and states that only cross section is documented, that similar limits on CP reactions cross sections are needed, that maximum limits are needed too which is tricky since ENDF assumes Normal PDFs, and that there may be other observables.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

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.↗