Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computation time”

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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

An eigenvalue method for solving transient heat conduction problems

The eigenvalue method, which has been used by researchers in structure mechanics, is applied to problems in heat conduction. Its formulation is decribed in terms of an examination of transient heat conduction in a square slab. Taking advantage of the availability of the exact solution, we compare the accuracy and other numerical properties of the eigenvalue method with those of existing numerical schemes. The comparsion shows that, overall, the eigenvalue method appears to be fairly attractive. Furthermore, only a few dominant eigenvalues and their corresponding eigenvectors need to be computed and retained to yield reasonably high accuracy. Greater savings are attained in the computation time for a transient problem with long time duration and a large computational domain.

Shih, T. M.↗
NASA NTRS1984

Multigrid techniques for the numerical solution of the diffusion equation

An accurate numerical solution of diffusion problems containing large local gradients can be obtained with a significant reduction in computational time by using a multigrid computational scheme. The spatial domain is covered with sets of uniform square grids of different sizes. The finer grid patterns overlap the coarse grid patterns. The finite-difference expressions for each grid pattern are solved independently by iterative techniques. Two interpolation methods were used to establish the values of the potential function on the fine grid boundaries with information obtained from the coarse grid solution. The accuracy and computational requirements for solving a test problem by a simple multigrid and a multilevel-multigrid method were compared. The multilevel-multigrid method combined with a Taylor series interpolation scheme was found to be best.

Phillips, R. E.↗
NASA NTRS1989

Control of the errors of discretization and idealization in finite element analysis

Understanding of the basic principles which control errors of discretization in finite element analysis has increased very substantially since 1980. The main milestones were: (1) development of the theoretical basis of p-extensions (1981); (2) understanding of the proper interplay between mesh design and assignment of polynomial degree to elements. Practical realization of exponential convergence rates, independently of the smoothness of the exact solution (1984); and (3) industrial experience with the new finite element technology known as the p- or hp-version of the finite element method: General Dynamics reported thirty- to forty-fold savings in terms of human time and large savings in computer time (1986). Lockheed reported favorably on their evaluation of error estimation and quality control capabilities of the p-version in industrial settings (1987). The gains in our understanding of how to control the errors of discretization represent only half of the control necessary to ensure that a numerical model is in fact an accurate representation of the corresponding physical system. Control of the errors of idealization is equally important. A brief overview of the main ideas of how to ensure the quality and reliability of mathematical models of structural systems is presented.

Szabo, Barna A.↗
NASA NTRS1991

Evaluation of a transfinite element numerical solution method for nonlinear heat transfer problems

Laplace transform techniques have been widely used to solve linear, transient field problems. A transform-based algorithm enables calculation of the response at selected times of interest without the need for stepping in time as required by conventional time integration schemes. The elimination of time stepping can substantially reduce computer time when transform techniques are implemented in a numerical finite element program. The coupling of transform techniques with spatial discretization techniques such as the finite element method has resulted in what are known as transfinite element methods. Recently attempts have been made to extend the transfinite element method to solve nonlinear, transient field problems. This paper examines the theoretical basis and numerical implementation of one such algorithm, applied to nonlinear heat transfer problems. The problem is linearized and solved by requiring a numerical iteration at selected times of interest. While shown to be acceptable for weakly nonlinear problems, this algorithm is ineffective as a general nonlinear solution method.

Cerro, J. A.↗
NASA NTRS2004

Fluid Structure Interaction in a Turbine Blade

An unsteady, three dimensional Navier-Stokes solution in rotating frame formulation for turbomachinery applications is presented. Casting the governing equations in a rotating frame enabled the freezing of grid motion and resulted in substantial savings in computer time. The turbine blade was computationally simulated and probabilistically evaluated in view of several uncertainties in the aerodynamic, structural, material and thermal variables that govern the turbine blade. The interconnection between the computational fluid dynamics code and finite element structural analysis code was necessary to couple the thermal profiles with the structural design. The stresses and their variations were evaluated at critical points on the Turbine blade. Cumulative distribution functions and sensitivity factors were computed for stress responses due to aerodynamic, geometric, mechanical and thermal random variables.

Gorla, Rama S. R.↗
NASA NTRS2008

Impacts of the IBM Cell Processor to Support Climate Models

NASA is interested in the performance and cost benefits for adapting its applications to the IBM Cell processor. However, its 256KB local memory per SPE and the new communication mechanism, make it very challenging to port an application. We selected the solar radiation component of the NASA GEOS-5 climate model, which: (1) is representative of column physics (approximately 50% computational time), (2) has a high computational load relative to transferring data from and to main memory, (3) performs independent calculations across multiple columns. We converted the baseline code (single-precision, Fortran) to C and ported it with manually SIMDizing 4 independent columns and found that a Cell with 8 SPEs can process 2274 columns per second. Compared with the baseline results, the Cell is approximately 5.2X, approximately 8.2X, approximately 15.1X faster than a core on Intel Woodcrest, Dempsey, and Itanium2, respectively. We believe this dramatic performance improvement makes a hybrid cluster with Cell and traditional nodes competitive.

Zhou, Shujia↗
NASA NTRS2003

Predicting Accumulations of Ice on Aerodynamic Surfaces

LEWICE is a computer program that predicts the accumulation of ice on two-dimensional aerodynamic surfaces under conditions representative of the flight of an aircraft through an icing cloud. The software first calculates the airflow surrounding the body of interest, then uses the airflow to compute the trajectories of water droplets that impinge on the surface of the body. The droplet trajectories are also used to compute impingement limits and local collection efficiencies, which are used in subsequent ice-growth calculations and are also useful for designing systems to protect against icing. Next, the software predicts the shape of accumulating ice by modeling transfers of mass and energy in small control volumes. The foregoing computations are repeated over several computational time steps until the total icing exposure time is reached. Results of computations by LEWICE have been compared with an extensive database of measured ice shapes obtained from experiments, and have been shown to closely approximate those shapes under most conditions of interest to the aviation community.

Bidwell, Colin↗
NASA NTRS2019

A Fast All-Sky Radiation Model for Solar Applications with Narrowband Irradiances on Tilted Surfaces (FARMS-NIT): Part II. The Cloudy-Sky Model

The Fast All-sky Radiation Model for Solar applications with Narrowband Irradiances on Tilted surfaces (FARMSNIT) reported in Part I of this study is enhanced to include the requirements for cloudy-sky conditions. Surface radiances in 2002 narrow-wavelength bands from 0.28 to 4.0 μm are analytically computed by solving the radiative transfer equation for five independent photon paths accounting for clear-sky absorption, Rayleigh scattering, and cloud absorption and scattering. The Simple Model of the Atmospheric Radiative Transfer of Sunshine (SMARTS) is used to provide the optical thickness of the clear-sky atmosphere. Unlike Part I, which approximates the computation of aerosol scattering using the single-scattering phase function, the cloud transmittance and reflectance are efficiently retrieved from a comprehensive look-up table pre-computed by a 32-stream DIScrete Ordinates Radiative Transfer (DISORT) model for possible cloud conditions as well as solar and viewing geometries. A resolution analysis is performed to assess the optimal balance between the computational efficiency and accuracy in the development of the look-up table. Model simulations by DISORT and TMYSPEC are used to evaluate the performance of FARMS-NIT under cloudy-sky conditions. Compared to DISORT, FARMS-NIT yields 2–3% uncertainties on average, but it substantially reduces the computational time because of the independent computation of cloud properties and the implementation of the look-up table. In contrast to TMYSPEC, which uses successive steps to empirically compute plane-of-array (POA) irradiances and spectral irradiances, FARMS-NIT directly solves spectral radiances from the radiative transfer equation, which profoundly increases the accuracy in surface irradiances, especially over inclined photovoltaics (PV) panels.

Xie, Yu↗
NASA NTRS1972

Development of equilibrium air computer programs suitable for numerical computation using time-dependent or shock-capturing methods

Computer programs were developed which compute the thermodynamic properties of equilibrium air for use in either the time-dependent or shock-capturing computational methods. For the time-dependent method, tne NASA-ARC RGAS computer program was modified to allow internal energy and density to be used as the independent variables. In addition, simplified-curve fits for p = p(e,rho), a = a(e,rho), and T = T(p,rho) were devised to reduce computer time. For the shock-capturing method a simplified curve fit for h = h(p,rho) was made. These approximate curve fits may be particularly useful when employed on advanced computers such as the Illiac 4 or the CDC Star since they avoid the cumbersome table-lookup feature of the RGAS program.

Tannehill, J. C.↗
DOE OSTI2020

Localized Exponential Time Differencing Method for Shallow Water Equations: Algorithms and Numerical Study

Here, we explore the performance of the exponential time differencing (ETD) method applied to the rotating shallow water equations. Comparing with explicit time stepping of the same order accuracy in time, the ETD algorithms could reduce the computational time in many cases by allowing the use of large time step sizes while still maintaining numerical stability. To accelerate the ETD simulations, we propose a localized approach that synthesizes the ETD method and overlapping domain decomposition. By dividing the original problem into many subdomain problems of smaller sizes and solving them locally, the proposed approach could speed up the calculation of matrix exponential vector products. Several standard test cases for shallow water equations of one or multiple layers are considered. The results show great potential of the localized ETD method for high-performance computing because each subdomain problem can be naturally solved in parallel at every time step.

58 GEOSCIENCES↗
NASA NTRS1986

New reflective symmetry design capability in the JPL-IDEAS Structure Optimization Program

The JPL-IDEAS antenna structure analysis and design optimization computer program was modified to process half structure models of symmetric structures subjected to arbitrary external static loads, synthesize the performance, and optimize the design of the full structure. Significant savings in computation time and cost (more than 50%) were achieved compared to the cost of full model computer runs. The addition of the new reflective symmetry analysis design capabilities to the IDEAS program allows processing of structure models whose size would otherwise prevent automated design optimization. The new program produced synthesized full model iterative design results identical to those of actual full model program executions at substantially reduced cost, time, and computer storage.

Strain, D.↗
NASA NTRS1999

A Parallel Compact Multi-Dimensional Numerical Algorithm with Aeroacoustics Applications

In this study we propose a novel method to parallelize high-order compact numerical algorithms for the solution of three-dimensional PDEs (Partial Differential Equations) in a space-time domain. For this numerical integration most of the computer time is spent in computation of spatial derivatives at each stage of the Runge-Kutta temporal update. The most efficient direct method to compute spatial derivatives on a serial computer is a version of Gaussian elimination for narrow linear banded systems known as the Thomas algorithm. In a straightforward pipelined implementation of the Thomas algorithm processors are idle due to the forward and backward recurrences of the Thomas algorithm. To utilize processors during this time, we propose to use them for either non-local data independent computations, solving lines in the next spatial direction, or local data-dependent computations by the Runge-Kutta method. To achieve this goal, control of processor communication and computations by a static schedule is adopted. Thus, our parallel code is driven by a communication and computation schedule instead of the usual "creative, programming" approach. The obtained parallelization speed-up of the novel algorithm is about twice as much as that for the standard pipelined algorithm and close to that for the explicit DRP algorithm.

Povitsky, Alex↗
DOE OSTI2021

A solution framework for linear PDE-constrained mixed-integer problems

Abstract We present a general numerical solution method for control problems with state variables defined by a linear PDE over a finite set of binary or continuous control variables. We show empirically that a naive approach that applies a numerical discretization scheme to the PDEs to derive constraints for a mixed-integer linear program (MILP) leads to systems that are too large to be solved with state-of-the-art solvers for MILPs, especially if we desire an accurate approximation of the state variables. Our framework comprises two techniques to mitigate the rise of computation times with increasing discretization level: First, the linear system is solved for a basis of the control space in a preprocessing step. Second, certain constraints are just imposed on demand via the IBM ILOG CPLEX feature of a lazy constraint callback. These techniques are compared with an approach where the relations obtained by the discretization of the continuous constraints are directly included in the MILP. We demonstrate our approach on two examples: modeling of the spread of wildfire and the mitigation of water contamination. In both examples the computational results demonstrate that the solution time is significantly reduced by our methods. In particular, the dependence of the computation time on the size of the spatial discretization of the PDE is significantly reduced.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1980

KU-Band rendezvous radar performance computer simulation model

The preparation of a real time computer simulation model of the KU band rendezvous radar to be integrated into the shuttle mission simulator (SMS), the shuttle engineering simulator (SES), and the shuttle avionics integration laboratory (SAIL) simulator is described. To meet crew training requirements a radar tracking performance model, and a target modeling method were developed. The parent simulation/radar simulation interface requirements, and the method selected to model target scattering properties, including an application of this method to the SPAS spacecraft are described. The radar search and acquisition mode performance model and the radar track mode signal processor model are examined and analyzed. The angle, angle rate, range, and range rate tracking loops are also discussed.

Griffin, J. W.↗
DOE OSTI2020

Methods for Explainable Artificial Intelligence

We explored ways of quantifying information in a neural network. This can be used to determine the right size of a network or to infer the way in which a network is processing information. The first year and a half was somewhat exploratory while the last half of the project focused on approaches that seemed to show the most promise. The introduce a new way of computing explainable artificial intelligence (XAI) saliency maps that is several orders of magnitude faster than methods with similar fidelity We call it FastCAM. The method works be combining a Class Activation Map (CAM) method such as GradCAM with a forward activation map computed with a statistic we call SMOE Scale. The addition of the forward activation maps to CAM methods seems to always improve their fidelity. At the same time, computational overhead is not increased by very much. While Gradients with SmoothGrad scores better on some fidelity measures, it is overall not as good and requires more than 1500 times to compute. We demonstrate two completed applications of FastCAM on tasks outside of the LDRD at LLNL. The source code for FastCAM is currently being implanted into Captum, the official XAI toolkit for the popular deep learning toolkit PyTorch. The LDRD currently has 13 publications released to the public. 10 of them are journal length.

97 MATHEMATICS AND COMPUTING↗