Search NASA⌕ Search

SEARCH · Search NASA

Results for “discretization methods”

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 OSTI2022

The MP{sub N} method: a new angular discretization method based on piecewise polynomial interfaces fluxes

In transport calculations, it is well known how S{sub N} method is extremely inefficient in problems where the particle physics is dominated by streaming. The ray-effect eventually produced by the insufficient angular discretization, appears to be extremely persistent with respect to the refinement of the angular quadrature. The MP{sub N} method, that relies on continuous angular representation, offers a robust remedy to such an issue. MP{sub N} is based on the decomposition of the unit sphere into solid angles and on a piecewise continuous definition of interface fluxes, which are expanded in polynomials in each solid angle. This allows propagating more than one angular degree of freedom simultaneously while maintaining unaltered the block-diagonal pattern of the displacement plus removal operator. The method is therefore well suited for the flux resolution by means of a conventional sweep algorithm. Furthermore, unlike the S{sub N} method, MP{sub N} does not rely on discrete directions and, thus, on an angular quadrature formula, but rather constructs a set of linear equations solving for the angular moments of the flux for all discrete solid angles within the sweep. MP{sub N} shows an error convergence rate higher than S{sub N} at the expense of an increased size of the coefficient matrices, so of the computational cost. Although MP{sub N} is not free from ray-effect, the latter is effectively mitigated and less persistent with respect to the increase of the angular refinement order. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2014

TH-E-BRE-01: A 3D Solver of Linear Boltzmann Transport Equation Based On a New Angular Discretization Method with Positivity for Photon Dose Calculation Benchmarked with Geant4

Purpose: The Linear Boltzmann Transport Equation (LBTE) solved through statistical Monte Carlo (MC) method provides the accurate dose calculation in radiotherapy. This work is to investigate the alternative way for accurately solving LBTE using deterministic numerical method due to its possible advantage in computational speed from MC. Methods: Instead of using traditional spherical harmonics to approximate angular scattering kernel, our deterministic numerical method directly computes angular scattering weights, based on a new angular discretization method that utilizes linear finite element method on the local triangulation of unit angular sphere. As a Result, our angular discretization method has the unique advantage in positivity, i.e., to maintain all scattering weights nonnegative all the time, which is physically correct. Moreover, our method is local in angular space, and therefore handles the anisotropic scattering well, such as the forward-peaking scattering. To be compatible with image-guided radiotherapy, the spatial variables are discretized on the structured grid with the standard diamond scheme. After discretization, the improved sourceiteration method is utilized for solving the linear system without saving the linear system to memory. The accuracy of our 3D solver is validated using analytic solutions and benchmarked with Geant4, a popular MC solver. Results: The differences between Geant4 solutions and our solutions were less than 1.5% for various testing cases that mimic the practical cases. More details are available in the supporting document. Conclusion: We have developed a 3D LBTE solver based on a new angular discretization method that guarantees the positivity of scattering weights for physical correctness, and it has been benchmarked with Geant4 for photon dose calculation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Comparison of Spatial Discretization Methods for Solving the S N Equations Using a Three-Dimensional Method of Manufactured Solutions Benchmark Suite with Escalating Order of Nonsmoothness

For this study, a comparison of the accuracy and computational efficiency of spatial discretization methods of the three-dimensional S N equations is conducted, including discontinuous Galerkin finite element methods, the arbitrarily high-order transport method of nodal type (AHOTN), the linear-linear method, the linear-nodal (LN) method, and the higher-order diamond difference method. For this purpose, we have developed a suite of method of manufactured solutions benchmarks that provides an exact solution of the S N equations even in the presence of scattering. Most importantly, our benchmark suite permits the user to set an arbitrary level of smoothness of the exact solution across the singular characteristics. Our study focuses on the computational efficiency of the considered spatial discretization methods. Numerical results indicate that the best-performing method depends on the norm used to measure the discretization error. We employ discrete Lp norms and integral error norms in this work. For configurations with continuous exact angular flux, high-order AHOTNs perform best under L p error norms, while the LN method performs best when measured by integral error norms. Lastly, when the angular flux is discontinuous, a new singular-characteristic tracking method for three-dimensional geometries performs best among the considered methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Exploring the Regimes of Particle Behavior upon Impact via the Discrete Element Method

Discrete element method simulations are conducted to probe the various regimes of post-impact behavior of particles with solid surfaces. The impacting particles are described as spherical agglomerates consisting of smaller constituent (or primary) particles held together via surface adhesion. Under the influence of a wide range of impact velocities and particle surface energies, five distinct behavioral regimes—rebounding, vibration, fragmentation, pancaking, and shattering—are identified, and force transmission patterns are linked to post-impact behavior. In the rebounding regime, the coefficient of restitution decreases linearly as impact velocity increases and the particle agglomerate experiences compaction. In the fragmentation regime, rebound velocity generally decreases with increasing fragment size. The rebound velocity of fragments decreases with time except for the smallest fragments, which can increase in velocity due to collisions with other fragments of high velocity. Particle breakage in the pancaking regime does not follow common mechanistic models of breakage.

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

Comparison of spherical harmonics method and discrete ordinates method for radiative transfer in a turbulent jet flame

Here, in this study, we systematically compared the accuracy and computational cost of two popular solution methods for the radiative transfer equation (RTE): the spherical harmonics method (P N ) and the discrete ordinates method (DOM). We first investigated convergence characteristics of different orders of P N and DOM in a series of 1D homogeneous configurations with varying optical thicknesses. Both solvers perform better for optically thicker cases. The accuracy of P N methods increases with its order, , but the gain in accuracy reduces with the increase in , i.e., improvement of P 7 over P 5 is less than that of P 3 over P 1 . This decreasing trend becomes more prominent as the optical thickness decreases. On the other hand, DOM’s accuracy increases almost linearly with the increase in the number of ordinates (or polar angles in this study) in all cases. While comparing the directional profile of radiative intensity, both solvers perform better when the radiative intensity is more isotropic. These solvers were then connected with a full spectrum k-distribution (FSK) spectral model and used to perform radiation-coupled simulations of a turbulent jet flame in an axi-symmetric cylindrical domain. Results obtained from P 1 to P 7 approximations for P N , and 2 x 4, 4 x 4, 4 x 8, 8 x 8 finite angles for DOM are compared with that from an optically thin model, and a reference solution from line-by-line (LBL) photon Monte Carlo (PMC) method. The choice of radiation solver shows a noticeable impact on the temperature distribution of the flame. The P N solvers lead to slightly higher radiant fractions and the DOM solvers lead to slightly lower radiant fractions than the PMC benchmark solution. Finally, the computational costs of each of these solvers are also reported and an intermittent evaluation / time blending scheme to improve the computational efficiency of radiation solvers in radiation-coupled simulations are also demonstrated.

42 ENGINEERING↗
DOE OSTI2024

Numerical analysis of a time discretized method for nonlinear filtering problem with Lévy process observations

Abstract In this paper, we consider a nonlinear filtering model with observations driven by correlated Wiener processes and point processes. We first derive a Zakai equation whose solution is an unnormalized probability density function of the filter solution. Then, we apply a splitting-up technique to decompose the Zakai equation into three stochastic differential equations, based on which we construct a splitting-up approximate solution and prove its half-order convergence. Furthermore, we apply a finite difference method to construct a time semi-discrete approximate solution to the splitting-up system and prove its half-order convergence to the exact solution of the Zakai equation. Finally, we present some numerical experiments to demonstrate the theoretical analysis.

Mathematics↗
DOE OSTI2017

GPU accelerated Discrete Element Method (DEM) molecular dynamics for conservative, faceted particle simulations

Faceted shapes, such as polyhedra, are commonly found in systems of nanoscale, colloidal, and granular particles. Many interesting physical phenomena, like crystal nucleation and growth, vacancy motion, and glassy dynamics are challenging to model in these systems because they require detailed dynamical information at the individual particle level. Within the granular materials community the Discrete Element Method has been used extensively to model systems of anisotropic particles under gravity, with friction. We provide an implementation of this method intended for simulation of hard, faceted nanoparticles, with a conservative Weeks–Chandler–Andersen (WCA) interparticle potential, coupled to a thermodynamic ensemble. This method is a natural extension of classical molecular dynamics and enables rigorous thermodynamic calculations for faceted particles.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

A reproducing kernel enhanced approach for peridynamic solutions

The most common discretization method for peridynamic models used in engineering problems is the node-based meshfree approach. This method discretizes peridynamic domains by a set of nodes, each associated with a nodal cell with a characteristic volume, leading to a particle-based description of continuum systems. The behavior of each particle is then considered representative of its cell. This limits the convergence rate to the first order. In this paper, we introduce a reproducing kernel (RK) approximation to the field variables in the peridynamic equations to increase the order of convergence of peridynamic numerical solutions. Furthermore, the numerical results demonstrate improved convergence rates in static peridynamic problems using the proposed method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Demonstrating Computational Equivalence Between Continuous and Discrete Adjoint Methods by Calculating Time-Dependent Adjoint Solutions with Neutron Diffusion Models

The continuous adjoint method and the discrete adjoint method are two alternative approaches used to calculate adjoint solutions for adjoint systems. The continuous adjoint method derives adjoint equations analytically from continuous forward equations and then solves the adjoint equations either analytically or numerically in a discretized form whereas the discrete adjoint method calculates the adjoint solutions directly from the discretized forward equations. With regard to the methodology development and calculation procedure, distinct differences are well recognized between the two methods. For certain reasons, both methods are exclusively preferred and commonly used by different computational communities, but limited studies clarify the connections between the two adjoint methods from either of the communities. Herein, this paper demonstrates the computational equivalence between the continuous and discrete adjoint methods by investigating time-dependent adjoint solutions to the two-group neutron diffusion model in nuclear reactor analysis problems using both methods. Adjoint solutions can be used to estimate system parameters for reactor safety analysis. Appropriate final state conditions for the adjoint systems are specified in both of the methods, and the conditions are clarified with proper physical explanations. With the help of an event-based case study on neutron diffusion models, the accuracy of the time-dependent adjoint fluxes obtained from both methods is verified, and the pros and cons of both adjoint methods are examined. More importantly, the computational equivalence of both methods is demonstrated when they are applied to multigroup neutron diffusion systems. The advantage of calculating time-dependent adjoint fluxes by directly solving time-dependent adjoint systems rather than taking steady-state approximations as in common practice is also demonstrated.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2015

A practical discrete-adjoint method for high-fidelity compressible turbulence simulations

Methods and computing hardware advances have enabled accurate predictions of complex compressible turbulence phenomena, such as the generation of jet noise that motivates the present effort. However, limited understanding of underlying physical mechanisms restricts the utility of such predictions since they do not, by themselves, indicate a route to design improvements. Gradient-based optimization using adjoints can circumvent the flow complexity to guide designs, though this is predicated on the availability of a sufficiently accurate solution of the forward and adjoint systems. These are challenging to obtain, since both the chaotic character of the turbulence and the typical use of discretizations near their resolution limits in order to efficiently represent its smaller scales will amplify any approximation errors made in the adjoint formulation. Formulating a practical exact adjoint that avoids such errors is especially challenging if it is to be compatible with state-of-the-art simulation methods used for the turbulent flow itself. Automatic differentiation (AD) can provide code to calculate a nominally exact adjoint, but existing general-purpose AD codes are inefficient to the point of being prohibitive for large-scale turbulence simulations. Here, we analyze the compressible flow equations as discretized using the same high-order workhorse methods used for many high-fidelity compressible turbulence simulations, and formulate a practical space–time discrete-adjoint method without changing the basic discretization. A key step is the definition of a particular discrete analog of the continuous norm that defines our cost functional; our selection leads directly to an efficient Runge–Kutta-like scheme, though it would be just first-order accurate if used outside the adjoint formulation for time integration, with finite-difference spatial operators for the adjoint system. Its computational cost only modestly exceeds that of the flow equations. We confirm that its accuracy is limited by computing precision, and we demonstrate it on the aeroacoustic control of a mixing layer with a challengingly broad range of turbulence scales. For comparison, the error from a corresponding discretization of the continuous-adjoint equations is quantified to potentially explain its limited success in past efforts to control jet noise. The differences are illuminating: the continuous-adjoint is shown to suffer from exponential error growth in (reverse) time even for the best-resolved largest turbulence scales. Implications for jet noise reduction and turbulence control in general are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Protein drift-diffusion dynamics and phase separation in curved cell membranes and dendritic spines: Hybrid discrete-continuum methods

We develop methods for investigating protein drift-diffusion dynamics in heterogeneous cell membranes and the roles played by geometry, diffusion, chemical kinetics, and phase separation. Our hybrid stochastic numerical methods combine discrete particle descriptions with continuum-level models for tracking the individual protein drift-diffusion dynamics when coupled to continuum fields. We show how our approaches can be used to investigate phenomena motivated by protein kinetics within dendritic spines. The spine geometry is hypothesized to play an important biological role regulating synaptic strength, protein kinetics, and self-assembly of clusters. We perform simulation studies for model spine geometries varying the neck size to investigate how phase-separation and protein organization is influenced by different shapes. We also show how our methods can be used to study the roles of geometry in reaction-diffusion systems including Turing instabilities. Furthermore, our methods provide general approaches for investigating protein kinetics and drift-diffusion dynamics within curved membrane structures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Three-Dimensional Evaluation of Sand Particle Fracture Using Discrete-Element Method and Synchrotron Microcomputed Tomography Images

Recent research showed that fracture of sand particles plays a significant role in determining the plastic bulk volumetric changes of granular materials under different loading conditions. One of the major tools used to better understand the influence of particle fracture on the behavior of granular materials is discrete-element modeling (DEM). This paper employed the bonded block model (BBM) to simulate the fracture behavior of sand. Each sand particle is modeled as an agglomerate of rigid blocks bonded at their contacts using the linear-parallel contact model, which can transmit both moment and force. DEM simulated particles closely matched the actual three-dimensional (3D) shape of sand particles acquired using high-resolution 3D synchrotron microcomputed tomography (SMT). Results from unconfined one-dimensional (1D) compression of a single synthetic silica cube were used to calibrate the model parameters. Particle fracture was investigated for specimens composed of three sand particles that were loaded under confined 1D compression. Breakage energy measured from DEM models matched well with that measured experimentally. The paper studied the effects of contact loading condition and particle interaction on the fracture mode of particles using BBM that can closely capture the 3D shape of real sand particles.

58 GEOSCIENCES↗
DOE OSTI2016

DSD2D-FLS 2010: Bdzil's 2010 DSD Code Base; Computing tb and Dn with Edits to Reduce the Noise in the Dn Field Near HE Boundaries

The full level-set function code, DSD3D, is fully described in LA-14336 (2007) [1]. This ASCI-supported, DSD code project was the last such LANL DSD code project that I was involved with before my retirement in 2007. My part in the project was to design and build the core DSD3D solver, which was to include a robust DSD boundary condition treatment. A robust boundary condition treatment was required, since for an important local “customer,” the only description of the explosives’ boundary was through volume fraction data. Given this requirement, the accuracy issues I had encountered with our “fast-tube,” narrowband, DSD2D solver, and the difficulty we had building an efficient MPI-parallel version of the narrowband DSD2D, I decided DSD3D should be built as a full level-set function code, using a totally local DSD boundary condition algorithm for the level-­set function, phi, which did not rely on the gradient of the level-­set function being one, |grad(phi)| = 1. The narrowband DSD2D solver was built on the assumption that |grad(phi)| could be driven to one, and near the boundaries of the explosive this condition was not being satisfied. Since the narrowband is typically no more than10*dx wide, narrowband methods are discrete methods with a fixed, non-­resolvable error, where the error is related to the thickness of the band: the narrower the band the larger the errors. Such a solution represents a discrete approximation to the true solution and does not limit to the solution of the underlying PDEs under grid resolution.The full level-­set function code, DSD3D, is fully described in LA-14336 (2007) [1]. This ASCI-­supported, DSD code project was the last such LANL DSD code project that I was involved with before my retirement in 2007. My part in the project was to design and build the core DSD3D solver, which was to include a robust DSD boundary condition treatment. A robust boundary condition treatment was required, since for an important local “customer,” the only description of the explosives’ boundary was through volume fraction data. Given this requirement, the accuracy issues I had encountered with our “fast-­tube,” narrowband, DSD2D solver, and the difficulty we had building an efficient MPI-parallel version of the narrowband DSD2D, I decided DSD3D should be built as a full level-­set function code, using a totally local DSD boundary condition algorithm for the level-­set function, phi, which did not rely on the gradient of the level-­set function being one, |grad(phi)| = 1. The narrowband DSD2D solver was built on the assumption that |grad(phi)| could be driven to one, and near the boundaries of the explosive this condition was not being satisfied. Since the narrowband is typically no more than10*dx wide, narrowband methods are discrete methods with a fixed, non-resolvable error, where the error is related to the thickness of the band: the narrower the band the larger the errors. Such a solution represents a discrete approximation to the true solution and does not limit to the solution of the underlying PDEs under grid resolution.

97 MATHEMATICS AND COMPUTING↗