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 91 records · Page 5

A mesoscopic link-transmission-model able to track individual vehicles

Macroscopic traffic flow is a common choice for large-scale traffic simulations. These models do not provide individual-specific metrics as outputs. However, this treatment is necessary in agent-based-models, as in, for example, assigning routes based on personal characteristics. Here, in this paper, we propose an extension of the link-transmission-model, an efficient and yet accurate discretization of the Lighthill-Whitham-Richards (LWR) model, which allow vehicles to be tracked individually while keeping the main features of the underlying model. The extension comprises modifying the link and node models to ensure that the flow between links is always at discrete levels. Therefore, every unit of flow is associated with one individual vehicle moving from its current to its next link. An upper bound of the discretization error is provided. We show that the proposed model resembles its continuous counterpart on lane drop, merge, and diverge cases. In addition, we apply the model into three different networks to validate its applicability in large networks. Finally, we also confirm the parameter transferability between continuous and discrete models and that both can well reproduce field data.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Efficient DSMC collision-partner selection schemes.

The effect of collision-partner selection schemes on the accuracy and the efficiency of the Direct Simulation Monte Carlo (DSMC) method of Bird is investigated. Several schemes to reduce the total discretization error as a function of the mean collision separation and the mean collision time are examined. These include the historically first sub-cell scheme, the more recent nearest-neighbor scheme, and various near-neighbor schemes, which are evaluated for their effect on the thermal conductivity for Fourier flow. Their convergence characteristics as a function of spatial and temporal discretization and the number of simulators per cell are compared to the convergence characteristics of the sophisticated and standard DSMC algorithms. Improved performance is obtained if the population from which possible collision partners are selected is an appropriate fraction of the population of the cell.

99 GENERAL AND MISCELLANEOUS↗

Efficient DSMC collision-partner selection schemes.

The effect of collision-partner selection schemes on the accuracy and the efficiency of the Direct Simulation Monte Carlo (DSMC) method of Bird is investigated. Several schemes to reduce the total discretization error as a function of the mean collision separation and the mean collision time are examined. These include the historically first sub-cell scheme, the more recent nearest-neighbor scheme, and various near-neighbor schemes, which are evaluated for their effect on the thermal conductivity for Fourier flow. Their convergence characteristics as a function of spatial and temporal discretization and the number of simulators per cell are compared to the convergence characteristics of the sophisticated and standard DSMC algorithms. Improved performance is obtained if the population from which possible collision partners are selected is an appropriate fraction of the population of the cell.

99 GENERAL AND MISCELLANEOUS↗

Improved-efficiency DSMC collision-partner selection schemes.

The effect of collision-partner selection schemes on the accuracy and the efficiency of the Direct Simulation Monte Carlo (DSMC) method of Bird is investigated. Several schemes to reduce the total discretization error as a function of the mean collision separation and the mean collision time are examined. These include the historically first sub-cell scheme, the more recent nearest-neighbor scheme, and various near-neighbor schemes, which are evaluated for their effect on the thermal conductivity for Fourier flow. Their convergence characteristics as a function of spatial and temporal discretization and the number of simulators per cell are compared to the convergence characteristics of the sophisticated and standard DSMC algorithms. Improved performance is obtained if the population from which possible collision partners are selected is an appropriate fraction of the population of the cell.

99 GENERAL AND MISCELLANEOUS↗

Robust Solution Verification Experiments on Nonuniform Meshes

The activities of verification, validation, and uncertainty quantification (VVUQ) provide a comprehensive means to assess the credibility of computational models. Within VVUQ, solution verification assesses numerical errors and evaluates whether the simulation is sufficiently accurate for its intended applications. As computational modeling gains traction in the development of complex, high-consequence systems, the need for robust solution verification intensifies, particularly because experimental data for these systems are often limited. This work examines improvements in the robustness of Richardson extrapolation (RE), a method commonly used in solution verification to study the discretization error of computational models using a power law. Nonuniform mesh refinement is discussed alongside other pollutants that affect the robustness of the power law model. Maximum likelihood estimation (MLE) is proposed as a robust strategy to address the uncertainty generated by nonuniform mesh refinement. An exploratory computational fluid dynamics (CFD) study of a 2D planar Poiseuille flow is conducted to determine if nonuniform mesh noise can be modeled with this MLE approach for more robust RE.

Weinmeister, Justin [ORNL] (ORCID:0000000160090237↗

On Sub-linear Convergence for Linearly Degenerate Waves in Capturing Schemes

A common attribute of capturing schemes used to find approximate solutions to the Euler equations is a sub-linear rate of convergence with respect to mesh resolution. Purely nonlinear jumps, such as shock waves produce a first-order convergence rate, but linearly degenerate discontinuous waves, where present, produce sub-linear convergence rates which eventually dominate the global rate of convergence. The classical explanation for this phenomenon investigates the behavior of the exact solution to the numerical method in combination with the finite error terms, often referred to as the modified equation. For a first-order method, the modified equation produces the hyperbolic evolution equation with second-order diffusive terms. In the frame of reference of the traveling wave, the solution of a discontinuous wave consists of a diffusive layer that grows with a rate of t{sup 1/2}, yielding a convergence rate of 1/2. Self-similar heuristics for higher order discretizations produce a growth rate for the layer thickness of {Delta}t{sup 1/(p+1)} which yields an estimate for the convergence rate as p/(p+1) where p is the order of the discretization. In this paper we show that this estimated convergence rate can be derived with greater rigor for both dissipative and dispersive forms of the discrete error. In particular, the form of the analytical solution for linear modified equations can be solved exactly. These estimates and forms for the error are confirmed in a variety of demonstrations ranging from simple linear waves to multidimensional solutions of the Euler equations.

99 GENERAL AND MISCELLANEOUS↗

Time-discretization of a plasma-neutral MHD model with a semi-implicit leapfrog algorithm

The semi-implicit leapfrog time-discretization is a workhorse algorithm for initial-value MHD codes to bridge between vastly separated time scales. Inclusion of atomic interactions with neutrals breaks the functional structure of the MHD equations that exploited by the leapfrog. In this work, we address how to best integrate atomic physics into the semi-implicit leapfrog. Following the Crank-Nicolson method, one approach is to time-center the atomic interactions in the linear solver and use a Newton method to include the nonlinear contributions. Alternatively, another family of methods are based on operator-splitting the terms associated with the atomic interactions using a Strang-splitting technique. These methods naturally break equations into constituent ODE and PDE parts and preserve the structure exploited by the semi-implicit leapfrog. We study the accuracy and efficiency of these methods through a battery of 0D and 1D cases and show that a second-order-in-time Douglas-Rachford inspired coupling between the ODE and PDE advances is effective in reducing the time-discretization error to be comparable to that of Crank-Nicolson with Newton iteration of the nonlinear terms. Splitting ODE and PDE parts results in independent matrix solves for each field which reduces the computational cost considerably and provides parallelization over species relative to Crank-Nicolson.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Multilevel Monte Carlo methods for the Grad-Shafranov free boundary problem

The equilibrium configuration of a plasma in an axially symmetric reactor is described mathematically by a free boundary problem associated with the celebrated Grad-Shafranov equation. The presence of uncertainty in the model parameters introduces the need to quantify the variability in the predictions. This is often done by computing a large number of model solutions on a computational grid for an ensemble of parameter values and then obtaining estimates for the statistical properties of solutions. In this study, we explore the savings that can be obtained using multilevel Monte Carlo methods, which reduce costs by performing the bulk of the computations on a sequence of spatial grids that are coarser than the one that would typically be used for a simple Monte Carlo simulation. We examine this approach using both a set of uniformly refined grids and a set of adaptively refined grids guided by a discrete error estimator. Numerical experiments show that multilevel methods dramatically reduce the cost of simulation, with cost reductions typically on the order of 60 or more and possibly as large as 200. Furthermore, adaptive griding results in more accurate computation of geometric quantities such as x-points associated with the model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Not so HOT Triangulations

Here, we propose primal–dual mesh optimization algorithms that overcome shortcomings of the standard algorithm while retaining some of its desirable features. “Hodge-Optimized Triangulations” defines the “HOT energy” as a bound on the discretization error of the diagonalized Delaunay Hodge star operator. HOT energy is a natural choice for an objective function, but unstable for both mathematical and algorithmic reasons: it has minima for collapsed edges, and its extrapolation to non-regular triangulations is inaccurate and has unbounded minima. We propose a different extrapolation with a stronger theoretical foundation, and avoid extrapolation by recalculating the objective just beyond the flip threshold. We propose new objectives, based on normalizations of the HOT energy, with barriers to edge collapses and other undesirable configurations. We propose mesh improvement algorithms coupling these. When HOT optimization nearly collapses an edge, we actually collapse the edge. Otherwise, we use the barrier objective to update positions and weights and remove vertices. By combining discrete connectivity changes with continuous optimization, we more fully explore the space of possible meshes and obtain higher quality solutions.

97 MATHEMATICS AND COMPUTING↗

Renormalization of heavy-light currents in moving nonrelativistic QCD

Heavy-light decays such as B{yields}{pi}l{nu}, B{yields}K*{gamma} and B{yields}K{sup (*)}ll can be used to constrain the parameters of the standard model and in indirect searches for new physics. While the precision of experimental results has improved over the last years this has still to be matched by equally precise theoretical predictions. The calculation of heavy-light form factors is currently carried out in lattice QCD. Because of its small Compton wavelength we discretize the heavy quark in an effective nonrelativistic theory. By formulating the theory in a moving frame of reference discretization errors in the final state are reduced at large recoil. Over the last years the formalism has been improved and tested extensively. Systematic uncertainties are reduced by renormalizing the m(oving) NRQCD action and heavy-light decay operators. The theory differs from QCD only for large loop momenta at the order of the lattice cutoff and the calculation can be carried out in perturbation theory as an expansion in the strong coupling constant. In this paper we calculate the one-loop corrections to the heavy-light vector and tensor operator. Because of the complexity of the action the generation of lattice Feynman rules is automated and loop integrals are solved by the adaptive Monte Carlo integrator VEGAS. We discuss the infrared and ultraviolet divergences in the loop integrals both in the continuum and on the lattice. The light quarks are discretized in the ASQTad and highly improved staggered quark (HISQ) action; the formalism is easily extended to other quark actions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Advanced numerical methods in mesh generation and mesh adaptation

Numerical solution of partial differential equations requires appropriate meshes, efficient solvers and robust and reliable error estimates. Generation of high-quality meshes for complex engineering models is a non-trivial task. This task is made more difficult when the mesh has to be adapted to a problem solution. This article is focused on a synergistic approach to the mesh generation and mesh adaptation, where best properties of various mesh generation methods are combined to build efficiently simplicial meshes. First, the advancing front technique (AFT) is combined with the incremental Delaunay triangulation (DT) to build an initial mesh. Second, the metric-based mesh adaptation (MBA) method is employed to improve quality of the generated mesh and/or to adapt it to a problem solution. We demonstrate with numerical experiments that combination of all three methods is required for robust meshing of complex engineering models. The key to successful mesh generation is the high-quality of the triangles in the initial front. We use a black-box technique to improve surface meshes exported from an unattainable CAD system. The initial surface mesh is refined into a shape-regular triangulation which approximates the boundary with the same accuracy as the CAD mesh. The DT method adds robustness to the AFT. The resulting mesh is topologically correct but may contain a few slivers. The MBA uses seven local operations to modify the mesh topology. It improves significantly the mesh quality. The MBA method is also used to adapt the mesh to a problem solution to minimize computational resources required for solving the problem. The MBA has a solid theoretical background. In the first two experiments, we consider the convection-diffusion and elasticity problems. We demonstrate the optimal reduction rate of the discretization error on a sequence of adaptive strongly anisotropic meshes. The key element of the MBA method is construction of a tensor metric from hierarchical edge-based error estimates. We conclude that the quasi-optimal mesh must be quasi-uniform in this metric. All numerical experiments are based on the publicly available Ani3D package, the collection of advanced numerical instruments.

99 GENERAL AND MISCELLANEOUS↗

In‐memory integration of existing software components for parallel adaptive unstructured mesh workflows

Summary Reliable mesh‐based simulations are needed to solve complex engineering problems. Mesh adaptivity can increase reliability by reducing discretization errors but requires multiple software components to exchange information. Often, components exchange information by reading and writing a common file format. This file‐based approach becomes a problem on massively parallel computers where filesystem bandwidth is a critical performance bottleneck. Our approach using data streams and component interfaces avoids the filesystem bottleneck. In this paper, we present these techniques and their use for coupling mesh adaptivity to the PHASTA computational fluid dynamics solver, the Albany multi‐physics framework, and the Omega3P linear accelerator frequency analysis applications. Performance results are reported on up to 16,384 cores of an Intel Knights Landing‐based system.

Smith, Cameron W.↗

A low-communication, parallel algorithm for solving PDEs based on range decomposition

This work proposes a new, low-communication algorithm for solving PDEs on massively parallel computers. The range decomposition (RD) algorithm exposes coarse-grain parallelism by applying nested iteration and adaptive mesh refinement locally before performing a global communication step. Just a few such steps are observed to be sufficient to obtain accuracy within a small multiple of discretization error. The target applications are petascale and exascale machines, where hierarchical parallelism is required and traditional parallel numerical PDE communication patterns are costly because of message latency. The RD algorithm uses a partition of unity to equally distribute the error, and thus, the work. The computational advantages of this approach are that the decomposed problems can be solved in parallel without any communication until the partitioned solutions are summed. This offers potential advantages in the paradigm of expensive communication but very cheap computation. This paper introduces the method and explains the details of the communication step. Two performance models are developed, showing that the latency cost associated with a traditional parallel implementation of nested iteration is proportional to log(P) 2 , whereas the RD method reduces the communication latency to log(P), while maintaining similar bandwidth costs. Numerical results for two problems, Laplace and advection diffusion, demonstrate the enhanced performance, and a heuristic argument explains why the method converges quickly.

97 MATHEMATICS AND COMPUTING↗

An embedded mesh method using piecewise constant multipliers with stabilization: mathematical and numerical aspects

An embedded mesh method using piecewise constant multipliers originally proposed by Puso et al. (CMAME, 2012) is analyzed here to determine effects of the pressure stabilization term and small cut cells. The approach is implemented for transient dynamics using the central difference scheme for the time discretization. It is shown that the resulting equations of motion are a stable linear system with a condition number independent of mesh size. Furthermore, we show that the constraints and the stabilization terms can be recast as non-proportional damping such that the time integration of the scheme is provably stable with a critical time step computed from the undamped equations of motion. Effects of small cuts are discussed throughout the presentation. A mesh study is conducted to evaluate the effects of the stabilization on the discretization error and conditioning and is used to recommend an optimal value for stabilization scaling parameter. Several nonlinear problems are also analyzed and compared with comparable conforming mesh results. Finally, we show several demanding problems highlighting the robustness of the proposed approach.

42 ENGINEERING↗

Interactions of πK, ππK and KKπ systems at maximal isospin from lattice QCD

We study the interactions of systems of two and three nondegenerate mesons composed of pions and kaons at maximal isospin using lattice QCD, specifically $π^+K^+, π^+π^+K^+$ and $K^+K^+π^+$. Utilizing the stochastic LapH method, we determine the spectrum of these systems on two CLS $N_f$ = 2 + 1 ensembles with pion masses of 200 MeV and 340 MeV, and include many levels in different momentum frames. We constrain the K matrices describing two- and three-particle interactions by fitting the spectrum to the results predicted by the finite-volume formalism, including up to p waves. This requires also results for the $π^+π^+$ and $K^+K^+$ spectrum, which have been obtained previously on the same configurations. We explore different fitting strategies, comparing fits to energy shifts with fits to energies boosted to the rest frame, and also comparing simultaneous global fits to all relevant two- and three-particle channels to those where we first fit twoparticle channels and then add in the three-particle information. We provide the first determination of the three-particle K matrix in $π^+π^+K^+$ and $K^+K^+π^+$ systems, finding statistically significant nonzero results in most cases. We include s and $\textit{p}$ waves in the K matrix for $π^+K^+$ scattering, finding evidence for an attractive p-wave scattering length. We compare our results to Chiral Perturbation Theory, including an investigation of the impact of discretization errors, for which we provide the leading order predictions obtained using Wilson Chiral Perturbation Theory.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Binary optimal control by trust-region steepest descent

Abstract We present a trust-region steepest descent method for dynamic optimal control problems with binary-valued integrable control functions. Our method interprets the control function as an indicator function of a measurable set and makes set-valued adjustments derived from the sublevel sets of a topological gradient function. By combining this type of update with a trust-region framework, we are able to show by theoretical argument that our method achieves asymptotic stationarity despite possible discretization errors and truncation errors during step determination. To demonstrate the practical applicability of our method, we solve two optimal control problems constrained by ordinary and partial differential equations, respectively, and one topological optimization problem.

97 MATHEMATICS AND COMPUTING↗

Low-dimensional supersymmetric lattice models

We study and simulate N=2 supersymmetric Wess-Zumino models in one and two dimensions. For any choice of the lattice derivative, the theories can be made manifestly supersymmetric by adding appropriate improvement terms corresponding to discretizations of surface integrals. In one dimension, our simulations show that a model with the Wilson derivative and the Stratonovich prescription for this discretization leads to far better results at finite lattice spacing than other models with Wilson fermions considered in the literature. In particular, we check that fermionic and bosonic masses coincide and the unbroken Ward identities are fulfilled to high accuracy. Equally good results for the effective masses can be obtained in a model with the SLAC derivative (even without improvement terms). In two dimensions we introduce a non-standard Wilson term in such a way that the discretization errors of the kinetic terms are only of order O(a{sup 2}). Masses extracted from the corresponding manifestly supersymmetric model prove to approach their continuum values much quicker than those from a model containing the standard Wilson term. Again, a comparable enhancement can be achieved in a theory using the SLAC derivative.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Toward more mechanistic representations of biogeochemical processes in river networks: Implementation and demonstration of a multiscale model

A recently introduced multiscale model for representing the effects of small-scale hyporheic-zone biogeochemical processes is extended from the reach scale to river network scales. The model uses advection-dispersion-reaction equations for the channel network and one-dimensional advection-reaction subgrid models for the hyporheic zone. We summarize implementation in the integrated surface/subsurface hydrology modeling system Amanzi-ATS. The extension uses topologically defined meshes to represent stream/river networks and associates a hyporheic subgrid model with each channel grid cell. Biogeochemical reaction modeling capability residing in community software is accessed through an application programming interface. The implementation is verified against independent numerical solutions on a single reach. Mesh convergence studies show that commonly used semi-distributed representations can introduce significant spatial discretization error. Denitrification of farm runoff in a subbasin of the Portage River Basin in Ohio, USA is used to demonstrate the general-purpose reactive transport capability.

54 ENVIRONMENTAL SCIENCES↗