Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear equations”

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 163 records · Page 9

Investigation of the Stability of Very Flat Spins and Analysis of Effects of Applying various Moments Utilizing the Three Moment Equations of Motion

Based on linearized equations of motion utilizing only the three moment equations and assuming only flat-spin conditions, it appears that contemporary designs (with the moment of inertia about the wing axis I(sub Y) considerably greater than the moment of inertia about the fuselage axis I(sub X) having positive values of C(sub l, sub p) (rolling-moment coefficient due to rolling) or positive values of C(sub l, sub beta) (rolling-moment coefficient due to sideslip) will probably not have a stable spin in the flat-spin region near an angle of attack of 90 deg. If the damping in pitch in flat-spin attitudes is zero, stable flat-spin conditions may not be possible on an airplane having the mass primarily distributed along the wings. The effect of moving ailerons with the spin or the effect of applying a positive pitching moment producing recovery for contemporary fighter designs will be greatest for large negative values of C(sub n, sub beta) (yawing-moment coefficient due to sideslip). In addition, for a certain critical value of positive C(sub n, sub beta), the rolling moment applied by moving ailerons with the spin or the application of a positive pitching moment will have no effect on reducing the spin rate.

Klinar, Walter J.↗

Discrete Fourier transforms of nonuniformly spaced data

Time series or spatial series of measurements taken with nonuniform spacings have failed to yield fully to analysis using the Discrete Fourier Transform (DFT). This is due to the fact that the formal DFT is the convolution of the transform of the signal with the transform of the nonuniform spacings. Two original methods are presented for deconvolving such transforms for signals containing significant noise. The first method solves a set of linear equations relating the observed data to values defined at uniform grid points, and then obtains the desired transform as the DFT of the uniform interpolates. The second method solves a set of linear equations relating the real and imaginary components of the formal DFT directly to those of the desired transform. The results of numerical experiments with noisy data are presented in order to demonstrate the capabilities and limitations of the methods.

Swan, P. R.↗

Using yttrium as an indicator to estimate total rare earth element concentration: a case study of anthracite-associated clays from northeastern Pennsylvania

Abstract This study demonstrated using yttrium (Y) as an indicator to estimate the total rare earth element and Y contents (REY) in coal-associated samples and to facilitate selection of samples with high REY assays in a fast and inexpensive manner. More than 10 anthracite-associated samples were collected from each of three Pennsylvanian sites (sites B, J and C) based on Thorium gamma ray logging suggesting high REY content. Several samples from each site were analyzed by ICP-MS to determine the rare earth distribution patterns and to establish the site-specific linear equations of Y and REY. The Y contents of the remaining samples were measured by a portable X-ray fluorescence analyzer, and the REY values were estimated based on the site-specific linear equation developed earlier. R-squared values above 0.70 were obtained for all the estimation equations from all three sites on both a whole sample basis and an ash basis. Previously, ash content has been widely used as an indicator of high REY content. This may not be applicable for a specific site. Site B in this study is an example where ash contents could not be statistically correlated with REY, so using Y for estimation is more applicable. The demonstrated sample screening process is suitable for samples from sites that share more similar distribution patterns (either MREY or LREY or HREY) as well as for samples from sites that share multiple distribution patterns (LREY/MREY/HREY) depending on the desirable accuracy. The demonstrated process lowers the analytical cost from $70 to 80 dollars per sample to $10–15 per sample while significantly reducing the processing time and acid consumption for ICP digestion. This is particularly true when a relatively large sample size is involved, for example, 100 samples from one site analyzed by ICP-MS/OES.

Yang, Xiaojing↗

Methodology for Sensitivity Analysis, Approximate Analysis, and Design Optimization in CFD for Multidisciplinary Applications

An incremental iterative formulation together with the well-known spatially split approximate-factorization algorithm, is presented for solving the large, sparse systems of linear equations that are associated with aerodynamic sensitivity analysis. This formulation is also known as the 'delta' or 'correction' form. For the smaller two dimensional problems, a direct method can be applied to solve these linear equations in either the standard or the incremental form, in which case the two are equivalent. However, iterative methods are needed for larger two-dimensional and three dimensional applications because direct methods require more computer memory than is currently available. Iterative methods for solving these equations in the standard form are generally unsatisfactory due to an ill-conditioned coefficient matrix; this problem is overcome when these equations are cast in the incremental form. The methodology is successfully implemented and tested using an upwind cell-centered finite-volume formulation applied in two dimensions to the thin-layer Navier-Stokes equations for external flow over an airfoil. In three dimensions this methodology is demonstrated with a marching-solution algorithm for the Euler equations to calculate supersonic flow over the High-Speed Civil Transport configuration (HSCT 24E). The sensitivity derivatives obtained with the incremental iterative method from a marching Euler code are used in a design-improvement study of the HSCT configuration that involves thickness. camber, and planform design variables.

Taylor, Arthur C., III↗

Evaluating Diesel/Biofuel Blends Using Artificial Neural Networks and Linear/Nonlinear Equations

Abstract The use of biomass-derived additives in diesel fuel mixtures has the potential to increase the fuel’s efficiency, decrease the formation of particulate matter during its combustion, and retain the fuel’s behavior in cold weather. To this end, identifying compounds that enable these behaviors is paramount. The present work utilizes a series of linear and non-linear equations in series with artificial neural networks to predict the cetane number, yield sooting index, kinematic viscosity, cloud point, and lower heating value of multi-component blends. Property values of pure components are predicted using artificial neural networks trained with existing experimental data, and these predictions and their expected errors are propagated through linear and non-linear equations to obtain property predictions for multi-component blends. Individual component property prediction errors, defined by blind prediction median absolute error, are 4.91 units, 7.84 units, 0.06 cSt, 4.00 °C, and 0.55 MJ/kg for cetane number, yield sooting index, kinematic viscosity, cloud point, and lower heating value respectively. On average, property predictions for blends are shown to be accurate to within 6% of the blends’ experimental values. Further, a multitude of compounds expected to be produced from catalytically upgrading products of fast pyrolysis are evaluated with respect to their behavior in diesel fuel blends.

09 BIOMASS FUELS↗

HPC4Mfg with Samsung: Making semiconductor devices cool through HPC ab initio simulations

For decades, the semiconductor technology has followed the Moore’s law, making newer devices more powerful and energy efficient. Recently, however, it has reached a point where the performance and the energy efficiency of the device do not improve with the shrinking device size. One of the fundamental reasons of this deviation from the past trend is the interconnect resistance, which becomes larger with the shrinking size. The devices size is so small that the quantum mechanical effects can no longer be ignored and the traditional continuum simulation tools such as TCAD become inadequate. In this project, Samsung Semiconductor Inc. and Lawrence Berkeley National Laboratory has collaborated to perform first of kind device-scale ab initio simulations to optimize materials and interconnect morphology to minimize interconnect resistance. We have tested the use of LS3DF method and the PEtot_trans approach on top of the folded spectrum method (FSM) Escan code to calculate the scattering state, and to study various effects influence the interconnect conductivity. We found that, the LS3DF can be used to calculate such metallic system. On the other hand, the use of Escan code to solve the linear equation is not practical due to the slow convergence. We have implemented a Chebyshev filter technique to calculate a few hundred eigen states near the scattering state energy E, then use these eigen states as preconditioner to solve the linear equation. We have used this approach to study the different factors which affect the interconnect conductivity, including the shape, the point defect, the temperature, and the grain boundary.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Development of Numerical Codes for Modeling Electromagnetic Behavior at High Frequencies Near Large Objects

A study into the problem of determining electromagnetic solutions at high frequencies for problems involving complex geometries, large sizes and multiple sources (e.g. antennas) has been initiated. Typical applications include the behavior of antennas (and radiators) installed on complex conducting structures (e.g. ships, aircrafts, etc..) with strong interactions between antennas, the radiation patterns, and electromagnetic signals is of great interest for electromagnetic compatibility control. This includes the overall performance evaluation and control of all on-board radiating systems, electromagnetic interference, and personnel radiation hazards. Electromagnetic computational capability exists at NASA LaRC, and many of the codes developed are based on the Moment Method (MM). However, the MM is computationally intensive, and this places a limit on the size of objects and structures that can be modeled. Here, two approaches are proposed: (i) a current-based hybrid scheme that combines the MM with Physical optics, and (ii) an Alternating Direction Implicit-Finite Difference Time Domain (ADI-FDTD) method. The essence of a hybrid technique is to split the overall scattering surface(s) into two regions: (a) a MM zone (MMZ) which can be used over any part of the given geometry, but is most essential over irregular and "non-smooth" geometries, and (b) a PO sub-region (POSR). Currents induced on the scattering and reflecting surfaces can then be computed in two ways depending on whether the region belonged to the MMZ or was part of the POSR. For the MMZ, the current calculations proceed in terms of basis functions with undetermined coefficients (as in the usual MM method), and the answer obtained by solving a system of linear equations. Over the POSR, conduction is obtained as a superposition of two contributions: (i) currents due to the incident magnetic field, and (ii) currents produced by the mutual induction from conduction within the MMZ. This effectively leads to a reduction in the size of linear equations from N to N - Npo with N being the total number of segments for the entire surface and Npo the number of segments over the POSR. The scheme would be appropriate for relatively large, flat surfaces, and at high frequencies. The ADI-FDTD scheme provides for both transient and steady state analyses. The restrictive Courant-Friedrich-Levy (CFL) condition on the time-step is removed, and so large time steps can be chosen even though the spatial grids are small. This report includes the problem definition, a detailed discussion of both the numerical techniques, and numerical implementations for simple surface geometries. Numerical solutions have been derived for a few simple situations.

Joshi, R. P.↗

The responses of rising or falling spherical wind sensors to atmospheric wind perturbations.

Analysis of the responses of rising or falling spherical wind sensors to atmospheric wind perturbations on the wind profile in the vertical, using Fourier transform techniques. The linearized equations of motion of a sensor that is subject to drag and gravitational body forces are developed by perturbing a sensor about an equilibrium uniform motion with wind fluctuations which have vertical variations. The wind environment and sensor velocities are decomposed with stochastic Fourier-Stieltjes integrals, and the linearized equations of motion are used to derive the response functions and phase angles of the sensor motions. The results of the analysis are used to analyze the response properties of the Jimsphere balloon wind sensor. It is shown that, in general, the transfer functions associated with the horizontal sensor motions are smaller than the transfer functions associated with the vertical sensor motions in the omega times T product range from zero to infinity, omega being the wind perturbation frequency and T a time constant of the system. Thus, the sensor is more responsive to vertical than to horizontal air motions.

Fichtl, G. H.↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

Integrals and integral equations in linearized wing theory

The formulas of subsonic and supersonic wing theory for source, doublet, and vortex distributions are reviewed and a systematic presentation is provided which relates these distributions to the pressure and to the vertical induced velocity in the plane of the wing. It is shown that care must be used in treating the singularities involved in the analysis and that the order of integration is not always reversible. Concepts suggested by the irreversibility of order of integration are shown to be useful in the inversion of singular integral equations when operational techniques are used. A number of examples are given to illustrate the methods presented, attention being directed to supersonic flight speed.

Lomax, Harvard↗

Sound propagation in choked ducts

The linearized equations describing the propagation of sound in variable area ducts containing flow are shown to be singular when the duct mean flow is sonic. The singularity is removed when previously ignored nonlinear terms are retained. The results of a numerical study, for the case of plane waves propagating in a one-dimensional converging-diverging duct, show that the sound field is adequately described by the linearized equations only when the axial mean flow Mach number at the duct throat M sub th 0.6. For M sub th 0.6, the numerical results showed that acoustic energy flux was not conserved. An attempt was made to extend the study to include the nonlinear behavior of the sound field. Meaningful results were not obtained due, primarily, to numerical difficulties.

Hersh, A. S.↗

Numerical procedures for the calculation of the stresses in monocoques III : calculation of the bending moments in fuselage frames

This report deals with the calculation of the bending moments in and the distortions of fuselage rings upon which known concentrated and distributed loads are acting. In the procedure suggested, the ring is divided into a number of beams each having a constant radius of curvature. The forces and moments caused in the end sections of the beams by individual unit displacements of the end sections are listed in a table designated as the operations table in conformity with Southwell's nomenclature. The operations table and the external loads are equivalent to a set of linear equations. For their solution the following three procedures are presented: 1) Southwell's method of systematic relaxations. This is a step-by-step approximation procedure guided by the physical interpretation of the changes in the values of the unknown. 2) The growing unit procedure in which the individual beams are combined successively into beams of increasing length until finally the entire ring becomes a single beam. In each step of the procedure a set of not more than three simultaneous linear equations is solved. 3) Solution of the entire set of simultaneous equations by the methods of the matrix calculus. In order to demonstrate the manner in which the calculations may be carried out, the following numerical examples are worked out: 1) Curved beam with both its end sections rigidly fixed. The load is a concentrated force. 2) Egg-shape ring with symmetric concentrated loads. 3) Circular ring with antisymmetric concentrated loads and shear flow (torsion of the fuselage). 4) Same with V-braces incorporated in the ring. 5) Egg-shape ring with antisymmetric concentrated loads and shear flow (torsion of the fuselage). 6) Same with V-braces incorporated in the ring. The results of these calculations are checked, whenever possible, by calculations carried out according to known methods of analysis. The agreement is found to be good. The amount of work necessary for the solution of ring problems by the methods described in the present report is practically independent of the degree of redundancy of the structure. For this reason the methods are recommended for use particularly in problems of rings having one or more internal bracing elements.

LOADS - FUSELAGES↗

USM3D Unstructured Grid Solutions for CAWAPI at NASA LaRC

In support the Cranked Arrow Wing Aerodynamic Project International (CAWAPI) to improve the Technology Readiness Level of flow solvers by comparing results with measured F-16XL-1 flight data, NASA Langley employed the TetrUSS unstructured grid solver, USM3D, to obtain solutions for all seven flight conditions of interest. A newly available solver version that incorporates a number of turbulence models, including the two-equation linear and non-linear k-epsilon, was used in this study. As a first test, a choice was made to utilize only a single grid resolution with the solver for the simulation of the different flight conditions. Comparisons are presented with three turbulence models in USM3D, flight data for surface pressure, boundary-layer profiles, and skin-friction results, as well as limited predictions from other solvers. A result of these comparisons is that the USM3D solver can be used in an engineering environment to predict flow physics on a complex configuration at flight Reynolds numbers with a two-equation linear k-epsilon turbulence model.

Lamar, John E.↗

Numerical Solutions for the CAWAPI Configuration on Unstructured Grids at NASA LaRC, United States

In support of the Cranked Arrow Wing Aerodynamic Project International (CAWAPI) with its goal of improving the Technology Readiness Level of flow solvers by comparing results with measured F-16XL-1 flight data, NASA Langley employed the TetrUSS unstructured grid solver, USM3D, to obtain solutions for all seven flight conditions of interest. A newly available solver version that incorporates a number of turbulence models, including the two-equation linear and non-linear k- , was used in this study. As a first test, a choice was made to utilize only a single grid resolution with the solver for the simulation of the different flight conditions. Comparisons are presented with three turbulence models in USM3D, flight data for surface pressure, boundary-layer profiles, and skin-friction distribution, as well as limited predictions from other solvers. A result of these comparisons is that the USM3D solver can be used in an engineering environment to predict vortex-flow physics on a complex configuration at flight Reynolds numbers with a two-equation linear k- turbulence model.

Lamar, John E.↗

Efficient computer algebra algorithms for polynomial matrices in control design

The theory of polynomial matrices plays a key role in the design and analysis of multi-input multi-output control and communications systems using frequency domain methods. Examples include coprime factorizations of transfer functions, cannonical realizations from matrix fraction descriptions, and the transfer function design of feedback compensators. Typically, such problems abstract in a natural way to the need to solve systems of Diophantine equations or systems of linear equations over polynomials. These and other problems involving polynomial matrices can in turn be reduced to polynomial matrix triangularization procedures, a result which is not surprising given the importance of matrix triangularization techniques in numerical linear algebra. Matrices with entries from a field and Gaussian elimination play a fundamental role in understanding the triangularization process. In the case of polynomial matrices, matrices with entries from a ring for which Gaussian elimination is not defined and triangularization is accomplished by what is quite properly called Euclidean elimination. Unfortunately, the numerical stability and sensitivity issues which accompany floating point approaches to Euclidean elimination are not very well understood. New algorithms are presented which circumvent entirely such numerical issues through the use of exact, symbolic methods in computer algebra. The use of such error-free algorithms guarantees that the results are accurate to within the precision of the model data--the best that can be hoped for. Care must be taken in the design of such algorithms due to the phenomenon of intermediate expressions swell.

Baras, J. S.↗