Search NASA⌕ Search

SEARCH · Search NASA

Results for “Meshless method”

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

Meshless discretization of the discrete-ordinates transport equation with integration based on Voronoi cells

The time-dependent, gray, linear radiation transport equation is discretized using the meshless local Petrov-Galerkin method with reproducing kernels. The integration is performed using a Voronoi tessellation, which creates a partition of unity that only depends on the position and extent of the kernels. The resolution of the integration automatically follows the particles and requires no manual adjustment. The discretization includes streamline-upwind Petrov-Galerkin stabilization to prevent oscillations and improve numerical conditioning. The angular quadrature is selectively refineable to increase angular resolution in chosen directions. The time discretization is done using backward Euler. The transport solve for each direction and the solve for the scattering source are both done using Krylov iterative methods. The results indicate first-order convergence in time and second-order convergence in space for linear reproducing kernels.

97 MATHEMATICS AND COMPUTING↗

Integral Kernel Methods for Nonlinear Parabolic-Elliptic Systems

Nonlinear parabolic-elliptic systems arise in many physical, biological, and chemical phenomena such as chemotaxis, ion transport, self-gravitating particles, and Brownian vortices. Existing methods struggle with the strong coupling and high nonlinearity and nonlocality of some of these systems, especially the ill-conditioned, convection-dominated problems. To overcome numerical difficulties, current approaches rely on initial guesses, preconditioning, or iterative techniques with no convergence guarantees. They might suffer from poor scalability, large memory usage, and difficulty to parallelize. Inspired by the connection of parabolic-elliptic systems to stochastic processes, we introduce a novel meshless, monolithic, and fully explicit method that naturally encapsulates the elliptic and parabolic operators into a single step which updates each node deterministically with global information. By being fully quadrature-based, it avoids solving systems of discretized equations and does not utilize initial guesses or preconditioning, while requiring little memory and being easy to parallelize. We first derive the method in an integral kernel formulation with quadratic complexity in the number of integration nodes and then leverage kernel-independent fast multipole methods (FMM) to present a scalable algorithm with linear complexity. We provide numerical examples for the Poisson-Nernst-Planck equations in one, two, and three dimensions, together with the derivation of the integral kernel for each case. Furthermore, the examples demonstrate the fast convergence and scalability of the FMM-accelerated algorithm, as well as its suitability for convection-dominated problems, making it competitive against traditional PDE solvers.

PDE systems↗

Further Developments in the MLPG Method for Beam Problems

An accurate and yet simple Meshless Local Petrov-Galerkin (MLPG) formulation for analyzing beam problems is presented. In the formulation, simple weight functions are chosen as test functions as in the conventional MLPG method. Linear test functions are also chosen, leading to a variation of the MLPG method that is computationally efficient compared to the conventional implementation. The MLPG method is evaluated by applying the formulation to a variety of patch tests, thin beam problems, and problems with load discontinuities. The formulation successfully reproduces exact solutions to machine accuracy when higher order power and spline functions are chosen as test functions or when the linear test function is used, and when constructing the trial functions, the order of the basis function is properly balanced by the order of the weight function. For mixed boundary value problems, deflections, slopes, moments, and shear forces are calculated to the same accuracy by the MLPG method without the use of elaborate post-processing techniques. Problems with load discontinuities require special care - when a reasonable number of nodes are used, the method yields very accurate results.

Raju, I. S.↗

Experimental and Numerical Investigation on Vibration of Sandwich Plates with Honeycomb Cores Based on Radial Basis Function

The vibration characteristic of the sandwich plate with a honeycomb core was investigated by experimental measurements and numerical calculation based on radial basis function (RBF). RBF method was used not only in the meshless approach but also in the post-processing of the experimental data. During the experiment, amplitude-fluctuation electronic speckle pattern interferometry was applied to access the resonant frequencies and the corresponding vibration mode shapes simultaneously. Then RBF method was used to improve the quality of patterns and reconstruct the out-of-plane vibration amplitude after fringe analysis. As for numerical calculation, the modal parameters were numerically predicted using the first-order shear deformation theory. The computation approach was based on collocation with multi-quadric radial basis function. To understand the influence of the thickness of face sheet on dynamic behaviors, three types of specimens with different thickness were tested and analyzed. Of particular interest was that the vibration modes show veering due to the thickness increment. Furthermore, the numerical predicted results were compared with the experimental measurements for the first five modes. They are in good agreement with each other for resonant frequencies, mode shapes and relative out-of-plane amplitudes.

36 MATERIALS SCIENCE↗

Meshless Local Petrov-Galerkin Euler-Bernoulli Beam Problems: A Radial Basis Function Approach

A radial basis function implementation of the meshless local Petrov-Galerkin (MLPG) method is presented to study Euler-Bernoulli beam problems. Radial basis functions, rather than generalized moving least squares (GMLS) interpolations, are used to develop the trial functions. This choice yields a computationally simpler method as fewer matrix inversions and multiplications are required than when GMLS interpolations are used. Test functions are chosen as simple weight functions as in the conventional MLPG method. Compactly and noncompactly supported radial basis functions are considered. The non-compactly supported cubic radial basis function is found to perform very well. Results obtained from the radial basis MLPG method are comparable to those obtained using the conventional MLPG method for mixed boundary value problems and problems with discontinuous loading conditions.

Raju, I. S.↗

A novel partitioning method for block-structured adaptive meshes

We propose a novel partitioning method for block-structured adaptive meshes utilizing the meshless Lagrangian particle concept. With the observation that an optimum partitioning has high analogy to the relaxation of a multi-phase fluid to steady state, physically motivated model equations are developed to characterize the background mesh topology and are solved by multi-phase smoothed-particle hydrodynamics. In contrast to well established partitioning approaches, all optimization objectives are implicitly incorporated and achieved during the particle relaxation to stationary state. Distinct partitioning sub-domains are represented by colored particles and separated by a sharp interface with a surface tension model. In order to obtain the particle relaxation, special viscous and skin friction models, coupled with a tailored time integration algorithm are proposed. Numerical experiments show that the present method has several important properties: generation of approximately equal-sized partitions without dependence on the mesh-element type, optimized interface communication between distinct partitioning sub-domains, continuous domain decomposition which is physically localized and implicitly incremental. Therefore it is particularly suitable for load-balancing of high-performance CFD simulations.

97 MATHEMATICS AND COMPUTING↗

Modelling a Heaving Point-Absorber with a Closed-Loop Control System Using the DualSPHysics Code

The present work addresses the need for an efficient, versatile, accurate and open-source numerical tool to be used during the design stage of wave energy converters (WECs). The device considered here is the heaving point-absorber developed and tested by Sandia National Laboratories. The smoothed particle hydrodynamics (SPH) method, as implemented in DualSPHysics, is proposed since its meshless approach presents some important advantages when simulating floating devices. The dynamics of the power take-off system are also modelled by coupling DualSPHysics with the multi-physics library Project Chrono. A satisfactory matching between experimental and numerical results is obtained for: (i) the heave response of the device when forced via its actuator; (ii) the vertical forces acting on the fixed device under regular waves and; (iii) the heave response of the WEC under the action of both regular waves and the actuator force. This proves the ability of the numerical approach proposed to simulate accurately the fluid–structure interaction along with the WEC’s closed-loop control system. In addition, radiation models built from the experimental and WAMIT results are compared with DualSPHysics by plotting the intrinsic impedance in the frequency domain, showing that the SPH method can be also employed for system identification.

42 ENGINEERING↗

Smoothed particle hydrodynamics non-Newtonian model for ice-sheet and ice-shelf dynamics

Mathematical modeling of ice sheets is complicated by the non-linearity of the governing equations and boundary conditions. Standard grid-based methods require complex front tracking techniques and have limited capability to handle large material deformations and abrupt changes in bottom topography. As a consequence, numerical methods are usually restricted to shallow ice sheet and ice shelf approximations. We propose a new smoothed particle hydrodynamics (SPH) non-Newtonian model for coupled ice sheet and ice shelf dynamics. SPH, a fully Lagrangian particle method, is highly scalable and its Lagrangian nature and meshless discretization are well suited to the simulation of free surface flows, large material deformation, and material fragmentation. In this paper, SPH is used to study 3D ice sheet/ice shelf behavior, and the dynamics of the grounding line. The steady state position of the grounding line obtained from SPH simulations is in good agreement with laboratory observations for a wide range of simulated bedrock slopes, and density ratios, similar to those of ice and sea water. The numerical accuracy of the SPH algorithm is verif;ed by simulating Poiseuille flow, plane shear flow with free surface and the propagation of a blob of ice along a horizontal surface. In the laboratory experiment, the ice was represented with a viscous Newtonian fluid. In the present work, however, the ice is modeled as both viscous Newtonian fluid and non-Newtonian fluid, such that the effect of non-Newtonian rheology on the dynamics of grounding line was examined. The non-Newtonian constitutive relation is prescribed to be Glen’s law for the creep of polycrystalline ice. A V-shaped bedrock ramp is further introduced to model the real geometry of bedrock slope.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Smoothed Particle Hydrodynamics Model for Ice Sheet and Ice Shelf Dynamics

Mathematical modeling of ice sheets is complicated by the non-linearity of the governing equations and boundary conditions. Standard grid-based methods require complex front tracking techniques and have limited capability to handle large material deformations and abrupt changes in bottom topography. As a consequence, numerical methods are usually restricted to shallow ice sheet and ice shelf approximations. We propose a new smoothed particle hydrodynamics (SPH) model for coupled ice sheet and ice shelf dynamics. SPH is a fully Lagrangian particle method. It is highly scalable and its Lagrangian nature and meshless discretization are well suited to the simulation of free surface flows, large material deformation, and material fragmentation. In this paper SPH is used to study ice sheet/ice shelf behavior, and the dynamics of the grounding line. The steady state position of the grounding line obtained from the SPH simulations is in good agreement with laboratory observations for a wide range of simulated bedrock slopes, and density ratios similar to those of ice and sea water. The numerical accuracy of the SPH algorithm is further verified by simulating the plane shear flow of two immiscible fluids and the propagation of a highly viscous blob of fluid along a horizontal surface. In the experiment, the ice was represented with a viscous newtonian fluid. For consistency, in the described SPH model the ice is also modeled as a viscous newtonian fluid. Typically, ice sheets are modeled as a non-Newtonian fluid, accounting for the changes in the mechanical properties of ice. Implementation of a non-Newtonian rheology in the SPH model is the subject of our ongoing research.

54 ENVIRONMENTAL SCIENCES↗

Object-constrained meshless deformable algorithm for high speed 3D nonrigid registration between CT and CBCT

Purpose: High-speed nonrigid registration between the planning CT and the treatment CBCT data is critical for real time image guided radiotherapy (IGRT) to improve the dose distribution and to reduce the toxicity to adjacent organs. The authors propose a new fully automatic 3D registration framework that integrates object-based global and seed constraints with the grayscale-based ''demons'' algorithm. Methods: Clinical objects were segmented on the planning CT images and were utilized as meshless deformable models during the nonrigid registration process. The meshless models reinforced a global constraint in addition to the grayscale difference between CT and CBCT in order to maintain the shape and the volume of geometrically complex 3D objects during the registration. To expedite the registration process, the framework was stratified into hierarchies, and the authors used a frequency domain formulation to diffuse the displacement between the reference and the target in each hierarchy. Also during the registration of pelvis images, they replaced the air region inside the rectum with estimated pixel values from the surrounding rectal wall and introduced an additional seed constraint to robustly track and match the seeds implanted into the prostate. The proposed registration framework and algorithm were evaluated on 15 real prostate cancer patients. For each patient, prostate gland, seminal vesicle, bladder, and rectum were first segmented by a radiation oncologist on planning CT images for radiotherapy planning purpose. The same radiation oncologist also manually delineated the tumor volumes and critical anatomical structures in the corresponding CBCT images acquired at treatment. These delineated structures on the CBCT were only used as the ground truth for the quantitative validation, while structures on the planning CT were used both as the input to the registration method and the ground truth in validation. By registering the planning CT to the CBCT, a displacement map was generated. Segmented volumes in the CT images deformed using the displacement field were compared against the manual segmentations in the CBCT images to quantitatively measure the convergence of the shape and the volume. Other image features were also used to evaluate the overall performance of the registration. Results: The algorithm was able to complete the segmentation and registration process within 1 min, and the superimposed clinical objects achieved a volumetric similarity measure of over 90% between the reference and the registered data. Validation results also showed that the proposed registration could accurately trace the deformation inside the target volume with average errors of less than 1 mm. The method had a solid performance in registering the simulated images with up to 20 Hounsfield unit white noise added. Also, the side by side comparison with the original demons algorithm demonstrated its improved registration performance over the local pixel-based registration approaches. Conclusions: Given the strength and efficiency of the algorithm, the proposed method has significant clinical potential to accelerate and to improve the CBCT delineation and targets tracking in online IGRT applications.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

THE FORMATION OF A MILKY WAY-SIZED DISK GALAXY. I. A COMPARISON OF NUMERICAL METHODS

The long-standing challenge of creating a Milky Way- (MW-) like disk galaxy from cosmological simulations has motivated significant developments in both numerical methods and physical models. We investigate these two fundamental aspects in a new comparison project using a set of cosmological hydrodynamic simulations of an MW-sized galaxy. In this study, we focus on the comparison of two particle-based hydrodynamics methods: an improved smoothed particle hydrodynamics (SPH) code Gadget, and a Lagrangian Meshless Finite-Mass (MFM) code Gizmo. All the simulations in this paper use the same initial conditions and physical models, which include star formation, “energy-driven” outflows, metal-dependent cooling, stellar evolution, and metal enrichment. We find that both numerical schemes produce a late-type galaxy with extended gaseous and stellar disks. However, notable differences are present in a wide range of galaxy properties and their evolution, including star-formation history, gas content, disk structure, and kinematics. Compared to Gizmo, the Gadget simulation produced a larger fraction of cold, dense gas at high redshift which fuels rapid star formation and results in a higher stellar mass by 20% and a lower gas fraction by 10% at z = 0, and the resulting gas disk is smoother and more coherent in rotation due to damping of turbulent motion by the numerical viscosity in SPH, in contrast to the Gizmo simulation, which shows a more prominent spiral structure. Given its better convergence properties and lower computational cost, we argue that the MFM method is a promising alternative to SPH in cosmological hydrodynamic simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

Metrics for Intercomparison of Remapping Algorithms (MIRA) protocol applied to Earth system models

Abstract. Strongly coupled nonlinear phenomena such as those described by Earth system models (ESMs) are composed of multiple component models with independent mesh topologies and scalable numerical solvers. A common operation in ESMs is to remap or interpolate component solution fields defined on their computational mesh to another mesh with a different combinatorial structure and decomposition, e.g., from the atmosphere to the ocean, during the temporal integration of the coupled system. Several remapping schemes are currently in use or available for ESMs. However, a unified approach to compare the properties of these different schemes has not been attempted previously. We present a rigorous methodology for the evaluation and intercomparison of remapping methods through an independently implemented suite of metrics that measure the ability of a method to adhere to constraints such as grid independence, monotonicity, global conservation, and local extrema or feature preservation. A comprehensive set of numerical evaluations is conducted based on a progression of scalar fields from idealized and smooth to more general climate data with strong discontinuities and strict bounds. We examine four remapping algorithms with distinct design approaches, namely ESMF Regrid (Hill et al., 2004), TempestRemap (Ullrich and Taylor, 2015), generalized moving least squares (GMLS) (Trask and Kuberry, 2020) with post-processing filters, and WLS-ENOR (Li et al., 2020). By repeated iterative application of the high-order remapping methods to the test fields, we verify the accuracy of each scheme in terms of their observed convergence order for smooth data and determine the bounded error propagation using challenging, realistic field data on both uniform and regionally refined mesh cases. In addition to retaining high-order accuracy under idealized conditions, the methods also demonstrate robust remapping performance when dealing with non-smooth data. There is a failure to maintain monotonicity in the traditional L2-minimization approaches used in ESMF and TempestRemap, in contrast to stable recovery through nonlinear filters used in both meshless GMLS and hybrid mesh-based WLS-ENOR schemes. Local feature preservation analysis indicates that high-order methods perform better than low-order dissipative schemes for all test cases. The behavior of these remappers remains consistent when applied on regionally refined meshes, indicating mesh-invariant implementations. The MIRA intercomparison protocol proposed in this paper and the detailed comparison of the four algorithms demonstrate that the new schemes, namely GMLS and WLS-ENOR, are competitive compared to standard conservative minimization methods requiring computation of mesh intersections. The work presented in this paper provides a foundation that can be extended to include complex field definitions, realistic mesh topologies, and spectral element discretizations, thereby allowing for a more complete analysis of production-ready remapping packages.

58 GEOSCIENCES↗

A discontinuous piecewise polynomial generalized moving least squares scheme for robust finite element analysis on arbitrary grids

A variational approach is developed with a meshless discretization to enable accurate and robust numerical simulation of partial differential equations for meshes that are of poor quality. Traditional finite element methods use the mesh to both discretize the geometric domain and to define the finite element shape functions. The latter creates a dependence between the quality of the mesh and the properties of the finite element basis that may adversely affect the accuracy of the discretized problem. Here, we propose a new approach for defining finite element shape functions that breaks this dependence and separates mesh quality from the discretization quality, which we call discontinuous piecewise polynomial generalized moving least squares (DPP-GMLS). At the core of the approach is a meshless definition of the shape functions, which limits the purpose of the mesh to representing the geometric domain and integrating the basis functions without having any role in their approximation quality. The resulting non-conforming space can be utilized within a standard discontinuous Galerkin framework, providing a rigorous foundation for solving partial differential equations on low-quality meshes. We present a collection of numerical experiments demonstrating our approach in a wide range of settings: strongly coercive elliptic problems, linear elasticity in the compressible regime, and the stationary Stokes problem. We demonstrate convergence for all problems and stability for element pairs for problems which usually require inf-sup compatibility for conforming methods, also referring to a minor modification possible through the symmetric interior penalty Galerkin framework for stabilizing element pairs that would otherwise be traditionally unstable. Mesh robustness is particularly critical for elasticity, and we provide an example that our approach provides a greater than 5 x improvement in accuracy and allows for taking an 8 x larger stable timestep for a highly deformed mesh, compared to the continuous Galerkin finite element method.

97 MATHEMATICS AND COMPUTING↗

Mingus Discontinuous Multiphysics

Mingus provides hybrid coupled local/non-local mechanics analysis capabilities that extend several traditional methods to applications with inherent discontinuities. Its primary features include adaptations of solid mechanics, fluid dynamics and digital image correlation that naturally accommodate dijointed data or irregular solution fields by assimilating a variety of discretizations (such as control volume finite elements, peridynamics and meshless control point clouds). The goal of this software is to provide an analysis framework form multiphysics engineering problems with an integrated image correlation capability that can be used for experimental validation and model

Turner, Dan↗

Regression Based Approach for Robust Finite Element Analysis on Arbitrary Grids. LDRD Final Report

This report summarizes the work performed under a one-year LDRD project aiming to enable accurate and robust numerical simulation of partial differential equations for meshes that are of poor quality. Traditional finite element methods use the mesh to both discretize the geometric domain and to define the finite element shape functions. The latter creates a dependence between the quality of the mesh and the properties of the finite element basis that may adversely affect the accuracy of the discretized problem. In this project, we propose a new approach for defining finite element shape functions that breaks this dependence and separates mesh quality from the discretization quality. At the core of the approach is a meshless definition of the shape functions, which limits the purpose of the mesh to representing the geometric domain and integrating the basis functions without having any role in their approximation quality. The resulting non-conforming space can be utilized within a standard discontinuous Galerkin framework providing a rigorous foundation for solving partial differential equations on low-quality meshes. We present a collection of numerical experiments demonstrating our approach in a wide range of settings: strongly coercive elliptic problems, linear elasticity in the compressible regime, and the stationary Stokes problem. We demonstrate convergence for all problems and stability for element pairs for problems which usually require inf-sup compatibility for conforming methods, also referring to a minor modification possible through the symmetric interior penalty Galerkin framework for stabilizing element pairs that would otherwise be traditionally unstable. Mesh robustness is particularly critical for elasticity, and we provide an example that our approach provides a greater than 5x improvement in accuracy and allows for taking an 8x larger stable timestep for a highly deformed mesh, compared to the continuous Galerkin finite element method. The report concludes with a brief summary of ongoing projects and collaborations that utilize or extend the products of this work.

97 MATHEMATICS AND COMPUTING↗

Sensitivity of Single-Scattering Properties to Precipitation Particle Meltwater Geometry for GPM Passive Microwave and Radar Remote Sensing Applications

The objective of the current work is to describe the microwave single-scattering properties of partially melted ice-phase precipitation particles using physically-based computational methods, taking into full account the varied geometries of the initially “dry” ice particles and the distributions of liquid water that develop during the melting process. Ultimately, the bulk properties of ensembles of these partially-melted particles will be included in “scattering tables” to support radar and combined radar-radiometer remote sensing of precipitation. A meshless Lagrangian melting procedure (snowMELT) based on smoothed-particle hydrodynamics is applied to both spherical and finely-structured ice particle models to describe the full evolution of the particles from dry ice particles to liquid drops. The melting of spherical ice particles using snowMELT is compared to an alternative continuum physics model to validate melt times and internal thermodynamics. The discrete dipole approximation is then utilized to calculate the single-scattering properties of different mixed-phase particles throughout the melting process. The sensitivities of particle single-scattering properties to thermodynamic and hydrodynamic assumptions in snowMELT are explored, and the implications for combined radar-radiometer precipitation remote sensing from GPM are discussed.

William S Olson↗

Generalized moving least squares vs. radial basis function finite difference methods for approximating surface derivatives

Approximating differential operators defined on two-dimensional surfaces is an important problem that arises in many areas of science and engineering. Over the past ten years, localized meshfree methods based on generalized moving least squares (GMLS) and radial basis function finite differences (RBF-FD) have been shown to be effective for this task as they can give high orders of accuracy at low computational cost, and they can be applied to surfaces defined only by point clouds. However, there have yet to be any studies that perform a direct comparison of these methods for approximating surface differential operators (SDOs). The first purpose of this work is to fill that gap. For this comparison, we focus on an RBF-FD method based on polyharmonic spline kernels and polynomials (PHS+Poly) since they are most closely related to the GMLS method. Additionally, we use a relatively new technique for approximating SDOs with RBF-FD called the tangent plane method since it is simpler than previous techniques and natural to use with PHS+Poly RBF-FD. Further, the second purpose of this work is to relate the tangent plane formulation of SDOs to the local coordinate formulation used in GMLS and to show that they are equivalent when the tangent space to the surface is known exactly. The final purpose is to use ideas from the GMLS SDO formulation to derive a new RBF-FD method for approximating the tangent space for a point cloud surface when it is unknown. For the numerical comparisons of the methods, we examine their convergence rates for approximating the surface gradient, divergence, and Laplacian as the point clouds are refined for various parameter choices. We also compare their efficiency in terms of accuracy per computational cost, both when including and excluding setup costs.

97 MATHEMATICS AND COMPUTING↗

Data-driven nonlocal model for fragmentation in the crushing of solids

A technique is proposed for reproducing particle size distributions in three-dimensional simulations of the crushing and comminution of solid materials. The method is designed to produce realistic distributions over a wide range of loading conditions, especially for small fragments. In contrast to most existing methods, the new model does not explicitly treat the small-scale process of fracture. Instead, it uses measured fragment distributions from laboratory tests as the basic material property that is incorporated into the algorithm, providing a data-driven approach. The algorithm is implemented within a nonlocal peridynamic solver, which simulates the underlying continuum mechanics and contact interactions between fragments after they are formed. Finally, the technique is illustrated in reproducing fragmentation data from drop weight testing on sandstone samples.

58 GEOSCIENCES↗