Search NASA⌕ Search

SEARCH · Search NASA

Results for “Discretization error”

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 199 records · Page 11

Individual pore and interconnection size analysis of macroporous ceramic scaffolds using high-resolution X-ray tomography

The pore interconnection size of β-tricalcium phosphate scaffolds plays an essential role in the bone repair process. Although, the μCT technique is widely used in the biomaterial community, it is rarely used to measure the interconnection size because of the lack of algorithms. In addition, discrete nature of the μCT introduces large systematic errors due to the convex geometry of interconnections. We proposed, verified and validated a novel pore-level algorithm to accurately characterize the individual pores and interconnections. Specifically, pores and interconnections were isolated, labeled, and individually analyzed with high accuracy. The technique was verified thoroughly by visually inspecting and verifying over 3474 properties of randomly selected pores. This extensive verification process has passed a one-percent accuracy criterion. Scanning errors inherent in the discretization, which lead to both dummy and significantly overestimated interconnections, have been examined using computer-based simulations and additional high-resolution scanning. Then accurate correction charts were developed and used to reduce the scanning errors. Only after the corrections, both the μCT and SEM-based results converged, and the novel algorithm was validated. Material scientists with access to all geometrical properties of individual pores and interconnections, using the novel algorithm, will have a more-detailed and accurate description of the substitute architecture and a potentially deeper understanding of the link between the geometric and biological interaction. - Highlights: •An algorithm is developed to analyze individually all pores and interconnections. •After pore isolating, the discretization errors in interconnections were corrected. •Dummy interconnections and overestimated sizes were due to thin material walls. •The isolating algorithm was verified through visual inspection (99% accurate). •After correcting for the systematic errors, algorithm was validated successfully.

36 MATERIALS SCIENCE↗

Faster and more accurate transport procedures for HZETRN

The deterministic transport code HZETRN was developed for research scientists and design engineers studying the effects of space radiation on astronauts and instrumentation protected by various shielding materials and structures. In this work, several aspects of code verification are examined. First, a detailed derivation of the light particle (A {<=} 4) and heavy ion (A > 4) numerical marching algorithms used in HZETRN is given. References are given for components of the derivation that already exist in the literature, and discussions are given for details that may have been absent in the past. The present paper provides a complete description of the numerical methods currently used in the code and is identified as a key component of the verification process. Next, a new numerical method for light particle transport is presented, and improvements to the heavy ion transport algorithm are discussed. A summary of round-off error is also given, and the impact of this error on previously predicted exposure quantities is shown. Finally, a coupled convergence study is conducted by refining the discretization parameters (step-size and energy grid-size). From this study, it is shown that past efforts in quantifying the numerical error in HZETRN were hindered by single precision calculations and computational resources. It is determined that almost all of the discretization error in HZETRN is caused by the use of discretization parameters that violate a numerical convergence criterion related to charged target fragments below 50 AMeV. Total discretization errors are given for the old and new algorithms to 100 g/cm{sup 2} in aluminum and water, and the improved accuracy of the new numerical methods is demonstrated. Run time comparisons between the old and new algorithms are given for one, two, and three layer slabs of 100 g/cm{sup 2} of aluminum, polyethylene, and water. The new algorithms are found to be almost 100 times faster for solar particle event simulations and almost 10 times faster for galactic cosmic ray simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

A Posteriori Error Analysis of Two-Stage Computation Methods with Application to Efficient Discretization and the Parareal Algorithm

We consider numerical methods for initial value problems that employ a two stage approach consisting of solution on a relatively coarse discretization followed by solution on a relatively fine discretization. Examples include adaptive error control, parallel-in-time solution schemes, and efficient solution of adjoint problems for computing a posteriori error estimates. We describe a general formulation of two stage computations then perform a general a posteriori error analysis based on computable residuals and solution of an adjoint problem. The analysis accommodates various variations in the two stage computation and in formulation of the adjoint problems. We apply the analysis to compute “dual-weighted” a posteriori error estimates, to develop novel algorithms for efficient solution that take into account cancellation of error, and to the Parareal Algorithm. We test the various results using several numerical examples.

97 MATHEMATICS AND COMPUTING↗

Real time time-dependent density functional theory using higher order finite-element methods

We present a computationally efficient approach to solve the time-dependent Kohn-Sham equations in real time using higher order finite-element spatial discretization, applicable to both pseudopotential and all-electron calculations. To this end, we develop an a priori mesh adaption technique, based on the semidiscrete (discrete in space but continuous in time) error estimate on the time-dependent Kohn-Sham orbitals, to construct an efficient finite-element discretization. Subsequently, we obtain the full-discrete error estimate to guide our choice of the time step. We employ spectral finite elements along with special reduced order quadrature to render the overlap matrix diagonal, thereby simplifying the inversion of the overlap matrix that features in the evaluation of the discrete time-evolution operator. We use the second-order Magnus operator as the time-evolution operator, wherein the action of the discrete Magnus operator, expressed as exponential of a matrix, on the Kohn-Sham orbitals is obtained efficiently through an adaptive Lanczos iteration. We observe close to optimal rates of convergence of the dipole moment with respect to spatial and temporal discretization, for both pseudopotential and all-electron calculations. We demonstrate a staggering 100-fold reduction in the computational time afforded by higher order finite elements over linear finite elements, for both pseudopotential and all-electron calculations. Further, for similar level of accuracy, we obtain significant computational savings by our approach as compared to state-of-the-art finite-difference methods. Here, we also demonstrate the competence of higher order finite elements for all-electron benchmark systems. Lastly, we observe good parallel scalability of the proposed method on many hundreds of processors.

36 MATERIALS SCIENCE↗

Error estimates to smooth solutions of semi-discrete discontinuous Galerkin methods with quadrature rules for scalar conservation laws

Here, we focus on error estimates to smooth solutions of semi-discrete discontinuous Galerkin (DG) methods with quadrature rules for scalar conservation laws. The main techniques we use are energy estimate and Taylor expansion first introduced by Zhang and Shu in (Zhang and Shu, SIAM J Num Anal 42 (2004), 641–666). We show that, with p K (piecewise polynomials of degree k) finite elements in 1D problems, if the quadrature over elements is exact for polynomials of degree (2k) error estimates of O(h k+1/2 ) are obtained for general monotone fluxes, and optimal estimates of O(h k+1 ) are obtained for upwind fluxes. For multidimensional problems, if in addition quadrature over edges is exact for polynomials of degree (2k+1), error estimates of O(h k ) are obtained for general monotone fluxes, and O(h k+1/2 ) are obtained for monotone and sufficiently smooth numerical fluxes. Numerical results validate our analysis.

97 MATHEMATICS AND COMPUTING↗

AP-Cloud: Adaptive Particle-in-Cloud method for optimal solutions to Vlasov–Poisson equation

We propose a new adaptive Particle-in-Cloud (AP-Cloud) method for obtaining optimal numerical solutions to the Vlasov–Poisson equation. Unlike the traditional particle-in-cell (PIC) method, which is commonly used for solving this problem, the AP-Cloud adaptively selects computational nodes or particles to deliver higher accuracy and efficiency when the particle distribution is highly non-uniform. Unlike other adaptive techniques for PIC, our method balances the errors in PDE discretization and Monte Carlo integration, and discretizes the differential operators using a generalized finite difference (GFD) method based on a weighted least square formulation. As a result, AP-Cloud is independent of the geometric shapes of computational domains and is free of artificial parameters. Efficient and robust implementation is achieved through an octree data structure with 2:1 balance. We analyze the accuracy and convergence order of AP-Cloud theoretically, and verify the method using an electrostatic problem of a particle beam with halo. Simulation results show that the AP-Cloud method is substantially more accurate and faster than the traditional PIC, and it is free of artificial forces that are typical for some adaptive PIC techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Estimation of Errors in Stress Distributions Computed in Finite Element Simulations of Polycrystals

The accuracy of the stresses predicted from crystal plasticity-based finite element formulation depends on estimation and control of the errors associated with the discretization. In the current work, the errors in the stress distribution are estimated in virtual polycrystalline samples of α-phase titanium (hexagonal close-packed phase of Ti–6Al– 4 V). To estimate the error, the stress field, which does not possess inter-element continuity, is smoothed over a grain using an L 2 projection, thereby providing continuous stress distributions with inter-element continuity. The differences between the continuous (smooth) and discontinuous (raw) stress fields are calculated at individual Gauss quadrature points and used to estimate errors for corresponding elements and grains. Error estimations are performed for a Voronoi-tessellated microstructure, an equiaxed microstructure, and two microstructures with varying grain sizes for tensile loading extending into the fully plastic regime (≈ 5% extension). Magnitudes of the errors are found to depend on microstructural characteristics, particularly the shape and size of grains. Samples having variations in grain size or having less spherical grains exhibited higher errors than samples with uniformly sized, equiaxed grains, with the size variations having a more pronounced effect. In conclusion, errors correlate with proximity to grain boundaries at small (elastic) strains and with deformation-induced features (deformation bands) at large strains.

42 ENGINEERING↗

PDE-constrained high-order mesh optimization

Here, we present a novel framework for PDE-constrained r-adaptivity of high-order meshes. The proposed method formulates mesh movement as an optimization problem, with an objective function defined as a convex combination of a mesh quality metric and a measure of the accuracy of the PDE solution obtained via finite element discretization. The proposed formulation achieves optimized, well-defined high-order meshes by integrating mesh quality control, PDE solution accuracy, and robust gradient regularization. We adopt the Target-Matrix Optimization Paradigm to control geometric properties across the mesh, independent of the PDE of interest. To incorporate the accuracy of the PDE solution, we introduce error measures that control the finite element discretization error. The implicit dependence of these error measures on the mesh nodal positions is accurately captured by adjoint sensitivity analysis. Additionally, a convolution-based gradient regularization strategy is used to ensure stable and effective adaptation of high-order meshes. We demonstrate that the proposed framework can improve mesh quality and reduce the error by up to 10 times for the solution of Poisson and linear elasto-static problems. The approach is general with respect to the dimensionality, the order of the mesh, the types of mesh elements, and can be applied to any PDE that admits well-defined adjoint operators.

Computer science↗

A multiresolution adaptive wavelet method for nonlinear partial differential equations

We report the multiscale complexity of modern problems in computational science and engineering can prohibit the use of traditional numerical methods in multi-dimensional simulations. Therefore, novel algorithms are required in these situations to solve partial differential equations (PDEs) with features evolving on a wide range of spatial and temporal scales. To meet these challenges, we present a multiresolution wavelet algorithm to solve PDEs with significant data compression and explicit error control. We discretize in space by projecting fields and spatial derivative operators onto wavelet basis functions. We provide error estimates for the wavelet representation of fields and their derivatives. Then, our estimates are used to construct a sparse multiresolution discretization which guarantees the prescribed accuracy. Additionally, we embed a predictor-corrector procedure within the temporal integration to dynamically adapt the computational grid and maintain the accuracy of the solution of the PDE as it evolves. We present examples to highlight the accuracy and adaptivity of our approach.

97 MATHEMATICS AND COMPUTING↗

COMPARISON OF THE ACCURACY OF VARIOUS SPATIAL DISCRETIZATION SCHEMES OF THE DISCRETE ORDINATES EQUATIONS IN 2D CARTESIAN GEOMETRY

We present a comprehensive error estimation of four spatial discretization schemes of the two-dimensional Discrete Ordinates (SN) equations on Cartesian grids utilizing a Method of Manufactured Solution (MMS) benchmark suite based on variants of Larsen’s benchmark featuring different orders of smoothness of the underlying exact solution. The considered spatial discretization schemes include the arbitrarily high order transport methods of the nodal (AHOTN) and characteristic (AHOTC) types, the discontinuous Galerkin Finite Element method (DGFEM) and the recently proposed higher order diamond difference method (HODD) of spatial expansion orders 0 through 3. While AHOTN and AHOTC rely on approximate analytical solutions of the transport equation within a mesh cell, DGFEM and HODD utilize a polynomial expansion to mimick the angular flux profile across each mesh cell. Intuitively, due to the higher degree of analyticity, we expect AHOTN and AHOTC to feature superior accuracy compared with DGFEM and HODD, but at the price of potentially longer grind times and numerical instabilities. The latter disadvantages can result from the presence of exponential terms evaluated at the cell optical thickness that arise from the semianalytical solution process. This work quantifies the order of accuracy and the magnitude of the error of all four discretization methods for different optical thicknesses, scattering ratios and degrees of smoothness of the underlying exact solutions in order to verify or contradict the aforementioned intuitive expectation.

99 GENERAL AND MISCELLANEOUS↗

Meshes optimized for discrete exterior calculus (DEC).

We study the optimization of an energy function used by the meshing community to measure and improve mesh quality. This energy is non-traditional because it is dependent on both the primal triangulation and its dual Voronoi (power) diagram. The energy is a measure of the mesh's quality for usage in Discrete Exterior Calculus (DEC), a method for numerically solving PDEs. In DEC, the PDE domain is triangulated and this mesh is used to obtain discrete approximations of the continuous operators in the PDE. The energy of a mesh gives an upper bound on the error of the discrete diagonal approximation of the Hodge star operator. In practice, one begins with an initial mesh and then makes adjustments to produce a mesh of lower energy. However, we have discovered several shortcomings in directly optimizing this energy, e.g. its non-convexity, and we show that the search for an optimized mesh may lead to mesh inversion (malformed triangles). We propose a new energy function to address some of these issues.

97 MATHEMATICS AND COMPUTING↗

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↗

OPTIMIZED MULTI-FREQUENCY SPECTRA FOR APPLICATIONS IN RADIATIVE FEEDBACK AND COSMOLOGICAL REIONIZATION

The recent implementation of radiative transfer algorithms in numerous hydrodynamics codes has led to a dramatic improvement in studies of feedback in various astrophysical environments. However, because of methodological limitations and computational expense, the spectra of radiation sources are generally sampled at only a few evenly spaced discrete emission frequencies. Using one-dimensional radiative transfer calculations, we investigate the discrepancies in gas properties surrounding model stars and accreting black holes that arise solely due to spectral discretization. We find that even in the idealized case of a static and uniform density field, commonly used discretization schemes induce errors in the neutral fraction and temperature by factors of two to three on average, and by over an order of magnitude in certain column density regimes. The consequences are most severe for radiative feedback operating on large scales, dense clumps of gas, and media consisting of multiple chemical species. We have developed a method for optimally constructing discrete spectra, and show that for two test cases of interest, carefully chosen four-bin spectra can eliminate errors associated with frequency resolution to high precision. Applying these findings to a fully three-dimensional radiation-hydrodynamic simulation of the early universe, we find that the H II region around a primordial star is substantially altered in both size and morphology, corroborating the one-dimensional prediction that discrete spectral energy distributions can lead to sizable inaccuracies in the physical properties of a medium, and as a result, the subsequent evolution and observable signatures of objects embedded within it.

79 ASTRONOMY AND ASTROPHYSICS↗

Implicit Monte Carlo with a linear discontinuous finite element material solution and piecewise non-constant opacity

Here, the non-linear thermal radiative-transfer equations can be solved in various ways. One popular way is the Fleck and Cummings Implicit Monte Carlo (IMC) method. The IMC method was originally formulated with piecewise-constant material properties. For domains with a coarse spatial grid and large temperature gradients, an error known as numerical teleportation may cause artificially non-causal energy propagation and consequently an inaccurate material temperature. Source tilting is a technique to reduce teleportation error by constructing sub-spatial-cell (or sub-cell) emission profiles from which IMC particles are sampled. Several source tilting schemes exist, but some allow teleportation error to persist. We examine the effect of source tilting in problems with a temperature-dependent opacity. Within each cell, the opacity is evaluated continuously from a temperature profile implied by the source tilt. For IMC, this is a new approach to modeling the opacity. We find that applying both source tilting along with a source tilt-dependent opacity can introduce another dominant error that overly inhibits thermal wavefronts. We show that we can mitigate both teleportation and under-propagation errors if we discretize the temperature equation with a linear discontinuous (LD) trial space. Our method is for opacities ~ 1/T 3 , but we formulate and test a slight extension for opacities ~ 1/T 3.5 , where T is temperature. We find our method avoids errors that can be incurred by IMC with continuous source tilt constructions and piecewise-constant material temperature updates.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Exploring the feasibility of lossy compression for PDE simulations

Checkpoint restart plays an important role in high-performance computing (HPC) applications, allowing simulation runtime to extend beyond a single job allocation and facilitating recovery from hardware failure. Yet, as machines grow in size and in complexity, traditional approaches to checkpoint restart are becoming prohibitive. Current methods store a subset of the application’s state and exploit the memory hierarchy in the machine. However, as the energy cost of data movement continues to dominate, further reductions in checkpoint size are needed. Lossy compression, which can significantly reduce checkpoint sizes, offers a potential to reduce computational cost in checkpoint restart. This article investigates the use of numerical properties of partial differential equation (PDE) simulations, such as bounds on the truncation error, to evaluate the feasibility of using lossy compression in checkpointing PDE simulations. Restart from a checkpoint with lossy compression is considered for a fail-stop error in two time-dependent HPC application codes: PlasComCM and Nek5000. Results show that error in application variables due to a restart from a lossy compressed checkpoint can be masked by the numerical error in the discretization, leading to increased efficiency in checkpoint restart without influencing overall accuracy in the simulation.

97 MATHEMATICS AND COMPUTING↗