Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algebraic methods”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS1973

Transonic flow past lifting wings.

Work conducted by Norstrud (1971) has been extended to lifting flows with the inclusion of embedded continuous supercritical regions. The approach taken follows some fundamental steps proposed for two-dimensional flows by Oswatitsch (1950). The governing integral equation is replaced by a system of nonlinear algebraic equations. The method of parametric differentiation is applied to the solution of this system of equations. The analytical analysis is discussed together with a numerical analysis in the case of a wing configuration with arbitrary thickness distribution.

Norstrud, H.↗
NASA NTRS1979

Two-dimensional representations of axisymmetric fields for computer calculations

An accurate representation of axisymmetric fields has been devised by extending the method of ideal current loops to off-axis fields. It is assumed that the data to be simulated are available through measurements or through a solution of a boundary value problem. The method provides an algebraic expression for the fields throughout a two-dimensional region of interest and eliminates the need for the axial expansion formula in approximating off-axis fields. The use of Gaussian and other functions as alternatives to the coil function is proposed. Examples of the technique in simulating a periodic permanent magnet (PPM) focusing field are presented and compared with a Fourier analysis of the problem.

Stankiewicz, N.↗
NASA NTRS1982

Algebraic grid generation

The numerical solution of partial differential equations about irregular geometries and with varying characteristic scales has created the need for coordinate systems and associated transformations which reflect both geometric and physical requirements. The process of finding coordinate transformations in discrete representations is called 'grid generation'. The present investigation is concerned with three algebraic grid generation methods. The methods include transfinite interpolation, the multisurface method, and the two-boundary technique. Interpolation formulas, in terms of homotopic mappings and constraints in terms of point positions and/or derivatives are the essential elements of the techniques. The methods are relatively simple to understand, they are explicit and do not require extensive computational effort, and they have a high degree of generality.

Smith, R. E.↗
NASA NTRS1984

Analytical estimates of turbulent MHD transport coefficients

Turbulent transfer rates from small-scale MHD excitations to large-scale Fourier modes are calculated algebraically, using the method of Biskamp and Welter. Three cases are considered: two-dimensional Navier-Stokes flows, two-dimensional incompressible MHD, and the weakly three-dimensional Strauss equations. In all cases, an initially large spectral gap between the small-scale and large-scale excitations is assumed, and attention focusses on the initial values of the back-transfer rates. The sign of the transfer is determined by the sign of an analytically calculable eddy viscosity and/or anomalous resistivity. We are able to confirm the results of Biskamp and Welter for the case of two-dimensional MHD, but find some differences for the case of the Strauss equations. It is argued that the Strauss equations may not exhibit an inverse cascade phenomenon for the spatially periodic case unless their initial spectra are such that the behavior is essentially that of two-dimensional MHD.

Montgomery, D.↗
NASA NTRS1987

Three-dimensional computations of transverse hydrogen jet combustion in a supersonic airstream

A computational fluid dynamics (CFD) code is being developed to compute the mixing and combustion of hydrogen fuel in the turbulent flow fields of supersonic combustion ramjets (scramjet). The code solves the three-dimensional Reynolds time-averaged complete Navier-Stokes equations including transport equations for a four species, two reaction, global finite rate chemistry model. The code was applied to the case of transverse injection of hydrogen from a sonic circular orifice into a supersonic airstream. The equations were numerically integrated using MacCormack's explicit method, and the algebraic eddy viscosity model of Baldwin-Lomax was used to model the turbulence. In the species transport and energy equations, diffusion coefficients based on Fick's Law and an assumption of unit Lewis number were applied. Computed features of the three-dimensional flow field are depicted by static pressure, static temperature, mass fraction of species, and velocity vectors. For engineering interest, mixing and combustion parameters were examined to assess the effect of injector diameter, injected fuel pressure, fuel-air ratio, and spacing of fuel injectors. The objective of the present paper is to demonstrate the capability of the present three-dimensional spatially elliptic, CFD code for turbulent, reacting flow. Application of the code to specific supersonic combustion configurations is planned.

Uenishi, K.↗
NASA NTRS1987

Fuel-air mixing and combustion in a two-dimensional Wankel engine

A two-equation turbulence model, an algebraic grid generalization method, and an approximate factorization time-linearized numerical technique are used to study the effects of mixture stratification at the intake port and gaseous fuel injection on the flow field and fuel-air mixing in a two-dimensional rotary engine model. The fuel distribution in the combustion chamber is found to be a function of the air-fuel mixture fluctuations at the intake port. It is shown that the fuel is advected by the flow field induced by the rotor and is concentrated near the leading apex during the intake stroke, while during compression, the fuel concentration is highest near the trailing apex and is lowest near the rotor. It is also found that the fuel concentration near the trailing apex and rotor is small except at high injection velocities.

Shih, T. I.-P.↗
NASA NTRS1988

A rapid method for the computation of equilibrium chemical composition of air to 15000 K

A rapid computational method has been developed to determine the chemical composition of equilibrium air to 15000 K. Eleven chemically reacting species, i.e., O2, N2, O, NO, N, NO+, e-, N+, O+, Ar, and Ar+ are included. The method involves combining algebraically seven nonlinear equilibrium equations and four linear elemental mass balance and charge neutrality equations. Computational speeds for determining the equilibrium chemical composition are significantly faster than the often used free energy minimization procedure. Data are also included from which the thermodynamic properties of air can be computed. A listing of the computer program together with a set of sample results are included.

Prabhu, Ramadas K.↗
NASA NTRS1991

A general multiblock Euler code for propulsion integration. Volume 1: Theory document

A general multiblock Euler solver was developed for the analysis of flow fields over geometrically complex configurations either in free air or in a wind tunnel. In this approach, the external space around a complex configuration was divided into a number of topologically simple blocks, so that surface-fitted grids and an efficient flow solution algorithm could be easily applied in each block. The computational grid in each block is generated using a combination of algebraic and elliptic methods. A grid generation/flow solver interface program was developed to facilitate the establishment of block-to-block relations and the boundary conditions for each block. The flow solver utilizes a finite volume formulation and an explicit time stepping scheme to solve the Euler equations. A multiblock version of the multigrid method was developed to accelerate the convergence of the calculations. The generality of the method was demonstrated through the analysis of two complex configurations at various flow conditions. Results were compared to available test data. Two accompanying volumes, user manuals for the preparation of multi-block grids (vol. 2) and for the Euler flow solver (vol. 3), provide information on input data format and program execution.

Chen, H. C.↗
NASA NTRS1991

Algebraic grid generation for complex geometries

An efficient computer program called GRID2D/3D has been developed to generate single and composite grid systems within geometrically complex two- and three-dimensional (2D and 3D) spatial domains that can deform with time. GRID2D/3D generates single grid systems by using algebraic grid generation methods based on transfinite interpolation. The distribution of grid points within the spatial domain is controlled by stretching functions and grid lines can intersect boundaries of the spatial domain orthogonally. GRID2D/3D generates composite grid systems by patching together two or more single grid systems. The patching can be discontinuous or continuous. For 2D spatial domains the boundary curves are constructed by using either cubic or tension spline interpolation. For 3D spatial domains the boundary surfaces are constructed by using a new technique, developed in this study, referred to as 3D bidirectional Hermite interpolation.

Shih, T. I.-P.↗
NASA NTRS1992

Enhancing control of grid distribution in algebraic grid generation

Three techniques are presented to enhance the control of grid-point distribution for a class of algebraic grid generation methods known as the two-, four- and six-boundary methods. First, multidimensional stretching functions are presented, and a technique is devised to construct them based on the desired distribution of grid points along certain boundaries. Second, a normalization procedure is proposed which allows more effective control over orthogonality of grid lines at boundaries and curvature of grid lines near boundaries. And third, interpolating functions based on tension splines are introduced to control curvature of grid lines in the interior of the spatial domain. In addition to these three techniques, consistency conditions are derived which must be satisfied by all user-specified data employed in the grid generation process to control grid-point distribution. The usefulness of the techniques developed in this study was demonstrated by using them in conjunction with the two- and four-boundary methods to generate several grid systems, including a three-dimensional grid system in the coolant passage of a radial turbine blade with serpentine channels and pin fins.

Steinthorsson, E.↗
NASA NTRS1999

Low Density Parity Check Codes Based on Finite Geometries: A Rediscovery and More

Low density parity check (LDPC) codes with iterative decoding based on belief propagation achieve astonishing error performance close to Shannon limit. No algebraic or geometric method for constructing these codes has been reported and they are largely generated by computer search. As a result, encoding of long LDPC codes is in general very complex. This paper presents two classes of high rate LDPC codes whose constructions are based on finite Euclidean and projective geometries, respectively. These classes of codes a.re cyclic and have good constraint parameters and minimum distances. Cyclic structure adows the use of linear feedback shift registers for encoding. These finite geometry LDPC codes achieve very good error performance with either soft-decision iterative decoding based on belief propagation or Gallager's hard-decision bit flipping algorithm. These codes can be punctured or extended to obtain other good LDPC codes. A generalization of these codes is also presented.

Kou, Yu↗
NASA NTRS2015

Discrete Fourier Transform in a Complex Vector Space

An image-based phase retrieval technique has been developed that can be used on board a space based iterative transformation system. Image-based wavefront sensing is computationally demanding due to the floating-point nature of the process. The discrete Fourier transform (DFT) calculation is presented in "diagonal" form. By diagonal we mean that a transformation of basis is introduced by an application of the similarity transform of linear algebra. The current method exploits the diagonal structure of the DFT in a special way, particularly when parts of the calculation do not have to be repeated at each iteration to converge to an acceptable solution in order to focus an image.

Dean, Bruce H.↗
NASA NTRS1977

Integration-free interval doubling for Riccati equation solutions

Starting with certain identities obtained by Reid (1972) and Redheffer (1962) for general matrix Riccati equations (RE's), we give various algorithms for the case of constant coefficients. The algorithms are based on two ideas - first, relate the RE solution with general initial conditions to anchored RE solutions; and second, when the coefficients are constant, the anchored solutions have a basic shift-invariance property. These ideas are used to construct an integration-free, superlinearly convergent iterative solution to the algebraic RE. Preliminary numerical experiments show that our algorithms, arranged in square-root form, provide a method that is numerically stable and appears to be competitive with other methods of solving the algebraic RE.

Sidhu, G. S.↗
NASA NTRS1994

Spatial-Operator Algebra For Flexible-Link Manipulators

Method of computing dynamics of multiple-flexible-link robotic manipulators based on spatial-operator algebra, which originally applied to rigid-link manipulators. Aspects of spatial-operator-algebra approach described in several previous articles in NASA Tech Briefs-most recently "Robot Control Based on Spatial-Operator Algebra" (NPO-17918). In extension of spatial-operator algebra to manipulators with flexible links, each link represented by finite-element model: mass of flexible link apportioned among smaller, lumped-mass rigid bodies, coupling of motions expressed in terms of vibrational modes. This leads to operator expression for modal-mass matrix of link.

Jain, Abhinandan↗
NASA NTRS1976

Integration-free interval doubling for Riccati equation solutions

Various algorithms are given for the case of constant coefficients. The algorithms are based on two ideas: first, relate the Re solution with general initial conditions to anchored RE solutions; and second, when the coefficients are constant the anchored solutions have a basic shift-invariance property. These ideas are used to construct an integration free superlinearly convergent iterative solution to the algebraic RE. The algorithm, arranged in square-root form, is thought to be numerically stable and competitive with other methods of solving the algebraic RE.

Bierman, G. J.↗
NASA NTRS1992

The algebraic decoding of the (41, 21, 9) quadratic residue code

A new algebraic approach for decoding the quadratic residue (QR) codes, in particular the (41, 21, 9) QR code is presented. The key ideas behind this decoding technique are a systematic application of the Sylvester resultant method to the Newton identities associated with the code syndromes to find the error-locator polynomial, and next a method for determining error locations by solving certain quadratic, cubic and quartic equations over GF(2 exp m) in a new way which uses Zech's logarithms for the arithmetic. The algorithms developed here are suitable for implementation in a programmable microprocessor or special-purpose VLSI chip. It is expected that the algebraic methods developed here can apply generally to other codes such as the BCH and Reed-Solomon codes.

Reed, Irving S.↗
NASA NTRS1996

Algebraic Multigrid by Smoothed Aggregation for Second and Fourth Order Elliptic Problems

Multigrid methods are very efficient iterative solvers for system of algebraic equations arising from finite element and finite difference discretization of elliptic boundary value problems. The main principle of multigrid methods is to complement the local exchange of information in point-wise iterative methods by a global one utilizing several related systems, called coarse levels, with a smaller number of variables. The coarse levels are often obtained as a hierarchy of discretizations with different characteristic meshsizes, but this requires that the discretization is controlled by the iterative method. To solve linear systems produced by existing finite element software, one needs to create an artificial hierarchy of coarse problems. The principal issue is then to obtain computational complexity and approximation properties similar to those for nested meshes, using only information in the matrix of the system and as little extra information as possible. Such algebraic multigrid method that uses the system matrix only was developed by Ruge. The prolongations were based on the matrix of the system by partial solution from given values at selected coarse points. The coarse grid points were selected so that each point would be interpolated to via so-called strong connections. Our approach is based on smoothed aggregation introduced recently by Vanek. First the set of nodes is decomposed into small mutually disjoint subsets. A tentative piecewise constant interpolation (in the discrete sense) is then defined on those subsets as piecewise constant for second order problems, and piecewise linear for fourth order problems. The prolongation operator is then obtained by smoothing the output of the tentative prolongation and coarse level operators are defined variationally.

Vanek, Petr↗