SEARCH · Engineering Papers
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.
The design and implementation of a software system for generating finite elements and related computations are described. Exact symbolic computational techniques are employed to derive strain-displacement matrices and element stiffness matrices. Methods for dealing with the excessive growth of symbolic expressions are discussed. Automatic FORTRAN code generation is described with emphasis on improving the efficiency of the resultant code.
The Q3DG is a computer program developed to perform a quasi-three-dimensional stress analysis for composite laminates which may contain delaminations. The laminates may be subjected to mechanical, thermal, and hygroscopic loads. The program uses the finite element method and models the laminates with eight-noded parabolic isoparametric elements. The program computes the strain-energy-release components and the total strain-energy release in all three modes for delamination growth. A rectangular mesh and data file generator, DATGEN, is included. The DATGEN program can be executed interactively and is user friendly. The documentation includes sections dealing with the Q3D analysis theory, derivation of element stiffness matrices and consistent load vectors for the parabolic element. Several sample problems with the input for Q3DG and output from the program are included. The capabilities of the DATGEN program are illustrated with examples of interactive sessions. A microfiche of all the examples is included. The Q3DG and DATGEN programs have been implemented on CYBER 170 class computers. Q3DG and DATGEN were developed at the Langley Research Center during the early eighties and documented in 1984 to 1985.
Single-mode projection filters are developed for eigensystem parameter estimates from both analytical results and test data. Explicit formulations of these projection filters are derived using the pseudoinverse matrices of the controllability and observability matrices in general use. A global minimum optimization algorithm is developed to update the filter parameters by using interval analysis method. Modal parameters can be attracted and updated in the global sense within a specific region by passing the experimental data through the projection filters. For illustration of this method, a numerical example is shown by using a one-dimensional global optimization algorithm to estimate model frequencies and dampings.
Single-mode projection filters are developed for eigensystem parameter identification and state estimation from both analytical results and test data. Explicit formulations of these projection filters are derived using the pseudoinverse matrices of the controllabilty and observability matrices in the general sense. A global minimum optimization algorithm is developed to update the filter parameters by using the interval analysis method. Modal parameters can be identified and updated in the global sense within a specified region of parameters by passing the experimental data through the projection filters. For illustration of this new approach, a numerical example is shown by using a one-dimensional global optimization algorithm to estimate modal frequencies and damping.
Single-mode projection filters are developed for eigensystem parameter identification from both analytical results and test data. Explicit formulations of these projection filters are derived using the orthogonal matrices of the controllability and observability matrices in the general sense. A global minimum optimization algorithm is applied to update the filter parameters by using the interval analysis method. The updated modal parameters represent the characteristics of the test data. For illustration of this new approach, a numerical simulation for the MAST beam structure is shown by using a one-dimensional global optimization algorithm to identify modal frequencies and damping. Another numerical simulation of a ten-mode structure is also presented by using a two-dimensional global optimization algorithm to illustrate the feasibility of the new method. The projection filters are practical for parallel processing implementation.
Single-mode projection filters are developed for eigensystem parameter identification from both analytical results and test data. Explicit formulations of these projection filters are derived using the orthogonal matrices of the controllability and observability matrices in the general sense. A global minimum optimization algorithm is applied to update the filter parameters by using the interval analysis method. The updated modal parameters represent the characteristics of the test data. For illustration of this new approach, a numerical simulation for the MAST beam structure is shown by using a one-dimensional global optimization algorithm to identify modal frequencies and damping. The projection filters are practical for parallel processing implementation.
The basic formulation for probabilistic finite element analysis is described and demonstrated on a few sample problems. This formulation is based on iterative perturbation that uses the factorized stiffness on the unperturbed system as the iteration preconditioner for obtaining the solution to the perturbed problem. This approach eliminates the need to compute, store and manipulate explicit partial derivatives of the element matrices and force vector, which not only reduces memory usage considerably, but also greatly simplifies the coding and validation tasks. All aspects for the proposed formulation were combined in a demonstration problem using a simplified model of a curved turbine blade discretized with 48 shell elements, and having random pressure and temperature fields with partial correlation, random uniform thickness, and random stiffness at the root.
Identifiability of linear, time-invariant systems in physical coordinates is discussed. It is shown that identification of the system matrix in physical coordinates can be accomplished by determining a transformation matrix that relates the physical locations of actuators and sensors to the test-data-derived input and output matrices. For systems with symmetric matrices, the solution of a constrained optimization problem is used to characterize all the possible solutions of the transformation matrix. Conditions for the existence of a unique transformation matrix are established easily from the explicit form of the solutions. For systems with limited inputs and outputs, the question about which part of the system can be uniquely identified is also answered. A simple mass-spring system is used to verify the conclusions of this study.
The main text of the report contains the particular results of our research which relate to the Experimental Vector Magnetograph (EXVM) and the Balloon-borne Vector Magnetograph (BVM). A brief overview of which elements in the EXVM and BVM that are relevant to this polarization analysis are presented. The possible meaning of the 10(exp -5) polarization specification for the BVM is discussed qualitatively. A recommendation of which polarization specification is most relevant for the BVM is provided. A diattenuation budget for the various surfaces in the BVM which will allow the polarization specification to be met is discussed. An explanation of the various coating specifications which are recommended is presented. Optical design of the EXVM and coating specification sheets for the BVM are presented. The appendices of this report contain the more general results of our research on the general topic of polarization aberrations. A general discussion of polarization aberration theory, in terms of the SAMEX solar magnetograph, and rigorous derivations for the Mueller matrices of optical systems are also presented in the appendices.
In this paper we briefly describe a combined symbolic and numeric approach for solving mathematical models on parallel computers. An experimental software system, PIER, is being developed in Common Lisp to synthesize computationally intensive and domain formulation dependent phases of finite element analysis (FEA) solution methods. Quantities for domain formulation like shape functions, element stiffness matrices, etc., are automatically derived using symbolic mathematical computations. The problem specific information and derived formulae are then used to generate (parallel) numerical code for FEA solution steps. A constructive approach to specify a numerical program design is taken. The code generator compiles application oriented input specifications into (parallel) FORTRAN77 routines with the help of built-in knowledge of the particular problem, numerical solution methods and the target computer.
An advanced beam finite element has been developed for modeling rotor blade dynamics and aeroelasticity. This element is part of the Element Library of the Second Generation Comprehensive Helicopter Analysis System (2GCHAS). The element allows modeling of arbitrary rotor systems, including bearingless rotors. It accounts for moderately large elastic deflections, anisotropic properties, large frame motion for maneuver simulation, and allows for variable order shape functions. The effects of gravity, mechanically applied and aerodynamic loads are included. All kinematic quantities required to compute airloads are provided. In this paper, the fundamental assumptions and derivation of the element matrices are presented. Numerical results are shown to verify the formulation and illustrate several features of the element.
Three matrice methods are developed and presented for determining the longitudinal-stability derivatives from transient flight data. In these methods the expressions for some of the stability derivatives are in the form generally used in stability calculations. The first method requires the combination of four measurements in time-history form, two of which must be incremental elevator deflection and incremental tail load and the other two measurements can be chosen from a possible three, namely incremental load factor, pitching velocity, and angle of attack. The method demonstrates the use of the tail load to separate the pitching-moment derivatives and to determine the downwash derivative. (author)
We illustrate a technique to calculate the gradient of scalar functions that are defined on any arbitrary matrix subspace. It generalizes our earlier work titled “What is the gradient of a scalar function of a symmetric matrix ?”(Indian Journal of Pure and Applied Mathematics (2022), doi:10.1007/s13226-022-00313-x), in which we considered the special case of the subspace of symmetric matrices. Extant methods to calculate the gradient in such cases have an inherent flaw which leads to spurious results that populate several publications, as well as respected textbooks and handbooks on matrix calculus. We examine these sources and results in a rigorous and concrete mathematical setting of a finite-dimensional inner-product space and discover the inherent flaw and also a remedy. We demonstrate two ways to calculate the derivative/gradient and second derivative for scalar functions of matrices defined over an arbitrary matrix subspace; the first method is by considering any (differentiable) extension to the space of square matrices and projection of its gradient onto the given subspace. The second method utilizes an ordered basis and computes each component of the gradient through evaluation of the directional derivative. All the ideas presented are illustrated by non-trivial examples, namely, considering the subspace of 3 × 3 circulant and Toeplitz matrices and presenting the results of gradient-descent with both the spurious and correct gradients. Moreover, our bibliography makes it clear that a rigorous approach to matrix calculus is not common in practice, and our presentation of matrix calculus in the language of inner-product spaces will be significant and meaningful for applied mathematicians, engineers and researchers working in inter-disciplinary fields to avoid the conceptual pitfalls that exist.
We illustrate a technique to calculate the gradient of scalar functions that are defined on any arbitrary matrix subspace. It generalizes our earlier work titled “What is the gradient of a scalar function of a symmetric matrix ?”(Indian Journal of Pure and Applied Mathematics (2022), https://doi.org/10.1007/s13226-022-00313-x), in which we considered the special case of the subspace of symmetric matrices. Extant methods to calculate the gradient in such cases have an inherent flaw which leads to spurious results that populate several publications, as well as respected textbooks and handbooks on matrix calculus. Here, we examine these sources and results in a rigorous and concrete mathematical setting of a finite-dimensional inner-product space and discover the inherent flaw and also a remedy. We demonstrate two ways to calculate the derivative/gradient and second derivative for scalar functions of matrices defined over an arbitrary matrix subspace; the first method is by considering any (differentiable) extension to the space of square matrices and projection of its gradient onto the given subspace. The second method utilizes an ordered basis and computes each component of the gradient through evaluation of the directional derivative. All the ideas presented are illustrated by non-trivial examples, namely, considering the subspace of 3 x 3 circulant and Toeplitz matrices and presenting the results of gradient-descent with both the spurious and correct gradients. Moreover, our bibliography makes it clear that a rigorous approach to matrix calculus is not common in practice, and our presentation of matrix calculus in the language of inner-product spaces will be significant and meaningful for applied mathematicians, engineers and researchers working in inter-disciplinary fields to avoid the conceptual pitfalls that exist.
A novel benzoxazine made from furfurylamine, paraformaldehyde, and piceol, Bz-FA-HA, is assessed for applications in fiber reinforced (FR) composites. Piceol is a biobased phenolic compound derived from the roots of Norwegian spruce trees and contains a methyl ketone group at the para position. Bz-FA-HA is a liquid at room temperature, has a viscosity of < 1 Pa.s at temperatures above 90 °C, and a Tonset of cure at 132 °C. The carbonyl is found to react with the furan ring, yielding a crosslinking reaction, when cured above 180 °C as indicated by differential scanning calorimetry and thermogravimetric analysis coupled with Fourier transform infrared spectroscopy. Poly(Bz-FA-HA) has a Tg > 350 °C, attributed to the crosslinking reaction. Furthermore, the storage modulus is > 3 GPa, regardless of cure temperature. Poly(Bz-FA-HA) has a char yield at 800 °C of 65.0 % (62.3 % at 1000 °C), and a Tonset of decomposition of 357 °C in nitrogen. The resulting carbon formed during pyrolysis shrinks during the carbonization reaction and scanning electron microscopy imaging shows a cross-section with micro cracks. The high processability, advanced mechanical properties, and exceptional char yield make it a promising candidate as the matrix for FR composites.
A rigorous method for calibrating polarimetric backscatter measurements of distributed targets is presented. By characterizing the radar distortions over the entire mainlobe of the antenna, the differential Mueller matrix is derived from the measured scattering matrices with a high degree of accuracy. It is shown that the radar distortions can be determined by measuring the polarimetric response of a metallic sphere over the main lobe of the antenna. Comparison of results obtained with the new algorithm with the results derived from the old calibration method show that the discrepancy between the two methods is less than 1 dB for the backscattering coefficients. The discrepancy is more drastic for the phase-difference statistics, indicating that removal of the radar distortions from the cross products of the scattering matrix elements cannot be accomplished with the traditional calibration methods.
Radiative transfer of partially polarized radiation in an anisotropically scattering, inhomogeneous atmosphere containing an arbitrary polydispersion of particles is described using Jones's (1941) amplitude vectors and matrices. This approach exploits the close analogy between the quantum-mechanical states of spin 1/2 systems and the polarization states of electromagnetic radiation described by Jones's vector. The complete equivalence between the transport equation for Jones's vectors and the classical radiative-transfer equation for Stokes's intensity vectors is demonstrated in two independent ways after deriving the transport equations for the polarization coherency matrices and for the quaternions corresponding to the Jones's vectors. A compact-operator formulation of the theory is provided and used to derive the necessary equations for both a local and a global description of the transport of Jones's vectors. The integro-differential equations for the amplitude reflection and transmission matrices are derived and related to the usual corresponding equations.
We present substantially generalized and improved quantum algorithms over prior work for inhomogeneous linear and nonlinear ordinary differential equations (ODE). Specifically, we show how the norm of the matrix exponential characterizes the run time of quantum algorithms for linear ODEs opening the door to an application to a wider class of linear and nonlinear ODEs. In [1], a quantum algorithm for a certain class of linear ODEs is given, where the matrix involved needs to be diagonalizable. The quantum algorithm for linear ODEs presented here extends to many classes of non-diagonalizable matrices including singular matrices. The algorithm here is also exponentially faster than the bounds derived in [1] for certain classes of diagonalizable matrices. Our linear ODE algorithm is then applied to nonlinear differential equations using Carleman linearization (an approach taken recently by us in [2]). The improvement over that result is two-fold. First, we obtain an exponentially better dependence on error. This kind of logarithmic dependence on error has also been achieved by [3], but only for homogeneous nonlinear equations. Second, the present algorithm can handle any sparse matrix (that models dissipation) if it has a negative log-norm (including non-diagonalizable matrices), whereas [2] and [3] additionally require normality.