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 145 records · Page 8

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↗

An Anisotropic Scale-Invariant Unstructured Mesh Generator Auitable for Volumetric Imaging Data

Mesh generation algorithms must consider the computational physics schemes to be adopted insomuch as tessellation should attempt to minimize discretization error metrics a priori, while placing elements judiciously yet economically. Basing local element size and shape on local geometric feature size is a promising approach, as the underlying physics may either be scale-invariant or may vary with scale in a predictable way. We present a boundary-fitted scale-invariant unstructured tetrahedral mesh generation algorithm that enables registration of element size to local geometric scale, given a triangulated mesh surface. The resulting tetrahedra are well-shaped and nearly orthogonal to the boundary. Unlike previous feature-based approaches, our algorithm does not require a background mesh, nor does it rely on the medial-axis. In contrast, as a first step, our algorithm produces a gradientlimited feature-size field over the input surface based on efficient ray casting. We illustrate how this field can be used to produce quality grids for computational fluid dynamics based simulations of challenging, topologically complex surfaces derived from magnetic resonance images. The algorithm is implemented in the Pacific Northwest National Laboratory (PNNL) version of the Los Alamos grid toolbox LaGriT[6].

36 MATERIALS SCIENCE↗

Computation of stationary 3D halo currents in fusion devices with accuracy control

This paper addresses the calculation of the resistive distribution of halo currents in three-dimensional structures of large magnetic confinement fusion machines. A Neumann electrokinetic problem is solved on a geometry so complicated that complementarity is used to monitor the discretization error. An irrotational electric field is obtained by a geometric formulation based on the electric scalar potential, whereas three geometric formulations are compared to obtain a solenoidal current density: a formulation based on the electric vector potential and two geometric formulations inspired from mixed and mixed-hybrid Finite Elements. The electric vector potential formulation is usually considered impractical since an enormous computing power is wasted by the topological pre-processing it requires. To solve this challenging problem, we present novel algorithms based on lazy cohomology generators that enable to save orders of magnitude computational time with respect to all other state-of-the-art solutions proposed in literature. Believing that our results are useful in other fields of scientific computing, the proposed algorithm is presented as a detailed pseudocode in such a way that it can be easily implemented.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Galerkin v. least-squares Petrov–Galerkin projection in nonlinear model reduction

Least-squares Petrov–Galerkin (LSPG) model-reduction techniques such as the Gauss–Newton with Approximated Tensors (GNAT) method have shown promise, as they have generated stable, accurate solutions for large-scale turbulent, compressible flow problems where standard Galerkin techniques have failed. Furthermore, there has been limited comparative analysis of the two approaches. This is due in part to difficulties arising from the fact that Galerkin techniques perform optimal projection associated with residual minimization at the time-continuous level, while LSPG techniques do so at the time-discrete level. This work provides a detailed theoretical and computational comparison of the two techniques for two common classes of time integrators: linear multistep schemes and Runge–Kutta schemes. We present a number of new findings, including conditions under which the LSPG ROM has a time-continuous representation, conditions under which the two techniques are equivalent, and time-discrete error bounds for the two approaches. Perhaps most surprisingly, we demonstrate both theoretically and computationally that decreasing the time step does not necessarily decrease the error for the LSPG ROM; instead, the time step should be ‘matched’ to the spectral content of the reduced basis. In numerical experiments carried out on a turbulent compressible-flow problem with over one million unknowns, we show that increasing the time step to an intermediate value decreases both the error and the simulation time of the LSPG reduced-order model by an order of magnitude.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal design of acoustic metamaterial cloaks under uncertainty

In this work, we consider the problem of optimal design of an acoustic cloak under uncertainty and develop scalable approximation and optimization methods to solve this problem. The design variable is taken as an infinite-dimensional spatially-varying field that represents the material property, while an additive infinite-dimensional random field represents the variability of the material property or the manufacturing error. Discretization of this optimal design problem results in high-dimensional design variables and uncertain parameters. To solve this problem, we develop a computational approach based on a Taylor approximation and an approximate Newton method for optimization, which is based on a Hessian derived at the mean of the random field. We show our approach is scalable with respect to the dimension of both the design variables and uncertain parameters, in the sense that the necessary number of acoustic wave propagations is essentially independent of these dimensions, for numerical experiments with up to one million design variables and half a million uncertain parameters. Additionally, we demonstrate that, using our computational approach, an optimal design of the acoustic cloak that is robust to material uncertainty is achieved in a tractable manner. The optimal design under uncertainty problem is posed and solved for the classical circular obstacle surrounded by a ring-shaped cloaking region, subjected to both a single-direction single-frequency incident wave and multiple-direction multiple-frequency incident waves. Finally, we apply the method to a deterministic large-scale optimal cloaking problem with complex geometry, to demonstrate that the approximate Newton method’s Hessian computation is viable for large, complex problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-variance replica exchange SGMCMC for inverse and forward problems via Bayesian PINN

Physics-informed neural network (PINN) has been successfully applied in solving a variety of nonlinear non-convex forward and inverse problems. However, the training is challenging because of the non-convex loss functions and the multiple optima in the Bayesian inverse problem. In this work, we propose a multi-variance replica exchange stochastic gradient Langevin dynamics method to tackle the challenge of the multiple local optima in the optimization and the challenge of the multiple modal posterior distribution in the inverse problem. Replica exchange methods are capable of escaping from the local traps and accelerating the convergence; two chains with different temperatures are designed where the low temperature chain aims for the local convergence, and the target of the high temperature chain is to travel globally and explore the whole loss function entropy landscape. However, it may not be efficient to solve mathematical inversion problems by using the vanilla replica method directly since the method doubles the computational cost in evaluating the forward solvers (likelihood functions) in the two chains. To address this issue, we propose to make different assumptions on the energy function estimation and this facilities one to use solvers of different fidelities in the likelihood function evaluation. More precisely, one can use a solver with low fidelity in the high temperature chain while using a solver with high fidelity in the low temperature chain. Our proposed method significantly lowers the computational cost in the high temperature chain, meanwhile preserving the accuracy and converging very fast. Here we give an unbiased estimate of the swapping rate and give an estimation of the discretization error of the scheme. To verify our idea, we design and solve four inverse problems which have multiple modes. The proposed method is also employed to train the Bayesian PINN to solve the forward and inverse problems; faster and more accurate convergence has been observed when compared to the stochastic gradient Langevin dynamics (SGLD) method and vanilla replica exchange methods.

97 MATHEMATICS AND COMPUTING↗

A discrete integral transform for rapid spectral synthesis

Accurate synthetic spectra that rely on large Line-By-Line (LBL)-databases are used in a wide range of applications such as high temperature combustion, atmospheric re-entry, planetary surveillance and laboratory plasmas. Conventionally synthetic spectra are calculated by computing a lineshape for every spectral line in the database and adding those together, which may take multiple hours for large databases. In this paper we propose a new approach for spectral synthesis based on an integral transform: the synthetic spectrum is calculated as the integral over the product of a Voigt profile and a newly proposed three-dimensional “lineshape distribution function”, which is a function of spectral position and Gaussian- & Lorentzian width coordinates. A fast discrete version of this transform based on the Fast Fourier Transform (FFT) is proposed, which improves performance compared to the conventional approach by several orders of magnitude while maintaining accuracy. Strategies that minimize the discretization error are discussed. A Python implementation of the method is compared against state-of-the-art spectral code RADIS, and is since adopted as RADIS's default synthesis method. The synthesis of a benchmark CO2 spectrum consisting of 1.8 M spectral lines and 200k spectral points took only 3.1 s using the proposed method (1011 lines × spectral points/s), a factor ~300 improvement over the state-of-the-art, with the relative improvement generally increasing for higher number of lines and/or number of spectral points. Finally, an experimental GPU-implementation of the method was also benchmarked, which demonstrated another 2~3 orders performance increase, achieving up to 5 ∙ 10 14 lines × spectral points/s.

42 ENGINEERING↗

Machine learning from RANS and LES to inform coarse grid simulations

Nuclear system thermal hydraulic analysis has historically relied on computationally inexpensive 1D codes. However, such tools are unable to capture multiscale multidimensional effects in large nuclear reactor enclosures. On the other hand, simulations with higher fidelity can be too expensive for such purposes. One of the ways to reduce computational cost is to perform simulations on a coarse grid, which, unfortunately, introduces large discretization errors. In this paper, two high-to-low data-driven approaches are investigated: (1) a coarse grid turbulence model to predict eddy viscosity and (2) correction of errors in coarse grid velocity fields. The approaches aim to reduce grid- and turbulence model-induced errors in coarse grid Reynolds-averaged Navier–Stokes (RANS) simulations. Two sources of high-fidelity data, RANS and large eddy simulations (LES), are explored. To extract the eddy viscosity from the LES data, an inverse optimization problem is solved. However, the LES eddy viscosity is shown to be comparable to the RANS eddy viscosity in terms of error reduction. Therefore, the directly available RANS eddy viscosity was used to develop a coarse grid data-driven turbulence model. Additionally, error correction in velocity is used to reduce the remaining uncertainties and bring the results closer to reality. In conclusion, the performance of the frameworks is demonstrated for a scaled upper plenum of a gas-cooled reactor facility.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Numerically Relevant Timescales in the MG2 Microphysics Model

Climate models rely on parameterizations of a variety of processes in the atmospheric physics, but a common concern is that the temporal resolution is too coarse to consistently resolve the behavior that individual parameterizations are designed to capture. This study examines timescales numerically derived from the Morrison-Gettelman (MG2) microphysics as implemented within the Energy Exascale Earth System Model, version 1 (E3SMv1). Numerically relevant timescales in MG2 are derived by computing the eigenspectrum of its Jacobian. These timescales are found to often be smaller than the default 5 min time step used for MG2. The fast timescales are then heuristically connected to individual microphysics processes. By substepping a few particular rain processes within MG2, the time discretization error for those processes was considerably reduced with minimal additional expense to the overall microphysics. While this improvement has a substantial effect on the target processes and on the vertical distribution of stratiform-derived rain within E3SMv1, the overall model climate is found to not be sensitive to MG2 time step. Here, we hypothesize that this is because the surface climate does not depend strongly on certain process rates, especially MG2's rain evaporation rate.

58 GEOSCIENCES↗

Automatic Time Step Control to Resolve Hydromechanically Driven Fault Reactivation, Spontaneous Nucleation, and Seismic Arrest

Abstract A physical understanding of the progression from flow‐driven (quasi‐static) poromechanical deformation to dynamic fault rupture is critical to the resilient operations of several engineering systems. These processes are bridged by a progression from fault reactivation to the spontaneous nucleation of unstable sliding. Toward addressing this challenge, novel automatic time step size control methods are developed to enable accurate and efficient simulation of these dynamics and transitions from the first principles. The controllers combine local models for discretization error and Coulomb failure conditions to automatically adjust the time step size across several orders of magnitude. The methods do not require additional empirical or theoretical input and can resolve the pre‐rupture, interseismic, and seismic periods to the allowed accuracy. The computational results reveal that the proposed methods automatically capture the onset of reactivation and nucleation for homogeneous and heterogeneous fields. Hydrodynamic and structural heterogeneity lead to disparate critical nucleation sizes compared to those predicted by theory. The results highlight its potential in predicting induced seismicity in realistic subsurface engineering systems and at practical scales.

Environmental Sciences & Ecology↗

Water Mass Transformation Budgets in Finite‐Volume Generalized Vertical Coordinate Ocean Models

Water Mass Transformation (WMT) theory provides conceptual tools that in principle enable innovative analyses of numerical ocean models; in practice, however, these methods can be challenging to implement and interpret, and therefore remain under-utilized. Our aim is to demonstrate the feasibility of diagnosing all terms in the water mass budget and to exemplify their usefulness for scientific inquiry and model development by quantitatively relating water mass changes, overturning circulations, boundary fluxes, and interior mixing. We begin with a pedagogical derivation of key results of classical WMT theory. We then describe best practices for diagnosing each of the water mass budget terms from the output of Finite-Volume Generalized Vertical Coordinate (FV-GVC) ocean models, including the identification of a non-negligible remainder term as the spurious numerical mixing due to advection scheme discretization errors. We illustrate key aspects of the methodology through the analysis of a polygonal region of the Greater Baltic Sea in a regional demonstration simulation using the Modular Ocean Model v6 (MOM6). We verify the convergence of our WMT diagnostics by brute-force, comparing time-averaged (“offline”) diagnostics on various vertical grids to timestep-averaged (“online”) diagnostics on the native model grid. Finally, we briefly describe a stack of xarray-enabled Python packages for evaluating WMT budgets in FV-GVC models (culminating in the new xwmb package), which is intended to be model-agnostic and available for community use and development.

54 ENVIRONMENTAL SCIENCES↗

Well-balanced treatment of gravity in astrophysical fluid dynamics simulations at low Mach numbers

We report accurate simulations of flows in stellar interiors are crucial to improving our understanding of stellar structure and evolution. Because the typically slow flows are merely tiny perturbations on top of a close balance between gravity and the pressure gradient, such simulations place heavy demands on numerical hydrodynamics schemes. We demonstrate how discretization errors on grids of reasonable size can lead to spurious flows orders of magnitude faster than the physical flow. Well-balanced numerical schemes can deal with this problem. Three such schemes were applied in the implicit, finite-volume SEVEN-LEAGUE HYDRO code in combination with a low-Mach-number numerical flux function. We compare how the schemes perform in four numerical experiments addressing some of the challenges imposed by typical problems in stellar hydrodynamics. We find that the α-β and deviation well-balancing methods can accurately maintain hydrostatic solutions provided that gravitational potential energy is included in the total energy balance. They accurately conserve minuscule entropy fluctuations advected in an isentropic stratification, which enables the methods to reproduce the expected scaling of convective flow speed with the heating rate. The deviation method also substantially increases accuracy of maintaining stationary orbital motions in a Keplerian disk on long timescales. The Cargo–LeRoux method fares substantially worse in our tests, although its simplicity may still offer some merits in certain situations. Overall, we find the well-balanced treatment of gravity in combination with low Mach number flux functions essential to reproducing correct physical solutions to challenging stellar slow-flow problems on affordable collocated grids.

79 ASTRONOMY AND ASTROPHYSICS↗