SEARCH · Search NASA

Results for “Computing”

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 NTRS2015

Re-Computation of Numerical Results Contained in NACA Report No. 496

An extensive examination of NACA Report No. 496 (NACA 496), "General Theory of Aerodynamic Instability and the Mechanism of Flutter," by Theodore Theodorsen, is described. The examination included checking equations and solution methods and re‐computing interim quantities and all numerical examples in NACA 496. The checks revealed that NACA 496 contains computational shortcuts (time‐ and effort‐saving devices for engineers of the time) and clever artifices (employed in its solution methods), but, unfortunately, also contains numerous tripping points (aspects of NACA 496 that have the potential to cause confusion) and some errors. The re‐computations were performed employing the methods and procedures described in NACA 496, but using modern computational tools. With some exceptions, the magnitudes and trends of the original results were in fair‐to‐very‐good agreement with the re‐computed results. The exceptions included what are speculated to be computational errors in the original in some instances and transcription errors in the original in others. Independent flutter calculations were performed and, in all cases, including those where the original and re‐computed results differed significantly, were in excellent agreement with the re‐computed results. Appendix A contains NACA 496; Appendix B contains a Matlab(Reistered) program that performs the re‐computation of results; Appendix C presents three alternate solution methods, with examples, for the two‐degree‐of-freedom solution method of NACA 496; Appendix D contains the three‐degree‐of‐freedom solution method (outlined in NACA 496 but never implemented), with examples.

Perry, Boyd, III↗

NASA NTRS2022

Computational Analysis of the X-57 Maxwell Airplane at Unpowered Conditions (Preliminary Fuselage)

The X-57 Maxwell is an all-electric airplane that implements a distributed electric propulsion system to demonstrate that high-efficiency electric propulsion can be integrated with aerodynamics to increase the performance of an airplane. To this end, distributed electric fans were installed on the wing to provide increased flow over the wing at the low takeoff and landing speeds of the X-57. The low-speed lift augmentation allows for a reduction in wing area for cruise optimization. The X-57 wing area was reduced to 42 percent of the wing area of the baseline aircraft, a Tecnam P2006T. With this reduced wing area and the electric propulsion system, it is estimated that the X-57 will cruise on less than one-third the total energy compared to the baseline aircraft. To meet the cruise performance goal at a Mach number of 0.233 at an altitude of 8000 feet, the X-57 has a cruise lift coefficient of 0.7516 and needs to have a cruise drag coefficient of 0.05423 or less. The USM3D computational solver was used to investigate the X-57 performance, without the distributed electric propulsion high-lift system operating. The unpowered X-57 performance is of interest to quantify if the X-57 can meet the cruise drag performance goal, and to document the lift performance of the very small wing at takeoff and landing conditions. The primary configurations investigated in this paper include the cruise configuration with no flap deflection, a takeoff configuration with a 10◦ flap deflection, and a landing configuration with a 30◦ flap deflection. The conditions for the cruise configuration were a flight unit Reynolds number of 1.32E+06 per foot, an altitude of 8000 feet, a Mach number of 0.233, and angles of attack from −2° to 24° . At the cruise lift coefficient of 0.7516, the computed drag coefficient is 0.05275. This computed drag is less than the drag coefficient of 0.05423 that is required to meet the X-57 airplane performance goal. However, the computational airplane is a completely smooth geometry and does not account for protuberance drag, nor the drag from steps and gaps in the actual X-57 airplane. Therefore, based upon the CFD drag calculation there is a 10-percent margin to account for some of the differences between the as-built metal fuselage and empennage construction, and the smooth computational geometry. The computed cruise drag also does not account for an induced drag reduction due to the wing-tip propellers and a drag reduction due to laminar flow achieved on the wing. The computed lift to drag ratio is 14.14 at the cruise lift coefficient of 0.7516, and the maximum computed lift to drag ratio is 15.8. The maximum lift coefficient for the cruise configuration was 2.13 at an angle of attack of 15°. The conditions for the takeoff configuration with a 10° flap deflection were a flight unit Reynolds number of 0.986E+06 per foot, an altitude of 2500 feet, a Mach number of 0.149, and angles of attack from −2° to 22°. The maximum lift coefficient for the takeoff configuration was 2.21 at an angle of attack of 16°. The conditions for the landing configuration with a 30° flap deflection were a flight unit Reynolds number of 0.922E+06 per foot, an altitude of 2500 feet, a Mach number of 0.139, and angles of attack from −2° to 24°. The maximum lift coefficient for the landing configuration was 2.58 and occurred at two angles of attack, 10° and 14°. Based on the unpowered maximum lift coefficient of 2.58 for the 30° flap deflection, along with computations of the distributed electric propulsion lift augmentation (not shown in this paper), the X-57 Maxwell is estimated to meet its powered landing goal of a maximum lift coefficient of 4.0.

X-57 Maxwell Airplane↗

NASA NTRSDate not supplied

NASA and Blue Origin Collaborative Assessment of Precision Landing Algorithms and Computing

NASA’s Safe and Precise Landing Integrated Capabilities Evolution (SPLICE) project is developing sensor, algorithm, and compute technologies for precision landing and hazard avoidance. These technologies are being tested as an integrated Precision Landing and Hazard Avoidance (PL&HA) system on Blue Origin’s New Shephard suborbital vehicle. A key goal for the computing element of this technology development is to characterize the performance of the SPLICE software workloads on the project’s Descent and Landing Computer (DLC). The DLC is a multi-core processor designed as a surrogate for NASA’s High-Performance Space Computer (HPSC). Measurements of the SPLICE workload performance on the DLC provides NASA insight on how PL&HA capabilities will perform on the HPSC, and guidance on how the SPLICE algorithms can be implemented to best utilize the DLC platform. This insight can also be used to derive requirements to guide trade studies on candidate computing architectures, for use on platforms like Blue Moon. NASA and Blue Origin are collaborating under an agreement to pursue this mutual benefit. Performance metrics collected are based on measurement of common compute resources such as percentage used of memory bandwidth, I/O utilization, interrupt latency, and kernel vs. user space code residency. Where possible existing performance counters and metrics that are part of the operating system kernel are used. As the design has a significant FPGA component, performance counters are identified and instantiated in the fabric to measure DMA performance and interface metrics. Collection of metrics is performed on the DLC with a representative workload that simulates a full landing cycle of the Blue Origin New Shepard vehicle. Consideration is given to the other compute implementations and whether they can run SPLICE algorithms at the same rate and with the same latency as the DLC. One option being considered is the use of a RISC-V soft core instantiated in a radiation resilient FPGA fabric such as the Xilinx KU60. Select algorithms from the SPLICE code will be run for comparison with the DLC. This paper describes how the DLC is instrumented to collect performance measurements of the SPLICE workloads, preliminary results from these measurements, and their implications on SPLICE algorithm implementation. The results of experimentation to derive candidate requirements for architecture trades on a PL&HA computing system are also presented.

computer performance↗

NASA NTRSDate not supplied

Improving Computational Efficiency of Prognostics Algorithms in Resource-Constrained Settings

In engineering and aerospace applications, it is vital to operational success to have insight into the expected performance and health of physical systems. The field of prognostics and health management provides quantitative methods for monitoring, predicting, and managing system health. Prognostics algorithms can be employed to assess the current state of a system, propagate the system throughout time, and predict potential anomalies or failures that may occur. While they can provide accurate prediction results, effective prognostics algorithms can be challenging to use in resource-constrained settings due to computational limitations and high computational latency, leading to obsolete predictions. Thus, computationally efficient and accurate algorithms are necessary for future remaining useful life predictions. In this work, we implement new algorithmic approaches for prediction, quantitatively compare them via a battery degradation use-case, and provide recommendations of potential improvements to a prognostics framework. One approach to prediction is through sampling, whereby the current state of a physical system is sampled many times and each sample is propagated forward until failure is reached, resulting in a distribution of failure values. To improve the efficiency of this process, we implemented five new algorithmic approaches to prediction, including three distinct sampling methods (standard Monte Carlo, Quasi-Monte Carlo, and Latin Hypercube Sampling), a variable time step algorithm, and a variable sample size algorithm. To compare the algorithms, we employ a variety of metrics designed specifically to analyze both computational efficiency and model accuracy. Our metrics include accuracy to compare the average predicted value to ground truth, mean absolute deviation to illustrate dispersion, specific percentile error to describe accuracy within a user-defined risk tolerance, and code run-time. To quantitatively analyze our results, we employ a use-case of degradation of a Lithium-ion battery. We use an electrochemistry-based model to describe the current health state of the battery, and implement our prediction algorithms to propagate forward in time until end-of-discharge (EOD) is reached. Notably, through this work it was found that none of our sampling approaches had a significant impact on computational efficiency or model accuracy in predicting EOD of the battery. We find that while the sampling methods are unique, the distributions they generate are similar, ultimately producing final predictions that are nearly identical. In exploring the effect of the time step within the prediction algorithm, we found that prediction accuracy was highly dependent on the time step used, and that implementing a variable time step within a particular prediction may provide an increase in computational efficiency while also maintaining prediction accuracy. Finally, implementing a variable sample size also affected prediction, and our results show that tuning both the magnitude and timing of the sample size adjustment can result in improved computation speed and maintained prediction accuracy. Taken together, our findings highlight the challenge of performing prognostics in resource-constrained settings, and illustrate the potential of developing new prediction algorithms to improve computational efficiency.

prognostics↗

NASA NTRS1973

Combining human and computer interpretation capabilities to analyze ERTS imagery

The human photointerpreter and the computer have complementary capabilities that are exploited in a computer-based data analysis system developed at the Forestry Remote Sensing Laboratory, University of California. This system is designed to optimize the process of extracting resource information from ERTS images. The human has the ability to quickly delineate gross differences in land classes, such as wildland, urban, and agriculture on appropriate ERTS images, and to further break these gross classes into meaningful subclasses. The computer, however, can more efficiently analyze point-by-point spectral information and localized textural information which can result in a much more detailed agricultural or wildland classification based on species composition and/or plant association. These human and computer capabilities have been integrated through the use of an inexpensive small scale computer dedicated to the interactive preprocessing of the human inputs and the display of raw ERTS images and computer classified images. The small computer is linked to a large scale computer system wherein the bulk of the statistical work and the automatic point-by-point classification is done.

Nichols, J. D.↗

NASA NTRS1974

Adaptive voting computer system

A computer system is reported that uses adaptive voting to tolerate failures and operates in a fail-operational, fail-safe manner. Each of four computers is individually connected to one of four external input/output (I/O) busses which interface with external subsystems. Each computer is connected to receive input data and commands from the other three computers and to furnish output data commands to the other three computers. An adaptive control apparatus including a voter-comparator-switch (VCS) is provided for each computer to receive signals from each of the computers and permits adaptive voting among the computers to permit the fail-operational, fail-safe operation.

Koczela, L. J.↗

NASA NTRS1978

Projected role of advanced computational aerodynamic methods at the Lockheed-Georgia company

Experience with advanced computational methods being used at the Lockheed-Georgia Company to aid in the evaluation and design of new and modified aircraft indicates that large and specialized computers will be needed to make advanced three-dimensional viscous aerodynamic computations practical. The Numerical Aerodynamic Simulation Facility should be used to provide a tool for designing better aerospace vehicles while at the same time reducing development costs by performing computations using Navier-Stokes equations solution algorithms and permitting less sophisticated but nevertheless complex calculations to be made efficiently. Configuration definition procedures and data output formats can probably best be defined in cooperation with industry, therefore, the computer should handle many remote terminals efficiently. The capability of transferring data to and from other computers needs to be provided. Because of the significant amount of input and output associated with 3-D viscous flow calculations and because of the exceedingly fast computation speed envisioned for the computer, special attention should be paid to providing rapid, diversified, and efficient input and output.

Lores, M. E.↗

NASA NTRS1980

Computer applications in remote sensing education

Computer applications to instruction in any field may be divided into two broad generic classes: computer-managed instruction and computer-assisted instruction. The division is based on how frequently the computer affects the instructional process and how active a role the computer affects the instructional process and how active a role the computer takes in actually providing instruction. There are no inherent characteristics of remote sensing education to preclude the use of one or both of these techniques, depending on the computer facilities available to the instructor. The characteristics of the two classes are summarized, potential applications to remote sensing education are discussed, and the advantages and disadvantages of computer applications to the instructional process are considered.

Danielson, R. L.↗

NASA NTRS1982

Guidelines for developing vectorizable computer programs

Some fundamental principles for developing computer programs which are compatible with array-oriented computers are presented. The emphasis is on basic techniques for structuring computer codes which are applicable in FORTRAN and do not require a special programming language or exact a significant penalty on a scalar computer. Researchers who are using numerical techniques to solve problems in engineering can apply these basic principles and thus develop transportable computer programs (in FORTRAN) which contain much vectorizable code. The vector architecture of the ASC is discussed so that the requirements of array processing can be better appreciated. The "vectorization" of a finite-difference viscous shock-layer code is used as an example to illustrate the benefits and some of the difficulties involved. Increases in computing speed with vectorization are illustrated with results from the viscous shock-layer code and from a finite-element shock tube code. The applicability of these principles was substantiated through running programs on other computers with array-associated computing characteristics, such as the Hewlett-Packard (H-P) 1000-F.

Miner, E. W.↗

NASA NTRS1983

A grid-embedding transonic flow analysis computer program for wing/nacelle configurations

An efficient grid-interfacing zonal algorithm was developed for computing the three-dimensional transonic flow field about wing/nacelle configurations. the algorithm uses the full-potential formulation and the AF2 approximate factorization scheme. The flow field solution is computed using a component-adaptive grid approach in which separate grids are employed for the individual components in the multi-component configuration, where each component grid is optimized for a particular geometry such as the wing or nacelle. The wing and nacelle component grids are allowed to overlap, and flow field information is transmitted from one grid to another through the overlap region using trivariate interpolation. This report represents a discussion of the computational methods used to generate both the wing and nacelle component grids, the technique used to interface the component grids, and the method used to obtain the inviscid flow solution. Computed results and correlations with experiment are presented. also presented are discussions on the organization of the wing grid generation (GRGEN3) and nacelle grid generation (NGRIDA) computer programs, the grid interface (LK) computer program, and the wing/nacelle flow solution (TWN) computer program. Descriptions of the respective subroutines, definitions of the required input parameters, a discussion on interpretation of the output, and the sample cases illustrating application of the analysis are provided for each of the four computer programs.

Atta, E. H.↗

NASA NTRS1986

The RANDOM computer program: A linear congruential random number generator

The RANDOM Computer Program is a FORTRAN program for generating random number sequences and testing linear congruential random number generators (LCGs). The linear congruential form of random number generator is discussed, and the selection of parameters of an LCG for a microcomputer described. This document describes the following: (1) The RANDOM Computer Program; (2) RANDOM.MOD, the computer code needed to implement an LCG in a FORTRAN program; and (3) The RANCYCLE and the ARITH Computer Programs that provide computational assistance in the selection of parameters for an LCG. The RANDOM, RANCYCLE, and ARITH Computer Programs are written in Microsoft FORTRAN for the IBM PC microcomputer and its compatibles. With only minor modifications, the RANDOM Computer Program and its LCG can be run on most micromputers or mainframe computers.

Miles, R. F., Jr.↗

NASA NTRS1988

Modern meteorological computing resources - The Maryland experience

The Department of Meteorology at the University of Maryland is developing one of the first computer systems in meteorology to take advantage of the new networked computer architecture that has been made possible by recent advances in computer and communication technology. Elements of the department's system include scientific workstations, local mainframe computers, remote mainframe computers, local-area networks,'long-haul' computer-to-computer communications, and 'receive-only' communications. Some background is provided, together with highlights of some lessons that were learned in carrying out the design. In agreement with work in the Unidata Project, this work shows that the networked computer architecture discussed here presents a new style of resources for solving problems that arise in meteorological research and education.

Huffman, George J.↗

NASA NTRS1992

Current state and future direction of computer systems at NASA Langley Research Center

Computer systems have advanced at a rate unmatched by any other area of technology. As performance has dramatically increased there has been an equally dramatic reduction in cost. This constant cost performance improvement has precipitated the pervasiveness of computer systems into virtually all areas of technology. This improvement is due primarily to advances in microelectronics. Most people are now convinced that the new generation of supercomputers will be built using a large number (possibly thousands) of high performance microprocessors. Although the spectacular improvements in computer systems have come about because of these hardware advances, there has also been a steady improvement in software techniques. In an effort to understand how these hardware and software advances will effect research at NASA LaRC, the Computer Systems Technical Committee drafted this white paper to examine the current state and possible future directions of computer systems at the Center. This paper discusses selected important areas of computer systems including real-time systems, embedded systems, high performance computing, distributed computing networks, data acquisition systems, artificial intelligence, and visualization.

Rogers, James L.↗

NASA NTRS1994

Applications of automatic differentiation in computational fluid dynamics

Automatic differentiation (AD) is a powerful computational method that provides for computing exact sensitivity derivatives (SD) from existing computer programs for multidisciplinary design optimization (MDO) or in sensitivity analysis. A pre-compiler AD tool for FORTRAN programs called ADIFOR has been developed. The ADIFOR tool has been easily and quickly applied by NASA Langley researchers to assess the feasibility and computational impact of AD in MDO with several different FORTRAN programs. These include a state-of-the-art three dimensional multigrid Navier-Stokes flow solver for wings or aircraft configurations in transonic turbulent flow. With ADIFOR the user specifies sets of independent and dependent variables with an existing computer code. ADIFOR then traces the dependency path throughout the code, applies the chain rule to formulate derivative expressions, and generates new code to compute the required SD matrix. The resulting codes have been verified to compute exact non-geometric and geometric SD for a variety of cases. in less time than is required to compute the SD matrix using centered divided differences.

Green, Lawrence L.↗

NASA NTRS1994

Aeroacoustic computation of gust-blade interaction

To better understand and address the challenges faced in computing the acoustics of flow fields, test problems must be considered. In the present study, the sound radiated by the interaction of a flat plate with an oncoming gust containing a two component, mean velocity is computed. The gust has a uniform mean flow in x with Mach number M(infinity) equal to 0.5. The gust's mean velocity in y is of smaller amplitude and is given by: v = 0.1 sin(pi/8(x/M(sub infinity) - t)). This problem has been posed for an upcoming ICASE/LaRC workshop on benchmark problems in computational aeroacoustics. A plate with a length of 30 units in x is used. The plate is assumed to be infinitesimally thin and is centered at the origin. All variables are made dimensionless using the scales specified. Acoustic quantities are obtained by numerically integrating the linearized Euler equations. Integration is performed on the computational domain -100.0 less than or equal to x less than or equal to 100.0, -100.0 less than or equal to y less than or equal to 100.0, using unit length grid spacing in x and in y. An integration scheme is sought which will provide accurate solution to the small quantities of interest at a minimal computational expense. Results indicate that with the given discretization a scheme of minimal fourth order accuracy might be adequate to approximate the waves within the given flow. Thus, a variation of the MacCormack scheme with fourth order accuracy in space and second order accuracy in time was chosen. A scheme with sixth order accuracy in space has also been implemented and results compared with those of the fourth order accurate scheme. To ensure no mass flux, zero normal velocity is assigned at the plate. This condition will induce a discontinuity in the pressure across the plate location. Values for the perturbation pressure p' along the surface of the plate are obtained using a one-sided, third order Taylor expansion, such that p'(sub y) = O. In accordance with the Kutta condition, perturbation pressure at the trailing edge is assigned to zero. In the far field, radiation boundary conditions have been implemented. The effectiveness of the far field conditions are validated by computing in a larger computational domain and comparing the results. Early in time, sound waves begin to radiate from the plate. A Doppler effect is observed. After the initial transients disappear, the strongest waves leave the trailing edge at an approximate 45 degree angle. The intensity pattern of pressure fluctuations shows five lobes (of increasing magnitude with increasing downstream direction) emerging from the plate. Undesirable short wave contaminants are observed in the computed pressure distribution along the plate surface. For a more accurate solution at small scales, a more refined discretization will be required.

Martin, James E.↗

NASA NTRS1999

Development and Validation of a Fast, Accurate and Cost-Effective Aeroservoelastic Method on Advanced Parallel Computing Systems

Progress to date towards the development and validation of a fast, accurate and cost-effective aeroelastic method for advanced parallel computing platforms such as the IBM SP2 and the SGI Origin 2000 is presented in this paper. The ENSAERO code, developed at the NASA-Ames Research Center has been selected for this effort. The code allows for the computation of aeroelastic responses by simultaneously integrating the Euler or Navier-Stokes equations and the modal structural equations of motion. To assess the computational performance and accuracy of the ENSAERO code, this paper reports the results of the Navier-Stokes simulations of the transonic flow over a flexible aeroelastic wing body configuration. In addition, a forced harmonic oscillation analysis in the frequency domain and an analysis in the time domain are done on a wing undergoing a rigid pitch and plunge motion. Finally, to demonstrate the ENSAERO flutter-analysis capability, aeroelastic Euler and Navier-Stokes computations on an L-1011 wind tunnel model including pylon, nacelle and empennage are underway. All computational solutions are compared with experimental data to assess the level of accuracy of ENSAERO. As the computations described above are performed, a meticulous log of computational performance in terms of wall clock time, execution speed, memory and disk storage is kept. Code scalability is also demonstrated by studying the impact of varying the number of processors on computational performance on the IBM SP2 and the Origin 2000 systems.

Goodwin, Sabine A.↗

NASA NTRS1999

Survey of Turbulence Models for the Computation of Turbulent Jet Flow and Noise

The report presents an overview of jet noise computation utilizing the computational fluid dynamic solution of the turbulent jet flow field. The jet flow solution obtained with an appropriate turbulence model provides the turbulence characteristics needed for the computation of jet mixing noise. A brief account of turbulence models that are relevant for the jet noise computation is presented. The jet flow solutions that have been directly used to calculate jet noise are first reviewed. Then, the turbulent jet flow studies that compute the turbulence characteristics that may be used for noise calculations are summarized. In particular, flow solutions obtained with the k-e model, algebraic Reynolds stress model, and Reynolds stress transport equation model are reviewed. Since, the small scale jet mixing noise predictions can be improved by utilizing anisotropic turbulence characteristics, turbulence models that can provide the Reynolds stress components must now be considered for jet flow computations. In this regard, algebraic stress models and Reynolds stress transport models are good candidates. Reynolds stress transport models involve more modeling and computational effort and time compared to algebraic stress models. Hence, it is recommended that an algebraic Reynolds stress model (ASM) be implemented in flow solvers to compute the Reynolds stress components.

Nallasamy, N.↗

NASA NTRS1986

The Science of Computing: Virtual Memory

In the March-April issue, I described how a computer's storage system is organized as a hierarchy consisting of cache, main memory, and secondary memory (e.g., disk). The cache and main memory form a subsystem that functions like main memory but attains speeds approaching cache. What happens if a program and its data are too large for the main memory? This is not a frivolous question. Every generation of computer users has been frustrated by insufficient memory. A new line of computers may have sufficient storage for the computations of its predecessor, but new programs will soon exhaust its capacity. In 1960, a longrange planning committee at MIT dared to dream of a computer with 1 million words of main memory. In 1985, the Cray-2 was delivered with 256 million words. Computational physicists dream of computers with 1 billion words. Computer architects have done an outstanding job of enlarging main memories yet they have never kept up with demand. Only the shortsighted believe they can.

Denning, Peter J.↗