Search NASA⌕ Search

Engineering topics

Aftosmis, M. J.

Publications and source records attributed to Aftosmis, M. J..

Analysis of Potentially Hazardous Asteroids

The National Aeronautics and Space Administration initiated a new project focused on Planetary Defense on October 1, 2014. The new project is funded by NASAs Near Earth Object Program (Lindley Johnson, Program Executive). This presentation describes the objectives, functions and plans of four tasks encompassed in the new project and their inter-relations. Additionally, this project provides for outreach to facilitate partnerships with other organizations to help meet the objectives of the planetary defense community. The four tasks are (1) Characterization of Near Earth Asteroids, (2) Physics-Based Modeling of Meteor Entry and Breakup (3) Surface Impact Modeling and (4) Physics-Based Impact Risk Assessment.

Asteroids↗

Overview of a New NASA Activity Focused on Planetary Defense

The National Aeronautics and Space Administration (NASA) has initiated a new Planetary Defense research activity, led by the NASA Ames Research Center. The objective of the effort is to provide tools for reliably assessing the impact damage that Potentially Hazardous Asteroids (PHAs) could inflict on the Earth. This research will support decisions regarding appropriate mitigation action in the event that an impact threat is discovered. The activity includes four interrelated tasks: PHA characterization, physics-based simulations of atmospheric entry/breakup, simulations of surface damage due to airbursts, land impacts, or tsunamis, and an integrated assessment of the overall risks posed by potential PHA strikes. This paper outlines the objectives, research approaches, products, and interrelations of the activity’s four tasks, and presents an overview of their current progress and preliminary results. Companion papers in this conference provide additional details of the work in the four task areas.

Arnold, J. O.↗

Overview of a New NASA Activity Focused on Planetary Defense

The National Aeronautics and Space Administration (NASA) has initiated a new Planetary Defense research activity, led by the NASA Ames Research Center. The objective of the effort is to provide tools for reliably assessing the impact damage that Potentially Hazardous Asteroids (PHAs) could inflict on the Earth. This research will support decisions regarding appropriate mitigation action in the event that an impact threat is discovered. The activity includes four interrelated tasks: PHA characterization, physics-based simulations of atmospheric entry breakup, simulations of surface damage due to airbursts, land impacts, or tsunamis, and an integrated assessment of the overall risks posed by potential PHA strikes. This paper outlines the objectives, research approaches, products, and interrelations of the activity's four tasks, and presents an overview of their current progress and preliminary results. Companion papers in this conference provide additional details of the work in the four task areas.

Arnold, J. O.↗

Red Dragon: Low-cost Access to the Surface of Mars using Commercial Capabilities

We will discuss the feasibility of using a minimally-modified variant of a SpaceX Dragon capsule as a low-cost, large-capacity, near-term, Mars lander for scientific and human-precursor missions. We have been evaluating such a Red Dragon platform as an option for a Discovery Program mission concept. A Red Dragon lander has the potential to be low cost primarily because it would be derived from a routinely-flying spacecraft. Dragon is being developed to ferry cargo and crew to and from the International Space Station (ISS). The cargo variant is currently undergoing test flights, which will be followed by standard ISS cargo missions and, eventually, crewed flights. The human variant, unlike other Earth-return vehicles, appears to also have most of the capabilities necessary to land on Mars. In particular, it has a set of high-thrust, throttleable, storable bi-propellant Super- Draco engines integrated directly into the capsule which are intended for launch abort and powered landings on Earth. These thrusters suggest the possibility of a parachute-free, fully-propulsive deceleration at Mars from supersonic speeds to the surface. Concepts for large, human-relevant landers (see, e.g., [1]) also often employ supersonic retro-propulsion; Red Dragon's entry, descent, and landing approach would scale to those landers. Further, SpaceX's Falcon Heavy launch vehicle, currently under development and expected to have its first flight in 2013, will be capable of sending Dragon on a trajectory to Mars. We will discuss our motivation for exploring a Red Dragon lander, the primary technical questions which determine its feasibility, and the current results of our analysis. In particular, we will examine entry, descent, and landing (EDL) in detail. We will describe the modifications to Dragon necessary for interplanetary cruise, EDL, and operations on the Martian surface.

Karcz, John↗

On the Use of CAD and Cartesian Methods for Aerodynamic Optimization

The objective for this paper is to present the development of an optimization capability for Curt3D, a Cartesian inviscid-flow analysis package. We present the construction of a new optimization framework and we focus on the following issues: 1) Component-based geometry parameterization approach using parametric-CAD models and CAPRI. A novel geometry server is introduced that addresses the issue of parallel efficiency while only sparingly consuming CAD resources; 2) The use of genetic and gradient-based algorithms for three-dimensional aerodynamic design problems. The influence of noise on the optimization methods is studied. Our goal is to create a responsive and automated framework that efficiently identifies design modifications that result in substantial performance improvements. In addition, we examine the architectural issues associated with the deployment of a CAD-based approach in a heterogeneous parallel computing environment that contains both CAD workstations and dedicated compute engines. We demonstrate the effectiveness of the framework for a design problem that features topology changes and complex geometry.

Nemec, M.↗

Applications of Space-Filling-Curves to Cartesian Methods for CFD

This paper presents a variety of novel uses of space-filling-curves (SFCs) for Cartesian mesh methods in CFD. While these techniques will be demonstrated using non-body-fitted Cartesian meshes, many are applicable on general body-fitted meshes-both structured and unstructured. We demonstrate the use of single theta(N log N) SFC-based reordering to produce single-pass (theta(N)) algorithms for mesh partitioning, multigrid coarsening, and inter-mesh interpolation. The intermesh interpolation operator has many practical applications including warm starts on modified geometry, or as an inter-grid transfer operator on remeshed regions in moving-body simulations Exploiting the compact construction of these operators, we further show that these algorithms are highly amenable to parallelization. Examples using the SFC-based mesh partitioner show nearly linear speedup to 640 CPUs even when using multigrid as a smoother. Partition statistics are presented showing that the SFC partitions are, on-average, within 15% of ideal even with only around 50,000 cells in each sub-domain. The inter-mesh interpolation operator also has linear asymptotic complexity and can be used to map a solution with N unknowns to another mesh with M unknowns with theta(M + N) operations. This capability is demonstrated both on moving-body simulations and in mapping solutions to perturbed meshes for control surface deflection or finite-difference-based gradient design methods.

Aftosmis, M. J.↗

Multilevel Error Estimation and Adaptive h-Refinement for Cartesian Meshes with Embedded Boundaries

This paper presents the development of a mesh adaptation module for a multilevel Cartesian solver. While the module allows mesh refinement to be driven by a variety of different refinement parameters, a central feature in its design is the incorporation of a multilevel error estimator based upon direct estimates of the local truncation error using tau-extrapolation. This error indicator exploits the fact that in regions of uniform Cartesian mesh, the spatial operator is exactly the same on the fine and coarse grids, and local truncation error estimates can be constructed by evaluating the residual on the coarse grid of the restricted solution from the fine grid. A new strategy for adaptive h-refinement is also developed to prevent errors in smooth regions of the flow from being masked by shocks and other discontinuous features. For certain classes of error histograms, this strategy is optimal for achieving equidistribution of the refinement parameters on hierarchical meshes, and therefore ensures grid converged solutions will be achieved for appropriately chosen refinement parameters. The robustness and accuracy of the adaptation module is demonstrated using both simple model problems and complex three dimensional examples using meshes with from 10(exp 6), to 10(exp 7) cells.

Aftosmis, M. J.↗

Progress in the Simulation of Steady and Time-Dependent Flows with 3D Parallel Unstructured Cartesian Methods

The proposed paper will present recent extensions in the development of an efficient Euler solver for adaptively-refined Cartesian meshes with embedded boundaries. The paper will focus on extensions of the basic method to include solution adaptation, time-dependent flow simulation, and arbitrary rigid domain motion. The parallel multilevel method makes use of on-the-fly parallel domain decomposition to achieve extremely good scalability on large numbers of processors, and is coupled with an automatic coarse mesh generation algorithm for efficient processing by a multigrid smoother. Numerical results are presented demonstrating parallel speed-ups of up to 435 on 512 processors. Solution-based adaptation may be keyed off truncation error estimates using tau-extrapolation or a variety of feature detection based refinement parameters. The multigrid method is extended to for time-dependent flows through the use of a dual-time approach. The extension to rigid domain motion uses an Arbitrary Lagrangian-Eulerlarian (ALE) formulation, and results will be presented for a variety of two- and three-dimensional example problems with both simple and complex geometry.

Aftosmis, M. J.↗

A Parallel Cartesian Approach for External Aerodynamics of Vehicles with Complex Geometry

This workshop paper presents the current status in the development of a new approach for the solution of the Euler equations on Cartesian meshes with embedded boundaries in three dimensions on distributed and shared memory architectures. The approach uses adaptively refined Cartesian hexahedra to fill the computational domain. Where these cells intersect the geometry, they are cut by the boundary into arbitrarily shaped polyhedra which receive special treatment by the solver. The presentation documents a newly developed multilevel upwind solver based on a flexible domain-decomposition strategy. One novel aspect of the work is its use of space-filling curves (SFC) for memory efficient on-the-fly parallelization, dynamic re-partitioning and automatic coarse mesh generation. Within each subdomain the approach employs a variety reordering techniques so that relevant data are on the same page in memory permitting high-performance on cache-based processors. Details of the on-the-fly SFC based partitioning are presented as are construction rules for the automatic coarse mesh generation. After describing the approach, the paper uses model problems and 3- D configurations to both verify and validate the solver. The model problems demonstrate that second-order accuracy is maintained despite the presence of the irregular cut-cells in the mesh. In addition, it examines both parallel efficiency and convergence behavior. These investigations demonstrate a parallel speed-up in excess of 28 on 32 processors of an SGI Origin 2000 system and confirm that mesh partitioning has no effect on convergence behavior.

Aftosmis, M. J.↗

Computation of External Aerodynamics for a Canard Rotor/Wing Aircraft

The aerodynamic loads on a Canard Rotor/Wing vehicle are investigated using inviscid numerical simulations in order to understand the flight characteristics of the vehicle during conversion from rotor craft to fixed-wing flight. A series of numerical simulations at seven azimuthal rotor indices are presented covering a quarter turn of the rotor With symmetry arguments, these simulations produce 25 data points for a complete rotation. A Cartesian mesh approach is used to compute the flow field about a configuration with faired-over engine inlet and exhaust that matches the wind tunnel geometry. These simulations were performed using meshes with approximately nine Million Cartesian cells. To better understand the aerodynamic effects of the rotor hub on the configuration, the same set of simulations were repeated for a hub-less geometry. Overall loads for both configurations are similar but are due to somewhat different aerodynamic mechanisms.

Pandya, S. A.↗

A Domain-Decomposed Multilevel Method for Adaptively Refined Cartesian Grids with Embedded Boundaries

Preliminary verification and validation of an efficient Euler solver for adaptively refined Cartesian meshes with embedded boundaries is presented. The parallel, multilevel method makes use of a new on-the-fly parallel domain decomposition strategy based upon the use of space-filling curves, and automatically generates a sequence of coarse meshes for processing by the multigrid smoother. The coarse mesh generation algorithm produces grids which completely cover the computational domain at every level in the mesh hierarchy. A series of examples on realistically complex three-dimensional configurations demonstrate that this new coarsening algorithm reliably achieves mesh coarsening ratios in excess of 7 on adaptively refined meshes. Numerical investigations of the scheme's local truncation error demonstrate an achieved order of accuracy between 1.82 and 1.88. Convergence results for the multigrid scheme are presented for both subsonic and transonic test cases and demonstrate W-cycle multigrid convergence rates between 0.84 and 0.94. Preliminary parallel scalability tests on both simple wing and complex complete aircraft geometries shows a computational speedup of 52 on 64 processors using the run-time mesh partitioner.

Aftosmis, M. J.↗

Computation of External Aerodynamics for a Canard Rotor/Wing Aircraft

The aerodynamic loads on a Canard Rotor/Wing vehicle are investigated using inviscid numerical simulations to understand the aerodynamic characteristics of the vehicle during conversion from rotorcraft to fixed wing flight. Steady numerical simulations at five azimuthal rotor indices are presented over a quarter turn of the rotor, producing 19 points during a single rotation due to symmetry. A Cartesian mesh approach is used to compute the steady flow field. All computations are done with a faired over engine inlet and exit to be consistent with the wind tunnel model geometry. Modification to the geometry is suggested and the aerodynamic effect of the modification is discussed.

Pandya, S.↗

On the Use of CAD-Native Predicates and Geometry in Surface Meshing

Several paradigms for accessing computer-aided design (CAD) geometry during surface meshing for computational fluid dynamics are discussed. File translation, inconsistent geometry engines, and nonnative point construction are all identified as sources of nonrobustness. The paper argues in favor of accessing CAD parts and assemblies in their native format, without translation, and for the use of CAD-native predicates and constructors in surface mesh generation. The discussion also emphasizes the importance of examining the computational requirements for exact evaluation of triangulation predicates during surface meshing.

Aftosmis, M. J.↗

On the Use of CAD-Native Predicates and Geometry in Surface Meshing

Several paradigms for accessing CAD geometry during surface meshing for CFD are discussed. File translation, inconsistent geometry engines and non-native point construction are all identified as sources of non-robustness. The paper argues in favor of accessing CAD parts and assemblies in their native format, without translation, and for the use of CAD-native predicates and constructors in surface mesh generation. The discussion also emphasizes the importance of examining the computational requirements for exact evaluation of triangulation predicates during surface meshing. The native approach is demonstrated through an algorithm for the generation of closed manifold surface triangulations from CAD geometry. CAD parts and assemblies are used in their native format, and a part's native geometry engine is accessed through a modeler-independent application programming interface (API). In seeking a robust and fully automated procedure, the algorithm is based on a new physical space manifold triangulation technique specially developed to avoid robustness issues associated with poorly conditioned mappings. In addition, this approach avoids the usual ambiguities associated with floating-point predicate evaluation on constructed coordinate geometry in a mapped space. The technique is incremental, so that each new site improves the triangulation by some well defined quality measure. The algorithm terminates after achieving a prespecified measure of mesh quality and produces a triangulation such that no angle is less than a given angle bound, a or greater than pi - 2alpha. This result also sets bounds on the maximum vertex degree, triangle aspect-ratio and maximum stretching rate for the triangulation. In addition to the output triangulations for a variety of CAD parts, the discussion presents related theoretical results which assert the existence of such an angle bound, and demonstrate that maximum bounds of between 25 deg and 30 deg may be achieved in practice.

Aftosmis, M. J.↗

Automatic Generation of CFD-Ready Surface Triangulations from CAD Geometry

This paper presents an approach for the generation of closed manifold surface triangulations from CAD geometry. CAD parts and assemblies are used in their native format, without translation, and a part's native geometry engine is accessed through a modeler-independent application programming interface (API). In seeking a robust and fully automated procedure, the algorithm is based on a new physical space manifold triangulation technique which was developed to avoid robustness issues associated with poorly conditioned mappings. In addition, this approach avoids the usual ambiguities associated with floating-point predicate evaluation on constructed coordinate geometry in a mapped space, The technique is incremental, so that each new site improves the triangulation by some well defined quality measure. Sites are inserted using a variety of priority queues to ensure that new insertions will address the worst triangles first, As a result of this strategy, the algorithm will return its 'best' mesh for a given (prespecified) number of sites. Alternatively, the algorithm may be allowed to terminate naturally after achieving a prespecified measure of mesh quality. The resulting triangulations are 'CFD-ready' in that: (1) Edges match the underlying part model to within a specified tolerance. (2) Triangles on disjoint surfaces in close proximity have matching length-scales. (3) The algorithm produces a triangulation such that no angle is less than a given angle bound, alpha, or greater than Pi - 2alpha This result also sets bounds on the maximum vertex degree, triangle aspect-ratio and maximum stretching rate for the triangulation. In addition to tile output triangulations for a variety of CAD parts, tile discussion presents related theoretical results which assert the existence of such all angle bound, and demonstrate that maximum bounds of between 25 deg and 30 deg may be achieved in practice.

Aftosmis, M. J.↗

A Domain-Decomposed Multi-Level Method for Adaptively Refined Cartesian Grids with Embedded Boundaries

The work presents a new method for on-the-fly domain decomposition technique for mapping grids and solution algorithms to parallel machines, and is applicable to both shared-memory and message-passing architectures. It will be demonstrated on the Cray T3E, HP Exemplar, and SGI Origin 2000. Computing time has been secured on all these platforms. The decomposition technique is an outgrowth of techniques used in computational physics for simulations of N-body problems and the event horizons of black holes, and has not been previously used by the CFD community. Since the technique offers on-the-fly partitioning, it offers a substantial increase in flexibility for computing in heterogeneous environments, where the number of available processors may not be known at the time of job submission. In addition, since it is dynamic it permits the job to be repartitioned without global communication in cases where additional processors become available after the simulation has begun, or in cases where dynamic mesh adaptation changes the mesh size during the course of a simulation. The platform for this partitioning strategy is a completely new Cartesian Euler solver tarcreted at parallel machines which may be used in conjunction with Ames' "Cart3D" arbitrary geometry simulation package.

Aftosmis, M. J.↗

Numerical simulation of an F-16A at angle of attack

The transonic flowfield around an F-16A fighter configuration at a moderate incidence angle is simulated by solving the Navier-Stokes equations on a single-block grid. The numerical solution matches experimental freestream conditions with a mach number of 0.85, 16 degrees angle of attack, and a characteristic Reynolds number of 12.75 million. MacCormack's explicit algorithm is used in conjuction with a local time step and consecutive mesh refinement procedure to accelerate numerical convergence. The Baldwin-Lomax algebraic model provides turbulent closure. Computed surface pressure distributions and the aircraft lift coefficient compare favorably with wind tunnel data. The drag coefficient in the simulation overpredicts the experimental value by 8 percent.

Huband, G. W.↗