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 595 records · Page 33

Deterministic Modeling of the High Temperature Test Reactor

Idaho National Laboratory (INL) is tasked with the development of reactor physics analysis capability of the Next Generation Nuclear Power (NGNP) project. In order to examine INL’s current prismatic reactor deterministic analysis tools, the project is conducting a benchmark exercise based on modeling the High Temperature Test Reactor (HTTR). This exercise entails the development of a model for the initial criticality, a 19 column thin annular core, and the fully loaded core critical condition with 30 columns. Special emphasis is devoted to the annular core modeling, which shares more characteristics with the NGNP base design. The DRAGON code is used in this study because it offers significant ease and versatility in modeling prismatic designs. Despite some geometric limitations, the code performs quite well compared to other lattice physics codes. DRAGON can generate transport solutions via collision probability (CP), method of characteristics (MOC), and discrete ordinates (Sn). A fine group cross section library based on the SHEM 281 energy structure is used in the DRAGON calculations. HEXPEDITE is the hexagonal z full core solver used in this study and is based on the Green’s Function solution of the transverse integrated equations. In addition, two Monte Carlo (MC) based codes, MCNP5 and PSG2/SERPENT, provide benchmarking capability for the DRAGON and the nodal diffusion solver codes. The results from this study show a consistent bias of 2–3% for the core multiplication factor. This systematic error has also been observed in other HTTR benchmark efforts and is well documented in the literature. The ENDF/B VII graphite and U235 cross sections appear to be the main source of the error. The isothermal temperature coefficients calculated with the fully loaded core configuration agree well with other benchmark participants but are 40% higher than the experimental values. This discrepancy with the measurement stems from the fact that during the experiments the control rods were adjusted to maintain criticality, whereas in the model, the rod positions were fixed. In addition, this work includes a brief study of a cross section generation approach that seeks to decouple the domain in order to account for neighbor effects. This spectral interpenetration is a dominant effect in annular HTR physics. This analysis methodology should be further explored in order to reduce the error that is systematically propagated in the traditional generation of cross sections.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

On fast simulation of dynamical system with neural vector enhanced numerical solver

The large-scale simulation of dynamical systems is critical in numerous scientific and engineering disciplines. However, traditional numerical solvers are limited by the choice of step sizes when estimating integration, resulting in a trade-off between accuracy and computational efficiency. To address this challenge, we introduce a deep learning-based corrector called Neural Vector (NeurVec), which can compensate for integration errors and enable larger time step sizes in simulations. Our extensive experiments on a variety of complex dynamical system benchmarks demonstrate that NeurVec exhibits remarkable generalization capability on a continuous phase space, even when trained using limited and discrete data. NeurVec significantly accelerates traditional solvers, achieving speeds tens to hundreds of times faster while maintaining high levels of accuracy and stability. Moreover, NeurVec’s simple-yet-effective design, combined with its ease of implementation, has the potential to establish a new paradigm for fast-solving differential equations based on deep learning.

97 MATHEMATICS AND COMPUTING↗

Variational integration for ideal magnetohydrodynamics with built-in advection equations

Newcomb's Lagrangian for ideal magnetohydrodynamics (MHD) in Lagrangian labeling is discretized using discrete exterior calculus. Variational integrators for ideal MHD are derived thereafter. Besides being symplectic and momentum-preserving, the schemes inherit built-in advection equations from Newcomb's formulation, and therefore avoid solving them and the accompanying error and dissipation. We implement the method in 2D and show that numerical reconnection does not take place when singular current sheets are present. We then apply it to studying the dynamics of the ideal coalescence instability with multiple islands. The relaxed equilibrium state with embedded current sheets is obtained numerically.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Variational reactivity estimates: new analyses and new results

A modified form of the variational estimate of the reactivity worth ofa perturbation was previously developed to extend the range of applicability of variational perturbation theory for perturbations leading to negative reactivity worths. Recent numerical results challenged the assumptions behind the modified form. In this paper, more results are obtained, leading to the conclusion that sometimes the modified form extends the range ofapplicability of variational perturbation theory for positive reactivity worths as well, and sometimes the standard variational form is more accurate for negative-reactivity perturbations. In addition, this paper proves that using the exact generalized adjoint function would lead to an inaccurate variational reactivity estimate when the error in the first-order estimate is large; the standard generalized adjoint function, an approximation to the exact one, leads to Lore accurate results. This conclusion is also demonstrated numerically. Transport calculations use the PARTISN multi group discrete ordinates code

97 MATHEMATICS AND COMPUTING↗

Impact of genotype‐calling methodologies on genome‐wide association and genomic prediction in polyploids

Abstract Discovery and analysis of genetic variants underlying agriculturally important traits are key to molecular breeding of crops. Reduced representation approaches have provided cost‐efficient genotyping using next‐generation sequencing. However, accurate genotype calling from next‐generation sequencing data is challenging, particularly in polyploid species due to their genome complexity. Recently developed Bayesian statistical methods implemented in available software packages, polyRAD, EBG, and updog, incorporate error rates and population parameters to accurately estimate allelic dosage across any ploidy. We used empirical and simulated data to evaluate the three Bayesian algorithms and demonstrated their impact on the power of genome‐wide association study (GWAS) analysis and the accuracy of genomic prediction. We further incorporated uncertainty in allelic dosage estimation by testing continuous genotype calls and comparing their performance to discrete genotypes in GWAS and genomic prediction. We tested the genotype‐calling methods using data from two autotetraploid species, Miscanthus sacchariflorus and Vaccinium corymbosum , and performed GWAS and genomic prediction. In the empirical study, the tested Bayesian genotype‐calling algorithms differed in their downstream effects on GWAS and genomic prediction, with some showing advantages over others. Through subsequent simulation studies, we observed that at low read depth, polyRAD was advantageous in its effect on GWAS power and limit of false positives. Additionally, we found that continuous genotypes increased the accuracy of genomic prediction, by reducing genotyping error, particularly at low sequencing depth. Our results indicate that by using the Bayesian algorithm implemented in polyRAD and continuous genotypes, we can accurately and cost‐efficiently implement GWAS and genomic prediction in polyploid crops.

59 BASIC BIOLOGICAL SCIENCES↗

High-order diamond differencing schemes for the Boltzmann Fokker-Planck equation in 3D Cartesian geometries

The Boltzmann Fokker-Planck, an approximate form of the linear Boltzmann equation is commonly used to treat efficiently the transport of charged particles in matter. This paper introduces the application of high-order diamond differencing schemes (HODD), specifically the DD1 and DD2 schemes which are 4- and 6-order accurate respectively, to handle the spatial discretization of that equation in 3D Cartesian geometries. The energy deposition solutions for the coupled transport of electrons and photons presented in this work shows that HODD, compared to classical DD scheme, provides correction to the oscillations and a reduced propensity to yield negative fluxes. They are useful tools to minimize local error, notably in regions with abrupt variations of the flux solution. They also can be used to reduced execution time by decreasing the needed number of voxels to obtain a fixed accuracy. On the tested benchmarks, the DD1 scheme is 87%- 92%-91% more accurate than the classical DD scheme for total, mean per-voxels and maximum deviation of energy deposition values respectively. For comparison, a calculation with 8 times more voxels, requiring roughly 2.5 times more time to execute, is 92%-90%-77% more accurate. (authors)

97 MATHEMATICS AND COMPUTING↗

Observations on variational and projector Monte Carlo methods

Variational Monte Carlo and various projector Monte Carlo (PMC) methods are presented in a unified manner. Similarities and differences between the methods and choices made in designing the methods are discussed. Both methods where the Monte Carlo walk is performed in a discrete space and methods where it is performed in a continuous space are considered. It is pointed out that the usual prescription for importance sampling may not be advantageous depending on the particular quantum Monte Carlo method used and the observables of interest, so alternate prescriptions are presented. The nature of the sign problem is discussed for various versions of PMC methods. A prescription for an exact PMC method in real space, i.e., a method that does not make a fixed-node or similar approximation and does not have a finite basis error, is presented. This method is likely to be practical for systems with a small number of electrons. Approximate PMC methods that are applicable to larger systems and go beyond the fixed-node approximation are also discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum field as a quantum cellular automaton: The Dirac free evolution in one dimension

We present a quantum cellular automaton model in one space-dimension which has the Dirac equation as emergent. This model, a discrete-time and causal unitary evolution of a lattice of quantum systems, is derived from the assumptions of homogeneity, parity and time-reversal invariance. The comparison between the automaton and the Dirac evolutions is rigorously set as a discrimination problem between unitary channels. We derive an exact lower bound for the probability of error in the discrimination as an explicit function of the mass, the number and the momentum of the particles, and the duration of the evolution. Computing this bound with experimentally achievable values, we see that in that regime the QCA model cannot be discriminated from the usual Dirac evolution. Finally, we show that the evolution of one-particle states with narrow-band in momentum can be efficiently simulated by a dispersive differential equation for any regime. This analysis allows for a comparison with the dynamics of wave-packets as it is described by the usual Dirac equation. This paper is a first step in exploring the idea that quantum field theory could be grounded on a more fundamental quantum cellular automaton model and that physical dynamics could emerge from quantum information processing. In this framework, the discretization is a central ingredient and not only a tool for performing non-perturbative calculation as in lattice gauge theory. The automaton model, endowed with a precise notion of local observables and a full probabilistic interpretation, could lead to a coherent unification of a hypothetical discrete Planck scale with the usual Fermi scale of high-energy physics. - Highlights: • The free Dirac field in one space dimension as a quantum cellular automaton. • Large scale limit of the automaton and the emergence of the Dirac equation. • Dispersive differential equation for the evolution of smooth states on the automaton. • Optimal discrimination between the automaton evolution and the Dirac equation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SU-F-T-156: Monte Carlo Simulation Using TOPAS for Synchrotron Based Proton Discrete Spot Scanning System

Purpose: This study provides an overview of the design and commissioning of the Monte Carlo (MC) model of the spot-scanning proton therapy nozzle and its implementation for the patient plan simulation. Methods: The Hitachi PROBEAT V scanning nozzle was simulated based on vendor specifications using the TOPAS extension of Geant4 code. FLUKA MC simulation was also utilized to provide supporting data for the main simulation. Validation of the MC model was performed using vendor provided data and measurements collected during acceptance/commissioning of the proton therapy machine. Actual patient plans using CT based treatment geometry were simulated and compared to the dose distributions produced by the treatment planning system (Varian Eclipse 13.6), and patient quality assurance measurements. In-house MATLAB scripts are used for converting DICOM data into TOPAS input files. Results: Comparison analysis of integrated depth doses (IDDs), therapeutic ranges (R90), and spot shape/sizes at different distances from the isocenter, indicate good agreement between MC and measurements. R90 agreement is within 0.15 mm across all energy tunes. IDDs and spot shapes/sizes differences are within statistical error of simulation (less than 1.5%). The MC simulated data, validated with physical measurements, were used for the commissioning of the treatment planning system. Patient geometry simulations were conducted based on the Eclipse produced DICOM plans. Conclusion: The treatment nozzle and standard option beam model were implemented in the TOPAS framework to simulate a highly conformal discrete spot-scanning proton beam system.

60 APPLIED LIFE SCIENCES↗

Gauge structures: From stabilizer codes to continuum models

Stabilizer codes are a powerful method for implementing fault-tolerant quantum memory and in the case of topological codes, they form useful models for topological phases of matter. In this paper, we discuss the theory of stabilizer codes as a discrete version of a linear gauge structure, a concept we introduce here. A linear gauge structure captures all the familiar ingredients of U(1) gauge theory including a generalization of charge conservation, Maxwell equations and topological terms. Using this connection, we prove some important results for stabilizer codes which can be used to characterize their error-correction properties. However, this perspective does not depend on any particular Hamiltonian or Lagrangian, which as a consequence is agnostic to the source of the gauge redundancy. Based upon the connection to stabilizer codes, we view the source of the gauge redundancy as an ambiguity in the tensor product structure of the Hilbert space. That is, the gauge provides a set of equivalent but arbitrary ways to factorize the Hilbert space. We apply this formalism to the d=2 and 3 toric code as well as the paradigm fracton models, X-Cube and Haah’s cubic code. From this perspective, we are able to map all these models to some continuum version which captures all or some of the fractonic and topological features of their parent discrete models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A provably stable numerical method for the anisotropic diffusion equation in confined magnetic fields

We present a novel numerical method for solving the anisotropic diffusion equation in magnetic fields confined to a periodic box which is accurate and provably stable. We derive energy estimates of the solution of the continuous initial boundary value problem. A discrete formulation is presented using operator splitting in time with the summation by parts finite difference approximation of spatial derivatives for the perpendicular diffusion operator. Weak penalty procedures are derived for implementing both boundary conditions and parallel diffusion operator obtained by field line tracing. We prove that the fully-discrete approximation is unconditionally stable. Discrete energy estimates are shown to match the continuous energy estimate given the correct choice of penalty parameters. A nonlinear penalty parameter is shown to provide an effective method for tuning the parallel diffusion penalty and significantly minimises rounding errors. Several numerical experiments, using manufactured solutions, the “NIMROD benchmark” problem and a single island problem, are presented to verify numerical accuracy, convergence, and asymptotic preserving properties of the method. Finally, we present a magnetic field with chaotic regions and islands and show the contours of the anisotropic diffusion equation reproduce key features in the field.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos

A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos. It is illustrated that for moderately high-dimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5 and 10 different input distributions or histograms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Landau-gauge propagators in Yang-Mills theories at {beta}=0: Massive solution versus conformal scaling

We study Landau-gauge gluon and ghost propagators in Yang-Mills theories at lattice parameter {beta}=0, considering relatively large lattice volumes for the case of the SU(2) gauge group in three and four space-time dimensions. We compare the lattice data to the so-called massive and conformal-scaling solutions, examining the requirements for a good description of the propagators over various ranges of momenta and discussing possible systematic errors. Our analysis strongly supports the massive solution, i.e. a finite gluon propagator and an essentially free ghost propagator in the infrared limit, in disagreement with A. Sternbeck and L. von Smekal, arXiv:0811.4300.. Moreover, we argue that discretization effects play no role in the analysis of these propagators.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

When ancient numerical demons meet physics-informed machine learning: adjoint-based gradients for implicit differentiable modeling

Recent advances in differentiable modeling, a genre of physics-informed machine learning that trains neural networks (NNs) together with process-based equations, have shown promise in enhancing hydrological models' accuracy, interpretability, and knowledge-discovery potential. Current differentiable models are efficient for NN-based parameter regionalization, but the simple explicit numerical schemes paired with sequential calculations (operator splitting) can incur numerical errors whose impacts on models' representation power and learned parameters are not clear. Implicit schemes, however, cannot rely on automatic differentiation to calculate gradients due to potential issues of gradient vanishing and memory demand. Here we propose a “discretize-then-optimize” adjoint method to enable differentiable implicit numerical schemes for the first time for large-scale hydrological modeling. The adjoint model demonstrates comprehensively improved performance, with Kling–Gupta efficiency coefficients, peak-flow and low-flow metrics, and evapotranspiration that moderately surpass the already-competitive explicit model. Therefore, the previous sequential-calculation approach had a detrimental impact on the model's ability to represent hydrological dynamics. Furthermore, with a structural update that describes capillary rise, the adjoint model can better describe baseflow in arid regions and also produce low flows that outperform even pure machine learning methods such as long short-term memory networks. The adjoint model rectified some parameter distortions but did not alter spatial parameter distributions, demonstrating the robustness of regionalized parameterization. Despite higher computational expenses and modest improvements, the adjoint model's success removes the barrier for complex implicit schemes to enrich differentiable modeling in hydrology.

58 GEOSCIENCES↗

A domain decomposition method for pseudo-spectral electromagnetic simulations of plasmas

Pseudo-spectral electromagnetic solvers (i.e. representing the fields in Fourier space) have extraordinary precision. In particular, Haber et al. presented in 1973 a pseudo-spectral solver that integrates analytically the solution over a finite time step, under the usual assumption that the source is constant over that time step. Yet, pseudo-spectral solvers have not been widely used, due in part to the difficulty for efficient parallelization owing to global communications associated with global FFTs on the entire computational domains. A method for the parallelization of electromagnetic pseudo-spectral solvers is proposed and tested on single electromagnetic pulses, and on Particle-In-Cell simulations of the wakefield formation in a laser plasma accelerator. The method takes advantage of the properties of the Discrete Fourier Transform, the linearity of Maxwell’s equations and the finite speed of light for limiting the communications of data within guard regions between neighboring computational domains. Although this requires a small approximation, test results show that no significant error is made on the test cases that have been presented. The proposed method opens the way to solvers combining the favorable parallel scaling of standard finite-difference methods with the accuracy advantages of pseudo-spectral methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Markov state models from short non-equilibrium simulations—Analysis and correction of estimation bias

To begin, many state-of-the-art methods for the thermodynamic and kinetic characterization of large and complex biomolecular systems by simulation rely on ensemble approaches, where data from large numbers of relatively short trajectories are integrated. In this context, Markov state models (MSMs) are extremely popular because they can be used to compute stationary quantities and long-time kinetics from ensembles of short simulations, provided that these short simulations are in “local equilibrium” within the MSM states. However, over the last 15 years since the inception of MSMs, it has been controversially discussed and not yet been answered how deviations from local equilibrium can be detected, whether these deviations induce a practical bias in MSM estimation, and how to correct for them. In this paper, we address these issues: We systematically analyze the estimation of MSMs from short non-equilibrium simulations, and we provide an expression for the error between unbiased transition probabilities and the expected estimate from many short simulations. We show that the unbiased MSM estimate can be obtained even from relatively short non-equilibrium simulations in the limit of long lag times and good discretization. Further, we exploit observable operator model (OOM) theory to derive an unbiased estimator for the MSM transition matrix that corrects for the effect of starting out of equilibrium, even when short lag times are used. Finally, we show how the OOM framework can be used to estimate the exact eigenvalues or relaxation time scales of the system without estimating an MSM transition matrix, which allows us to practically assess the discretization quality of the MSM. Applications to model systems and molecular dynamics simulation data of alanine dipeptide are included for illustration. The improved MSM estimator is implemented in PyEMMA of version 2.3.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An adaptive multiblock high-order finite-volume method for solving the shallow-water equations on the sphere

We present a high-order finite-volume approach for solving the shallow-water equations on the sphere, using multiblock grids on the cubed-sphere. This approach combines a Runge--Kutta time discretization with a fourth-order accurate spatial discretization, and includes adaptive mesh refinement and refinement in time. Results of tests show fourth-order convergence for the shallow-water equations as well as for advection in a highly deformational flow. Hierarchical adaptive mesh refinement allows solution error to be achieved that is comparable to that obtained with uniform resolution of the most refined level of the hierarchy, but with many fewer operations.

97 MATHEMATICS AND COMPUTING↗