Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

Compliance matrices for cracked bodies

An algorithm is presented which can be used to develop compliance matrices for cracked bodies. The method relies on the numerical solution of singular integral equations with Cauchy-type kernels and provides an efficient and accurate procedure for relating applied loadings to crack opening displacements. The algorithm should be of interest to those performing repetitive calculations in the analysis of experimental results obtained from fracture specimens.

Ballarini, R.↗
NASA NTRS1987

Comparison of flexural properties of aramid-reinforced pultrusions having varied matrices, pretreatments and postcures

Aramid-reinforced composite materials of equal fiber volume and varied polymer thermoset matrices were pultruded and flexurally tested to failure. The objective was to improve the flexural properties of aramid-reinforced pultrusions. Pultrusions of both sized and unsized aramid fiber with four different resin systems were compared to determine the effects of sizing compounds and postcuring on flexural strength, fiber wettability, and fiber-to-resin interface bonding. Improvements in flexural strength resulting from pretreatments with the sizing solutions used were marginal. The most significant improvements in flexural properties resulted from postcuring. Flexural strengths ranged from a low of 39,647 psi (273MPa) to a high of 80,390 psi (554 MPa), an overall increase of 103 percent. The fact that postcuring improved the flexural properties of the pultrusions of the four resin systems indicates that a full cure did not occur in any of the resin systems during the pultrusion process. The increased flexural strengths of the polyester and vinyl ester pultrusions were the most surprising. The four resin systems examined were Interplastic Corporation VE 8300 vinyl ester, Ashland Chemical Company Aropol 7430 Polyester, and Shell Chemical Company Epon 9302 and Epon 9310 epoxides.

Wilson, Maywood L.↗
NASA NTRS1987

Polynomial approximation of functions of matrices and its application to the solution of a general system of linear equations

During the process of solving a mathematical model numerically, there is often a need to operate on a vector v by an operator which can be expressed as f(A) while A is NxN matrix (ex: exp(A), sin(A), A sup -1). Except for very simple matrices, it is impractical to construct the matrix f(A) explicitly. Usually an approximation to it is used. In the present research, an algorithm is developed which uses a polynomial approximation to f(A). It is reduced to a problem of approximating f(z) by a polynomial in z while z belongs to the domain D in the complex plane which includes all the eigenvalues of A. This problem of approximation is approached by interpolating the function f(z) in a certain set of points which is known to have some maximal properties. The approximation thus achieved is almost best. Implementing the algorithm to some practical problem is described. Since a solution to a linear system Ax = b is x= A sup -1 b, an iterative solution to it can be regarded as a polynomial approximation to f(A) = A sup -1. Implementing the algorithm in this case is also described.

Tal-Ezer, Hillel↗
NASA NTRS1986

A comparison of flexural properties of aramid reinforced pultrusions having constant fiber volume and varied matrices, pretreatments, and postcures

Aramid reinforcement composite materials of equal fiber volume having varied polymer thermoset matrices have been pultruded and flexurally tested to failure. The objective was to improve flexural properties of aramid reinforced pultrusions. Pultrusions of both sized and unsized aramid fiber with four different resin systems were compared to determine the effects of sizing compounds and post-thermal treatments on the flexural strength as an indication of fiber wettability and fiber-to-resin interface bonding. Improvements in flexural strength as the result of pretreatments with sizing solutions used in this study were marginal. The most significant improvements in flexural properties were the results of postcuring. Overall improvements ranged from a low 39,647 Psi(273 Mpa) to a high of 80,390 Psi(554 Mpa), or 103 percent. The fact that post-thermal treatments improved the flexural properties of the four pultrusions indicates that a full cure did not occur in either resin system during the pultrusion process. The increased flexural strengths of the polyester and vinyl ester pultrusions were the most surprising. Based on data presented, the most promising resin system of the four examined (VE 8300, Aropol 7430, Epon 9302, and Epon 9310) for Kevlar reinforced pultrusion is Epon 9310 epoxy.

Wilson, Maywood L.↗
NASA NTRS1986

Concurrent Cholesky factorization of positive definite banded Hermitian matrices

First, the Cholesky factorization is extended to cover uniformly partitioned banded positive definite matrices of rank n which may be real symmetric or Hermitian. Then, two stratagems are given for the use of the algorithm in concurrent machines where the number of processing elements is less than required to factor the matrix in as few serial steps as possible, and where uniformly high efficiency is expected from all processing elements. Expressions are given for the efficiency factor e appearing in the speed-up expression q = eN, and these are specialized for the N node hypercube machine as a function of partition size s, the number N of processing elements of the hypercube machine, and the cost mu of interelement transmission relative to computation. It is shown that the efficiency factor e is inversely proportional to mu/s, and that e is almost independent of N when N is large and mu/s = 0. The task is completed in n/s serial steps with no limit on n. The half bandwidth b of the matrix is 2 Ns.

Utku, S.↗
NASA NTRS1987

Inverse of polynomial matrices in the irreducible form

An algorithm is developed for finding the inverse of polynomial matrices in the irreducible form. The computational method involves the use of the left (right) matrix division method and the determination of linearly dependent vectors of the remainders. The obtained transfer function matrix has no nontrivial common factor between the elements of the numerator polynomial matrix and the denominator polynomial.

Chang, Fan R.↗
NASA NTRS1988

Flux Jacobian matrices and generaled Roe average for an equilibrium real gas

Inviscid flux Jacobian matrices and their properties used in numerical solutions of conservation laws are extended to general, equilibrium gas laws. Exact and approximate generalizations of the Roe average are presented. Results are given for one-dimensional flow, and then extended to three-dimensional flow with time-varying grids.

Vinokur, Marcel↗
NASA NTRS1988

Symbolic derivation of material property matrices in finite element analysis

The principles and operation of MMAX, a symbolic-computation program which automates the process of generating property matrices for structural materials, are briefly described and illustrated with sample analyses of a rubberlike material and an elastoplastic material. MMAX is written in LISP under the symbolic finite-element generator FINGER and the general symbolic manipulator MACSYMA; it first derives the formulas required by mathematical manipulation, and then translates the formulas into FORTRAN code, adapted to the particular type of machine to be used for the numerical calculations. This approach is shown to combine efficiently the advantages of symbolic and numerical computation for engineering applications.

Tan, H. Q.↗
NASA NTRS1989

Derivation of improved load transformation matrices for launchers-spacecraft coupled analysis, and direct computation of margins of safety

Load and stress recovery from transient dynamic studies are improved upon using an extended acceleration vector in the modal acceleration technique applied to structural analysis. Extension of the normal LTM (load transformation matrices) stress recovery to automatically compute margins of safety is presented with an application to the Hubble space telescope.

Klein, M.↗
NASA NTRS1990

Factoring symmetric indefinite matrices on high-performance architectures

The Bunch-Kaufman algorithm is the method of choice for factoring symmetric indefinite matrices in many applications. However, the Bunch-Kaufman algorithm does not take advantage of high-performance architectures such as the Cray Y-MP. Three new algorithms, based on Bunch-Kaufman factorization, that take advantage of such architectures are described. Results from an implementation of the third algorithm are presented.

Jones, Mark T.↗
NASA NTRS1990

Phase calibration of imaging radar polarimeter Stokes matrices

It is shown that the Stokes matrices measured by an imaging radar polarimeter provide enough information for the accurate phase calibration of the observed polarimetric characteristics of a surface. This is important because it allows the data to be reduced in volume in an operational synthetic aperture radar correlator with no prior knowledge of the conditions at the surface, and the end user can later select the particular region where he or she is comfortable with making an assumption regarding the relative phases of the hh and vv signals. No ground calibration equipment is necessary, as all important parameters are derived from the data themselves.

Zebker, Howard A.↗
NASA NTRS1989

On polynomial preconditioning for indefinite Hermitian matrices

The minimal residual method is studied combined with polynomial preconditioning for solving large linear systems (Ax = b) with indefinite Hermitian coefficient matrices (A). The standard approach for choosing the polynomial preconditioners leads to preconditioned systems which are positive definite. Here, a different strategy is studied which leaves the preconditioned coefficient matrix indefinite. More precisely, the polynomial preconditioner is designed to cluster the positive, resp. negative eigenvalues of A around 1, resp. around some negative constant. In particular, it is shown that such indefinite polynomial preconditioners can be obtained as the optimal solutions of a certain two parameter family of Chebyshev approximation problems. Some basic results are established for these approximation problems and a Remez type algorithm is sketched for their numerical solution. The problem of selecting the parameters such that the resulting indefinite polynomial preconditioners speeds up the convergence of minimal residual method optimally is also addressed. An approach is proposed based on the concept of asymptotic convergence factors. Finally, some numerical examples of indefinite polynomial preconditioners are given.

Freund, Roland W.↗
NASA NTRS1991

An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices

The nonsymmetric Lanczos method can be used to compute eigenvalues of large sparse non-Hermitian matrices or to solve large sparse non-Hermitian linear systems. However, the original Lanczos algorithm is susceptible to possible breakdowns and potential instabilities. An implementation is presented of a look-ahead version of the Lanczos algorithm that, except for the very special situation of an incurable breakdown, overcomes these problems by skipping over those steps in which a breakdown or near-breakdown would occur in the standard process. The proposed algorithm can handle look-ahead steps of any length and requires the same number of matrix-vector products and inner products as the standard Lanczos process without look-ahead.

Freund, Roland W.↗
NASA NTRS1991

A parallel algorithm for generation and assembly of finite element stiffness and mass matrices

A new algorithm is proposed for parallel generation and assembly of the finite element stiffness and mass matrices. The proposed assembly algorithm is based on a node-by-node approach rather than the more conventional element-by-element approach. The new algorithm's generality and computation speed-up when using multiple processors are demonstrated for several practical applications on multi-processor Cray Y-MP and Cray 2 supercomputers.

Storaasli, O. O.↗
NASA NTRS1990

Robust time-domain identification of mass stiffness, and damping matrices

Accurate estimates of the mass, stiffness, and damping characteristics of a structure is necessary for determining the control laws best suited for active control methodologies. There are several modal identification techniques available for determining the frequencies, damping ratios, and mode shapes of a structure. However, modal identification methods in both the frequency and time domains have difficulties for certain circumstances. Frequency domain techniques which utilize the steady-state response from various harmonic inputs often encounter difficulties when the frequencies are closely distributed, the structure exhibits a high degree of damping, or the steady-state condition is hard to establish. Time domain techniques have produced successful results, but lack robustness with respect to measurement noise. In this paper, two identification techniques and an estimation method are combined to form a time-domain technique to accurately identify the mass, stiffness, and damping matrices from noisy measurements.

Roemer, Michael J.↗
NASA NTRS1990

An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, part 1

The nonsymmetric Lanczos method can be used to compute eigenvalues of large sparse non-Hermitian matrices or to solve large sparse non-Hermitian linear systems. However, the original Lanczos algorithm is susceptible to possible breakdowns and potential instabilities. We present an implementation of a look-ahead version of the Lanczos algorithm which overcomes these problems by skipping over those steps in which a breakdown or near-breakdown would occur in the standard process. The proposed algorithm can handle look-ahead steps of any length and is not restricted to steps of length 2, as earlier implementations are. Also, our implementation has the feature that it requires roughly the same number of inner products as the standard Lanczos process without look-ahead.

Freund, Roland W.↗
NASA NTRS1992

Global transformation of rotation matrices to Euler parameters

A global algorithm for transforming rotation matrices to Euler parameters is presented. Although it has no apparent computational or numerical advantage over the known algorithms, it elucidates the relationship between the rotation matrix form and the Euler parameter form. It employs the singular-value decomposition, a numerically ideal algorithm involving orthogonal transformations. Attitude parameterization is reviewed and an analytical framework is provided.

Paielli, Russell A.↗