Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “unstructured”

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 919 records · Page 51

Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems

Dynamic mesh adaption on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load imbalance among processors on a parallel machine. This paper describes the parallel implementation of a tetrahedral mesh adaption scheme and a new global load balancing method. A heuristic remapping algorithm is presented that assigns partitions to processors such that the redistribution cost is minimized. Results indicate that the parallel performance of the mesh adaption code depends on the nature of the adaption region and show a 35.5X speedup on 64 processors of an SP2 when 35% of the mesh is randomly adapted. For large-scale scientific computations, our load balancing strategy gives almost a sixfold reduction in solver execution times over non-balanced loads. Furthermore, our heuristic remapper yields processor assignments that are less than 3% off the optimal solutions but requires only 1% of the computational time.

Biswas, Rupak↗

Practical Aspects of Krylov Subspace Iterative Methods in CFD

Implementation issues associated with the application of Krylov subspace iterative methods, such as Newton-GMRES, are presented within the framework of practical computational fluid dynamic (CFD) applications. This paper categorizes, evaluates, and contrasts the major ingredients (function evaluations, matrix-vector products, and preconditioners) of Newton-GMRES Krylov subspace methods in terms of their effect on the local linear and global nonlinear convergence, memory requirements, and accuracy. The discussion focuses on Newton-GMRES in both a structured multi-zone incompressible Navier-Stokes solver and an unstructured mesh finite-volume Navier-Stokes solver. Approximate versus exact matrix-vector products, effective preconditioners, and other pertinent issues are addressed.

Pulliam, Thomas H.↗

Computational Study of a McDonnell Douglas Single-Stage-to-Orbit Vehicle Concept for Aerodynamic Analysis

This paper presents the results of a computational flow analysis of the McDonnell Douglas single-stage-to-orbit vehicle concept designated as the 24U. This study was made to determine the aerodynamic characteristics of the vehicle with and without body flaps over an angle of attack range of 20-40 deg. Computations were made at a flight Mach number of 20 at 200,000 ft. altitude with equilibrium air, and a Mach number of 6 with CF4 gas. The software package FELISA (Finite Element Langley imperial College Sawansea Ames) was used for all the computations. The FELISA software consists of unstructured surface and volume grid generators, and inviscid flow solvers with (1) perfect gas option for subsonic, transonic, and low supersonic speeds, and (2) perfect gas, equilibrium air, and CF4 options for hypersonic speeds. The hypersonic flow solvers with equilibrium air and CF4 options were used in the present studies. Results are compared with other computational results and hypersonic CF4 tunnel test data.

Prabhu, Ramadas K.↗

A Genuinely Two-Dimensional Scheme for the Compressible Euler Equations

We present a new genuinely multidimensional discretization for the compressible Euler equations. It is the only high-resolution scheme known to us where Gauss-Seidel relaxation is stable when applied as a smoother directly to the resulting high-resolution scheme. This allows us to construct a very simple and highly efficient multigrid steady-state solver. The scheme is formulated on triangular (possibly unstructured) meshes.

Sidilkover, David↗

An Algebraic Multigrid Solver for Navier-Stokes Problems in the Discrete Second-Order Approximation

An algebraic multigrid scheme is presented for solving the discrete Navier-Stokes equations to second-order accuracy using the defect-correction method. Solutions have been obtained for problems involving both structured and unstructured meshes, with the resolution and resolution grading controlled by global and local mesh refinements. The solver is efficient and robust to the extent that no underrelaxation of variables has been required to ensure convergence, but rates of convergence can be improved with small amounts of underrelaxation of the velocity-pressure coupling. Provided that the computational mesh can resolve the flow field, convergence characteristics are almost mesh independent. Rates of convergence actually improve with refinement, asymptotically approaching mesh independent values. For extremely coarse meshes where dispersive truncation errors would be expected to prevent convergence (or even induce divergence), solutions can still be obtained by using explicit underrelaxation in the iterative cycle.

Webster, R.↗

Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems

Dynamic mesh adaptation on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load inbalances among processors on a parallel machine. This paper described the parallel implementation of a tetrahedral mesh adaption scheme and a new global load balancing method. A heuristic remapping algorithm is presented that assigns partitions to processors such that the redistribution coast is minimized. Results indicate that the parallel performance of the mesh adaption code depends on the nature of the adaption region and show a 35.5X speedup on 64 processors of an SP2 when 35 percent of the mesh is randomly adapted. For large scale scientific computations, our load balancing strategy gives an almost sixfold reduction in solver execution times over non-balanced loads. Furthermore, our heuristic remappier yields processor assignments that are less than 3 percent of the optimal solutions, but requires only 1 percent of the computational time.

Biswas, Rupak↗

Research in Parallel Algorithms and Software for Computational Aerosciences

Phase 1 is complete for the development of a computational fluid dynamics CFD) parallel code with automatic grid generation and adaptation for the Euler analysis of flow over complex geometries. SPLITFLOW, an unstructured Cartesian grid code developed at Lockheed Martin Tactical Aircraft Systems, has been modified for a distributed memory/massively parallel computing environment. The parallel code is operational on an SGI network, Cray J90 and C90 vector machines, SGI Power Challenge, and Cray T3D and IBM SP2 massively parallel machines. Parallel Virtual Machine (PVM) is the message passing protocol for portability to various architectures. A domain decomposition technique was developed which enforces dynamic load balancing to improve solution speed and memory requirements. A host/node algorithm distributes the tasks. The solver parallelizes very well, and scales with the number of processors. Partially parallelized and non-parallelized tasks consume most of the wall clock time in a very fine grain environment. Timing comparisons on a Cray C90 demonstrate that Parallel SPLITFLOW runs 2.4 times faster on 8 processors than its non-parallel counterpart autotasked over 8 processors.

Domel, Neal D.↗

Flows in Pinned Arrays Simulating Brush Seals

Flows through idealized pin arrays were investigated using an unstructured grid finite difference model and the simplified Ergun model to predict leakage flows and pressure drops in brush seals. The models are in good agreement in the laminar region with departures in the laminar-turbulent transition region defined by the simplified Ergun model. No local disturbances in the velocity or pressure fields, symptomatic of turbulence were found in the numerical results. The simplified model failed to predict the pressure drop of a 32-pin anisotropic array. Transitional and anisotropic behavior requires

Hendricks, R.C.↗

Sensitivity Analysis and Optimization of Aerodynamic Configurations with Blend Surfaces

A novel (geometrical) parametrization procedure using solutions to a suitably chosen fourth order partial differential equation is used to define a class of airplane configurations. Inclusive in this definition are surface grids, volume grids, and grid sensitivity. The general airplane configuration has wing, fuselage, vertical tail and horizontal tail. The design variables are incorporated into the boundary conditions, and the solution is expressed as a Fourier series. The fuselage has circular cross section, and the radius is an algebraic function of four design parameters and an independent computational variable. Volume grids are obtained through an application of the Control Point Form method. A graphic interface software is developed which dynamically changes the surface of the airplane configuration with the change in input design variable. The software is made user friendly and is targeted towards the initial conceptual development of any aerodynamic configurations. Grid sensitivity with respect to surface design parameters and aerodynamic sensitivity coefficients based on potential flow is obtained using an Automatic Differentiation precompiler software tool ADIFOR. Aerodynamic shape optimization of the complete aircraft with twenty four design variables is performed. Unstructured and structured volume grids and Euler solutions are obtained with standard software to demonstrate the feasibility of the new surface definition.

Thomas, A. M.↗

Optimal and robust control of transition

Optimal and robust control theories are used to determine feedback control rules that effectively stabilize a linearly unstable flow in a plane channel. Wall transpiration (unsteady blowing/suction) with zero net mass flux is used as the control. Control algorithms are considered that depend both on full flowfield information and on estimates of that flowfield based on wall skin-friction measurements only. The development of these control algorithms accounts for modeling errors and measurement noise in a rigorous fashion; these disturbances are considered in both a structured (Gaussian) and unstructured ('worst case') sense. The performance of these algorithms is analyzed in terms of the eigenmodes of the resulting controlled systems, and the sensitivity of individual eigenmodes to both control and observation is quantified.

Bewley, T. R.↗

Efficient Load Balancing and Data Remapping for Adaptive Grid Calculations

Mesh adaption is a powerful tool for efficient unstructured- grid computations but causes load imbalance among processors on a parallel machine. We present a novel method to dynamically balance the processor workloads with a global view. This paper presents, for the first time, the implementation and integration of all major components within our dynamic load balancing strategy for adaptive grid calculations. Mesh adaption, repartitioning, processor assignment, and remapping are critical components of the framework that must be accomplished rapidly and efficiently so as not to cause a significant overhead to the numerical simulation. Previous results indicated that mesh repartitioning and data remapping are potential bottlenecks for performing large-scale scientific calculations. We resolve these issues and demonstrate that our framework remains viable on a large number of processors.

Oliker, Leonid↗

Annual Research Briefs - 1996, Center for Turbulence Research

Partial contents include: (1) Simulation of jet impingement heat transfer with the k-e-V2 model; (2) A new methodology for turbulence modelers using Direct Numerical Simulation (DNS) database analysis; (3) A particle representation model for the deformation of homogeneous turbulence; (4) Modeling of inhomogeneous compressible turbulence using a two-scale statistical theory; (5) Lewis number effects on partially premixed flames; (6) Conditional moment closure of mixing and reaction in turbulent non-premixed combustion; (7) Dynamic models for LES of turbulent front propagation with a spectral method; (8) Jet noise using large eddy simulation; (9) Towards numerical simulations of trailing-edge aeroacoustics; (10) A model for the onset of vortex breakdown; (11) Compressing an elliptic vortex: transition to turbulence by tumble breakdown; (12) A new method for the adaptive control of vortex-wall interactions; (13) Symmetries in turbulent boundary layer flows; (14) Near-wall models in large eddy simulations of flow behind a backward-facing step; (15) Assessment of the subgrid-scale models at low and high Reynolds numbers; (16) Large-eddy simulations of flow around a NACA 4412 airfoil using unstructured grids; (17) Progress on LES of flow past a circular cylinder; (18) Experimental investigation of flow through an asymmetric plane diffuser; (19) Progress in the large-eddy simulation of an asymmetric plane diffuser; (20) A numerical study of self-similarity in a turbulent plane wake using large-eddy simulation; (21) On the generation of turbulent inflow conditions for boundary layer simulations, and (22) A new class of finite difference schemes.

COMPUTATIONAL FLUID DYNAMICS↗

HARP: A Dynamic Inertial Spectral Partitioner

Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (RSB), have proven effecfive in generating high-quality partitions of realistically-sized meshes. The major problem which hindered their wide-spread use was their long execution times. This paper presents a new inertial spectral partitioner, called HARP. The main objective of the proposed approach is to quickly partition the meshes at runtime in a manner that works efficiently for real applications in the context of distributed-memory machines. The underlying principle of HARP is to find the eigenvectors of the unpartitioned vertices and then project them onto the eigerivectors of the original mesh. Results for various meshes ranging in size from 1000 to 100,000 vertices indicate that HARP can indeed partition meshes rapidly at runtime. Experimental results show that our largest mesh can be partitioned sequentially in only a few seconds on an SP2 which is several times faster than other spectral partitioners while maintaining the solution quality of the proven RSB method. A parallel WI version of HARP has also been implemented on IBM SP2 and Cray T3E. Parallel HARP, running on 64 processors SP2 and T3E, can partition a mesh containing more than 100,000 vertices into 64 subgrids in about half a second. These results indicate that graph partitioning can now be truly embedded in dynamically-changing real-world applications.

Simon, Horst D.↗

Three-Dimensional Multiscale MHD Model of Cometary Plasma Environments

First results of a three-dimensional multiscale MHD model of the interaction of an expanding cometary atmosphere with the magnetized solar wind are presented. The model starts with a supersonic and super-Alfvenic solar wind far upstream of the comet (25 Gm upstream of the nucleus) with arbitrary interplanetary magnetic field orientation. The solar wind is continuously mass loaded with cometary ions originating from a 10-km size nucleus. The effects of photoionization, electron impact ionization, recombination, and ion-neutral frictional drag are taken into account in the model. The governing equations are solved on an adaptively refined unstructured Cartesian grid using our new multiscale upwind scalar conservation laws-type numerical technique (MUSCL). We have named this the multiscale adaptive upwind scheme for MHD (MAUS-MHD). The combination of the adaptive refinement with the MUSCL-scheme allows the entire cometary atmosphere to be modeled, while still resolving both the shock and the diamagnetic cavity of the comet. The main findings are the following: (1) Mass loading decelerates the solar wind flow upstream of the weak cometary shock wave (M approximately equals 2, M(sub A) approximately equals 2), which forms at a subsolar standoff distance of about 0.35 Gm. (2) A cometary plasma cavity is formed at around 3 x 10(exp 3) km from the nucleus. Inside this cavity the plasma expands outward due to the frictional interaction between ions and neutrals. On the nightside this plasma cavity considerably narrows and a relatively fast and dense cometary plasma beam is ejected into the tail. (3) Inside the plasma cavity a teardrop-shaped inner shock is formed, which is terminated by a Mach disk on the nightside. Only the region inside the inner shock is the 'true' diamagnetic cavity. (4) The model predicts four distinct current systems in the inner coma: the density peak current, the cavity boundary current, the inner shock current, and finally the cross-tail current. (5) The calculated plasma parameters (magnetic field, plasma density, speed, and temperature) are in very good agreement with published Giotto observations.

Gombosi, Tamas I.↗

A Least-Squares Finite Element Method for Electromagnetic Scattering Problems

The least-squares finite element method (LSFEM) is applied to electromagnetic scattering and radar cross section (RCS) calculations. In contrast to most existing numerical approaches, in which divergence-free constraints are omitted, the LSFF-M directly incorporates two divergence equations in the discretization process. The importance of including the divergence equations is demonstrated by showing that otherwise spurious solutions with large divergence occur near the scatterers. The LSFEM is based on unstructured grids and possesses full flexibility in handling complex geometry and local refinement Moreover, the LSFEM does not require any special handling, such as upwinding, staggered grids, artificial dissipation, flux-differencing, etc. Implicit time discretization is used and the scheme is unconditionally stable. By using a matrix-free iterative method, the computational cost and memory requirement for the present scheme is competitive with other approaches. The accuracy of the LSFEM is verified by several benchmark test problems.

Wu, Jie↗

Turbine blade tip/outer airseal/platform flow analysis

The interaction between the main passage flow through a high pressure turbine and the secondary flows due to leakage through the wheelspace rim seals is reviewed. Various experimental and analytical studies of these interactions are outlined and a numerical investigation of the interaction between the main passage flow and a wheelspace cavity seal flow is described. The numerical investigation uses a structured grid method to study the overall interaction between the turbine stage components and the wheelspace seal flow, and an unstructured grid method to resolve the detailed flow features within the geometrically complex cavity seal. The numerical results agree with various observations from experimental studies under similar flow conditions. As the flow rate through the rim cavity seal is increased, the ingestion of fluid from the main passage flow into the rim seal area decreases rapidly. A small amount of main flow gas is ingested into the rim seal area, even at high seal flow rates.

Hah, C.↗

Homotopy Algorithm for Fixed Order Mixed H2/H(infinity) Design

Recent developments in the field of robust multivariable control have merged the theories of H-infinity and H-2 control. This mixed H-2/H-infinity compensator formulation allows design for nominal performance by H-2 norm minimization while guaranteeing robust stability to unstructured uncertainties by constraining the H-infinity norm. A key difficulty associated with mixed H-2/H-infinity compensation is compensator synthesis. A homotopy algorithm is presented for synthesis of fixed order mixed H-2/H-infinity compensators. Numerical results are presented for a four disk flexible structure to evaluate the efficiency of the algorithm.

Whorton, Mark↗

Research in Computational Aeroscience Applications Implemented on Advanced Parallel Computing Systems

Improving the numerical linear algebra routines for use in new Navier-Stokes codes, specifically Tim Barth's unstructured grid code, with spin-offs to TRANAIR is reported. A fast distance calculation routine for Navier-Stokes codes using the new one-equation turbulence models is written. The primary focus of this work was devoted to improving matrix-iterative methods. New algorithms have been developed which activate the full potential of classical Cray-class computers as well as distributed-memory parallel computers.

Wigton, Larry↗