Search NASASearch

Engineering topics

Lawson, C. L.

Publications and source records attributed to Lawson, C. L..

At least 19 records

On some recent advances in multidisciplinary analysis of hypersonic vehicles

This paper presents pertinent details of the development and application of an integrated, multidisciplinary finite element analysis tool for the effective modeling and simulation of aerospace vehicles including hypersonic ones. Recent advances in this connection include more efficient CFD solution techniques and also aeroservoelastic stability analysis methods that employ unsteady aerodynamic forces for computation of flutter and divergence speeds. An accelerated Euler solution procedure based on the Aitken acceleration technique has recently been implemented that effects considerable improvement in solution efficiency for the same level of solution accuracy, as evidenced by example problems presented in the paper. A summary of finite element numerical formulations for the various individual disciplines as well as for the unified aeroservoelastic analysis and some relevant numerical examples are also presented in the paper.

Gupta, K. K.

On development of a finite dynamic element and solution of associated eigenproblem by a block Lanczos procedure

The paper first presents the details of the development of a new six-noded plane triangular finite dynamic element. A block Lanczos algorithm is developed next for the accurate and efficient solution of the quadratic matrix eigenvalue problem associated with the finite dynamic element formulation. The resulting computer program fully exploits matrix sparsity inherent in such a discretization and proves to be most efficient for the extraction of the usually required first few roots and vectors, including repeated ones. Most importantly, the present eigenproblem solution is shown to be comparable to that of the corresponding finite element analysis, thereby rendering the associated dynamic element method rather attractive owing to superior convergence characteristics of such elements, presented herein.

Gupta, K. K.

Multidisciplinary modeling and simulation of a generic hypersonic vehicle

The modeling and simulation of hypersonic vehicles which involve the interaction of a number of major technical disciplines including aerodynamics, structures, heat transfer, propulsion, and control engineering are described. Finite element numerical formulations of individual disciplines including their appropriate integration for multidisciplinary simulation are presented. An efficient unstructured grid generation strategy, evolved by modifying an existing code, is developed.

Gupta, K. K.

Development of a block Lanczos algorithm for free vibration analysis of spinning structures

This paper is concerned with the development of an efficient eigenproblem solution algorithm and an associated computer program for the economical solution of the free vibration problem of complex practical spinning structural systems. Thus, a detailed description of a newly developed block Lanczos procedure is presented in this paper that employs only real numbers in all relevant computations and also fully exploits sparsity of associated matrices. The procedure is capable of computing multiple roots and proves to be most efficient compared to other existing similar techniques.

Gupta, K. K.

Ada Linear-Algebra Program

Routines provided for common scalar, vector, matrix, and quaternion operations. Computer program extends Ada programming language to include linear-algebra capabilities similar to HAS/S programming language. Designed for such avionics applications as software for Space Station.

Klumpp, A. R.

Implementation of a block Lanczos algorithm for eigenproblem solution of gyroscopic systems

This paper describes the details of implementation of a general numerical procedure developed for the accurate and economical computation of natural frequencies and associated modes of any elastic structure rotating along an arbitrary axis. A block version of the Lanczos algorithm is derived for the solution that fully exploits associated matrix sparsity and employs only real numbers in all relevant computations. It is also capable of determining multiple roots and proves to be most efficient when compared to other, similar, existing techniques.

Gupta, K. K.

Some properties of n-dimensional triangulations

A number of mathematical results relevant to the problem of constructing a triangulation, i.e., a simplicial tessellation, of the convex hull of an arbitrary finite set of points in n-space are described. The principal results achieved are: (1) a set of n+2 points in n-space may be triangulated in at most 2 different ways; (2) the sphere test defined in this report selects a preferred one of these two triangulations; (3) a set of parameters is defined that permits the characterization and enumeration of all sets of n+2 points in n-space that are significantly different from the point of view of their possible triangulation; (4) the local sphere test induces a global sphere test property for a triangulation; and (5) a triangulation satisfying the global sphere property is dual to the n-dimensional Dirichlet tesselation, i.e., it is a Delaunay triangulation.

Lawson, C. L.

Structured FORTRAN Preprocessor

SFTRAN3 supports structured programing in FORTRAN environment. Language intended particularly to support two aspects of structured programing -- nestable single-entry control structures and modularization and top-down organization of code. Code designed and written using these SFTRAN3 facilities have fewer initial errors, easier to understand and less expensive to maintain and modify.

Flynn, J. A.

Antenna Radiation-Pattern Program

Effects of reflector deformations and feed characteristics computed. JPL Antenna Radiation Pattern computer program ANRAD, evaluates performance of radio-frequency antenna with paraboloidal main reflector by solving scalar far-field radiation pattern integral.

Hughes, R. D.

Linear-Algebra Programs

The Basic Linear Algebra Subprograms (BLAS) library is a collection of 38 FORTRAN-callable routines for performing basic operations of numerical linear algebra. BLAS library is portable and efficient source of basic operations for designers of programs involving linear algebriac computations. BLAS library is supplied in portable FORTRAN and Assembler code versions for IBM 370, UNIVAC 1100 and CDC 6000 series computers.

Lawson, C. L.

C-1 surface interpolation for scattered data on a sphere

An algorithm is described for constructing a smooth computable function, f, defined over the surface of a sphere and interpolating a set of n data values, u sub i, associated with n locations, P sub i, on the surface of the sphere. The interpolation function, f, will be continuous and have continuous first partial derivatives. The locations, p sub i, are not required to lie on any type of regular grid.

Lawson, C. L.

The IFIP WG 2.5 proposals on FORTRAN

Language problem areas are summarized and possible solutions are discussed. Areas covered are: (1) double complex, (2) arrays of work space in library subroutines, (3) calls from a library subprogram to user code, (4) decomposition and synthesis of floating-point numbers, (5) environment parameters, (6) precision function, and (7) control structures.

Lawson, C. L.

Basic linear algebra subprograms for FORTRAN usage

A package of 38 low level subprograms for many of the basic operations of numerical linear algebra is presented. The package is intended to be used with FORTRAN. The operations in the package are dot products, elementary vector operations, Givens transformations, vector copy and swap, vector norms, vector scaling, and the indices of components of largest magnitude. The subprograms and a test driver are available in portable FORTRAN. Versions of the subprograms are also provided in assembly language for the IBM 360/67, the CDC 6600 and CDC 7600, and the Univac 1108.

Lawson, C. L.

Software for C1 interpolation

The problem of mathematically defining a smooth surface, passing through a finite set of given points is studied. Literature relating to the problem is briefly reviewed. An algorithm is described that first constructs a triangular grid in the (x,y) domain, and first partial derivatives at the modal points are estimated. Interpolation in the triangular cells using a method that gives C sup.1 continuity overall is examined. Performance of software implementing the algorithm is discussed. Theoretical results are presented that provide valuable guidance in the development of algorithms for constructing triangular grids.

Lawson, C. L.

C super 1: Compatible interpolation over a triangle

An elementary derivation and a complete description is given of an algorithm for interpolation over a plane triangle when function values and first partial derivatives are given at the vertices. The method gives C1 continuity with neighboring triangles. The interpolation method is mathematically equivalent to one that has been discussed previously in the literature; however, the algorithmic form given here is more efficient than has previously been described.

Lawson, C. L.