Search NASA⌕ Search

SEARCH · Search NASA

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 73 records · Page 4

ERUPTING FILAMENTS WITH LARGE ENCLOSING FLUX TUBES AS SOURCES OF HIGH-MASS THREE-PART CMEs, AND ERUPTING FILAMENTS IN THE ABSENCE OF ENCLOSING FLUX TUBES AS SOURCES OF LOW-MASS UNSTRUCTURED CMEs

The 3-part appearance of many coronal mass ejections (CMEs) arising from erupting filaments emerges from a large magnetic flux tube structure, consistent with the form of the erupting filament system. Other CMEs arising from erupting filaments lack a clear 3-part structure and reasons for this have not been researched in detail. This paper aims to further establish the link between CME structure and the structure of the erupting filament system and to investigate whether CMEs which lack a 3-part structure have different eruption characteristics. A survey is made of 221 near-limb filament eruptions observed from 2013 May 03 to 2014 June 30 by Extreme UltraViolet (EUV) imagers and coronagraphs. Ninety-two filament eruptions are associated with 3-part structured CMEs, 41 eruptions are associated with unstructured CMEs. The remaining 88 are categorized as failed eruptions. For 34% of the 3-part CMEs, processing applied to EUV images reveals the erupting front edge is a pre-existing loop structure surrounding the filament, which subsequently erupts with the filament to form the leading bright front edge of the CME. This connection is confirmed by a flux-rope density model. Furthermore, the unstructured CMEs have a narrower distribution of mass compared to structured CMEs, with total mass comparable to the mass of 3-part CME cores. This study supports the interpretation of 3-part CME leading fronts as the outer boundaries of a large pre-existing flux tube. Unstructured (non 3-part) CMEs are a different family to structured CMEs, arising from the eruption of filaments which are compact flux tubes in the absence of a large system of enclosing closed field.

79 ASTRONOMY AND ASTROPHYSICS↗

Graph convolutional networks applied to unstructured flow field data

Abstract Many scientific and engineering processes produce spatially unstructured data. However, most data-driven models require a feature matrix that enforces both a set number and order of features for each sample. They thus cannot be easily constructed for an unstructured dataset. Therefore, a graph based data-driven model to perform inference on fields defined on an unstructured mesh, using a graph convolutional neural network (GCNN) is presented. The ability of the method to predict global properties from spatially irregular measurements with high accuracy is demonstrated by predicting the drag force associated with laminar flow around airfoils from scattered velocity measurements. The network can infer from field samples at different resolutions, and is invariant to the order in which the measurements within each sample are presented. The GCNN method, using inductive convolutional layers and adaptive pooling, is able to predict this quantity with a validation R 2 above 0.98, and a Normalized Mean Squared Error below 0.01, without relying on spatial structure.

Ogoke, Francis (ORCID:0000000224327783)↗

A General Framework for Error-controlled Unstructured Scientific Data Compression

Data compression plays a key role in reducing storage and I/O costs. Traditional lossy methods primarily target data on rectilinear grids and cannot leverage the spatial coherence in unstructured mesh data, leading to suboptimal compression ratios. We present a multi-component, error-bounded compression framework designed to enhance the compression of floating-point unstructured mesh data, which is common in scientific applications. Our approach involves interpolating mesh data onto a rectilinear grid and then separately compressing the grid interpolation and the interpolation residuals. This method is general, independent of mesh types and typologies, and can be seamlessly integrated with existing lossy compressors for improved performance. We evaluated our framework across twelve variables from two synthetic datasets and two real-world simulation datasets. The results indicate that the multi-component framework consistently outperforms state-of-the-art lossy compressors on unstructured data, achieving, on average, a 2.3 − 3.5× improvement in compression ratios, with error bounds ranging from 1 × 10 the −6 to 1×10−2. We further investigate impact of hyperparameters, such as grid spacing and error allocation, to deliver optimal compression ratios in diverse datasets.

Gong, Qian↗

Parallel deterministic transport sweeps of structured and unstructured meshes with overloaded mesh decompositions

Here, the efficiency of discrete ordinates transport sweeps depends on the scheduling algorithm, the domain decomposition, the problem to be solved, and the computational platform. Sweep scheduling algorithms may be categorized by their approach to several issues. In this paper we examine the strategy of domain overloading for mesh partitioning as one of the components of such algorithms. In particular, we extend the domain overloading strategy, previously defined and analyzed for structured meshes, to the general case of unstructured meshes. We also present computational results for both the structured and unstructured domain overloading cases. We find that an appropriate amount of domain overloading can greatly improve the efficiency of parallel sweeps for both structured and unstructured partitionings of the test problems examined on up to 10 5 processor cores.

97 MATHEMATICS AND COMPUTING↗

Numerical experiments on unstructured PIC stability.

Particle-In-Cell (PIC) is a method for plasmas simulation. Particles are pushed with Verlet time integration. Fields are modeled using finite differences on a tensor product mesh (cells). The Unstructured PIC methods studied here use instead finite element discretizations on unstructured (simplicial) meshes. PIC is constrained by stability limits (upper bounds) on mesh and time step sizes. Numerical evidence (2D) and analysis will be presented showing that similar bounds constrain unstructured PIC.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

GMLS-Nets: A Framework for Learning from Unstructured Data

Data fields sampled on irregularly spaced points arise in many applications in the sciences and engineering. For regular grids, Convolutional Neural Networks (CNNs) have been successfully used to gaining benefits from weight sharing and invariances. We generalize CNNs by introducing methods for data on unstructured point clouds based on Generalized Moving Least Squares (GMLS). GMLS is a nonparametric technique for estimating linear bounded functionals from scattered data, and has recently been used in the literature for solving partial differential equations. By parameterizing the GMLS estimator, we obtain learning methods for operators with unstructured stencils. In GMLS-Nets the necessary calculations are local, readily parallelizable, and the estimator is supported by a rigorous approximation theory. We show how the framework may be used for unstructured physical data sets to perform functional regression to identify associated differential operators and to regress quantities of interest. The results suggest the architectures to be an attractive foundation for data-driven model development in scientific machine learning applications.

42 ENGINEERING↗

Wave Resource Characterization Using an Unstructured Grid Modeling Approach

This paper presents a modeling study conducted on the central Oregon coast for wave resource characterization using the unstructured-grid SWAN model coupled with a nested-grid WWIII model. The flexibility of models of various spatial resolutions and the effects of open- boundary conditions simulated by a nested-grid WWIII model with different physics packages were evaluated. The model results demonstrate the advantage of the unstructured-grid modeling approach for flexible model resolution and good model skills in simulating the six wave resource parameters recommended by the International Electrotechnical Commission in comparison to the observed data in Year 2009 at National Data Buoy Center Buoy 46050. Notably, spectral analysis indicates that the ST4 physics package improves upon the model skill of the ST2 physics package for predicting wave power density for large waves, which is important for wave resource assessment, device load calculation, and risk management. In addition, bivariate distributions show the simulated sea state of maximum occurrence with the ST4 physics package matched the observed data better than that with the ST2 physics package. This study demonstrated that the unstructured-grid wave modeling approach, driven by the nested-grid regional WWIII outputs with the ST4 physics package, can efficiently provide accurate wave hindcasts to support wave resource characterization. Our study also suggests that wind effects need to be considered if the dimension of the model domain is greater than approximately 100 km, or O (10^2 km).

Wu, Wei-Cheng↗

Generation of unstructured grids and Euler solutions for complex geometries

Algorithms are described for the generation and adaptation of unstructured grids in two and three dimensions, as well as Euler solvers for unstructured grids. The main purpose is to demonstrate how unstructured grids may be employed advantageously for the economic simulation of both geometrically as well as physically complex flow fields.

Loehner, Rainald↗

Euler flutter analysis of airfoils using unstructured dynamic meshes

Modifications to a two-dimensional unsteady Euler code for the aeroelastic analysis of airfoils are described. The modifications involve including the structural equations of motion and their simultaneous time-integration with the governing flow equations. A novel aspect of the capability is that the solutions are obtained using unstructured grids made up of triangles. Comparisons are made with parallel calculations performed using linear theory and a structured grid Euler code to assess the accuracy of the unstructured grid Euler results. Results are presented for a flat plate airfoil and the NACA 0012 airfoil to demonstrate applications of the Euler code for generalized force computations and aeroelastic analysis. In these comparisons, two different finite-volume discretizations of the Euler equations on unstructured meshes were employed. Sensitivity of the Euler results to changes in numerical parameters were also investigated.

Rausch, Russ D.↗

Euler and Navier-Stokes computations for two-dimensional geometries using unstructured meshes

A general purpose unstructured mesh solver for steady-state two-dimensional inviscid and viscous flows is described. The efficiency and accuracy of the method are enhanced by the simultaneous use of adaptive meshing and an unstructured multigrid technique. A method for generating highly stretched triangulations in regions of viscous flow is outlined, and a procedure for implementing an algebraic turbulence model on unstructured meshes is described. Results are shown for external and internal inviscid flows and for turbulent viscous flow over a multi-element airfoil configuration.

Mavriplis, D. J.↗

Euler and Navier-Stokes computations for airfoil geometries using unstructured meshes

A general purpose unstructured mesh solver for steady-state two-dimensional inviscid and viscous flows is described. The efficiency and accuracy of the method are enhanced by the simultaneous use of adaptive meshing and an unstructured multigrid technique. A method for generating highly stretched triangulations in regions of viscous flow is outlined, and a procedure for implementing an algebraic turbulence model on unstructured meshes is described. Results are shown for external and internal inviscid flows and for turbulent viscous flow over a multi-element airfoil configuration.

Mavriplis, D. J.↗

An efficient massively parallel Euler solver for unstructured grids

A data parallel mesh-vertex upwind finite-volume scheme for solving the Euler equations on triangular unstructured meshes is described. A novel vertex-based partitioning of the problem is introduced which minimizes the computation and communication costs associated with distributing the computation to the processors of a massively parallel computer. Finally, the performance of this unstructured computation on 8K processors of the Connection Machine CM-2 is compared with one processor of a Cray-YMP. The experiments show that 8K processors of the CM-2 achieve approximately 70 percent of the performance of one processor of the Cray-YMP on the unstructured mesh computations described here.

Hammond, Steven W.↗

Unstructured Euler flow solutions using hexahedral cell refinement

An attempt is made to extend grid refinement into three dimensions by using unstructured hexahedral grids. The flow solver is developed using the TIGER (topologically Independent Grid, Euler Refinement) as the starting point. The program uses an unstructured hexahedral mesh and a modified version of the Jameson four-stage, finite-volume Runge-Kutta algorithm for integration of the Euler equations. The unstructured mesh allows for local refinement appropriate for each freestream condition, thereby concentrating mesh cells in the regions of greatest interest. This increases the computational efficiency because the refinement is not required to extend throughout the entire flow field.

Melton, John E.↗

Integrated fluid-thermal-structural analysis using adaptive unstructured meshes

An integrated fluid-thermal-structural analysis approach using adaptive unstructured meshes is presented. The approach combines the finite-element method and an adaptive remeshing technique to solve the Navier-tokes equations for high-speed compressible flow, the energy equation for the thermal response of the structure, and the quasi-static equilibrium equations for the structural response. The analysis solution procedure and the adaptive unstructured remeshing technique are described. The effectiveness of the approach is evaluated with three application studies. The adaptive unstructured remeshing procedure and finite-element solution algorithms combine to yield increased accuracy and effiency over standard structured meshes.

Dechaumphai, Pramote↗

The design and implementation of a parallel unstructured Euler solver using software primitives

This paper is concerned with the implementation of a three-dimensional unstructured grid Euler-solver on massively parallel distributed-memory computer architectures. The goal is to minimize solution time by achieving high computational rates with a numerically efficient algorithm. An unstructured multigrid algorithm with an edge-based data structure has been adopted, and a number of optimizations have been devised and implemented in order to accelerate the parallel communication rates. The implementation is carried out by creating a set of software tools, which provide an interface between the parallelization issues and the sequential code, while providing a basis for future automatic run-time compilation support. Large practical unstructured grid problems are solved on the Intel iPSC/860 hypercube and Intel Touchstone Delta machine. The quantitative effect of the various optimizations are demonstrated, and we show that the combined effect of these optimizations leads to roughly a factor of three performance improvement. The overall solution efficiency is compared with that obtained on the CRAY-YMP vector supercomputer.

Das, R.↗

Unstructured grid methods for compressible flows

The implementation of the finite element method on unstructured triangular grids is described and the development of centered finite element schemes for the solution of the compressible Euler equation on general triangular and tetrahedral grids is discussed. Explicit and implicit Lax-Wendroff type methods and a method based upon the use of explicit multistep timestepping are considered. In the latter case, the convergence behavior of the method is accelerated by the incorporation of a fully unstructured multigrid procedure. The advancing front method for generating unstructured grids of triangles and tetrahedra is described and the application of adaptive mesh techniques to both steady and transient flow analysis is illustrated.

Morgan, K.↗

Investigation of advancing front method for generating unstructured grid

The advancing front technique is used to generate an unstructured grid about simple aerodynamic geometries. Unstructured grids are generated using VGRID2D and VGRID3D software. Specific problems considered are a NACA 0012 airfoil, a bi-plane consisting of two NACA 0012 airfoil, a four element airfoil in its landing configuration, and an ONERA M6 wing. Inviscid time dependent solutions are computed on these geometries using USM3D and the results are compared with standard test results obtained by other investigators. A grid convergence study is conducted for the NACA 0012 airfoil and compared with a structured grid. A structured grid is generated using GRIDGEN software and inviscid solutions computed using CFL3D flow solver. The results obtained by unstructured grid for NACA 0012 airfoil showed an asymmetric distribution of flow quantities, and a fine distribution of grid was required to remove this asymmetry. On the other hand, the structured grid predicted a very symmetric distribution, but when the total number of points were compared to obtain the same results it was seen that structured grid required more grid points.

Thomas, A. M.↗

Partitioning of unstructured problems for parallel processing

Many large-scale computational problems are based on unstructured computational domains. Primary examples are unstructured grid calculations based on finite volume methods in computational fluid dynamics, or structural analysis problems based on finite element approximations. The question of how to distribute such unstructured computational domains over a large number of processors in a MIMD machine with distributed memory is addressed. A graph theoretical framework for these problems is established. Based on this framework three decomposition algorithms are introduced. In particular a new decomposition algorithm is discussed, which is based on the computation of an eigenvector of the Laplacian matrix associated with the graph. Numerical comparisons on large-scale two- and three-dimensional problems demonstrate the superiority of the new spectral bisection algorithm.

Simon, H. D.↗