Search NASA⌕ Search

SEARCH · Search NASA

Results for “POINT IMPLICIT 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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

A B-spline based gradient-enhanced micropolar implicit material point method for large localized inelastic deformations

The quasi-brittle response of cohesive-frictional materials in numerical simulations is commonly represented by softening plasticity or continuum damage models, either individually or in combination. However, classical models, particularly when coupled with non-associated plasticity, often suffer from ill-posedness and a lack of objectivity in numerical simulations. Moreover, the performance of the finite element method significantly degrades in simulations involving finite strains when mesh distortion reaches excessive levels. This represents a challenge for modeling cohesive-frictional materials, given their tendency to experience strongly localized deformations, such as those occurring during shear band dominated failure. Hence, accurate modeling of the response of cohesive-frictional solids is a demanding task. To address these challenges, we present an extension of the material point method (MPM) for the unified gradient-enhanced micropolar continuum, aiming at the analysis of finite localized inelastic deformations in cohesive-frictional materials. The generalized gradient-enhanced micropolar continuum formulation is employed to tackle challenges related to localization and softening material behavior, while the MPM addresses issues arising from excessive deformations. The method utilizes a B-spline formulation for the rigid background mesh to mitigate the well-known cell crossing errors of the MPM. To demonstrate the performance of the method, 2D and 3D numerical studies on localized failure in sandstone in plane strain compression and triaxial extension tests are presented. A comparison with finite element results confirms the suitability of the formulation. Moreover, an efficient numerical implementation of the formulation is presented, and it is demonstrated that the additional MPM specific overhead is negligible.

B-spline↗
DOE OSTI2015

A point implicit time integration technique for slow transient flow problems

We introduce a point implicit time integration technique for slow transient flow problems. The method treats the solution variables of interest (that can be located at cell centers, cell edges, or cell nodes) implicitly and the rest of the information related to same or other variables are handled explicitly. The method does not require implicit iteration; instead it time advances the solutions in a similar spirit to explicit methods, except it involves a few additional function(s) evaluation steps. Moreover, the method is unconditionally stable, as a fully implicit method would be. This new approach exhibits the simplicity of implementation of explicit methods and the stability of implicit methods. It is specifically designed for slow transient flow problems of long duration wherein one would like to perform time integrations with very large time steps. Because the method can be time inaccurate for fast transient problems, particularly with larger time steps, an appropriate solution strategy for a problem that evolves from a fast to a slow transient would be to integrate the fast transient with an explicit or semi-implicit technique and then switch to this point implicit method as soon as the time variation slows sufficiently. We have solved several test problems that result from scalar or systems of flow equations. Our findings indicate the new method can integrate slow transient problems very efficiently; and its implementation is very robust.

42 ENGINEERING↗
DOE OSTI2016

Contour interpolated radial basis functions with spline boundary correction for fast 3D reconstruction of the human articular cartilage from MR images

Purpose: The aim of this work is to demonstrate a new image processing technique that can provide a “near real-time” 3D reconstruction of the articular cartilage of the human knee from MR images which is user friendly. This would serve as a point-of-care 3D visualization tool which would benefit a consultant radiologist in the visualization of the human articular cartilage. Methods: The authors introduce a novel fusion of an adaptation of the contour method known as “contour interpolation (CI)” with radial basis functions (RBFs) which they describe as “CI-RBFs.” The authors also present a spline boundary correction which further enhances volume estimation of the method. A subject cohort consisting of 17 right nonpathological knees (ten female and seven male) is assessed to validate the quality of the proposed method. The authors demonstrate how the CI-RBF method dramatically reduces the number of data points required for fitting an implicit surface to the entire cartilage, thus, significantly improving the speed of reconstruction over the comparable RBF reconstruction method of Carr. The authors compare the CI-RBF method volume estimation to a typical commercial package (3D DOCTOR), Carr’s RBF method, and a benchmark manual method for the reconstruction of the femoral, tibial, and patellar cartilages. Results: The authors demonstrate how the CI-RBF method significantly reduces the number of data points (p-value < 0.0001) required for fitting an implicit surface to the cartilage, by 48%, 31%, and 44% for the patellar, tibial, and femoral cartilages, respectively. Thus, significantly improving the speed of reconstruction (p-value < 0.0001) by 39%, 40%, and 44% for the patellar, tibial, and femoral cartilages over the comparable RBF model of Carr providing a near real-time reconstruction of 6.49, 8.88, and 9.43 min for the patellar, tibial, and femoral cartilages, respectively. In addition, it is demonstrated how the CI-RBF method matches the volume estimation of a typical commercial package (3D DOCTOR), Carr’s RBF method, and a benchmark manual method for the reconstruction of the femoral, tibial, and patellar cartilages. Furthermore, the performance of the segmentation method used for the extraction of the femoral, tibial, and patellar cartilages is assessed with a Dice similarity coefficient, sensitivity, and specificity measure providing high agreement to manual segmentation. Conclusions: The CI-RBF method provides a fast, accurate, and robust 3D model reconstruction that matches Carr’s RBF method, 3D DOCTOR, and a manual benchmark method in accuracy and significantly improves upon Carr’s RBF method in data requirement and computational speed. In addition, the visualization tool has been designed to quickly segment MR images requiring only four mouse clicks per MR image slice.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2019

Analysis of the Spectral Stability of the Generalized Runge–Kutta Methods Applied to Initial-Boundary-Value Problems for Equations of the Parabolic Type. II. Implicit Methods

We consider specific realizations of different implicit generalized Runge–Kutta methods as applied to the numerical integration with respect to time of initial-boundary-value problems for the second-order parabolic equations and investigate their spectral stability. It is shown that all implicit generalized Runge–Kutta methods are unconditionally spectrally stable but some of them have the conditional property of monotonicity of the numerical solution with respect to time. The functions of spectral stability of the implicit generalized Runge–Kutta methods are rational. We compare the analytic solution of the nonstationary one-dimensional problem of heat conduction with the numerical solutions of this problem obtained by different implicit generalized Runge–Kutta methods. It is shown that, in this case, the application of the one-stage Radau methods with subsequent discretization of the problem with respect to the space variable leads to the classical forward finite difference scheme (Laasonen scheme), whereas the use of the one-stage Gauss–Legendre method leads to a six-point symmetric scheme (Crank–Nicolson scheme). It is shown that diagonally implicit generalized Nørsett and Burrage methods are realized in almost the same way as the one-stage Radau and Gauss–Legendre methods but their accuracy in the time step is 10–1000 times higher. On the basis of comparison of the numerical and analytic solutions, we conclude that, in order to get practically suitable numerical solutions without any restrictions on the time step, it is reasonable to use one- and three-stage generalized Radau methods or two- and four-stage Lobatto IIIC methods. All other explicit and implicit generalized Runge–Kutta methods require certain restrictions imposed on the time step.

42 ENGINEERING↗
DOE OSTI2018

Accelerated modulus-based matrix splitting iteration method for a class of nonlinear complementarity problems

In this paper, we reformulate a class of nonlinear complementarity problems as the implicit fixed-point equations. We demonstrate accelerated modulus-based matrix splitting iteration method. We show their convergence by assuming that the system matrix is positive definite or the splitting of the system matrix are H{sub +}-compatible splitting and discuss the choice of the optimal parameter. Furthermore, we give two-step accelerated modulus-based matrix splitting iteration method, which may achieve higher computing efficiency. Numerical experiments are presented to show the effectiveness of the method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Hybrid optimization and Bayesian inference techniques for a non-smooth radiation detection problem

In this paper, we propose several algorithms to recover the location and intensity of a radiation source located in a simulated 250 × 180 m block of an urban center based on synthetic measurements. Radioactive decay and detection are Poisson random processes, so we employ likelihood functions based on this distribution. Owing to the domain geometry and the proposed response model, the negative logarithm of the likelihood is only piecewise continuous differentiable, and it has multiple local minima. To address these difficulties, we investigate three hybrid algorithms composed of mixed optimization techniques. For global optimization, we consider simulated annealing, particle swarm, and genetic algorithm, which rely solely on objective function evaluations; that is, they do not evaluate the gradient in the objective function. By employing early stopping criteria for the global optimization methods, a pseudo-optimum point is obtained. This is subsequently utilized as the initial value by the deterministic implicit filtering method, which is able to find local extrema in non-smooth functions, to finish the search in a narrow domain. These new hybrid techniques, combining global optimization and implicit filtering address, difficulties associated with the non-smooth response, and their performances, are shown to significantly decrease the computational time over the global optimization methods. To quantify uncertainties associated with the source location and intensity, we employ the delayed rejection adaptive Metropolis and DiffeRential Evolution Adaptive Metropolis algorithms. Finally, marginal densities of the source properties are obtained, and the means of the chains compare accurately with the estimates produced by the hybrid algorithms.

42 ENGINEERING↗
DOE OSTI2015

A continuous surface reconstruction method on point cloud captured from a 3D surface photogrammetry system

Purpose: To accurately and efficiently reconstruct a continuous surface from noisy point clouds captured by a surface photogrammetry system (VisionRT). Methods: The authors have developed a level-set based surface reconstruction method on point clouds captured by a surface photogrammetry system (VisionRT). The proposed method reconstructs an implicit and continuous representation of the underlying patient surface by optimizing a regularized fitting energy, offering extra robustness to noise and missing measurements. By contrast to explicit/discrete meshing-type schemes, their continuous representation is particularly advantageous for subsequent surface registration and motion tracking by eliminating the need for maintaining explicit point correspondences as in discrete models. The authors solve the proposed method with an efficient narrowband evolving scheme. The authors evaluated the proposed method on both phantom and human subject data with two sets of complementary experiments. In the first set of experiment, the authors generated a series of surfaces each with different black patches placed on one chest phantom. The resulting VisionRT measurements from the patched area had different degree of noise and missing levels, since VisionRT has difficulties in detecting dark surfaces. The authors applied the proposed method to point clouds acquired under these different configurations, and quantitatively evaluated reconstructed surfaces by comparing against a high-quality reference surface with respect to root mean squared error (RMSE). In the second set of experiment, the authors applied their method to 100 clinical point clouds acquired from one human subject. In the absence of ground-truth, the authors qualitatively validated reconstructed surfaces by comparing the local geometry, specifically mean curvature distributions, against that of the surface extracted from a high-quality CT obtained from the same patient. Results: On phantom point clouds, their method achieved submillimeter reconstruction RMSE under different configurations, demonstrating quantitatively the faith of the proposed method in preserving local structural properties of the underlying surface in the presence of noise and missing measurements, and its robustness toward variations of such characteristics. On point clouds from the human subject, the proposed method successfully reconstructed all patient surfaces, filling regions where raw point coordinate readings were missing. Within two comparable regions of interest in the chest area, similar mean curvature distributions were acquired from both their reconstructed surface and CT surface, with mean and standard deviation of (μ{sub recon} = − 2.7 × 10{sup −3} mm{sup −1}, σ{sub recon} = 7.0 × 10{sup −3} mm{sup −1}) and (μ{sub CT} = − 2.5 × 10{sup −3} mm{sup −1}, σ{sub CT} = 5.3 × 10{sup −3} mm{sup −1}), respectively. The agreement of local geometry properties between the reconstructed surfaces and the CT surface demonstrated the ability of the proposed method in faithfully representing the underlying patient surface. Conclusions: The authors have integrated and developed an accurate level-set based continuous surface reconstruction method on point clouds acquired by a 3D surface photogrammetry system. The proposed method has generated a continuous representation of the underlying phantom and patient surfaces with good robustness against noise and missing measurements. It serves as an important first step for further development of motion tracking methods during radiotherapy.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2018

A Fast Solver for Implicit Integration of the Vlasov--Poisson System in the Eulerian Framework

In this paper, we present a domain decomposition algorithm to accelerate the solution of Eulerian-type discretizations of the linear, steady-state Vlasov equation. The steady-state solver then forms a key component in the implementation of fully implicit or nearly fully implicit temporal integrators for the nonlinear Vlasov--Poisson system. The solver relies on a particular decomposition of phase space that enables the use of sweeping techniques commonly used in radiation transport applications. The original linear system for the phase space unknowns is then replaced by a smaller linear system involving only unknowns on the boundary between subdomains, which can then be solved efficiently with Krylov methods such as GMRES. Steady-state solves are combined to form an implicit Runge--Kutta time integrator, and the Vlasov equation is coupled self-consistently to the Poisson equation via a linearized procedure or a nonlinear fixed-point method for the electric field. Finally, numerical results for standard test problems demonstrate the efficiency of the domain decomposition approach when compared to the direct application of an iterative solver to the original linear system.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Crystal plasticity modeling of strain-induced martensitic transformations to predict strain rate and temperature sensitive behavior of 304 L steels: Applications to tension, compression, torsion, and impact

This paper advances crystallographically-based Olson-Cohen (direct γ → α’) and deformation mechanism (indirect γ→ε→α’) phase transformation models for predicting strain-induced austenite to martensite transformation. Here, the advanced transformation models enable predictions of not only strain-path sensitive, but also of strain-rate and temperature sensitive deformation of polycrystalline stainless steels (SSs). The deformation of constituent grains in SSs is modeled as a combination of anisotropic elasticity, crystallographic slip, and phase transformation, while the hardening is based on the evolution of dislocation density and explicit shifts in phase fractions. Such grain-scale deformation is implemented within the meso-scale elasto-plastic self-consistent (EPSC) homogenization model, which is coupled with the implicit finite element (FE) method to provide a constitutive response at each FE integration point for solving boundary value problems at the macro-scale. Parameters pertaining to the hardening and transformation models within FEEPSC are calibrated and validated on a suite of data including flow curves and phase fractions for monotonic compression, tension, and torsion as a function of strain-rate and temperature for wrought and additively manufactured (AM) SS304L. To illustrate the potential and accuracy of the integrated multi-level FE-EPSC simulation framework, geometry, mechanical response, phase fractions, and texture evolution are simulated during gas-gun impact deformation of a cylinder and quasi-static tension of a notched specimen made of AM SS304L. Details of the simulation framework, comparison between experimental and simulation results, and insights from the results are presented and discussed.

304L steels↗
DOE OSTI2024

Fast explicit solutions for neutrino-electron scattering: Explicit asymptotic methods

Here, we present results of explicit asymptotic approximations applied to neutrino-electron scattering in a representative model of neutrino population evolution under conditions characteristic of core-collapse supernova explosions or binary neutron star mergers. It is shown that this approach provides stable solutions of these stiff systems of equations, with accuracy and time stepping comparable to that for standard implicit treatments such as backward Euler, fixed point iteration, and Anderson-accelerated fixed point iteration. Because each time step can be computed more rapidly with the explicit asymptotic approximation than with implicit methods, this suggests that algebraically stabilized explicit integration methods could be used to compute neutrino evolution coupled to hydrodynamics more efficiently in stellar explosions and mergers than the methods currently in use.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2017

Subsurface Grain Morphology Reconstruction by Differential Aperture X-ray Microscopy

A multistep, non-destructive grain morphology reconstruction methodology that is applicable to near-surface volumes is developed and tested on synthetic grain structures. This approach probes the subsurface crystal orientation using differential aperture x-ray microscopy on a sparse grid across the microstructure volume of interest. Resulting orientation data are clustered according to proximity in physical and orientation space and used as seed points for an initial Voronoi tessellation to (crudely) approximate the grain morphology. Curvature-driven grain boundary relaxation, simulated by means of the Voronoi implicit interface method, progressively improves the reconstruction accuracy. The similarity between bulk and readily accessible surface reconstruction error provides an objective termination criterion for boundary relaxation.

36 MATERIALS SCIENCE↗
DOE OSTI2018

Rational RBF-based partition of unity method for efficiently and accurately approximating 3D objects

We consider the problem of reconstructing 3D objects via meshfree interpolation methods. In this framework, we usually deal with large data sets and thus develop an efficient local scheme via the well-known partition of unity method. The main contribution in this paper consists in constructing the local interpolants for the implicit interpolation by means of rational radial basis functions. Numerical experiments, devoted to test the accuracy of the scheme, confirm that the proposed method is particularly performing when 3D objects, or more in general implicit functions defined by scattered points, need to be approximated.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

thornado-transport: Anderson- and GPU-accelerated nonlinear solvers for neutrino-matter coupling

Algorithms for neutrino-matter coupling in core-collapse supernovae (CCSNe) are investigated in the context of a spectral two-moment model, which is discretized in space with the discontinuous Galerkin method, integrated in time with implicit-explicit (IMEX) methods, and implemented in the toolkit for high-order neutrino-radiation hydrodynamics (thornado). The model considers electron neutrinos and antineutrinos and tabulated opacities from Bruenn (1985), which includes neutrino-electron scattering and pair processes. The nonlinear system arising from implicit time discretization of the equations governing neutrino-matter coupling is iterated to convergence using Anderson-accelerated fixed-point methods, which avoid formation of Jacobians and inversion of dense linear systems. Numerical experiments show that, for a given tolerance, a nested iteration scheme which aims to reduce opacity evaluations can lower the computational cost. Our initial port to GPUs, using both OpenMP and OpenACC, shows an overall speedup of up to ~ 100× when compared to results using a single CPU core. These results indicate that the algorithms implemented in thornado are well-suited to GPU acceleration.

Laiu, Paul↗
DOE OSTI2016

Simulation and fitting of complex reaction network TPR: The key is the objective function

In this research, a method has been developed for finding improved fits during simulation and fitting of data from complex reaction network temperature programmed reactions (CRN-TPR). It was found that simulation and fitting of CRN-TPR presents additional challenges relative to simulation and fitting of simpler TPR systems. The method used here can enable checking the plausibility of proposed chemical mechanisms and kinetic models. The most important finding was that when choosing an objective function, use of an objective function that is based on integrated production provides more utility in finding improved fits when compared to an objective function based on the rate of production. The response surface produced by using the integrated production is monotonic, suppresses effects from experimental noise, requires fewer points to capture the response behavior, and can be simulated numerically with smaller errors. For CRN-TPR, there is increased importance (relative to simple reaction network TPR) in resolving of peaks prior to fitting, as well as from weighting of experimental data points. Using an implicit ordinary differential equation solver was found to be inadequate for simulating CRN-TPR. Lastly, the method employed here was capable of attaining improved fits in simulation and fitting of CRN-TPR when starting with a postulated mechanism and physically realistic initial guesses for the kinetic parameters.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Experimental verification of a crystal plasticity-based simulation framework for predicting microstructure and geometric shape changes: Application to bending and Taylor impact testing of Zr

This paper is concerned with experimental verification of a recently developed multi-scale simulation framework for plastic deformation of metallic materials from quasi-static to impact deformation conditions. The framework is a visco-plastic self-consistent (VPSC) polycrystalline model embedded in an implicit finite element method (FE-VPSC) to provide a microstructure-sensitive constitutive response at each material point. Each material point of the FEM model is a polycrystalline aggregate with crystallographic deformation mechanisms operating at the single crystal scale with their evolving activity based on a dislocation density-based hardening law and texture. Four beams and three cylinders machined in different orientations from a textured plate of high-purity zirconium are tested quasi-statically in 4-point bending and at speeds of 100 m/s, 170 m/s and 243 m/s during Taylor impact tests, respectively. The variation in dimensional changes resulting from different sample orientations in the plate with respect to loading directions is measured for each sample. Moreover, texture and twinning characterization is performed using electron backscattered diffraction (EBSD). The deformation processes and underlying evolution of microstructure are successfully simulated using the FE-VPSC framework. In doing so, the model parameters are optimized and validated across a broad range of strain rates and temperatures. Simulation results in terms of geometrical changes and microstructural evolution are compared with the experimental measurements. The model predicts anisotropic material flow resulting from the hard-to-deform crystallographic directions, the development of gradients in texture and twinning through the geometries, tension–compression asymmetry, as well as the extent of plasticity under impact.

42 ENGINEERING↗
DOE OSTI2016

Fourier-spectral element approximation of the ion–electron Braginskii system with application to tokamak edge plasma in divertor configuration

Due to the extreme conditions required to produce energy by nuclear fusion in tokamaks, simulating the plasma behavior is an important but challenging task. We focus on the edge part of the plasma, where fluid approaches are probably the best suited, and our approach relies on the Braginskii ion–electron model. Assuming that the electric field is electrostatic, this yields a set of 10 strongly coupled and non-linear conservation equations that exhibit multiscale and anisotropy features. The computational domain is a torus of complex geometrical section, that corresponds to the divertor configuration, i.e. with an “X-point” in the magnetic surfaces. To capture the complex physics that is involved, high order methods are used: The time-discretization is based on a Strang splitting, that combines implicit and explicit high order Runge–Kutta schemes, and the space discretization makes use of the spectral element method in the poloidal plane together with Fourier expansions in the toroidal direction. The paper thoroughly describes the algorithms that have been developed, provides some numerical validations of the key algorithms and exhibits the results of preliminary numerical experiments. In particular, we point out that the highest frequency of the system is intermediate between the ion and electron cyclotron frequencies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Absorbing boundary conditions in material point method adopting perfectly matched layer theory

This study focuses on solving the numerical challenges of imposing absorbing boundary conditions for dynamic simulations in the material point method (MPM). To attenuate elastic waves leaving the computational domain, the current work integrates the Perfectly Matched Layer (PML) theory into the implicit MPM framework. The proposed approach introduces absorbing particles surrounding the computational domain that efficiently absorb outgoing waves and reduce reflections, allowing for accurate modeling of wave propagation and its further impact on geotechnical slope stability analysis. The study also includes several benchmark tests to validate the effectiveness of the proposed method, such as several types of impulse loading and symmetric and asymmetric base shaking. The conducted numerical tests also demonstrate the ability to handle large deformation problems, including the failure of elasto-plastic soils under gravity and dynamic excitations. The findings extend the capability of MPM in simulating continuous analysis of earthquake-induced landslides, from shaking to failure.

58 GEOSCIENCES↗
DOE OSTI2017

A high-order staggered meshless method for elliptic problems

Here, we present a new meshless method for scalar diffusion equations, which is motivated by their compatible discretizations on primal-dual grids. Unlike the latter though, our approach is truly meshless because it only requires the graph of nearby neighbor connectivity of the discretization points. This graph defines a local primal-dual grid complex with a virtual dual grid, in the sense that specification of the dual metric attributes is implicit in the method's construction. Our method combines a topological gradient operator on the local primal grid with a generalized moving least squares approximation of the divergence on the local dual grid. We show that the resulting approximation of the div-grad operator maintains polynomial reproduction to arbitrary orders and yields a meshless method, which attains $O(h^{m})$ convergence in both $L^2$- and $H^1$-norms, similar to mixed finite element methods. We demonstrate this convergence on curvilinear domains using manufactured solutions in two and three dimensions. Application of the new method to problems with discontinuous coefficients reveals solutions that are qualitatively similar to those of compatible mesh-based discretizations.

97 MATHEMATICS AND COMPUTING↗