SEARCH · Search NASA

Results for “Computer algebra system”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 271 records · Page 15

All sources NASA NTRS DOE OSTI

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 NTRS1976

New convergence criteria for the vortex-lattice models of the leading-edge separation

The convergence criterion for the vortex-lattice technique which deals with delta wings exhibiting significant leading-edge separation was studied. It was shown that one can predict pressure distributions without irregularities which agree fairly well with experimental data (which show some irregularities of their own) by replacing the system of discrete vortex lines with a single concentrated core. This core has a circulation equal to the algebraic sum of the circulations around the discrete lines and is located at the centroid of these lines. Moreover, there is a requirement that the position and strength of the core must converge as the number of elements increases. Because the calculation of the position and strength of the core is much less involved than the calculation of the loads, this approach has the additional desirable feature of requiring less computational time.

Kandil, O. A.↗

NASA NTRS1990

Two Axis Pointing System (TAPS) attitude acquisition, determination, and control

The Two Axis Pointing System (TAPS) is a 2 axis gimbal system designed to provide fine pointing of Space Transportation System (STS) borne instruments. It features center-of-mass instrument mounting and will accommodate instruments of up to 1134 kg (2500 pounds) which fit within a 1.0 by 1.0 by 4.2 meter (40 by 40 by 166 inch) envelope. The TAPS system is controlled by a microcomputer based Control Electronics Assembly (CEA), a Power Distribution Unit (PDU), and a Servo Control Unit (SCU). A DRIRU-II inertial reference unit is used to provide incremental angles for attitude propagation. A Ball Brothers STRAP star tracker is used for attitude acquisition and update. The theory of the TAPS attitude determination and error computation for the Broad Band X-ray Telescope (BBXRT) are described. The attitude acquisition is based upon a 2 star geometric solution. The acquisition theory and quaternion algebra are presented. The attitude control combines classical position, integral and derivative (PID) control with techniques to compensate for coulomb friction (bias torque) and the cable harness crossing the gimbals (spring torque). Also presented is a technique for an adaptive bias torque compensation which adjusts to an ever changing frictional torque environment. The control stability margins are detailed, with the predicted pointing performance, based upon simulation studies. The TAPS user interface, which provides high level operations commands to facilitate science observations, is outlined.

Azzolini, John D.↗

NASA NTRS1982

An implicit solution of the three-dimensional Navier-Stokes equations for an airfoil spanning a wind tunnel

An implicit finite-difference algorithm is developed for the numerical solution of the incompressible three dimensional Navier-Stokes equations in the non-conservative primitive-variable formulation. The flow field about an airfoil spanning a wind-tunnel is computed. The coordinate system is generated by an extension of the two dimensional body-fitted coordinate generation techniques of Thompson, as well as that of Sorenson, into three dimensions. Two dimensional grids are stacked along a spanwise coordinate defined by a simple analytical function. A Poisson pressure equation for advancing the pressure in time is arrived at by performing a divergence operation on the momentum equations. The pressure at each time-step is calculated on the assumption that continuity be unconditionally satisfied. An eddy viscosity coefficient, computed according to the algebraic turbulence formulation of Baldwin and Lomax, simulates the effects of turbulence.

Moitra, A.↗

NASA NTRS1994

Parallel grid generation algorithm for distributed memory computers

A parallel grid-generation algorithm and its implementation on the Intel iPSC/860 computer are described. The grid-generation scheme is based on an algebraic formulation of homotopic relations. Methods for utilizing the inherent parallelism of the grid-generation scheme are described, and implementation of multiple levELs of parallelism on multiple instruction multiple data machines are indicated. The algorithm is capable of providing near orthogonality and spacing control at solid boundaries while requiring minimal interprocessor communications. Results obtained on the Intel hypercube for a blended wing-body configuration are used to demonstrate the effectiveness of the algorithm. Fortran implementations bAsed on the native programming model of the iPSC/860 computer and the Express system of software tools are reported. Computational gains in execution time speed-up ratios are given.

Moitra, Stuti↗

NASA NTRS1981

Bifurcation and post-buckling analysis of laminated composite plates via reduced basis technique

A reduced basis technique and a problem-adaptive computational algorithm are presented for the bifurcation and post-buckling analysis of laminated anisotropic plates. The computational algorithm can be conveniently divided into three distinct stages. The first stage is that of determining the bifurcation point. The plate is discretized by using displacement finite element (or finite difference) models. The special symmetries exhibited by the response of the anisotropic plate are used to reduce the size of the analysis region. The vector of unknown nodal parameters is expressed as a linear combination of a small number of basis vectors, and a Rayleigh-Ritz technique is used to approximate the finite element equations by a small system of algebraic equations. The reduced equations are used to determine the bifurcation point and the associated eigenmode of the panel. In the second stage of the bifurcation buckling mode is used to obtain a nonlinear solution in the vicinity of the bifurcation point and new (updated) sets of basis vectors and reduced equations are generated. In the third stage the reduced equations are used to trace the post-buckling paths. The effectiveness of the proposed technique for predicting the bifurcation and post-buckling behavior of plates is demonstrated by means of numerical examples for plates loaded by means of prescribed edge displacements.

Noor, A. K.↗

NASA NTRS1998

A Parallel Non-Overlapping Domain-Decomposition Algorithm for Compressible Fluid Flow Problems on Triangulated Domains

This paper considers an algebraic preconditioning algorithm for hyperbolic-elliptic fluid flow problems. The algorithm is based on a parallel non-overlapping Schur complement domain-decomposition technique for triangulated domains. In the Schur complement technique, the triangulation is first partitioned into a number of non-overlapping subdomains and interfaces. This suggests a reordering of triangulation vertices which separates subdomain and interface solution unknowns. The reordering induces a natural 2 x 2 block partitioning of the discretization matrix. Exact LU factorization of this block system yields a Schur complement matrix which couples subdomains and the interface together. The remaining sections of this paper present a family of approximate techniques for both constructing and applying the Schur complement as a domain-decomposition preconditioner. The approximate Schur complement serves as an algebraic coarse space operator, thus avoiding the known difficulties associated with the direct formation of a coarse space discretization. In developing Schur complement approximations, particular attention has been given to improving sequential and parallel efficiency of implementations without significantly degrading the quality of the preconditioner. A computer code based on these developments has been tested on the IBM SP2 using MPI message passing protocol. A number of 2-D calculations are presented for both scalar advection-diffusion equations as well as the Euler equations governing compressible fluid flow to demonstrate performance of the preconditioning algorithm.

Barth, Timothy J.↗

NASA NTRS1986

Computational and experimental study of turbulent flows in 180 degree bends

A theoretical and experimental investigation of turbulent flows inside a 180-deg strongly curved channel is included in the present study. A 10 by 100 centimeter water channel with a 10 centimeter radius turn was employed for the experimental study. Data measured are velocity profiles and distributions of longitudinal turbulence intensity. Numerical investigations are performed by solving the incompressible Navier-Stokes equations and turbulence models using a finite difference flow solver in generalized curvilinear coordinate systems. A widely used two-equation turbulence model and its modified version, which includes the effect of strong curvature on the turbulence length scale through a relation of algebraic Reynolds stress model, are employed to predict the turbulence quantities inside the flow field. Improvements on the predictions are obtained using the present approach.

Chen, Y. S.↗

NASA NTRS1993

Research activities at the Center for Modeling of Turbulence and Transition

The main research activities at the Center for Modeling of Turbulence and Transition (CMOTT) are described. The research objective of CMOTT is to improve and/or develop turbulence and transition models for propulsion systems. The flows of interest in propulsion systems can be both compressible and incompressible, three dimensional, bounded by complex wall geometries, chemically reacting, and involve 'bypass' transition. The most relevant turbulence and transition models for the above flows are one- and two-equation eddy viscosity models, Reynolds stress algebraic- and transport-equation models, pdf models, and multiple-scale models. All these models are classified as one-point closure schemes since only one-point (in time and space) turbulent correlations, such as second moments (Reynolds stresses and turbulent heat fluxes) and third moments, are involved. In computational fluid dynamics, all turbulent quantities are one-point correlations. Therefore, the study of one-point turbulent closure schemes is the focus of our turbulence research. However, other research, such as the renormalization group theory, the direct interaction approximation method, and numerical simulations are also pursued to support the development of turbulence modeling.

Shih, Tsan-Hsing↗

NASA NTRS1975

Numerical methods for evaluating the derivatives of eigenvalues and eigenvectors

Two numerical methods are presented for computing the derivatives of eigenvalues and eigenvectors which do not require complete solution of the eigenvalue problem if only a few derivatives are sought. The 'iterative' method may be used to find the first derivative of one or all of the eigenvectors together with the second derivative of their eigenvalues in a self-adjoint system. If the left- and right-hand eigenvectors are known, the first derivative of the eigenvector corresponding to the largest eigenvalue and the second derivative of the largest eigenvalue may be obtained for a nonself-adjoint system. The 'algebraic' method may be used to find all orders of the derivatives, provided they exist, without requiring the left-hand eigenvectors.

Rudisill, C. S.↗

NASA NTRS2014

Bifurcation Analysis Using Rigorous Branch and Bound Methods

For the study of nonlinear dynamic systems, it is important to locate the equilibria and bifurcations occurring within a specified computational domain. This paper proposes a new approach for solving these problems and compares it to the numerical continuation method. The new approach is based upon branch and bound and utilizes rigorous enclosure techniques to yield outer bounding sets of both the equilibrium and local bifurcation manifolds. These sets, which comprise the union of hyper-rectangles, can be made to be as tight as desired. Sufficient conditions for the existence of equilibrium and bifurcation points taking the form of algebraic inequality constraints in the state-parameter space are used to calculate their enclosures directly. The enclosures for the bifurcation sets can be computed independently of the equilibrium manifold, and are guaranteed to contain all solutions within the computational domain. A further advantage of this method is the ability to compute a near-maximally sized hyper-rectangle of high dimension centered at a fixed parameter-state point whose elements are guaranteed to exclude all bifurcation points. This hyper-rectangle, which requires a global description of the bifurcation manifold within the computational domain, cannot be obtained otherwise. A test case, based on the dynamics of a UAV subject to uncertain center of gravity location, is used to illustrate the efficacy of the method by comparing it with numerical continuation and to evaluate its computational complexity.

Smith, Andrew P.↗

NASA NTRS1985

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

NASA NTRS1986

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

NASA NTRS1980

A mixed-mode crack analysis of rectilinear anisotropic solids using conservation laws of elasticity

A very simple and convenient method of analysis for studying two-dimensional mixed-mode crack problems in rectilinear anisotropic solids is presented. The analysis is formulated on the basis of conservation laws of anisotropic elasticity and of fundamental relationships in anisotropic fracture mechanics. The problem is reduced to a system of linear algebraic equations in mixed-mode stress intensity factors. One of the salient features of the present approach is that it can determine directly the mixed-mode stress intensity solutions from the conservation integrals evaluated along a path removed from the crack-tip region without the need of solving the corresponding complex near-field boundary value problem. Several examples with solutions available in the literature are solved to ensure the accuracy of the current analysis. This method is further demonstrated to be superior to other approaches in its numerical simplicity and computational efficiency. Solutions of more complicated and practical engineering problems dealing with the crack emanating from a circular hole in composites are presented also to illustrate the capacity of this method.

Wang, S. S.↗

NASA NTRS2022

A Quantum Algorithm to Simulate Open Quantum Systems

Given the advent of quantum algorithms for a wide array of problems in linear algebra and machine learning, it is important to develop general methods for the simulation of arbitrary (ie non-unitary) operators on quantum hardware. In this talk, we present a novel quantum algorithm based on the quantum singular value transformation (QSVT) to apply an arbitrary operator K to some input state and subsequently estimate the expectation value of some observable. Our construction then immediately yields a route to estimating observables of states undergoing open quantum dynamics, whose effect is captured by a set of non-unitary Kraus operators. Our algorithm succeeds deterministically given the Sz-Nagy dilation, and we provide details on the algorithm's query and gate complexity, numerical verification, and comparisons with prior methods.

Quantum computing↗

NASA NTRS2004

Simplified computational approach for dual-probe heat-pulse method

Two equations are currently available for estimating soil volumetric heat capacity (pc) with the dual-probe heat-pulse (DPHP) method. One is simple but gives only approximate results because it assumes that the DPHP sensor releases an impulse of heat instantaneously. The other explicitly accounts for the finite duration of heating and gives exact results. Unfortunately, the equation that gives exact results involves the exponential integral function, which is not available in most computer spreadsheet software packages or data logger function libraries. In this note we introduce an approximation of the exact equation that contains only simple algebraic functions. The approximation consists of the first five terms of a Taylor series, which are written as a telescoped polynomial for computational purposes. For most applications of the DPHP method, the polynomial approximation gives estimates of pc that are at least an order of magnitude more accurate than estimates obtained from the simple equation based on instantaneous heating.

NASA Center JSC↗

NASA NTRS1996

NPARC Code Upgraded with Two-Equation Turbulence Models

The National PARC (NPARC) Alliance was established by the NASA Lewis Research Center and the Air Force Arnold Engineering Development Center to provide the U.S. aeropropulsion community with a reliable Navier-Stokes code for simulating the nonrotating components of propulsion systems. Recent improvements to the turbulence model capabilities of the NPARC code have significantly improved its capability to simulate turbulent flows. Specifically, the Chien k-epsilon and Wilcox k-omega turbulence models were implemented at Lewis. Lewis researchers installed the Chien k-epsilon model into NPARC to improve the code's ability to calculate turbulent flows with attached wall boundary layers and free shear layers. Calculations with NPARC have demonstrated that the Chien k-epsilon model provides more accurate calculations than those obtained with algebraic models previously available in the code. Grid sensitivity investigations have shown that computational grids must be packed against the solid walls such that the first point off of the wall is placed in the laminar sublayer. In addition, matching the boundary layer and momentum thicknesses entering mixing regions is necessary for an accurate prediction of the free shear-layer growth.

Source record↗

NASA NTRS1991

Experiments with conjugate gradient algorithms for homotopy curve tracking

There are algorithms for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for almost all starting points, i.e., with probability one. The essence of all such algorithms is the construction of an appropriate homotopy map and then tracking some smooth curve in the zero set of this homotopy map. HOMPACK is a mathematical software package implementing globally convergent homotopy algorithms with three different techniques for tracking a homotopy zero curve, and has separate routines for dense and sparse Jacobian matrices. The HOMPACK algorithms for sparse Jacobian matrices use a preconditioned conjugate gradient algorithm for the computation of the kernel of the homotopy Jacobian matrix, a required linear algebra step for homotopy curve tracking. Here, variants of the conjugate gradient algorithm are implemented in the context of homotopy curve tracking and compared with Craig's preconditioned conjugate gradient method used in HOMPACK. The test problems used include actual large scale, sparse structural mechanics problems.

Irani, Kashmira M.↗