Search NASA⌕ Search

SEARCH · Search NASA

Results for “General Algebraic Systems”

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 145 records · Page 8

Development of iterative techniques for the solution of unsteady compressible viscous flows

Efficient iterative solution methods are being developed for the numerical solution of two- and three-dimensional compressible Navier-Stokes equations. Iterative time marching methods have several advantages over classical multi-step explicit time marching schemes, and non-iterative implicit time marching schemes. Iterative schemes have better stability characteristics than non-iterative explicit and implicit schemes. Thus, the extra work required by iterative schemes can also be designed to perform efficiently on current and future generation scalable, missively parallel machines. An obvious candidate for iteratively solving the system of coupled nonlinear algebraic equations arising in CFD applications is the Newton method. Newton's method was implemented in existing finite difference and finite volume methods. Depending on the complexity of the problem, the number of Newton iterations needed per step to solve the discretized system of equations can, however, vary dramatically from a few to several hundred. Another popular approach based on the classical conjugate gradient method, known as the GMRES (Generalized Minimum Residual) algorithm is investigated. The GMRES algorithm was used in the past by a number of researchers for solving steady viscous and inviscid flow problems with considerable success. Here, the suitability of this algorithm is investigated for solving the system of nonlinear equations that arise in unsteady Navier-Stokes solvers at each time step. Unlike the Newton method which attempts to drive the error in the solution at each and every node down to zero, the GMRES algorithm only seeks to minimize the L2 norm of the error. In the GMRES algorithm the changes in the flow properties from one time step to the next are assumed to be the sum of a set of orthogonal vectors. By choosing the number of vectors to a reasonably small value N (between 5 and 20) the work required for advancing the solution from one time step to the next may be kept to (N+1) times that of a noniterative scheme. Many of the operations required by the GMRES algorithm such as matrix-vector multiplies, matrix additions and subtractions can all be vectorized and parallelized efficiently.

Sankar, Lakshmi N.↗

Effect of geometry and operating conditions on spur gear system power loss

The results of an analysis of the effects of spur gear size, pitch, width and ratio on total mesh power loss for a wide range of speeds, torques and oil viscosities are presented. The analysis uses simple algebraic expressions to determine gear sliding, rolling and windage losses and also incorporates an approximate ball bearing power loss expression. The analysis shows good agreement with published data. Large diameter and fine-pitched gears had higher peak efficiencies but lower part-load efficiency. Gear efficiencies were generally greater than 98 percent except at very low torque levels. Tare (no-load) losses are generally a significant percentage of the full-load loss except at low speeds.

Anderson, N. E.↗

Formal development of a clock synchronization circuit

This talk presents the latest stage in formal development of a fault-tolerant clock synchronization circuit. The development spans from a high level specification of the required properties to a circuit realizing the core function of the system. An abstract description of an algorithm has been verified to satisfy the high-level properties using the mechanical verification system EHDM. This abstract description is recast as a behavioral specification input to the Digital Design Derivation system (DDD) developed at Indiana University. DDD provides a formal design algebra for developing correct digital hardware. Using DDD as the principle design environment, a core circuit implementing the clock synchronization algorithm was developed. The design process consisted of standard DDD transformations augmented with an ad hoc refinement justified using the Prototype Verification System (PVS) from SRI International. Subsequent to the above development, Wilfredo Torres-Pomales discovered an area-efficient realization of the same function. Establishing correctness of this optimization requires reasoning in arithmetic, so a general verification is outside the domain of both DDD transformations and model-checking techniques. DDD represents digital hardware by systems of mutually recursive stream equations. A collection of PVS theories was developed to aid in reasoning about DDD-style streams. These theories include a combinator for defining streams that satisfy stream equations, and a means for proving stream equivalence by exhibiting a stream bisimulation. DDD was used to isolate the sub-system involved in Torres-Pomales' optimization. The equivalence between the original design and the optimized verified was verified in PVS by exhibiting a suitable bisimulation. The verification depended upon type constraints on the input streams and made extensive use of the PVS type system. The dependent types in PVS provided a useful mechanism for defining an appropriate bisimulation.

Miner, Paul S.↗

Reanalysis and design in structural dynamics

A unified efficient formulation for the static and dynamic reanalysis of locally modified structures is presented. The reanalysis problem is to find the structural responses when some of the element properties are adjusted as a result of design modifications or when additional structures are appended to the original system. The reanalysis problem is formulated as a problem of much lower order than the original system. This is achieved by utilizing the linearity property of the structure using the pseudoload concept together with the solution of the original system. The modifications to the structure are treated as displacement-dependent pseudoloads of the system. By expressing the modified system response as linear combinations of the response of the original system and a term depending on the pseudoload, a reduced set of response equations can be obtained. In the static and sinusoidal steady state analysis, this leads to a set of linear algebraic equations. For a free vibration analysis, this results in a reduced eigenvalue problem. Using these reduced equations, a design problem can be solved; that is, the magnitude of a specified local modification for given dynamic response characteristics can be calculated. Several examples are presented to illustrate the general formulations.

Wang, B. P.↗

Deformation of supersymmetric and conformal quantum mechanics through affine transformations

Affine transformations (dilatations and translations) are used to define a deformation of one-dimensional N = 2 supersymmetric quantum mechanics. Resulting physical systems do not have conserved charges and degeneracies in the spectra. Instead, superpartner Hamiltonians are q-isospectral, i.e. the spectrum of one can be obtained from another (with possible exception of the lowest level) by q(sup 2)-factor scaling. This construction allows easily to rederive a special self-similar potential found by Shabat and to show that for the latter a q-deformed harmonic oscillator algebra of Biedenharn and Macfarlane serves as the spectrum generating algebra. A general class of potentials related to the quantum conformal algebra su(sub q)(1,1) is described. Further possibilities for q-deformation of known solvable potentials are outlined.

Spiridonov, Vyacheslav↗

A fully vectorized numerical solution of the incompressible Navier-Stokes equations

A vectorizable algorithm is presented for the implicit finite difference solution of the incompressible Navier-Stokes equations in general curvilinear coordinates. The unsteady Reynolds averaged Navier-Stokes equations solved are in two dimension and non-conservative primitive variable form. A two-layer algebraic eddy viscosity turbulence model is used to incorporate the effects of turbulence. Two momentum equations and a Poisson pressure equation, which is obtained by taking the divergence of the momentum equations and satisfying the continuity equation, are solved simultaneously at each time step. An elliptic grid generation approach is used to generate a boundary conforming coordinate system about an airfoil. The governing equations are expressed in terms of the curvilinear coordinates and are solved on a uniform rectangular computational domain. A checkerboard SOR, which can effectively utilize the computer architectural concept of vector processing, is used for iterative solution of the governing equations.

Patel, N.↗

Mars 2020 Reconstructed Aerothermal Environments and Design Margins

The Mars 2020 aeroshell's thermal protection system was nearly identical to the Mars Science Laboratory system that successfully completed its mission for the Curiosity rover's landing in 2012. It was predicted that, like Mars Science Laboratory, the Mars 2020 heatshield would experience boundary layer transition and that the thermal protection system would provide sufficient material thickness margins against the aerothermal environments, even after adding radiative heating that was not included for Mars Science Laboratory. The Mars 2020 flight instrumentation suite included heatshield sensors similar to Mars Science Laboratory and new backshell measurements. A full set of surface pressure and in-depth temperature data were collected during atmospheric entry. This paper provides an initial analysis of the flight data and focuses on the reconstructed total surface heat flux inferred from the measured temperatures. Turbulent boundary layer conditions again were observed on the Mars 2020 heatshield, and the temperatures at all eleven heatshield and six backshell thermocouple in-depth sensor locations were well within system capabilities due to favorable entry conditions and conservative uncertainties. New computational fluid dynamics results on the reconstructed entry trajectory are compared to the measured surface pressures and reconstructed total heat fluxes. The predicted heatshield surface pressures at six locations match the data qualitatively and quantitatively well, as expected. Smooth-wall laminar heating predictions prior to boundary layer transition fall above the reconstructed heating on the heatshield. After the observed boundary layer transition time, total heat flux based on algebraic turbulence model calculations generally match the heat flux trends relative to one another. The convective heat flux was predicted to constitute the majority of the total heating. On the backshell, smooth-wall laminar total heat flux predictions generally exceed the reconstructed total heating at six locations. At each of these locations, it is estimated that radiative heating provided almost all of the total heating. The Mars 2020 as-flown aerothermal environments were well below the design levels for all measurement locations due to conservative design assumptions and a stressing design trajectory.

Mars 2020↗

Mars 2020 Reconstructed Aerothermal Environments and Design Margins

The Mars 2020 aeroshell's thermal protection system was nearly identical to the Mars Science Laboratory system that successfully completed its mission for the Curiosity rover's landing in 2012. It was predicted that, like Mars Science Laboratory, the Mars 2020 heatshield would experience boundary layer transition and that the thermal protection system would provide sufficient material thickness margins against the aerothermal environments, even after adding radiative heating that was not included for Mars Science Laboratory. The Mars 2020 flight instrumentation suite included heatshield sensors similar to Mars Science Laboratory and new backshell measurements. A full set of surface pressure and in-depth temperature data were collected during atmospheric entry. This paper provides an initial analysis of the flight data and focuses on the reconstructed total surface heat flux inferred from the measured temperatures. Turbulent boundary layer conditions again were observed on the Mars 2020 heatshield, and the temperatures at all eleven heatshield and six backshell thermocouple in-depth sensor locations were well within system capabilities due to favorable entry conditions and conservative uncertainties. New computational fluid dynamics results on the reconstructed entry trajectory are compared to the measured surface pressures and reconstructed total heat fluxes. The predicted heatshield surface pressures at six locations match the data qualitatively and quantitatively well, as expected. Smooth-wall laminar heating predictions prior to boundary layer transition fall above the reconstructed heating on the heatshield. After the observed boundary layer transition time, total heat flux based on algebraic turbulence model calculations generally match the heat flux trends relative to one another. The convective heat flux was predicted to constitute the majority of the total heating. On the backshell, smooth-wall laminar total heat flux predictions generally exceed the reconstructed total heating at six locations. At each of these locations, it is estimated that radiative heating provided almost all of the total heating. The Mars 2020 as-flown aerothermal environments were well below the design levels for all measurement locations due to conservative design assumptions and a stressing design trajectory.

Mars 2020↗

Application of symbolic computations to the constitutive modeling of structural materials

In applications involving elevated temperatures, the derivation of mathematical expressions (constitutive equations) describing the material behavior can be quite time consuming, involved and error-prone. Therefore intelligent application of symbolic systems to faciliate this tedious process can be of significant benefit. Presented here is a problem oriented, self contained symbolic expert system, named SDICE, which is capable of efficiently deriving potential based constitutive models in analytical form. This package, running under DOE MACSYMA, has the following features: (1) potential differentiation (chain rule), (2) tensor computations (utilizing index notation) including both algebraic and calculus; (3) efficient solution of sparse systems of equations; (4) automatic expression substitution and simplification; (5) back substitution of invariant and tensorial relations; (6) the ability to form the Jacobian and Hessian matrix; and (7) a relational data base. Limited aspects of invariant theory were also incorporated into SDICE due to the utilization of potentials as a starting point and the desire for these potentials to be frame invariant (objective). The uniqueness of SDICE resides in its ability to manipulate expressions in a general yet pre-defined order and simplify expressions so as to limit expression growth. Results are displayed, when applicable, utilizing index notation. SDICE was designed to aid and complement the human constitutive model developer. A number of examples are utilized to illustrate the various features contained within SDICE. It is expected that this symbolic package can and will provide a significant incentive to the development of new constitutive theories.

Arnold, Steven M.↗

Quantum mechanical algebraic variational methods for inelastic and reactive molecular collisions

The quantum mechanical problem of reactive or nonreactive scattering of atoms and molecules is formulated in terms of square-integrable basis sets with variational expressions for the reactance matrix. Several formulations involving expansions of the wave function (the Schwinger variational principle) or amplitude density (a generalization of the Newton variational principle), single-channel or multichannel distortion potentials, and primitive or contracted basis functions are presented and tested. The test results, for inelastic and reactive atom-diatom collisions, suggest that the methods may be useful for a variety of collision calculations and may allow the accurate quantal treatment of systems for which other available methods would be prohibitively expensive.

Schwenke, David W.↗

A unified mathematical theory of electrophoretic processes

A mathematical theory is presented which shows that each of the four classical electrophoretic modes (zone electrophoresis, moving boundary electrophoresis, isotachophoresis, and isoelectric focusing) is based on the same general principles and can collectively be described in terms of a single set of equations. This model can predict the evolution of the four electrophoretic modes as a function of time. The model system is one-dimensional, neglecting the effects of electroosmosis, temperature gradients, and any bulk flows of liquid. The model is based on equations which express the components' dissociation equilibria, the mass transport due to electromigration and diffusion, electroneutrality, and the conservation of mass and charge. The model consists of a system of coupled partial differential and nonlinear algebraic equations which can be solved numerically by use of a computer. The versatility of this model was verified using an example of a three-component system containing cacodylate, tris hydroxylmethylaminomethane, and histidine. Results show that this model not only correctly predicts the characteristic features of each electrophoretic mode, but also gives details of the concentration, pH, and conductivity profiles not easily amenable to direct experimental measurement.

Bier, M.↗

Applications of algebraic image operators to model-based vision

A highly structured and compact algebraic representation of grey-level images is expanded. Addition and multiplication are defined for the set of all grey-level images, which can then be described as polynomials of two variables. Utilizing this new algebraic structure, an innovative, efficient edge-detection scheme is devised. A robust method for linear feature extraction is developed by combining the techniques of a Hough transform and a line follower with this new edge detection scheme. The major advantage of this feature extractor is its general, object-independent nature. Target attributes, such as line segment lengths, intersections, angles of intersection, and endpoints are derived by the feature extraction algorithm and employed during model matching. The feature extractor and model matcher are being incorporated into a distributed robot-control system.

Lerner, Bao-Ting↗

State-Space System Realization with Input- and Output-Data Correlation

This paper introduces a general version of the information matrix consisting of the autocorrelation and cross-correlation matrices of the shifted input and output data. Based on the concept of data correlation, a new system realization algorithm is developed to create a model directly from input and output data. The algorithm starts by computing a special type of correlation matrix derived from the information matrix. The special correlation matrix provides information on the system-observability matrix and the state-vector correlation. A system model is then developed from the observability matrix in conjunction with other algebraic manipulations. This approach leads to several different algorithms for computing system matrices for use in representing the system model. The relationship of the new algorithms with other realization algorithms in the time and frequency domains is established with matrix factorization of the information matrix. Several examples are given to illustrate the validity and usefulness of these new algorithms.

Juang, Jer-Nan↗

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

New integration techniques for chemical kinetic rate equations. 2: Accuracy comparison

A comparison of the accuracy of several techniques recently developed for solving stiff differential equations is presented. The techniques examined include two general purpose codes EEPISODE and LSODE developed for an arbitrary system of ordinary differential equations, and three specialized codes CHEMEQ, CREKID, and GCKP84 developed specifically to solve chemical kinetic rate equations. The accuracy comparisons are made by applying these solution procedures to two practical combustion kinetics problems. Both problems describe adiabatic, homogeneous, gas phase chemical reactions at constant pressure, and include all three combustion regimes: induction, heat release, and equilibration. The comparisons show that LSODE is the most efficient code - in the sense that it requires the least computational work to attain a specified accuracy level. An important finding is that an iterative solution of the algebraic enthalpy conservation equation for the temperature can be more accurate and efficient than computing the temperature by integrating its time derivative.

Radhakrishnan, K.↗

New integration techniques for chemical kinetic rate equations. II - Accuracy comparison

A comparison of the accuracy of several techniques recently developed for solving stiff differential equations is presented. The techniques examined include two general purpose codes EEPISODE and LSODE developed for an arbitrary system of ordinary differential equations, and three specialized codes CHEMEQ, CREKID, and GCKP84 developed specifically to solve chemical kinetic rate equations. The accuracy comparisons are made by applying these solution procedures to two practical combustion kinetics problems. Both problems describe adiabatic, homogeneous, gas phase chemical reactions at constant pressure, and include all three combustion regimes: induction heat release, and equilibration. The comparisons show that LSODE is the most efficient code - in the sense that it requires the least computational work to attain a specified accuracy level. An important finding is that an iterative solution of the algebraic enthalpy conservation equation for the temperature can be more accurate and efficient than computing the temperature by integrating its time derivative.

Radhakrishnan, K.↗

First-Order System Least Squares for Velocity-Vorticity-Pressure Form of the Stokes Equations, with Application to Linear Elasticity

In this paper, we study the least-squares method for the generalized Stokes equations (including linear elasticity) based on the velocity-vorticity-pressure formulation in d = 2 or 3 dimensions. The least squares functional is defined in terms of the sum of the L(exp 2)- and H(exp -1)-norms of the residual equations, which is weighted appropriately by by the Reynolds number. Our approach for establishing ellipticity of the functional does not use ADN theory, but is founded more on basic principles. We also analyze the case where the H(exp -1)-norm in the functional is replaced by a discrete functional to make the computation feasible. We show that the resulting algebraic equations can be uniformly preconditioned by well-known techniques.

Cai, Zhiqiang↗

An Optimized Multicolor Point-Implicit Solver for Unstructured Grid Applications on Graphics Processing Units

In the field of computational fluid dynamics, the Navier-Stokes equations are often solved using an unstructuredgrid approach to accommodate geometric complexity. Implicit solution methodologies for such spatial discretizations generally require frequent solution of large tightly-coupled systems of block-sparse linear equations. The multicolor point-implicit solver used in the current work typically requires a significant fraction of the overall application run time. In this work, an efficient implementation of the solver for graphics processing units is proposed. Several factors present unique challenges to achieving an efficient implementation in this environment. These include the variable amount of parallelism available in different kernel calls, indirect memory access patterns, low arithmetic intensity, and the requirement to support variable block sizes. In this work, the solver is reformulated to use standard sparse and dense Basic Linear Algebra Subprograms (BLAS) functions. However, numerical experiments show that the performance of the BLAS functions available in existing CUDA libraries is suboptimal for matrices representative of those encountered in actual simulations. Instead, optimized versions of these functions are developed. Depending on block size, the new implementations show performance gains of up to 7x over the existing CUDA library functions.

Zubair, Mohammad↗