Search NASA⌕ Search

SEARCH · Search NASA

Results for “curved meshes”

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 55 records · Page 3

Unsteady density-current equations for highly curved terrain

New nonlinear partial differential equations containing terrain curvature and its rate of change are derived that describe the flow of an atmospheric density current. Unlike the classical hydraulic-type equations for density currents, the new equations are valid for two-dimensional, gradually varied flow over highly curved terrain, hence suitable for computing unsteady (or steady) flows over arbitrary mountain/valley profiles. The model assumes the atmosphere above the density current exerts a known arbitrary variable pressure upon the unknown interface. Later this is specialized to the varying hydrostatic pressure of the atmosphere above. The new equations yield the variable velocity distribution, the interface position, and the pressure distribution that contains a centrifugal component, often significantly larger than its hydrostatic component. These partial differential equations are hyperbolic, and the characteristic equations and characteristic directions are derived. Using these to form a characteristic mesh, a hypothetical unsteady curved-flow problem is calculated, not based upon observed data, merely as an example to illustrate the simplicity of their application to unsteady flows over mountains.

Sivakumaran, N. S.↗

Non-conformal interface-cohesive modeling with the shifted boundary method

The accurate simulation of boundary- and interface-dominated problems on complex geometries remains challenging when boundary- or interface-fitted meshes are difficult to generate, particularly for curved boundaries, polycrystalline microstructures, and dense interface networks. The Shifted Boundary Method (SBM) alleviates this meshing burden by shifting the enforcement of boundary conditions from the true boundary to a nearby surrogate boundary and recovering the effect of the true boundary through geometric correction terms, thereby enabling standard finite element spaces on non-boundary-fitted meshes. In this report, we develop a general shiftedboundary and shifted-interface framework within the open-source MOOSE framework. We first present a general SBM implementation for complex geometries on non-boundary-fitted meshes. We then adopt the Shifted Interface Method (SIM) for internal interfaces and develop a unified shifted-interface treatment in which the interface law is enforced on a surrogate interface and the effect of the true interface is recovered through shifted jumps, fluxes, and tractions. This perspective brings scalar thermal-contact and vector-valued cohesive-zone mechanics into a single framework, the latter realized as the Shifted Cohesive Zone Method (SCZM) and coupled with history-dependent constitutive models from NEML2. We further extend the MOOSE mesh infrastructure to support cohesive-zone calculations on distributed meshes. The framework is verified and demonstrated through three progressive studies: Poisson’s equation on a smoothed starshaped domain, a manufactured thermal-contact problem on a non-interface-fitted mesh, and a two-dimensional polycrystalline representative volume element combining crystal plasticity with cohesive grain-boundary interfaces. Across these studies, the shifted formulations reproduce boundary- and interface-fitted reference solutions with high fidelity, indicating that the proposed framework provides an accurate and efficient route to boundary- and interface-dominated simulations on arbitrary geometries without requiring fitted meshes.

Yang, Cheng-Hau↗

Massively parallel computation of RCS with finite elements

One of the promising combinations of finite element approaches for scattering problems uses Whitney edge elements, spherical vector wave-absorbing boundary conditions, and bi-conjugate gradient solution for the frequency-domain near field. Each of these approaches may be criticized. Low-order elements require high mesh density, but also result in fast, reliable iterative convergence. Spherical wave-absorbing boundary conditions require additional space to be meshed beyond the most minimal near-space region, but result in fully sparse, symmetric matrices which keep storage and solution times low. Iterative solution is somewhat unpredictable and unfriendly to multiple right-hand sides, yet we find it to be uniformly fast on large problems to date, given the other two approaches. Implementation of these approaches on a distributed memory, message passing machine yields huge dividends, as full scalability to the largest machines appears assured and iterative solution times are well-behaved for large problems. We present times and solutions for computed RCS for a conducting cube and composite permeability/conducting sphere on the Intel ipsc860 with up to 16 processors solving over 200,000 unknowns. We estimate problems of approximately 10 million unknowns, encompassing 1000 cubic wavelengths, may be attempted on a currently available 512 processor machine, but would be exceedingly tedious to prepare. The most severe bottlenecks are due to the slow rate of mesh generation on non-parallel machines and the large transfer time from such a machine to the parallel processor. One solution, in progress, is to create and then distribute a coarse mesh among the processors, followed by systematic refinement within each processor. Elimination of redundant node definitions at the mesh-partition surfaces, snap-to-surface post processing of the resulting mesh for good modelling of curved surfaces, and load-balancing redistribution of new elements after the refinement are auxiliary steps expected to result in a robust low i/o system for very large finite element problems.

Parker, Jay↗

Simulation of an Impact Test of the All-Composite Lear Fan Aircraft

An MSC.Dytran model of an all-composite Lear Fan aircraft fuselage was developed to simulate an impact test conducted at the NASA Langley Research Center Impact Dynamics Research Facility (IDRF). The test was the second of two Lear Fan impact tests. The purpose of the second test was to evaluate the performance of retrofitted composite energy-absorbing floor beams. A computerized photogrammetric survey was performed to provide airframe geometric coordinates, and over 5000 points were processed and imported into MSC.Patran via an IGES file. MSC.Patran was then used to develop the curves and surfaces and to mesh the finite element model. A model of the energy-absorbing floor beams was developed separately and then integrated into the Lear Fan model. Structural responses of components such as the wings were compared with experimental data or previously published analytical data wherever possible. Comparisons with experimental results were used to guide structural model modifications to improve the simulation performance. This process was based largely on qualitative (video and still camera images and post-test inspections) rather than quantitative results due to the relatively few accelerometers attached to the structure.

Stockwell, Alan E.↗

A Six-Node Curved Triangular Element and a Four-Node Quadrilateral Element for Analysis of Laminated Composite Aerospace Structures

Mathematical development and some computed results are presented for Mindlin plate and shell elements, suitable for analysis of laminated composite and sandwich structures. These elements use the conventional 3 (plate) or 5 (shell) nodal degrees of freedom, have no communicable mechanisms, have no spurious shear energy (no shear locking), have no spurious membrane energy (no membrane locking) and do not require arbitrary reduction of out-of-plane shear moduli or under-integration. Artificial out-of-plane rotational stiffnesses are added at the element level to avoid convergence problems or singularity due to flat spots in shells. This report discusses a 6-node curved triangular element and a 4-node quadrilateral element. Findings show that in regular rectangular meshes, the Martin-Breiner 6-node triangular curved shell (MB6) is approximately equivalent to the conventional 8-node quadrilateral with integration. The 4-node quadrilateral (MB4) has very good accuracy for a 4-node element, and may be preferred in vibration analysis because of narrower bandwidth. The mathematical developments used in these elements, those discussed in the seven appendices, have been applied to elements with 3, 4, 6, and 10 nodes and can be applied to other nodal configurations.

Martin, C. Wayne↗

Diffraction Analysis of Mesh Deployable Reflector Antennas

A formulation and many representative numerical results for mesh reflector antennas are presented. The reflection coefficient matrix for the prescribed mesh configuration was determined and the local coordinate system of the mesh cells at each point on the curved reflector surface was accentuated. A novel strip aperture model was used to formulate the transmission coefficient matrix for a variety of mesh cell configurations. Numerical data are tailored to the dimensions of a conceptually designed land mobile satellite system (LMSS) which employs a large mesh deployable offset parabolic antenna. Results are shown for an offset parabolic reflector with mesh surfaces similar to the mesh surface of tracking and data relay satellite system (TDRSS).

Rahmat-Samii, Y.↗

An Automated Marching Scheme for Overset Structured Surface Mesh Generation

Starting with a Boundary Representation (BRep) of the geometry of an aerospace vehicle, an automated marching scheme is presented for generation of structured overset surface meshes. First, a pre-processing step automatically generates discrete representations of the BRep faces and BRep edges by tessellating in parameter space. Topological connectivity between the discretized BRep edges is then established, followed by automatic grid point distribution on these edges based on local turning angle, proximity to sharp geometric features, and prescribed maximum stretching ratio and grid spacing. A set of initial curves for algebraic or hyperbolic marching on a surface is then derived from the redistributed edge curves. A spatially-variable marching distance together with a grid point distribution in the marching direction are automatically determined for each initial curve. A set of overset surface meshes that covers the entire geometry is then obtained by combining the surface meshes around the BRep edges, and the structured meshes derived from the discretized BRep faces

Shishir A Pandya↗

Spline Curves, Wire Frames and Bvalue

The methods that were developed for wire-frame design are described. The principal tools for control of a curve during interactive design are mathematical ducks. The simplest of these devices is an analog of the draftsman's lead weight that he uses to control a mechanical spline also create Ducks for controlling differential and integral properties of curves were created. Other methods presented include: constructing the end of a Bezier polygon to gain quick and reasonably confident control of the end tangent vector, end curvature and end torsion; keeping the magnitude of unwanted curvature oscillations within tolerance; constructing the railroad curves that appear in many engineering design problems; and controlling the frame to minimize errors at mesh points and to optimize the shapes of the curve elements.

Smith, L.↗

NASA Tech Briefs, December 2005

Topics covered include: Video Mosaicking for Inspection of Gas Pipelines; Shuttle-Data-Tape XML Translator; Highly Reliable, High-Speed, Unidirectional Serial Data Links; Data-Analysis System for Entry, Descent, and Landing; Hybrid UV Imager Containing Face-Up AlGaN/GaN Photodiodes; Multiple Embedded Processors for Fault-Tolerant Computing; Hybrid Power Management; Magnetometer Based on Optoelectronic Microwave Oscillator; Program Predicts Time Courses of Human/ Computer Interactions; Chimera Grid Tools; Astronomer's Proposal Tool; Conservative Patch Algorithm and Mesh Sequencing for PAB3D; Fitting Nonlinear Curves by Use of Optimization Techniques; Tool for Viewing Faults Under Terrain; Automated Synthesis of Long Communication Delays for Testing; Solving Nonlinear Euler Equations With Arbitrary Accuracy; Self-Organizing-Map Program for Analyzing Multivariate Data; Tool for Sizing Analysis of the Advanced Life Support System; Control Software for a High-Performance Telerobot; Java Radar Analysis Tool; Architecture for Verifiable Software; Tool for Ranking Research Options; Enhanced, Partially Redundant Emergency Notification System; Close-Call Action Log Form; Task Description Language; Improved Small-Particle Powders for Plasma Spraying; Bonding-Compatible Corrosion Inhibitor for Rinsing Metals; Wipes, Coatings, and Patches for Detecting Hydrazines; Rotating Vessels for Growing Protein Crystals; Oscillating-Linear-Drive Vacuum Compressor for CO2; Mechanically Biased, Hinged Pairs of Piezoelectric Benders; Apparatus for Precise Indium-Bump Bonding of Microchips; Radiation Dosimetry via Automated Fluorescence Microscopy; Multistage Magnetic Separator of Cells and Proteins; Elastic-Tether Suits for Artificial Gravity and Exercise; Multichannel Brain-Signal-Amplifying and Digitizing System; Ester-Based Electrolytes for Low-Temperature Li-Ion Cells; Hygrometer for Detecting Water in Partially Enclosed Volumes; Radio-Frequency Plasma Cleaning of a Penning Malmberg Trap; Reduction of Flap Side Edge Noise - the Blowing Flap; and Preventing Accidental Ignition of Upper-Stage Rocket Motors.

Source record↗

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.↗

Vaporization heat transfer of dielectric liquids on enhanced surfaces covered with screen wicks

Experiments were conducted to investigate the vaporization heat transfer characteristics for the dielectric liquid FC-72 on several wicking surfaces which may be used in flat-plate heat pipes. The wicking materials studied included microstructure enhanced surfaces and coarse surfaces covered with screen meshes. Experimental data for q versus deltaT curves and critical heat fluxes were obtained for the two different operating conditions of a heat pipe, evaporation, and shallow pool boiling. When the liquid level was above the heated surface, the height of the liquid level above the surface was varied from 0 to 10 mm. When the liquid level was below the heated surface, the distance from the liquid level to the edge of the surface was adjusted from 0 to 15 mm. Experimental results revealed that for shallow pool boiling when the heated surface was covered with a wire screen mesh, the heat transfer coefficient increased at lower heat fluxes but the critical heat flux (CHF) decreased for all the surfaces tested. In the case of evaporation, both CHF and the heat transfer coefficient increased as the microstructure surfaces were covered with screen meshes.

Gu, C. B.↗

CrossLink: Meshing a 3D part from a STEP file [Slides]

This example shows how to use CrossLink to create a mesh for a 3D geometry part read in from a STEP file. A STEP file (Standard for the Exchange of Product data) is a common file format used for 3D modelling that can be written out from a CAD program (e.g., Creo Parametric). Being able to read and mesh STEP file geometries is essential for meshing parts from engineering models. Creating the mesh typically involves: (1) Importing the geometry; (2) Creating geometry groups; (3) Assigning curves and surfaces to the geometry groups; (4) Building a topology; (5) Applying geometric and mesh constraints; and (6) Generating the final mesh. Current issues with this process in CrossLink include: (1) The GUI does not display trimmed surfaces; (2) The user must manually create and assign geometry groups; and (3) The user must be aware of duplicate curves and surfaces from the CAD model.

97 MATHEMATICS AND COMPUTING↗

Grid generation requirements at Marshall Space Flight Center

These viewgraphs present three examples of structural grid generation from MSFC analysts. The propulsion systems components include high performance requirements and multi-curved surfaces. Grid generation or finite element meshing for structural and thermal analysis models is currently accomplished using interactive graphics based software on personal workstations.

Larry Kiefling↗

Strategies Toward Automation of Overset Structured Surface Grid Generation

An outline of a strategy for automation of overset structured surface grid generation on complex geometries is described. The starting point of the process consists of an unstructured surface triangulation representation of the geometry derived from a native CAD, STEP, or IGES definition, and a set of discretized surface curves that captures all geometric features of interest. The procedure for surface grid generation is decomposed into an algebraic meshing step, a hyperbolic meshing step, and a gap-filling step. This paper will focus primarily on the high-level plan with details on the algebraic step. The algorithmic procedure for the algebraic step involves analyzing the topology of the network of surface curves, distributing grid points appropriately on these curves, identifying domains bounded by four curves that can be meshed algebraically, concatenating the resulting grids into fewer patches, and extending appropriate boundaries of the concatenated grids to provide proper overlap. Results are presented for grids created on various aerospace vehicle components.

overset↗

Effects of Mesh Irregularities on Accuracy of Finite-Volume Discretization Schemes

The effects of mesh irregularities on accuracy of unstructured node-centered finite-volume discretizations are considered. The focus is on an edge-based approach that uses unweighted least-squares gradient reconstruction with a quadratic fit. For inviscid fluxes, the discretization is nominally third order accurate on general triangular meshes. For viscous fluxes, the scheme is an average-least-squares formulation that is nominally second order accurate and contrasted with a common Green-Gauss discretization scheme. Gradient errors, truncation errors, and discretization errors are separately studied according to a previously introduced comprehensive methodology. The methodology considers three classes of grids: isotropic grids in a rectangular geometry, anisotropic grids typical of adapted grids, and anisotropic grids over a curved surface typical of advancing layer grids. The meshes within the classes range from regular to extremely irregular including meshes with random perturbation of nodes. Recommendations are made concerning the discretization schemes that are expected to be least sensitive to mesh irregularities in applications to turbulent flows in complex geometries.

Diskin, Boris↗

Multi-fidelity Uncertainty Quantification for Homogenization Problems in Structure-Property Relationships from Crystal Plasticity Finite Elements

Crystal plasticity finite element method (CPFEM) has been an integrated computational materials engineering (ICME) workhorse to study materials behaviors and structure-property relationships for the last few decades. These relations are mappings from the microstructure space to the materials properties space. Due to the stochastic and random nature of microstructures, there is always some uncertainty associated with materials properties, for example, in homogenized stress-strain curves. For critical applications with strong reliability needs, it is often desirable to quantify the microstructure-induced uncertainty in the context of structure-property relationships. However, this uncertainty quantification (UQ) problem often incurs a large computational cost because many statistically equivalent representative volume elements (SERVEs) are needed. In this article, we apply a multi-level Monte Carlo (MLMC) method to CPFEM to study the uncertainty in stress-strain curves, given an ensemble of SERVEs at multiple mesh resolutions. By using the information at coarse meshes, we show that it is possible to approximate the response at fine meshes with a much reduced computational cost. We focus on problems where the model output is multi-dimensional, which requires us to track multiple quantities of interest (QoIs) at the same time. In conclusion, our numerical results show that MLMC can accelerate UQ tasks around 2.23x, compared to the classical Monte Carlo (MC) method, which is widely known as ensemble average in the CPFEM literature.

36 MATERIALS SCIENCE↗

Accuracy of Gradient Reconstruction on Grids with High Aspect Ratio

Gradient approximation methods commonly used in unstructured-grid finite-volume schemes intended for solutions of high Reynolds number flow equations are studied comprehensively. The accuracy of gradients within cells and within faces is evaluated systematically for both node-centered and cell-centered formulations. Computational and analytical evaluations are made on a series of high-aspect-ratio grids with different primal elements, including quadrilateral, triangular, and mixed element grids, with and without random perturbations to the mesh. Both rectangular and cylindrical geometries are considered; the latter serves to study the effects of geometric curvature. The study shows that the accuracy of gradient reconstruction on high-aspect-ratio grids is determined by a combination of the grid and the solution. The contributors to the error are identified and approaches to reduce errors are given, including the addition of higher-order terms in the direction of larger mesh spacing. A parameter GAMMA characterizing accuracy on curved high-aspect-ratio grids is discussed and an approximate-mapped-least-square method using a commonly-available distance function is presented; the method provides accurate gradient reconstruction on general grids. The study is intended to be a reference guide accompanying the construction of accurate and efficient methods for high Reynolds number applications

Thomas, James↗

Incremental triangulation by way of edge swapping and local optimization

This document is intended to serve as an installation, usage, and basic theory guide for the two dimensional triangulation software 'HARLEY' written for the Silicon Graphics IRIS workstation. This code consists of an incremental triangulation algorithm based on point insertion and local edge swapping. Using this basic strategy, several types of triangulations can be produced depending on user selected options. For example, local edge swapping criteria can be chosen which minimizes the maximum interior angle (a MinMax triangulation) or which maximizes the minimum interior angle (a MaxMin or Delaunay triangulation). It should be noted that the MinMax triangulation is generally only locally optical (not globally optimal) in this measure. The MaxMin triangulation, however, is both locally and globally optical. In addition, Steiner triangulations can be constructed by inserting new sites at triangle circumcenters followed by edge swapping based on the MaxMin criteria. Incremental insertion of sites also provides flexibility in choosing cell refinement criteria. A dynamic heap structure has been implemented in the code so that once a refinement measure is specified (i.e., maximum aspect ratio or some measure of a solution gradient for the solution adaptive grid generation) the cell with the largest value of this measure is continually removed from the top of the heap and refined. The heap refinement strategy allows the user to specify either the number of cells desired or refine the mesh until all cell refinement measures satisfy a user specified tolerance level. Since the dynamic heap structure is constantly updated, the algorithm always refines the particular cell in the mesh with the largest refinement criteria value. The code allows the user to: triangulate a cloud of prespecified points (sites), triangulate a set of prespecified interior points constrained by prespecified boundary curve(s), Steiner triangulate the interior/exterior of prespecified boundary curve(s), refine existing triangulations based on solution error measures, and partition meshes based on the Cuthill-McKee, spectral, and coordinate bisection strategies.

Wiltberger, N. Lyn↗