SEARCH · Engineering Papers

Results for “Grid 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 1,729 records · Page 96

All sources NASA NTRS DOE OSTI

NASA NTRS1993

A ground track control algorithm for the Topographic Mapping Laser Altimeter (TMLA)

The results of an analysis of an algorithm that will provide autonomous onboard orbit control using orbits determined with Global Positioning System (GPS) data. The algorithm uses the GPS data to (1) compute the ground track error relative to a fixed longitude grid, and (2) determine the altitude adjustment required to correct the longitude error. A program was written on a personal computer (PC) to test the concept for numerous altitudes and values of solar flux using a simplified orbit model including only the J sub 2 zonal harmonic and simple orbit decay computations. The algorithm was then implemented in a precision orbit propagation program having a full range of perturbations. The analysis showed that, even with all perturbations (including actual time histories of solar flux variation), the algorithm could effectively control the spacecraft ground track and yield more than 99 percent Earth coverage in the time required to complete one coverage cycle on the fixed grid (220 to 230 days depending on altitude and overlap allowance).

Blaes, V.↗

NASA NTRS1990

An adaptive grid algorithm for one-dimensional nonlinear equations

Richards' equation, which models the flow of liquid through unsaturated porous media, is highly nonlinear and difficult to solve. Step gradients in the field variables require the use of fine grids and small time step sizes. The numerical instabilities caused by the nonlinearities often require the use of iterative methods such as Picard or Newton interation. These difficulties result in large CPU requirements in solving Richards equation. With this in mind, adaptive and multigrid methods are investigated for use with nonlinear equations such as Richards' equation. Attention is focused on one-dimensional transient problems. To investigate the use of multigrid and adaptive grid methods, a series of problems are studied. First, a multigrid program is developed and used to solve an ordinary differential equation, demonstrating the efficiency with which low and high frequency errors are smoothed out. The multigrid algorithm and an adaptive grid algorithm is used to solve one-dimensional transient partial differential equations, such as the diffusive and convective-diffusion equations. The performance of these programs are compared to that of the Gauss-Seidel and tridiagonal methods. The adaptive and multigrid schemes outperformed the Gauss-Seidel algorithm, but were not as fast as the tridiagonal method. The adaptive grid scheme solved the problems slightly faster than the multigrid method. To solve nonlinear problems, Picard iterations are introduced into the adaptive grid and tridiagonal methods. Burgers' equation is used as a test problem for the two algorithms. Both methods obtain solutions of comparable accuracy for similar time increments. For the Burgers' equation, the adaptive grid method finds the solution approximately three times faster than the tridiagonal method. Finally, both schemes are used to solve the water content formulation of the Richards' equation. For this problem, the adaptive grid method obtains a more accurate solution in fewer work units and less computation time than required by the tridiagonal method. The performance of the adaptive grid method tends to degrade as the solution process proceeds in time, but still remains faster than the tridiagonal scheme.

Gutierrez, William E.↗

NASA NTRS2003

Active Control of F/A-18 Vertical Tail Buffeting using Piezoelectric Actuators

Vertical tail buffeting is a serious multidisciplinary problem that limits the performance of twin-tail fighter aircraft. The buffet problem occurs at high angles of attack when the vortical flow breaks down ahead of the vertical tails resulting in unsteady and unbalanced pressure loads on the vertical tails. This paper describes a multidisciplinary computational investigation for buffet load alleviation of full F/A-18 aircraft using distributed piezoelectric actuators. The inboard and outboard surfaces of the vertical tail are equipped with piezoelectric actuators to control the buffet responses in the first bending and torsion modes. The electrodynamics of the smart structure are expressed with a three-dimensional finite element model. A single-input-single-output controller is designed to drive the active piezoelectric actuators. High-fidelity multidisciplinary analysis modules for the fluid dynamics, structure dynamics, electrodynamics of the piezoelectric actuators, fluid-structure interfacing, and grid motion are integrated into a multidisciplinary computing environment that controls the temporal synchronization of the analysis modules. Peak values of the power spectral density of tail tip acceleration are reduced by as much as 22% in the first bending mode and by as much as 82% in the first torsion mode. RMS values of tip acceleration are reduced by as much as 12%.

Sheta, Essam F.↗

DOE OSTI2024

Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation

Multiple tensor-times-matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimensional data analysis. Here, we establish communication lower bounds that determine how much data movement is required (under mild conditions) to perform the Multi-TTM computation in parallel. The crux of the proof relies on analytically solving a constrained, nonlinear optimization problem. We also present a parallel algorithm to perform this computation that organizes the processors into a logical grid with twice as many modes as the input tensor. We show that, with correct choices of grid dimensions, the communication cost of the algorithm attains the lower bounds and is therefore communication optimal. Finally, we show that our algorithm can significantly reduce communication compared to the straightforward approach of expressing the computation as a sequence of tensor-times-matrix operations when the input and output tensors vary greatly in size.

HBL-inequalities↗

NASA NTRS2002

Assessment of the Unstructured Grid Software TetrUSS for Drag Prediction of the DLR-F4 Configuration

An application of the NASA unstructured grid software system TetrUSS is presented for the prediction of aerodynamic drag on a transport configuration. The paper briefly describes the underlying methodology and summarizes the results obtained on the DLR-F4 transport configuration recently presented in the first AIAA computational fluid dynamics (CFD) Drag Prediction Workshop. TetrUSS is a suite of loosely coupled unstructured grid CFD codes developed at the NASA Langley Research Center. The meshing approach is based on the advancing-front and the advancing-layers procedures. The flow solver employs a cell-centered, finite volume scheme for solving the Reynolds Averaged Navier-Stokes equations on tetrahedral grids. For the present computations, flow in the viscous sublayer has been modeled with an analytical wall function. The emphasis of the paper is placed on the practicality of the methodology for accurately predicting aerodynamic drag data.

Pirzadeh, Shahyar Z.↗

NASA NTRS1997

Tetrahedral and Hexahedral Mesh Adaptation for CFD Problems

This paper presents two unstructured mesh adaptation schemes for problems in computational fluid dynamics. The procedures allow localized grid refinement and coarsening to efficiently capture aerodynamic flow features of interest. The first procedure is for purely tetrahedral grids; unfortunately, repeated anisotropic adaptation may significantly deteriorate the quality of the mesh. Hexahedral elements, on the other hand, can be subdivided anisotropically without mesh quality problems. Furthermore, hexahedral meshes yield more accurate solutions than their tetrahedral counterparts for the same number of edges. Both the tetrahedral and hexahedral mesh adaptation procedures use edge-based data structures that facilitate efficient subdivision by allowing individual edges to be marked for refinement or coarsening. However, for hexahedral adaptation, pyramids, prisms, and tetrahedra are used as buffer elements between refined and unrefined regions to eliminate hanging vertices. Computational results indicate that the hexahedral adaptation procedure is a viable alternative to adaptive tetrahedral schemes.

Biswas, Rupak↗

NASA NTRS1974

A rapid numerical solution to subsonic flow over planar and axisymmetric profiles at an angle of attack of 0 deg

A numerical solution is presented for the incompressible flow over thin planar and axisymmetric profiles at an angle of attack of 0 degrees. The method uses a finite-difference field solution to the governing equation with a Gauss-Seidel successive overrelaxation scheme. However, the use of a simple Cartesian grid system restricts this method to slender profiles. Results are presented for a cambered airfoil, airfoil in wall effect (two-dimensional flowthrough inlet), body of revolution, and flowthrough nacelle. A computer program is presented which can be used for any of the previously mentioned cases with simple input changes. Results for compressible flow are available with the use of the appropriate two-dimensional or axisymmetric compressibility corrections. Computational time for a typical field calculation of 3000 grid points and 200 cycles through the field is less than 1 minute with less than 50,000 octal storage on the Control Data Corporation 6600 computing system.

Mascitti, V. R.↗

DOE OSTI2020

Scalable implementation of polynomial filtering for density functional theory calculation in PARSEC

In this work, we present an efficient implementation of polynomial filtering methods in PARSEC, a real-space pseudopotential based Kohn–Sham density functional theory solver. The implementation described here improves upon a Chebyshev-filtered subspace iteration algorithm used in the previous version of PARSEC. We present a hybrid polynomial filtering scheme that combines Chebyshev-filtered subspace iteration and a spectrum slicing method that partitions the spectrum into several spectral slices and uses bandpass-filtered subspace iteration to compute approximate eigenpairs within each interior slice simultaneously. We describe a procedure to partition a spectrum and construct polynomial filters. We also discuss a number of practical issues such as the use of appropriate data layouts for carrying out the computation on a two-dimensional process grid and how to achieve good load balance by allocating an appropriate number of process groups to each spectral slice. Numerical examples are presented to demonstrate the effectiveness of the hybrid polynomial filtering method as well as the superior parallel scalability of spectrum slicing in comparison to that of Chebyshev-filtered subspace iteration.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

An Integrated Platform for Wind Power Plant Operations: From Atmosphere to Electrons to the Grid (A2e2g)

The research objective for the Atmosphere to Electrons to the Grid (A2e2g) project was to design a platform that merges forecasting tools with aerodynamic and economic models. The value proposition is that expanding wind power plant operation to include grid services allows those plants to operate in markets for grid services as well as energy markets, increasing revenue streams for wind plant operators while contributing to reliable grid operation.

17 WIND ENERGY↗

NASA NTRS1996

Multigrid, Fractional-Step Computation Of Flow

Speed of computer code solving three-dimensional Navier-Stokes equations of flow of incompressible fluid by fractional-step method increased significantly by use of multigrid procedures. In method, equations solved on general nonorthogonal curvilinear coordinate grid, using volume fluxes. At each time step, computations performed in two fractional steps. In first step, equations of conservation of momentum solved by use of gradient of pressure from previous time step via explicit approximate-factorization method, yielding approximate flow field that does not satisfy equation of conservation of mass. In second step, discrete Poisson-like equation with Neumann-type boundary conditions, formed by combining equations of conservation of momentum and mass, solved iteratively.

Kwak, Dochan↗

NASA NTRS2003

Three-Dimensional Turbulent RANS Adjoint-Based Error Correction

Engineering problems commonly require functional outputs of computational fluid dynamics (CFD) simulations with specified accuracy. These simulations are performed with limited computational resources. Computable error estimates offer the possibility of quantifying accuracy on a given mesh and predicting a fine grid functional on a coarser mesh. Such an estimate can be computed by solving the flow equations and the associated adjoint problem for the functional of interest. An adjoint-based error correction procedure is demonstrated for transonic inviscid and subsonic laminar and turbulent flow. A mesh adaptation procedure is formulated to target uncertainty in the corrected functional and terminate when error remaining in the calculation is less than a user-specified error tolerance. This adaptation scheme is shown to yield anisotropic meshes with corrected functionals that are more accurate for a given number of grid points then isotropic adapted and uniformly refined grids.

Park, Michael A.↗

NASA NTRS2004

Packaging data products using data grid middleware for Deep Space Mission Systems

We are investigating a distributed computing infrastructure for releasing science products out of the mission pipeline. We are creating a DSMS Product Service and DSMS Data Packaging Service based on the OODT middleware, a Data Grid middleware technology that has proven successful in providing access to heterogeneous, disparate data, and federating that data using a common data model.

Deep Space Mission Systems↗

DOE OSTI2026

Integrating AI Data Centers with the Power Grid

The rapid expansion of artificial intelligence (AI) has triggered an unprecedented surge in electricity demand, with US data center energy use projected to double or triple 2023 levels by 2028. This exponential growth places strain on grid infrastructure, which can hinder timely construction of desired computing capacity. To bridge this supply-demand gap, utilities and AI developers are increasingly turning to demand flexibility, a strategy that incentivizes shifting or reducing power use during peak periods of grid stress. Data centers are uniquely equipped for flexible operations due to their digital workloads, built-in redundancy, and onsite energy assets. This article outlines four primary mechanisms to enable data center flexibility: computational load flexibility (shifting tasks temporally or geographically), flexible use of core facility infrastructure adjustments, energy storage utilization, and onsite electricity generation. To encourage adoption, utilities are deploying new tariff designs, including voluntary interruptible service riders, mandated flexibility requirements, and streamlined interconnection processes for flexible loads. For the highly capitalized and rapidly growing AI industry, the primary motivators for embracing these strategies are expediting facility interconnection, satisfying emerging regulatory mandates, and mitigating community resistance. While demand flexibility cannot substitute the long-term need for new bulk power generation, it serves as an essential, immediate solution for enabling near-term deployment. By transforming data centers from grid stressors into stabilizing assets, flexible operations can ensure reliable grid integration, ease market pressures, and support a resilient power system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2020

Axisymmetric hydrodynamics in numerical relativity using a multipatch method

In this paper, we describe a method of implementing the axisymmetric evolution of general-relativistic hydrodynamics and magnetohydrodynamics through modification of a multipatch grid scheme. In order to ease the computational requirements required to evolve the post-merger phase of systems involving binary compact massive objects in numerical relativity, it is often beneficial to take advantage of these system's tendency to rapidly settle into states that are nearly axisymmetric, allowing for 2D evolution of secular timescales. We implement this scheme in the spectral Einstein code and show the results of application of this method to four test systems including viscosity, magnetic fields, and neutrino radiation transport. Our results show that this method can be used to quickly allow already existing 3D infrastructure that makes use of local coordinate system transformations to be made to run in axisymmetric 2D with the flexible grid creation capabilities of multipatch methods. Our code tests include a simple model of a binary neutron star postmerger remnant, for which we confirm the formation of a massive torus which is a promising source of post-merger ejecta.

79 ASTRONOMY AND ASTROPHYSICS↗

NASA NTRS1991

Interactive surface grid generation

This paper describes a surface grid generation tool called S3D. It is the result of integrating a robust and widely applicable interpolation technique with the latest in workstation technology. Employing the use of a highly efficient and user-friendly graphical interface, S3D permits real-time interactive analyses of surface geometry data and facilitates the construction of surface grids for a wide range of applications in Computational Fluid Dynamics (CFD). The design objectives are for S3D to be stand-alone and easy to use so that CFD analysts can take a hands-on approach toward most if not all of their surface grid generation needs. Representative examples of S3D applications are presented in describing the various elements involved in the process.

Luh, Raymond Ching-Chung↗

NASA NTRS2020

An Examination of the Impact of Grid Spacing on WRF Simulations of Wintertime Precipitation in the Mid-Atlantic United States

A large set of deterministic and ensemble forecasts was produced to identify the optimal spacing for forecasting U.S. East Coast snowstorms. WRF forecasts were produced on cloud-allowing (~1-km grid spacing) and convection-allowing (3–4 km) grids, and compared against forecasts with parameterized convection (>~10 km). Performance diagrams were used to evaluate 19 deterministic forecasts from the winter of 2013–14. Ensemble forecasts of five disruptive snowstorms spanning the years 2015–18 were evaluated using various methods to evaluate probabilistic forecasts. While deterministic forecasts using cloud-allowing grids were not better than convection-allowing forecasts, both had lower bias and higher success ratios than forecasts with parameterized convection. All forecasts were underdispersive. Nevertheless, forecasts on the higher-resolution grids were more reliable than those with parameterized convection. Forecasts on the cloud-allowing grid were best able to discriminate areas that received heavy snow and those that did not, while the forecasts with parameterized convection were least able to do so. It is recommended to use convection-resolving and (if computationally possible) to use cloud-allowing forecast grids when predicting East Coast winter storms.

Snowstorms↗

NASA NTRS1984

Multi-grid technique for the solution of incompressible Navier-Stokes equations

A computationally efficient method is proposed for obtaining fine-mesh solutions of the Navier-Stokes equations for high-Re flow, including separation. The method involves implementing a multi-grid solution procedure with suitably chosen elements, such that the resulting overall solution technique is efficient as well as robust. The robustness and efficiency of the solution technique are demonstrated by applying it to three model problems: flow in a driven cavity, downstream asymptotic flow in curved ducts of square and polar sections, and Newmann boundary-value problem in clustered curvilinear orthogonal coordinates.

Ghia, K. N.↗

NASA NTRS1993

A Fine-Grid Model for the ASRM Aft Segment with Gimballed Nozzle

Results from computational fluid dynamic analyses for complex three-dimensional internal flows in the Advanced Solid Rocket Motor (ASRM) are presented. In particular, flow visualization and tabulated results from a fine-grid model consisting of 1.5 M grid points for the ASRM Aft Segment at the l9-second burn time with an 8-degree nozzle gimbal angle are shown. The results from this model will enable characterization of various aspects of the ASRM internal environment, and in particular will allow an assessment of the heat transfer and stresses exerted on the submerged nozzle, casing insulation, and nozzle case joint.

Reske, Edward J.↗