Search NASA⌕ Search

SEARCH · Search NASA

Results for “arbitrary 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 91 records · Page 5

Adaptive Generation of Multimaterial Grids from imaging data for Biomedical Lagrangian Fluid-Structure Simulations

Spatial discretization of complex imaging-derived fluid-solid geometries, such as the cardiac environment, is a critical but often overlooked challenge in biomechanical computations. This is particularly true in problems with Lagrangian interfaces, where, the fluid and solid phases must match geometrically. For simplicity and better accuracy, it is also highly desirable for the two phases to share the same surface mesh at the interface between them. We outline a method for solving this problem, and illustrate the approach with a 3D fluid-solid mesh of the mouse heart. An MRI perfusion-fixed dataset of a mouse heart with 50μm isotropic resolution was semi-automatically segmented using a customized multimaterial connected-threshold approach that divided the volume into non-overlapping regions of blood, tissue and background. Subsequently, a multimaterial marching cubes algorithm was applied to the segmented data to produce two detailed, compatible isosurfaces, one for blood and one for tissue. Both isosurfaces were simultaneously smoothed with a multimaterial smoothing algorithm that exactly conserves the volume for each phase. Using these two isosurfaces, we developed and applied novel automated meshing algorithms to generate anisotropic hybrid meshes on arbitrary biological geometries with the number of layers and the desired element anisotropy for each phase as the only input parameters. Since our meshes adapt to the local feature sizes and include boundary layer prisms, they are more efficient and accurate than non-adaptive, isotropic meshes, and the fluid-structure interaction computations will tend to have relative error equilibrated over the whole mesh.

59 BASIC BIOLOGICAL SCIENCES↗

PolyApps - Version 1.0

The polyApps software is an Umbra add-on C++ library that provides a polyhedral mesh library. Geometric shapes are defined by vertices, planes, edges, and faces. The library has a number of unique features that are useful for working with live scanners such as the SwissRanger. It includes a PolvApps multiple image texture casting capability that is compatible with the Umbra "Camera", and Umbra "lmageApps" class image connectors. The meshes are designed to be dynamic, allowing constant changing of their characteristics. Using these objects, live robot camera data can be cast onto arbitrary polygon meshes.

Source record↗

Mimetic finite difference method for the stokes problem on polygonal meshes

Various approaches to extend the finite element methods to non-traditional elements (pyramids, polyhedra, etc.) have been developed over the last decade. Building of basis functions for such elements is a challenging task and may require extensive geometry analysis. The mimetic finite difference (MFD) method has many similarities with low-order finite element methods. Both methods try to preserve fundamental properties of physical and mathematical models. The essential difference is that the MFD method uses only the surface representation of discrete unknowns to build stiffness and mass matrices. Since no extension inside the mesh element is required, practical implementation of the MFD method is simple for polygonal meshes that may include degenerate and non-convex elements. In this article, we develop a MFD method for the Stokes problem on arbitrary polygonal meshes. The method is constructed for tensor coefficients, which will allow to apply it to the linear elasticity problem. The numerical experiments show the second-order convergence for the velocity variable and the first-order for the pressure.

99 GENERAL AND MISCELLANEOUS↗

High-order accurate finite difference discretisations on fully unstructured dual quadrilateral meshes

Here, we present a novel approach for high-order accurate numerical differentiation on unstructured meshes of quadrilateral elements. To differentiate a given function, an auxiliary function with greater smoothness properties is defined which when differentiated provides the derivatives of the original function. The method generalises traditional finite difference methods to meshes of arbitrary topology in any number of dimensions for any order of derivative and accuracy. We demonstrate the accuracy of the numerical scheme using dual quadrilateral meshes and a refinement method based on subdivision surfaces. The scheme is applied to the solution of a range of partial differential equations, including both linear and nonlinear, second and fourth order equations, and a time-dependent first order equation.

97 MATHEMATICS AND COMPUTING↗

A Piecewise Linear Discontinuous Finite Element Spatial Discretization of the Transport Equation in 2D Cylindrical Geometry

We present a new spatial discretization of the discrete-ordinates transport equation in two-dimensional cylindrical (RZ) geometry for arbitrary polygonal meshes. This discretization is a discontinuous finite element method that utilizes the piecewise linear basis functions developed by Stone and Adams. We describe an asymptotic analysis that shows this method to be accurate for many problems in the thick diffusion limit on arbitrary polygons, allowing this method to be applied to radiative transfer problems with these types of meshes. We also present numerical results for multiple problems on quadrilateral grids and compare these results to the well-known bi-linear discontinuous finite element method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical simulation of high Reynolds number transonic flows

A code has been developed for simulating high Reynolds number transonic flow fields of arbitrary configuration. An explicit finite-difference method with time splitting is used to solve the time-dependent equations for compressible turbulent flow. A nonorthogonal computational mesh of arbitrary configuration facilitates the description of the flow field. The code is applied to simulate the flow over an 18 percent thick circular-arc biconvex airfoil at zero angle of attack and free-stream Mach number of 0.775. A simple mixing-length model is used to describe the turbulence and chord Reynolds numbers of 1, 2, 4, and 10 million are considered. The solution describes in sufficient detail both the shock-induced and trailing-edge separation regions, and provides the profile and friction drag.

Deiwert, G. S.↗

High Reynolds number transonic flow simulation

A code has been developed for simulating high Reynolds number transonic flow fields of arbitrary configuration. An explicit finite-difference method with time splitting is used to solve the time-dependent equations for compressible turbulent flow. A nonorthogonal computational mesh of arbitrary configuration facilitates the description of the flow field. The code is applied to simulate the flow over a two-dimensional 18 percent thick circular-arc biconvex airfoil at zero angle of attack for several different Reynolds numbers and a free-stream Mach number of 0.775.

Deiwert, G. S.↗

An advancing front Delaunay triangulation algorithm designed for robustness

A new algorithm is described for generating an unstructured mesh about an arbitrary two-dimensional configuration. Mesh points are generated automatically by the algorithm in a manner which ensures a smooth variation of elements, and the resulting triangulation constitutes the Delaunay triangulation of these points. The algorithm combines the mathematical elegance and efficiency of Delaunay triangulation algorithms with the desirable point placement features, boundary integrity, and robustness traditionally associated with advancing-front-type mesh generation strategies. The method offers increased robustness over previous algorithms in that it cannot fail regardless of the initial boundary point distribution and the prescribed cell size distribution throughout the flow-field.

Mavriplis, D. J.↗

An advancing front Delaunay triangulation algorithm designed for robustness

A new algorithm is described for generating an unstructured mesh about an arbitrary two-dimensional configuration. Mesh points are generated automatically by the algorithm in a manner which ensures a smooth variation of elements, and the resulting triangulation constitutes the Delaunay triangulation of these points. The algorithm combines the mathematical elegance and efficiency of Delaunay triangulation algorithms with the desirable point placement features, boundary integrity, and robustness traditionally associated with advancing-front-type mesh generation strategies. The method offers increased robustness over previous algorithms in that it cannot fail regardless of the initial boundary point distribution and the prescribed cell size distribution throughout the flow-field.

Mavriplis, D. J.↗

Adaptive Meshing Techniques for Viscous Flow Calculations on Mixed Element Unstructured Meshes

An adaptive refinement strategy based on hierarchical element subdivision is formulated and implemented for meshes containing arbitrary mixtures of tetrahendra, hexahendra, prisms and pyramids. Special attention is given to keeping memory overheads as low as possible. This procedure is coupled with an algebraic multigrid flow solver which operates on mixed-element meshes. Inviscid flows as well as viscous flows are computed an adaptively refined tetrahedral, hexahedral, and hybrid meshes. The efficiency of the method is demonstrated by generating an adapted hexahedral mesh containing 3 million vertices on a relatively inexpensive workstation.

Mavriplis, D. J.↗

A TWO-DIMENSIONAL METHOD OF MANUFACTURED SOLUTIONS BENCHMARK SUITE BASED ON VARIATIONS OF LARSEN'S BENCHMARK WITH ESCALATING ORDER OF SMOOTHNESS OF THE EXACT SOLUTION

The quantification of the discretization error associated with the spatial discretization of the Discrete Ordinate(DO) equations in multidimensional Cartesian geometries is the central problem in error estimation of spatial discretization schemes for transport theory as well as computer code verification. Traditionally fine mesh solutions are employed as reference, because analytical solutions only exist in the absence of scattering. This approach, however, is inadequate when the discretization error associated with the reference solution is not small compared to the discretization error associated with the mesh under scrutiny. Typically this situation occurs if the mesh of interest is only a couple of refinement levels away from the reference solution or if the order of accuracy of the numerical method (and hence the reference as well) is lower than expected. In this work we present a Method of Manufactured Solutions (MMS) benchmark suite with variable order of smoothness of the underlying exact solution for two-dimensional Cartesian geometries which provides analytical solutions aver- aged over arbitrary orthogonal meshes for scattering and non-scattering media. It should be emphasized that the developed MMS benchmark suite first eliminates the aforementioned limitation of fine mesh reference solutions since it secures knowledge of the underlying true solution and second that it allows for an arbitrary order of smoothness of the underlying ex- act solution. The latter is of importance because even for smooth parameters and boundary conditions the DO equations can feature exact solution with limited smoothness. Moreover, the degree of smoothness is crucial for both the order of accuracy and the magnitude of the discretization error for any spatial discretization scheme.

99 GENERAL AND MISCELLANEOUS↗

Two-dimensional unstructured triangular grid generation

The capability of generating 2-D unstructured triangular meshes about arbitrary geometries is demonstrated. This work uses a distribution of boundary points and triangulates the computational domain using a Delaunay triangulation algorithm. Typically, initial cells are added based on cell aspect ratios or cell areas. A resulting mesh can then be used along with the connectivity of the cells to solve either a Euler or Navier-Stokes flow problem.

Jorgenson, Philip C. E.↗

Into Mesh Lubrication of Spur Gears with Arbitrary Offset Oil Jet. I: For Jet Velocity Less than or Equal to Gear Velocity

An analysis was conducted for into mesh oil jet lubrication with an arbitrary offset and inclination angle from the pitch point for the case where the oil jet velocity is equal to or less than pitch line velocity. The analysis includes the case for the oil jet offset from the pitch point in the direction of the pinion and where the oil jet is inclined to intersect the common pitch point. Equations were developed for the minimum oil jet velocity required to impinge on the pinion or gear and the optimum oil jet velocity to obtain the maximum impingement depth.

Akin, L. S.↗

Into Mesh Lubrication of Spur Gears with Arbitrary Offset Oil Jet. 2: for Jet Velocities Equal to or Greater than Great Velocity

An analysis was conducted for into mesh oil jet lubrication with an arbitrary offset and inclination angle from the pitch point for the case where the oil jet velocity is equal to or greater than gear pitch line velocity. Equations were developed for minimum and maximum oil jet impingement depth. The analysis also included the minimum oil jet velocity required to impinge on the gear or pinion and the optimum oil jet velocity required to obtain the best lubrication condition of maximum impingement depth and gear cooling. It was shown that the optimum oil jet velocity for best lubrication and cooling is when the oil jet velocity equals the gear pitch line velocity. When the oil jet velocity is slightly greater than the pitch line velocity the loaded side of the driven gear and the unloaded side of the pinion receive the best lubrication and cooling with slightly less impingement depth. As the jet velocity becomes much greater than the pitch line velocity the impingement depth is considerably reduced and may completely miss the pinion.

Akin, L. S.↗

Into mesh lubrication of spur gears with arbitrary offset oil jet. I - For jet velocity less than or equal to gear velocity

An analysis was conducted for into mesh oil jet lubrication with an arbitrary offset and inclination angle from the pitch point for the case where the oil jet velocity is equal to or less than pitch line velocity. The analysis includes the case for the oil jet offset from the pitch point in the direction of the pinion and where the oil jet is inclined to intersect the common pitch point. Equations were developed for the minimum oil jet velocity required to impinge on the pinion or gear and the optimum oil jet velocity to obtain the maximum impingement depth.

Akin, L. S.↗

Continuously bounds-preserving discontinuous Galerkin methods for hyperbolic conservation laws

For finite element approximations of transport phenomena, it is often necessary to apply a form of limiting to ensure that the discrete solution remains well-behaved and satisfies physical constraints. However, these limiting procedures are typically performed at discrete nodal locations, which is not sufficient to ensure the robustness of the scheme when the solution must be evaluated at arbitrary locations (e.g., for adaptive mesh refinement, remapping in arbitrary Lagrangian–Eulerian solvers, overset meshes, etc.). In this work, a novel limiting approach for discontinuous Galerkin methods is presented which ensures that the solution is continuously bounds-preserving (i.e., across the entire solution polynomial) for any arbitrary choice of basis, approximation order, and mesh element type. Through a modified formulation for the constraint functionals, the proposed approach requires only the solution of a single spatial scalar minimization problem per element for which a highly efficient numerical optimization procedure is presented. Here, the efficacy of this approach is shown in numerical experiments by enforcing continuous constraints in high-order unstructured discontinuous Galerkin discretizations of hyperbolic conservation laws, ranging from scalar transport with maximum principle preserving constraints to compressible gas dynamics with positivity-preserving constraints.

97 MATHEMATICS AND COMPUTING↗

OpenSn: A massively parallel, open-source simulation environment for discrete ordinates radiation transport

OpenSn is an open-source, massively parallel deterministic radiation transport code for solving the discrete-ordinates ( S N ) form of the Boltzmann transport equation on unstructured, arbitrary polyhedral meshes. It supports high-fidelity simulations involving steady-state, eigenvalue, and adjoint problems for neutral particles (e.g., neutrons, photons, multi-particles), using the multigroup approximation in energy. OpenSn combines angular discretization via discrete ordinates with a discontinuous Galerkin finite element method (DGFEM) in space, enabling accurate resolution of transport physics on arbitrary polyhedral cells, included locally refined spatial grids. It includes multiple angular quadrature types, including locally refined angular quadratures. Written in modern C++ with a Python API, OpenSn runs efficiently on platforms ranging from laptops to supercomputers. The transport sweep algorithm is implemented using a task-based, directed-acyclic-graph (DAG) approach for each angle and supports asynchronous parallelism across thousands of MPI ranks. Group-set aggregation improves compute intensity, and synthetic acceleration techniques (e.g., diffusion synthetic acceleration, second-moment method) enhance solver convergence. OpenSn has been verified on reactor physics problems and demonstrated excellent weak and strong scaling performance on more than 32,768 processes, making it a versatile and robust platform for large-scale transport simulations in complex geometries.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A high-order vertex-based central ENO finite-volume scheme for three-dimensional compressible flows

High-order discretization methods offer the potential to reduce the computational cost associated with modeling compressible flows. However, it is difficult to obtain accurate high-order discretizations of conservation laws that do not produce spurious oscillations near discontinuities, especially on multi-dimensional unstructured meshes. A novel, high-order, central essentially non-oscillatory (CENO) finite-volume method that does not have these difficulties is proposed for tetrahedral meshes. The proposed unstructured method is vertex-based, which differs from existing cell-based CENO formulations, and uses a hybrid reconstruction procedure that switches between two different solution representations. It applies a high-order k-exact reconstruction in smooth regions and a limited linear reconstruction when discontinuities are encountered. Both reconstructions use a single, central stencil for all variables, making the application of CENO to arbitrary unstructured meshes relatively straightforward. The new approach was applied to the conservation equations governing compressible flows and assessed in terms of accuracy and computational cost. For all problems considered, which included various function reconstructions and idealized flows, CENO demonstrated excellent reliability and robustness. Up to fifth-order accuracy was achieved in smooth regions and essentially non-oscillatory solutions were obtained near discontinuities. The high-order schemes were also more computationally efficient for high-accuracy solutions, i.e., they took less wall time than the lower-order schemes to achieve a desired level of error. In one particular case, it took a factor of 24 less wall-time to obtain a given level of error with the fourth-order CENO scheme than to obtain the same error with the second-order scheme.

97 MATHEMATICS AND COMPUTING↗