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 37 records · Page 2

Initial Simulations of Empty Room Collapse and Reconsolidation at the Waste Isolation Pilot Plant

The Waste Isolation Pilot Plant (WIPP) is a geologic repository for defense-related nuclear waste. If left undisturbed, the virtually impermeable rock salt surrounding the repository will isolate the nuclear waste from the biosphere. If humans accidentally intrude into the repository in the future, then the likelihood of a radionuclide release to the biosphere will depend significantly on the porosity and permeability of the repository itself. Room ceilings and walls at the WIPP tend to collapse over time, causing rubble piles to form on floors of empty rooms. The surrounding rock formation will gradually compact these rubble piles until they eventually become solid salt, but the length of time for a rubble pile to reach a certain porosity and permeability is unknown. This report details the first efforts to build models to predict the porosity and permeability evolution of an empty room as it closes. Conventional geomechanical numerical methods would struggle to model empty room collapse and rubble pile consolidation, so three different meshless methods, the Immersed Isogeometric Analysis Meshfree, Reproducing Kernel Particle Method (RKPM), and the Conformal Reproducing Kernel method, were assessed. First, the meshless methods and the finite element method each simulated gradual room closure, without ceiling or wall collapse. All three methods produced equivalent room closure predictions with comparable computational speed. Second, the Immersed Isogeometric Analysis Meshfree method and RKPM simulated two-dimensional empty room collapse and rubble pile consolidation. Both methods successfully simulated large viscoplastic deformations, fracture, and rubble pile rearrangement to produce qualitatively realistic results. In addition to geomechanical simulations, the flow channels in damaged salt and crushed salt were measured using micro-computed tomography, and input into a computational fluid dynamics simulation to predict the salt's permeability. Although room for improvement exists, the current simulation approaches appear promising.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

A meshless stochastic method for Poisson–Nernst–Planck equations

A plethora of biological, physical, and chemical phenomena involve transport of charged particles (ions). Its continuum-scale description relies on the Poisson–Nernst–Planck (PNP) system, which encapsulates the conservation of mass and charge. The numerical solution of these coupled partial differential equations is challenging and suffers from both the curse of dimensionality and difficulty in efficiently parallelizing. We present a novel particle-based framework to solve the full PNP system by simulating a drift–diffusion process with time- and space-varying drift. We leverage Green’s functions, kernel-independent fast multipole methods, and kernel density estimation to solve the PNP system in a meshless manner, capable of handling discontinuous initial states. The method is embarrassingly parallel, and the computational cost scales linearly with the number of particles and dimension. We use a series of numerical experiments to demonstrate both the method’s convergence with respect to the number of particles and computational cost vis-à-vis a traditional partial differential equation solver.

Chemistry↗

Natural element method for radiative heat transfer in a semitransparent medium with irregular geometries

This paper develops a numerical solution to the radiative heat transfer problem coupled with conduction in an absorbing, emitting and isotropically scattering medium with the irregular geometries using the natural element method (NEM). The walls of the enclosures, having temperature and mixed boundary conditions, are considered to be opaque, diffuse as well as gray. The NEM as a meshless method is a new numerical scheme in the field of computational mechanics. Different from most of other meshless methods such as element-free Galerkin method or those based on radial basis functions, the shape functions used in NEM are constructed by the natural neighbor interpolations, which are strictly interpolant and the essential boundary conditions can be imposed directly. The natural element solutions in dealing with the coupled heat transfer problem for the mixed boundary conditions have been validated by comparison with those from Monte Carlo method (MCM) generated by the authors. For the validation of the NEM solution to radiative heat transfer in the semicircular medium with an inner circle, the results by NEM have been compared with those reported in the literatures. For pure radiative transfer, the upwind scheme is employed to overcome the oscillatory behavior of the solutions in some conditions. The steady state and transient heat transfer problem combined with radiation and conduction in the semicircular enclosure with an inner circle are studied. Effects of various parameters such as the extinction coefficient, the scattering albedo, the conduction–radiation parameter and the boundary emissivity are analyzed on the radiative and conductive heat fluxes and transient temperature distributions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simple Test Functions in Meshless Local Petrov-Galerkin Methods

Two meshless local Petrov-Galerkin (MLPG) methods based on two different trial functions but that use a simple linear test function were developed for beam and column problems. These methods used generalized moving least squares (GMLS) and radial basis (RB) interpolation functions as trial functions. These two methods were tested on various patch test problems. Both methods passed the patch tests successfully. Then the methods were applied to various beam vibration problems and problems involving Euler and Beck's columns. Both methods yielded accurate solutions for all problems studied. The simple linear test function offers considerable savings in computing efforts as the domain integrals involved in the weak form are avoided. The two methods based on this simple linear test function method produced accurate results for frequencies and buckling loads. Of the two methods studied, the method with radial basis trial functions is very attractive as the method is simple, accurate, and robust.

Raju, Ivatury S.↗

Verification and Large Deformation Analysis Using the Reproducing Kernel Particle Method

The reproducing kernel particle method (RKPM) is a meshless method used to solve general boundary value problems using the principle of virtual work. RKPM corrects the kernel approximation by introducing reproducing conditions which force the method to be complete to arbritrary order polynomials selected by the user. Effort in recent years has led to the implementation of RKPM within the Sierra/SM physics software framework. The purpose of this report is to investigate convergence of RKPM for verification and validation purposes as well as to demonstrate the large deformation capability of RKPM in problems where the finite element method is known to experience difficulty. Results from analyses using RKPM are compared against finite element analysis. A host of issues associated with RKPM are identified and a number of potential improvements are discussed for future work.

97 MATHEMATICS AND COMPUTING↗

Comparison of Response Surface Construction Methods for Derivative Estimation Using Moving Least Squares, Kriging and Radial Basis Functions

Response construction methods using Moving Least Squares (MLS), Kriging and Radial Basis Functions (RBF) are compared with the Global Least Squares (GLS) method in three numerical examples for derivative generation capability. Also, a new Interpolating Moving Least Squares (IMLS) method adopted from the meshless method is presented. It is found that the response surface construction methods using the Kriging and RBF interpolation yields more accurate results compared with MLS and GLS methods. Several computational aspects of the response surface construction methods also discussed.

Krishnamurthy, Thiagarajan↗

IMPROVED PERFORMANCES IN SUBSONIC FLOWS OF AN SPH SCHEME WITH GRADIENTS ESTIMATED USING AN INTEGRAL APPROACH

In this paper, we present results from a series of hydrodynamical tests aimed at validating the performance of a smoothed particle hydrodynamics (SPH) formulation in which gradients are derived from an integral approach. We specifically investigate the code behavior with subsonic flows, where it is well known that zeroth-order inconsistencies present in standard SPH make it particularly problematic to correctly model the fluid dynamics. In particular, we consider the Gresho–Chan vortex problem, the growth of Kelvin–Helmholtz instabilities, the statistics of driven subsonic turbulence and the cold Keplerian disk problem. We compare simulation results for the different tests with those obtained, for the same initial conditions, using standard SPH. We also compare the results with the corresponding ones obtained previously with other numerical methods, such as codes based on a moving-mesh scheme or Godunov-type Lagrangian meshless methods. We quantify code performances by introducing error norms and spectral properties of the particle distribution, in a way similar to what was done in other works. We find that the new SPH formulation exhibits strongly reduced gradient errors and outperforms standard SPH in all of the tests considered. In fact, in terms of accuracy, we find good agreement between the simulation results of the new scheme and those produced using other recently proposed numerical schemes. These findings suggest that the proposed method can be successfully applied for many astrophysical problems in which the presence of subsonic flows previously limited the use of SPH, with the new scheme now being competitive in these regimes with other numerical methods.

79 ASTRONOMY AND ASTROPHYSICS↗

Coupling Finite Element and Meshless Local Petrov-Galerkin Methods for Two-Dimensional Potential Problems

A coupled finite element (FE) method and meshless local Petrov-Galerkin (MLPG) method for analyzing two-dimensional potential problems is presented in this paper. The analysis domain is subdivided into two regions, a finite element (FE) region and a meshless (MM) region. A single weighted residual form is written for the entire domain. Independent trial and test functions are assumed in the FE and MM regions. A transition region is created between the two regions. The transition region blends the trial and test functions of the FE and MM regions. The trial function blending is achieved using a technique similar to the 'Coons patch' method that is widely used in computer-aided geometric design. The test function blending is achieved by using either FE or MM test functions on the nodes in the transition element. The technique was evaluated by applying the coupled method to two potential problems governed by the Poisson equation. The coupled method passed all the patch test problems and gave accurate solutions for the problems studied.

Chen, T.↗

NSFnets (Navier-Stokes flow nets): Physics-informed neural networks for the incompressible Navier-Stokes equations

In the last 50 years there has been a tremendous progress in solving numerically the Navier-Stokes equations using finite differences, finite elements, spectral, and even meshless methods. Yet, in many real cases, we still cannot incorporate seamlessly (multi-fidelity) data into existing algorithms, and for industrial-complexity applications the mesh generation is time consuming and still an art. Moreover, solving ill-posed problems (e.g., lacking boundary conditions) or inverse problems is often prohibitively expensive and requires different formulations and new computer codes. Here, we employ physics-informed neural networks (PINNs), encoding the governing equations directly into the deep neural network via automatic differentiation, to overcome some of the aforementioned limitations for simulating incompressible laminar and turbulent flows. We develop the Navier-Stokes flow nets (NSFnets) by considering two different mathematical formulations of the Navier-Stokes equations: the velocity-pressure (VP) formulation and the vorticity-velocity (VV) formulation. Since this is a new approach, we first select some standard benchmark problems to assess the accuracy, convergence rate, computational cost and flexibility of NSFnets; analytical solutions and direct numerical simulation (DNS) databases provide proper initial and boundary conditions for the NSFnet simulations. The spatial and temporal coordinates are the inputs of the NSFnets, while the instantaneous velocity and pressure fields are the outputs for the VP-NSFnet, and the instantaneous velocity and vorticity fields are the outputs for the VV-NSFnet. This is unsupervised learning and, hence, no labeled data are required beyond boundary and initial conditions and the fluid properties. The residuals of the VP or VV governing equations, together with the initial and boundary conditions, are embedded into the loss function of the NSFnets. No data is provided for the pressure to the VP-NSFnet, which is a hidden state and is obtained via the incompressibility constraint without extra computational cost. Unlike the traditional numerical methods, NSFnets inherit the properties of neural networks (NNs), hence the total error is composed of the approximation, the optimization, and the generalization errors. Here, we empirically attempt to quantify these errors by varying the sampling (“residual”) points, the iterative solvers, and the size of the NN architecture. For the laminar flow solutions, we show that both the VP and the VV formulations are comparable in accuracy but their best performance corresponds to different NN architectures. The initial convergence rate is fast but the error eventually saturates to a plateau due to the dominance of the optimization error. For the turbulent channel flow, we show that NSFnets can sustain turbulence at , but due to expensive training we only consider part of the channel domain and enforce velocity boundary conditions on the subdomain boundaries provided by the DNS data base. We also perform a systematic study on the weights used in the loss function for balancing the data and physics components, and investigate a new way of computing the weights dynamically to accelerate training and enhance accuracy. In the last part, we demonstrate how NSFnets should be used in practice, namely for ill-posed problems with incomplete or noisy boundary conditions as well as for inverse problems. We obtain reasonably accurate solutions for such cases as well without the need to change the NSFnets and at the same computational cost as in the forward well-posed problems. As a result, we also present a simple example of transfer learning that will aid in accelerating the training of NSFnets for different parameter settings.

97 MATHEMATICS AND COMPUTING↗

Discrete-Element and Material-Point Method (DEM and MPM) Based Solvers for Sustainable Technologies

We present the use of discrete element method (DEM) and material point method (MPM) in three relevant green technology applications that include biomass feedstock handling, lithium-ion battery manufacturing, and high-pressure reverse osmosis. Our open-source DEM and MPM solvers are developed using performance portable grid and particle management library, AMReX, thus enabling superior performance on NVIDIA and AMD GPUs with > 100 million particles. Our DEM solver resolves the motion of individual particles in a granular system and includes a bonded sphere method for modeling non-spherical particles along with Hertzian and liquid bridge-based contact models. We simulate highly variable biomass feedstock flows in large-scale hoppers for biofuel production and electrode calendering in battery manufacturing using DEM. Our simulations predict flow blockage in large scale biomass hoppers and electrode microstructure variations, thus providing valuable information for biofuel and battery manufacturers, respectively. The second half of the talk will be on MPM and its application towards pore resolved simulations of reverse osmosis membranes under compressive loads. We present a validation study of our MPM simulations with membrane microscopy imaging thus providing useful insights on membrane stability under high pressure conditions. We also present a spectral stability analysis of using linear hat, quadratic and cubic spline basis in MPM indicating regions of numerical stability.

BIOMASS FUELS,MATHEMATICS AND COMPUTING↗

Meshless Petrov-Galerkin Method Applied to Axisymmetric Problems

An axisymmetric Meshless Local Petrov-Galerkin (MLPG) algorithm is presented for the potential and elasticity problems. In this algorithm the trial and test functions are chosen from different spaces. By a judicious choice of these functions, the integrals involved in the weak form can be restricted to a local neighborhood. This makes the method truly meshless. The MLPG algorithm is used to study various potential and elasticity problems for which exact solutions are available. The sensitivity and effectiveness of the MLPG algorithm to various parameters such as the weight functions, basis functions and support domain radius, etc. was studied. The MLPG algorithm yielded accurate solutions for all weight functions, basis functions and support domain radii considered for all of the problems studied.

Raju, I. S.↗

Meshless Local Petrov-Galerkin Method for Bending Problems

Recent literature shows extensive research work on meshless or element-free methods as alternatives to the versatile Finite Element Method. One such meshless method is the Meshless Local Petrov-Galerkin (MLPG) method. In this report, the method is developed for bending of beams - C1 problems. A generalized moving least squares (GMLS) interpolation is used to construct the trial functions, and spline and power weight functions are used as the test functions. The method is applied to problems for which exact solutions are available to evaluate its effectiveness. The accuracy of the method is demonstrated for problems with load discontinuities and continuous beam problems. A Petrov-Galerkin implementation of the method is shown to greatly reduce computational time and effort and is thus preferable over the previously developed Galerkin approach. The MLPG method for beam problems yields very accurate deflections and slopes and continuous moment and shear forces without the need for elaborate post-processing techniques.

Phillips, Dawn R.↗

A Computationally Efficient Meshless Local Petrov-Galerkin Method for Axisymmetric Problems

The Meshless Local Petrov-Galerkin (MLPG) method is one of the recently developed element-free methods. The method is convenient and can produce accurate results with continuous secondary variables, but is more computationally expensive than the finite element method. To overcome this disadvantage, a simple Heaviside test function is chosen. The computational effort is significantly reduced by eliminating the domain integral for the axisymmetric potential problems and by simplifying the domain integral for the axisymmetric elasticity problems. The method is evaluated through several patch tests for axisymmetric problems and example problems for which the exact solutions are available. The present method yielded very accurate solutions. The sensitivity of several parameters of the method is also studied.

Raju, I. S.↗

Construction of Large Period Symplectic Maps by Interpolative Methods

The goal is to construct a symplectic evolution map for a large section of an accelerator, say a full turn of a large ring or a long wiggler. We start with an accurate tracking algorithm for single particles, which is allowed to be slightly non-symplectic. By tracking many particles for a distance S one acquires sufficient data to construct the mixed-variable generator of a symplectic map for evolution over S, given in terms of interpolatory functions. Two ways to find the generator are considered: (1) Find its gradient from tracking data, then the generator itself as a line integral. (2) Compute the action integral on many orbits. A test of method (1) has been made in a difficult example: a full turn map for an electron ring with strong nonlinearity near the dynamic aperture. The method succeeds at fairly large amplitudes, but there are technical difficulties near the dynamic aperture due to oddly shaped interpolation domains. For a generally applicable algorithm we propose method (2), realized with meshless interpolation methods.

43 PARTICLE ACCELERATORS↗

Using a meshless kernel-based method to solve the Black–Scholes variational inequality of American options

Under the Black–Scholes model, the value of an American option solves a free boundary problem which is equivalent to a variational inequality problem. Using positive definite kernels, we discretize the variational inequality problem in spatial direction and derive a sequence of linear complementarity problems (LCPs) in a finite-dimensional euclidean space. We use special kind of kernels to impose homogeneous boundary conditions and to obtain LCPs with positive definite coefficient matrices to guarantee the existence and uniqueness of the solution. The LCPs are then successfully solved iteratively by the projected SOR algorithm.

97 MATHEMATICS AND COMPUTING↗

A Meshless Local Petrov-Galerkin Method for Euler-Bernoulli 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. The use of these functions shows that the weak form can be integrated with conventional Gaussian integration. The MLPG method was evaluated by applying the formulation to a variety of patch test and thin beam problems. The formulation successfully reproduced exact solutions to machine accuracy when test functions with C2 continuity and an appropriate order of basis functions are used.

Raju, I. S.↗

Meshless Local Petrov-Galerkin (MLPG) Method with Orthogonal Polynomials for Euler-Bernoulli Beam Problems

In this paper, the feasibility of orthogonal polynomials in the meshless local Petrov Galerkin method (MLPG) method is studied. The orthogonal polynomials, Chebyshev and Legendre polynomials, are used in this MLPG method as trial functions. The test functions used were power functions with smooth derivatives at their ends. The performance of these methods is studied by applying these methods to Euler-Bernoulli beam problems. The MLPG-Galerkin and Legendre methods passed all the patch tests for simple beam problems. Next the formulations are tested on complex beam problems such as beams with partial loadings and continuous beam problems. Problems with load discontinuities and additional supports require special attention. Near discontinuities, judicious choice of number of nodes and nodal placements are needed to obtain accurate deflections, slopes, moments and shear forces. As polynomial functions are used, the large number of nodes can create a transformation matrix that is ill-conditioned, resulting in problems with the inversion of the matrix. The conditioning worsens as the number of nodes are increased beyond 20. Quadruple precision was needed for models to obtain accurate solutions. Even with quadruple precision the accuracy of the method suffers as the number of nodes is increased beyond 20. This appears to be a drawback of the MLPG-Chebyshev and MLPG-Legendre methods.

Raju, Ivatury S.↗

Modeling Mesoscale Processes of Scalable Synthesis

Brown University is part of the Collaboratory on Mathematics for Mesoscopic Modeling of Materials (CM4), led by PNNL. The Collaboratory focuses on developing rigorous mathematical foundations for understanding and controlling fundamental mechanisms in mesoscale processes to enable scalable synthesis of complex materials, through the design of efficient modeling methods and corresponding scalable algorithms.

97 MATHEMATICS AND COMPUTING↗