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 523 records · Page 29

Development of a River Dynamical Core for E3SM to simulate compound flooding on Exascale-class heterogeneous supercomputers

Flooding events pose significant risk to human life, property, and infrastructure. Physically-consistent quantification of altered flood risks in global models requires hyper-resolution (~1 km) or fine flood simulations using two-dimensional (2D) physics schemes, both of which are unavailable in the current generation Earth System Models. Here, in this work, we have developed the River Dynamical Core (RDycore), which is an open-source, 2D shallow water equation (SWE) library for the U.S. Department of Energy's Energy Exascale Earth System Model (E3SM). RDycore uses PETSc and libCEED libraries that allows it to run efficiently on CPUs and GPUs, as well as select a time-integration algorithm at runtime without requiring any code modifications. RDycore achieves spatial error convergence rates for problems with analytical and manufactured solutions similar to those reported previously in the literature, or consistent with the implemented first-order spatial discretization scheme. RDycore's accuracy in predicting flooding for a well-studied dam break problem is comparable to existing SWE models. For a problem with 471 million grid cells, RDycore achieves a speedup of 6.6x and 7.6x on GPUs compared to CPUs when using 320 compute nodes on DOE's Perlmutter and Frontier supercomputers, respectively. The one-way coupling of the RDycore library within E3SM is demonstrated by performing multiple 5-day flooding simulations during Hurricane Harvey driven by five precipitation datasets. The E3SM--RDycore simulations at 30 m spatial resolution accurately simulate maximum water height during the hurricane when benchmarked against a previously published study and achieve a speedup of 15x (Perlmutter) and 21x (Frontier) on GPUs relative to CPUs. The work presented here is the foundational step in providing hardware and algorithmic portability framework for simulating kilometer-scale river dynamics within E3SM.

Flood Simulation↗

Hybrid framework for the simulation of stochastic chemical kinetics

Stochasticity plays a fundamental role in various biochemical processes, such as cell regulatory networks and enzyme cascades. Isothermal, well-mixed systems can be modelled as Markov processes, typically simulated using the Gillespie Stochastic Simulation Algorithm (SSA) [25]. While easy to implement and exact, the computational cost of using the Gillespie SSA to simulate such systems can become prohibitive as the frequency of reaction events increases. This has motivated numerous coarse-grained schemes, where the “fast” reactions are approximated either using Langevin dynamics or deterministically. While such approaches provide a good approximation when all reactants are abundant, the approximation breaks down when one or more species exist only in small concentrations and the fluctuations arising from the discrete nature of the reactions become significant. This is particularly problematic when using such methods to compute statistics of extinction times for chemical species, as well as simulating non-equilibrium systems such as cell-cycle models in which a single species can cycle between abundance and scarcity. In this paper, a hybrid jump-diffusion model for simulating well-mixed stochastic kinetics is derived. It acts as a bridge between the Gillespie SSA and the chemical Langevin equation. For low reactant reactions the underlying behaviour is purely discrete, while purely diffusive when the concentrations of all species are large, with the two different behaviours coexisting in the intermediate region. A bound on the weak error in the classical large volume scaling limit is obtained, and three different numerical discretisations of the jump-diffusion model are described. The benefits of such a formalism are illustrated using computational examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the time growth of the error of the DG method for advective problems

Abstract In this paper we derive a priori $L^{\infty }(L^{2})$ and L2(L2) error estimates for a linear advection–reaction equation with inlet and outlet boundary conditions. The goal is to derive error estimates for the discontinuous Galerkin method that do not blow up exponentially with respect to time, unlike the usual case when Gronwall’s inequality is used. While this is possible in special cases, such as divergence-free advection fields, we take a more general approach using exponential scaling of the exact and discrete solutions. Here we use a special scaling function, which corresponds to time taken along individual pathlines of the flow. For advection fields, where the time that massless particles carried by the flow spend inside the spatial domain is uniformly bounded from above by some $\widehat{T}$, we derive $\mathcal{O}$(hp+1/2) error estimates where the constant factor depends only on $\widehat{T}$, but not on the final time T. This can be interpreted as applying Gronwall’s inequality in the error analysis along individual pathlines (Lagrangian setting), instead of physical time (Eulerian setting).

Mathematics↗

Unit Commitment With Continuous-Time Generation and Ramping Trajectory Models

There is increasing evidence of shortage of ramping resources in the real-time operation of power systems. To explain and remedy this problem systematically, we take a novel look at the way the day-ahead unit commitment (UC) problem represents the information about load, generation and ramping constraints. We specifically investigate the approximation error made in mapping of the original problem, that would decide the continuous-time generation and ramping trajectories of the committed generating units, onto the discrete-time problem that is solved in practice. We first show that current practice amounts to approximating the trajectories with linear splines. We then offer a different representation through cubic splines that provides physically feasible schedules and increases the accuracy of the continuous-time generation and ramping trajectories by capturing sub-hourly variations and ramping of load in the day-ahead power system operation. The corresponding day-ahead UC model is formulated as an instance of mixed-integer linear programming (MILP), with the same number of binary variables as the traditional UC formulation. Numerical simulation over real load data from the California ISO demonstrate that the proposed UC model reduces the total day-ahead and real-time operation cost, and the number of events of ramping scarcity in the real-time operations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Spatially Varying Embedded Stochastic Galerkin Methods for Steady-State PDEs

Existing discretizations for stochastic PDEs, based on a tensor product between the deter ministic basis and the stochastic basis, treat the required resolution of uncertainty as uniform across the physical domain. However, solutions to many PDEs of interest exhibit spatially localized features that may result in uncertainty being severely over or under-resolved by existing discretizations. In this report, we explore the mechanics and accuracy of using a spatially varying stochastic expansion. This is achieved through an adaptive refinement algorithm where simple error estimates are used to independently drive refinement of the stochastic basis at each point in the physical domain. Results are presented comparing the accuracy of the adaptive techinque to the accuracy achieved using uniform refinement.

Cyr, Eric C.↗

SIMULATED HUMAN ERROR PROBABILITY AND ITS APPLICATION TO DYNAMIC HUMAN FAILURE EVENTS

Abstract Objectives: Human reliability analysis (HRA) methods typically analyze human failure events (HFEs) at the overall task level. For dynamic HRA, it is important to model human activities at the subtask level. There exists a disconnect between dynamic subtask level and static task level that presents issues when modeling dynamic scenarios. For example, the SPAR-H method is typically used to calculate the human error probability (HEP) at the task level. As demonstrated in this paper, quantification in SPAR-H does not translate to the subtask level. Methods: Two different discrete distributions were generated for each SPAR-H Performance Shaping Factor (PSF) to define the frequency of PSF levels. The first distribution was a uniform, or uninformed distribution that assumed the frequency of each PSF level was equally likely. The second non-continuous distribution took the frequency of PSF level as identified from an assessment of the HERA database. These two different approaches were created to identify the resulting distribution of the HEP. The resulting HEP that appears closer to the known distribution, a log-normal centered on 1E-3, is the more desirable. Each approach then has median, average and maximum HFE calculations applied. To calculate these three values, three events, A, B and C are generated from the PSF level frequencies comprised of subtasks. The median HFE selects the median PSF level from each PSF and calculates HEP. The average HFE takes the mean PSF level, and the maximum takes the maximum PSF level. The same data set of subtask HEPs yields starkly different HEPs when aggregated to the HFE level in SPAR-H. Results: Assuming that each PSF level in each HFE is equally likely creates an unrealistic distribution of the HEP that is centered at 1. Next the observed frequency of PSF levels was applied with the resulting HEP behaving log-normally with a majority of the values under 2.5% HEP. The median, average and maximum HFE calculations did yield different answers for the HFE. The HFE maximum grossly over estimates the HFE, while the HFE distribution occurs less than HFE median, and greater than HFE average. Conclusions: Dynamic task modeling can be perused through the framework of SPAR-H. Identification of distributions associated with each PSF needs to be defined, and may change depending upon the scenario. However it is very unlikely that each PSF level is equally likely as the resulting HEP distribution is strongly centered at 100%, which is unrealistic. Other distributions may need to be identified for PSFs, to facilitate the transition to dynamic task modeling. Additionally discrete distributions need to be exchanged for continuous so that simulations for the HFE can further advance. This paper provides a method to explore dynamic subtask to task translation and provides examples of the process using the SPAR-H method.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Converged accelerated finite difference scheme for the multigroup neutron diffusion equation

Computer codes involving neutron transport theory for nuclear engineering applications always require verification to assess improvement. Generally, analytical and semi-analytical benchmarks are desirable, since they are capable of high precision solutions to provide accurate standards of comparison. However, these benchmarks often involve relatively simple problems, usually assuming a certain degree of abstract modeling. In the present work, we show how semi-analytical equivalent benchmarks can be numerically generated using convergence acceleration. Specifically, we investigate the error behavior of a 1D spatial finite difference scheme for the multigroup (MG) steady-state neutron diffusion equation in plane geometry. Since solutions depending on subsequent discretization can be envisioned as terms of an infinite sequence converging to the true solution, extrapolation methods can accelerate an iterative process to obtain the limit before numerical instability sets in. The obtained results have been compared to the analytical solution to the 1D multigroup diffusion equation when available, using FORTRAN as the computational language. Finally, a slowing down problem has been solved using a cascading source update, showing how a finite difference scheme performs for ultra-fine groups (104 groups) in a reasonable computational time using convergence acceleration. (authors)

97 MATHEMATICS AND COMPUTING↗

Beam combining of high-power terahertz lasers with semiconductor metasurface gratings

Spectral beam combining (SBC) of an array of single-mode lasers has the potential for realizing a chip-scale electrically tunable multispectral laser source without any moving parts and with emission at closely spaced discrete frequencies. Here, we demonstrate SBC of an array of single-mode THz quantum-cascade lasers (QCLs) with small frequency spacing. Semiconductor-based metasurface THz blazed gratings are developed for integration with QCLs in a compact cryocooler setup. Single-lobed beams of four QCLs emitting around 3.2 THz and spectrally separated by ~14 GHz are combined to achieve collinear propagation of spatially overlapped and collimated beams in the far field with ≲ 0.1° of pointing error. Peak optical power in the range 50–100 mW is detected from each of the QCLs after combining. The dense frequency spacing in our method provides a pathway to incorporate tens of QCLs on a chip to realize a high-power discretely tunable THz laser source for applications in THz spectroscopy.

Jia, Fei [Lehigh Univ., Bethlehem, PA (United Stat↗

Spectral deferred correction methods for high-order accuracy in poroelastic problems

In this work, we investigate high-order accuracy in time integration by examining two operator splitting methods for poroelastic problems: the two-pass and the spectral deferred correction (SDC) methods. To enhance the order of accuracy, the two-pass method partitions a coupled operator symmetrically, whereas the SDC method corrects truncation errors by establishing an error equation. These high-order methods are applied to underlying solution strategies, i.e., monolithic, fixed-stress sequential, and undrained sequential methods. We observe that semi-discretized systems from spatial discretization have forms similar to those of index-1 differential algebraic equations (DAEs), causing order reduction against the two-pass method when it is used in conjunction with either the monolithic or sequential method. On the other hand, the SDC in conjunction with the monolithic method exhibits the desired second-order accuracy in poroelastic problems while increasing the order of accuracy for index-1 DAEs. However, the SDC in conjunction with either of the two sequential methods does not achieve the desired order of accuracy, and maintains first order because the flow equation for poroelasticity has an additional approximation associated with the volumetric strain rate term, which does not yield exactly the same forms as those of conventional DAEs. Thus, the monolithic SDC method can achieve higher-order accuracy, but may require higher computational costs because it involves solving matrix systems larger than those for the sequential methods.

02 PETROLEUM↗

Impacts of Bulk Microphysics Scheme Structural Choices on Simulations of Rain Initiation Through Drop Coalescence

This study examines how different structural choices in bulk microphysics schemes impact the simulation of warm rain initiation. A single liquid category (SLC) approach prognosing up to four moments of a single drop size distribution (DSD) is compared to the traditional two-category, two-moment approach with separate DSDs for cloud and rain (four total prognostic variables). Different methods for calculating tendencies of the prognostic variables from drop collision-coalescence are also tested: a discretized numerical-integration approach, machine learning via neural networks, lookup tables, and traditional power law fits. Relative to simulations using a bin microphysics model, SLC gives smaller error overall than the two-category approach when numerical integration is used to calculate the collision-coalescence tendencies for both. Replacing the numerical integration with a pre-computed lookup table reduces computational cost with little loss of accuracy. However, using fitted power laws with SLC to represent the collision-coalescence tendencies substantially reduces accuracy and leads to an order of magnitude increase in error. It is also demonstrated that with SLC, reasonably accurate solutions are obtained using only three prognostic moments, while a two-moment SLC scheme leads to substantial error. Overall, both the choice of prognostic moments (e.g., SLC vs. two-category) and method to calculate the collision-coalescence tendencies are important to consider for minimizing errors in bulk schemes. SLC with a sufficiently detailed calculation of the collision-coalescence tendencies provides accurate solutions for a reasonable computational cost, providing a viable alternative to the traditional two-category, two-moment approach for bulk microphysics.

320 (cloud physics and chemistry)↗

Quantum computational phase transition in combinatorial problems

Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical computers, without a proof that bounded-error quantum polynomial time (BQP) ≠ nondeterministic polynomial time (NP), it is necessary to investigate the empirical advantages of QAOA. We identify a computational phase transition of QAOA when solving hard problems such as SAT—random instances are most difficult to train at a critical problem density. We connect the transition to the controllability and the complexity of QAOA circuits. Moreover, we find that the critical problem density in general deviates from the SAT-UNSAT phase transition, where the hardest instances for classical algorithms lies. Then, we show that the high problem density region, which limits QAOA’s performance in hard optimization problems (reachability deficits), is actually a good place to utilize QAOA: its approximation ratio has a much slower decay with the problem density, compared to classical approximate algorithms. Indeed, it is exactly in this region that quantum advantages of QAOA over classical approximate algorithms can be identified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

PM4Stell: A prototype permanent magnet stellarator structure

Permanent magnets provide a possible solution to simplify complicated stellarator coils. Here, a prototype permanent magnet stellarator structure, PM4Stell, has been funded to demonstrate the technical feasibility of using permanent magnets to create the shaping field of a stellarator. Permanent magnets in uniform cubes with three polarization directions will be carefully placed to generate the required magnetic field for a National Compact Stellarator eXperiment-like equilibrium together with planar toroidal field coils. Discrete magnets will be glued together and inserted into a “post-office-box-like” supporting structure. Electromagnetic and structural analyses have been done to validate the design. Error field correction magnets will be used to shim possible error fields. The design efforts of the prototype permanent magnet stellarator structure are discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Absorption Correction for Cylindrical and Annular Specimens and their Containers or Supports

Abstract The absorption correction for cylindrical specimens, typically capillary or annular, is affected by absorption in both the specimen and supporting material. These corrections are calculated here using numerical integration of the lengths through the different regions of the specimen that the beam traverses. Suitable formulae have been derived and built into a computer program for calculating the absorption correction for a range of cylindrical geometries. The influence of absorption in the support is most significant for annular specimens on a highly absorbing core, and for capillary specimens of highly absorbing compounds. The error arising from neglecting absorption in the specimen and additionally in the capillary is demonstrated in Rietveld refinements of LaB6. Interpolation of correction factors between values calculated at discrete θ intervals, and θ offsets arising from absorption are also discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Predictor-Corrector Strategy for Adaptivity in Dynamical Low-Rank Approximations

Here, in this paper, we present a predictor-corrector strategy for constructing rank-adaptive, dynamical low-rank approximations (DLRAs) of matrix-valued ODE systems. The strategy is a compromise between (i) low-rank step-truncation approaches that alternately evolve and compress solutions and (ii) strict DLRA approaches that augment the low-rank manifold using subspaces generated locally in time by the DLRA integrator. The strategy is based on an analysis of the error between a forward temporal update into the ambient full-rank space, which is typically computed in a step-truncation approach before recompressing, and the standard DLRA update, which is forced to live in a low-rank manifold. We use this error, without requiring its full-rank representation, to correct the DLRA solution. A key ingredient for maintaining a low-rank representation of the error is a randomized SVD, which introduces some degree of stochastic variability into the implementation. The strategy is formulated and implemented in the context of discontinuous Galerkin spatial discretizations of PDEs and applied to several versions of DLRA methods found in the literature as well as a new variant. Numerical experiments comparing the predictor-corrector strategy to other methods demonstrate robustness to overcome shortcomings of step truncation or strict DLRA approaches: The former may require more memory than is strictly needed, while the latter may miss transients solution features that cannot be recovered. The effect of randomization, tolerances, and other implementation parameters is also explored.

97 MATHEMATICS AND COMPUTING↗

Frequency extrapolation by nonconvex compressive sensing

Tomographic imaging modalities sample subjects with a discrete, finite set of measurements, while the underlying object function is continuous. Because of this, inversion of the imaging model, even under ideal conditions, necessarily entails approximation. The error incurred by this approximation can be important when there is rapid variation in the object function or when the objects of interest are small. In this work, we investigate this issue with the Fourier transform (FT), which can be taken as the imaging model for magnetic resonance imaging (MRl) or some forms of wave imaging. Compressive sensing has been successful for inverting this data model when only a sparse set of samples are available. We apply the compressive sensing principle to a somewhat related problem of frequency extrapolation, where the object function is represented by a super-resolution grid with many more pixels than FT measurements. The image on the super-resolution grid is obtained through nonconvex minimization. The method fully utilizes the available FT samples, while controlling aliasing and ringing. The algorithm is demonstrated with continuous FT samples of the Shepp-Logan phantom with additional small, high-contrast objects.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Building a new multiphysics workflow in MOOSE: application to tritium migration, trapping and advection in TMAP8

Fusion devices are anticipated to produce and consume several kilograms of tritium per year. This rare fuel resource is both highly mobile and radioactive, making tracking inventories a priority for operation and safety. The fusion safety program at the Idaho National Laboratory has been developing the Tritium Migration and Analysis Program (TMAP), of which the latest version is a MOOSE-based application. TMAP8 is verified against its predecessors and possesses additional multi-dimensional tritium migration modeling capabilities. As we extend its capabilities towards both whole device (in multiple dimensions) and whole plant (with multiple components) simulations, the syntax of inputs must become compact, descriptive, compatible with quality assurance processes, and as error-proof as achievable. The new Physics system developed MOOSE can set up equations and instantiating them on plant components. The system permits the automatic definition of complex discretization with a consistency between object parameters achieved programmatically. The Physics system can currently instantiate the equations for heat conduction and Navier Stokes weakly compressible flow. In MOOSE-terms, it automates the definition of kernels, boundary conditions, and several core and helper materials and fields. As part of this effort, Physics classes were developed for tritium migration, trapping and advection within either a multi-dimensional Navier Stokes fluid dynamics simulation, or a 1D thermal hydraulics piping system. In this presentation, we will showcase the new syntax, its application to several verification and validation cases which were already studied using the classical TMAP8 syntax, and a demonstration of the new coupling capabilities for the migration of tritium into blanket coolant channels and the subsequent advection into the coolant loop.

70 - PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Active learning of a crystal plasticity flow rule from discrete dislocation dynamics simulations

Continuum-scale material deformation models, such as crystal plasticity (CP), can significantly enhance their predictive accuracy by incorporating input from lower-scale (i.e. mesoscale) models. The procedure to generate and extract the relevant information is however typically complex and ad hoc, involving decision and intervention by domain experts, leading to long development times. In this study, we develop a principled approach for calibration of continuum-scale models using lower scale information by representing a CP flow rule as a Gaussian process model. This representation allows for efficient parameter space exploration, guided by the uncertainty embedded in the model through a process known as Bayesian optimization (BO). We demonstrate a semi-autonomous BO loop which instantiates discrete dislocation dynamics simulations whose initial conditions are automatically chosen to optimize the uncertainty of a model CP flow rule. Our self-guided computational pipeline efficiently generated a dataset and corresponding model whose error, uncertainty, and physical feature sensitivities were validated with comparison to an independent dataset four times larger, demonstrating a valuable and efficient active learning implementation readily transferable to similar material systems.

36 MATERIALS SCIENCE↗

Criteria for stochastic pinning control of networks of chaotic maps

This paper investigates the controllability of discrete-time networks of coupled chaotic maps through stochastic pinning. In this control scheme, the network dynamics are steered towards a desired trajectory through a feedback control input that is applied stochastically to the network nodes. The network controllability is studied by analyzing the local mean square stability of the error dynamics with respect to the desired trajectory. Through the analysis of the spectral properties of salient matrices, a toolbox of conditions for controllability are obtained, in terms of the dynamics of the individual maps, algebraic properties of the network, and the probability distribution of the pinning control. We demonstrate the use of these conditions in the design of a stochastic pinning control strategy for networks of Chirikov standard maps. To elucidate the applicability of the approach, we consider different network topologies and compare five different stochastic pinning strategies through extensive numerical simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗