Search NASA⌕ Search

SEARCH · Search NASA

Results for “Compute”

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

VNAP2: A Computer Program for Computation of Two-dimensional, Time-dependent, Compressible, Turbulent Flow

A computer program, VNAP2, for calculating turbulent (as well as laminar and inviscid), steady, and unsteady flow is presented. It solves the two dimensional, time dependent, compressible Navier-Stokes equations. The turbulence is modeled with either an algebraic mixing length model, a one equation model, or the Jones-Launder two equation model. The geometry may be a single or a dual flowing stream. The interior grid points are computed using the unsplit MacCormack scheme. Two options to speed up the calculations for high Reynolds number flows are included. The boundary grid points are computed using a reference plane characteristic scheme with the viscous terms treated as source functions. An explicit artificial viscosity is included for shock computations. The fluid is assumed to be a perfect gas. The flow boundaries may be arbitrary curved solid walls, inflow/outflow boundaries, or free jet envelopes. Typical problems that can be solved concern nozzles, inlets, jet powered afterbodies, airfoils, and free jet expansions. The accuracy and efficiency of the program are shown by calculations of several inviscid and turbulent flows. The program and its use are described completely, and six sample cases and a code listing are included.

Cline, M. C.↗

The finite element machine - An assessment of the impact of parallel computing on future finite element computations

The requirements of complex aerospace vehicles combined with the age of structural analysis systems enhance the need to advance technology toward a new generation of structural analysis capability. Recent and impeding advances in parallel and supercomputers provide the opportunity to significantly improve these structural analysis capabilities for large order finite element problems. Long-term research in parallel computing, associated with the NASA Finite Element Machine project, is discussed. The results show the potential of parallel computers to provide substantial increases in computation speed over sequential computers. Results are given for sample problems in the areas of eigenvalue analysis and transient response.

Fulton, R. E.↗

Computational strategies for three-dimensional flow simulations on distributed computer systems

An increasing amount of research activity in computational fluid dynamics has been devoted to the development of efficient algorithms for parallel computing systems. The increasing performance to price ratio of engineering workstations has led to research to development procedures for implementing a parallel computing system composed of distributed workstations. This thesis proposal outlines an ongoing research program to develop efficient strategies for performing three-dimensional flow analysis on distributed computing systems. The PVM parallel programming interface was used to modify an existing three-dimensional flow solver, the TEAM code developed by Lockheed for the Air Force, to function as a parallel flow solver on clusters of workstations. Steady flow solutions were generated for three different wing and body geometries to validate the code and evaluate code performance. The proposed research will extend the parallel code development to determine the most efficient strategies for unsteady flow simulations.

Weed, Richard Allen↗

Network Computer Technology. Phase I: Viability and Promise within NASA's Desktop Computing Environment

Over the past several months, major industry vendors have made a business case for the network computer as a win-win solution toward lowering total cost of ownership. This report provides results from Phase I of the Ames Research Center network computer evaluation project. It identifies factors to be considered for determining cost of ownership; further, it examines where, when, and how network computer technology might fit in NASA's desktop computing architecture.

Paluzzi, Peter↗

Current Status on the use of Parallel Computing in Turbulent Reacting Flow Computations Involving Sprays, Monte Carlo PDF and Unstructured Grids

The state of the art in multidimensional combustor modeling as evidenced by the level of sophistication employed in terms of modeling and numerical accuracy considerations, is also dictated by the available computer memory and turnaround times afforded by present-day computers. With the aim of advancing the current multi-dimensional computational tools used in the design of advanced technology combustors, a solution procedure is developed that combines the novelty of the coupled CFD/spray/scalar Monte Carlo PDF (Probability Density Function) computations on unstructured grids with the ability to run on parallel architectures. In this approach, the mean gas-phase velocity and turbulence fields are determined from a standard turbulence model, the joint composition of species and enthalpy from the solution of a modeled PDF transport equation, and a Lagrangian-based dilute spray model is used for the liquid-phase representation. The gas-turbine combustor flows are often characterized by a complex interaction between various physical processes associated with the interaction between the liquid and gas phases, droplet vaporization, turbulent mixing, heat release associated with chemical kinetics, radiative heat transfer associated with highly absorbing and radiating species, among others. The rate controlling processes often interact with each other at various disparate time 1 and length scales. In particular, turbulence plays an important role in determining the rates of mass and heat transfer, chemical reactions, and liquid phase evaporation in many practical combustion devices.

Raju, M. S.↗

Synchronous and Concurrent Multidomain Computing Method for Cloud Computing Platforms

We present a numerical method for synchronous and concurrent solution of transient elastodynamics problem where the computational domain is divided into subdomains that may reside on separate computational platforms. Here, this work employs the variational multiscale discontinuous Galerkin (VMDG) method to develop interdomain transmission conditions for transient problems. The fine-scale modeling concept leads to variationally consistent coupling terms at the common interfaces. The method admits a large class of time discretization schemes, and decoupling of the solution for each subdomain is achieved by selecting any explicit algorithm. Numerical tests with a manufactured solution problem show optimal convergence rates. The energy history in a free vibration problem is in agreement with that of the solution from a monolithic computational domain.

97 MATHEMATICS AND COMPUTING↗

Fostering Computational Thinking within Elementary Classrooms through a Research-Practice Partnership: A Strategy for Broadening Participation in Computer Science

This paper describes a research-practice partnership involving twenty elementary teachers and a support team of university researchers and K-12 learning specialists. Over five years, the partnership explored ways to highlight and to expand computational thinking within math and science instruction. The project sought to increase student awareness, confidence, and fluency with computational thinking as a problem-solving approach, with particular attention to students from groups historically underrepresented in computer science. Based on feedback from across the partnership – together with analysis of student attitude and problem-solving data – this experience report identifies successes, challenges, and recommendations for future study.

Broadening participation↗

Improving the Success of Underrepresented Populations in Computer and Computational Science Research with the CRA-W Women and URMD Grad Cohort Workshops

The Computing Research Association’s Committee on Widening Participation (CRA-WP) aims to increase the number of individual researchers from underrepresented groups in computing (UGC) (including women, underrepresented minorities, and persons with disabilities) who participate and succeed in computer science research at every stage of the research pipeline. Achieving these objectives requires that an increasing number of individuals from UGC start and progress to the next stage. The CRA-WP Grad Cohort Workshops are focused at the graduate level to maximize the likelihood participants will successfully complete their graduate degrees. Factors such as role models, skills, competence, confidence, mentoring, social support, and development of identity as a researcher help students to persist in graduate school, while factors such as sexism, racism, and dissatisfaction with their graduate program may cause them to leave. We, therefore, help first, second, and third year students build their skills, research strategies, and confidence; meet potential mentors from outside their institutions; develop connections with each other and with their research communities; and inform them about strategies for successful publishing, speaking, and advisor management strategies. By targeting early graduate students, we seek to help them stay in graduate school and in research.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Converged Computing: A Best of Both Worlds of High-Performance Computing and Cloud

Collaboration between Cloud and High Performance Computing (HPC) communities has accelerated in the last half decade. A common goal to run batch workloads combined with a desire for reproducibility, automation, and optimization has led to successful projects that range from container technologies to workload management and security. This span of current and future work defines a novel “Converged Computing” paradigm that aims to combine the best of both worlds, both from a technological and cultural standpoint. Furthermore, in this Special Issue, we review common themes in the space, showcasing current work and encouraging a continued effort toward innovative ideas that will enable the next generations of scientific discovery.

97 MATHEMATICS AND COMPUTING↗

Accessing a P-27 Data Acquisition Computer from an Off-Site Computer Not Owned by LANL

The steps to access a LANL owned P-27 data acquisition (DAQ) computer from off site using a non-LANL computer are documented here. Two connection paths should be possible. The first uses an HTML5 connection directly from portal.lanl.gov, and the steps for this path follow some preliminaries. The second connection path again uses an HTML5 from connection to portal.lan.gov to a virtual Windows desktop to then access our DAQ computers. Instructions for this will be added later.

97 MATHEMATICS AND COMPUTING↗

Neutron and x-ray computed tomography of a natural uranium tristructural isotropic (TRISO) fuel compact

A natural uranium-based, unirradiated tristructural isotropic (TRISO) fuel compact was nondestructively imaged using both X-ray (XCT) and neutron computed tomography (nCT). While XCT of compacts can provide information on fuel kernels, imaging artifacts preclude examination of the graphite matrix. In this work, nCT was used for the first time on a TRISO compact to examine the graphite matrix. A crack was clearly resolved within the graphite matrix, proving that nCT is a viable tool for nondestructive volumetric examination of the matrix material in TRISO fuel compacts. The XCT and nCT data were then fused together to create a more comprehensive dataset containing both matrix and fuel kernels.

36 - MATERIALS SCIENCE↗

Noise analysis for the Sorkin and Peres tests performed on a quantum computer

We use quantum computers to test the foundations of quantum mechanics through quantum algorithms that implement some of the experimental tests as the basis of the theory's postulates. These algorithms can be used as a test of the physical theory under the premise of a perfect hardware or as a test of the hardware under the premise that quantum theory is correct. In this paper, we show how the algorithms can be used to test the efficacy of a quantum computer in obeying the postulates of quantum mechanics. We study the effect of different types of errors on the results of experimental tests of the postulates. A salient feature of this error analysis is that it is deeply rooted in the fundamentals of quantum mechanics as it highlights how systematic errors affect the quantumness of the quantum computer.

Sadana, Simanraj↗

Accelerating Multivariate Functional Approximation Computation with Domain Decomposition Techniques⋆

Modeling large datasets through Multivariate Functional Approximations (MFA) provide an elegant way to handle many visualization and scientific analysis workflows. The process necessitates scalable data partitioning methods to compute MFA representations efficiently without compromising the accuracy or continuity of the reconstructed solution. We propose a domain -decomposed method for computing the MFA with B -spline bases, which reduces the total work per task and uses a restricted Additive Schwarz (RAS) method to converge the control point data degrees -of -freedom along subdomain boundaries. We provide an in-depth analysis of the parallel approach with domain decomposition solvers, aiming to minimize local subdomain error residuals and recover high -order continuity at subdomain interfaces with appropriate choices of knot overlaps. The communication cost, determined by the overlap regions in the RAS implementation, is optimized to recover the numerical error profile of the single subdomain case. Our proposed method stands in contrast to previous methods, which typically only recover either C 0 or at best C 1 continuity for arbitrary B -spline degree expansions, or those that require post -processing to blend discontinuities in the reconstructed data. We demonstrate the effectiveness of our approach using analytical and real -world datasets in 1D, 2D, and 3D through both strong and weak scaling studies. The performance results indicate that the overall cost of computing the approximation is directly proportional to the underlying nearest -neighbor communication implementation, and is only weakly dependent on the overlap region size that determines the size of the messages. This finding underscores the efficiency and scalability of our proposed method, making it a promising solution for handling large datasets in scientific workflows.

additive Schwarz solvers↗

Physics for neuromorphic computing

Neuromorphic computing takes inspiration from the brain to create energy-efficient hardware for information processing, capable of highly sophisticated tasks. Systems built with standard electronics achieve gains in speed and energy by mimicking the distributed topology of the brain. Scaling-up such systems and improving their energy usage, speed and performance by several orders of magnitude requires a revolution in hardware. Here, we discuss how including more physics in the algorithms and nanoscale materials used for data processing could have a major impact in the field of neuromorphic computing. We review striking results that leverage physics to enhance the computing capabilities of artificial neural networks, using resistive switching materials, photonics, spintronics and other technologies. We discuss the paths that could lead these approaches to maturity, towards low-power, miniaturized chips that could infer and learn in real time.

device physics↗