Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical 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 1,423 records · Page 79

Sum-rule corrections: A route to error cancellations in correlation matrix renormalisation theory

Here, we recently proposed the correlation matrix renormalisation (CMR) theory to efficiently and accurately calculate ground state total energy of molecular systems, based on the Gutzwiller variational wavefunction (GWF) to treat the electronic correlation effects. To help reduce numerical complications and better adapt the CMR to infinite lattice systems, we need to further refine the way to minimise the error originated from the approximations in the theory. This conference proceeding reports our recent progress on this key issue, namely, we obtained a simple analytical functional form for the one-electron renormalisation factors, and introduced a novel sum-rule correction for a more accurate description of the intersite electron correlations. Benchmark calculations are performed on a set of molecules to show the reasonable accuracy of the method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Capacitive/Inductive Corrections for Numerical Implementation of Thin-Slot Transmission Line Models and Other Useful Formulas

Capacitance/inductance corrections for grid induced errors for a thin slot models are given for both one and four point testing on a rectangular grid for surface currents surrounding the slot. In addition a formula for translating from one equivalent radius to another is given for the thin-slot transmission line model. Additional formulas useful for this slot modeling are also given.

42 ENGINEERING↗

MOCUM: A two-dimensional method of characteristics code based on unstructured meshing for general geometries

A transport theory code MOCUM based on the Method of Characteristics (MOC) as the flux solver with an advanced general geometry processor is developed for two-dimensional lattice and full core neutronics modeling. The core structure is represented by Constructive Solid Geometry (CSG) that uses Boolean operations to build complex geometries from simple polygons. Arbitrary-precision arithmetic is also used in the process of building CSG objects to eliminate the round-off error from the commonly used double precision numbers. Then, the constructed core frame will be decomposed and refined into a conforming Delaunay triangulation to ensure the quality of the meshes. The MOC solver kernel is fully paralleled using OpenMP and the developed numerical code is validated by several benchmarks representing various core geometries. For the cases modeled, the maximum percentage error for multiplication factor and the pin power compared to reference values are 0.1% and 0.7% respectively. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

An optimized finite-difference scheme for wave propagation problems

Two fully-discrete finite-difference schemes for wave propagation problems are presented, a maximum-order scheme and an optimized (or spectral-like) scheme. Both combine a seven-point spatial operator and an explicit six-stage time-march method. The maximum-order operator is fifth-order in space and is sixth-order in time for a linear problem with periodic boundary conditions. The phase and amplitude errors of the schemes obtained using Fourier analysis are given and compared with a second-order and a fourth-order method. Numerical experiments are presented which demonstrate the usefulness of the schemes for a range of problems. For some problems, the optimized scheme leads to a reduction in global error compared to the maximum-order scheme with no additional computational expense.

Zingg, D. W.↗

Data assimilation for burnup distribution of PWR with three-dimensional variational algorithm and artificial neutral network

In this paper, a data-assimilation method has been proposed and applied for the burnup distribution of PWR. The burnup distribution is significant to the safety and economy of the reactor, as it is essential for the fuel-reloading design and optimization. Due to the burnup distribution cannot be measured directly during the reactor operation, the numerical simulation is widely applied to determine the burnup distribution. However, there is a deviation between the numerical simulation and the actual core due to some unavoidable factors, such as component manufacturing deviation, uneven flow distribution and so on. These differences would induce the errors to the simulation values of power distributions and hence to the burnup distribution. To address this problem, a data-assimilation method for the burnup distribution has been proposed with the application of power-distribution measurements. In our research, the three-dimensional variational (3DVAR) algorithm was applied for burnup-distribution calibration and the artificial neutral network (ANN) was applied to establish the relation between power distribution and corresponding burnup distribution. As engineering verification, the proposed data-assimilation method has been applied to the CNP1000 PWR operated in China. The numerical results indicated that the burnup-distribution errors can be reduced notably, as the maximum value of relative errors for power distribution can be reduced from 5.35% to 3.96%. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Single Grid Error Estimation for Neutron Transport Solvers

The method of nearby problems (MNP) is a solution verification technique that does not require the use of multiple spatial grids. To estimate spatial discretization error without requiring a high-fidelity spatial grid, an analytical curve fit is interpolated from the numerical solution. The residual between the curve fit solution and numerical solution is calculated and added as an additional source term to the governing equation. The nearby solution is estimated using the updated source term and boundary conditions to remain consistent with the curve fit interpolation. The nearby solution can be compared to the curve fit solution as a discretization error estimation while using a single spatial grid. Without the use of higher fidelity spatial grids, the MNP is able to approximate the spatial discretization error, a facet of solution verification. The application of the method of nearby problems is presented for one- and two-dimensional neutron transport problems for both fixed source and criticality problems on the spatial variable. The fixed source results demonstrate the effectiveness of nearby problems for spatial error identification using the discrete ordinates method. Criticality results are shown to identify area of high spatial error for the C5G7 problem as well as for the discrete ordinates solver. A novel approach of combining the capabilities of Monte Carlo with the discrete ordinates nearby problems is presented for one- and two-dimensional fixed source problems. In conclusion, the MNP demonstrates its effectiveness at identifying spatial error on a single structured grid with a wide variety of neutron transport problems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Quantifying the impact of precision errors on quantum approximate optimization algorithms

The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical algorithm that seeks to achieve approximate solutions to optimization problems by iteratively alternating between intervals of controlled quantum evolution. Here, we examine the effect of analog precision errors on QAOA performance from the perspective of both algorithmic training and performance guarantees. Leveraging cumulant expansions, we recast the faulty QAOA as a control problem in which precision errors are expressed as multiplicative control noise and derive bounds on the performance of QAOA. We show using both analytical techniques and numerical simulations that fixed precision implementations of QAOA circuits are subject to an exponential degradation in performance dependent upon the number of optimal QAOA layers and magnitude of the precision error. Despite this significant reduction, we show that it is possible to mitigate precision errors in QAOA via digitization of the variational parameters at the cost of increasing circuit depth.

quantum algorithms↗

Utilizing Adjoint-Based Error Estimates for Surrogate Models to Accurately Predict Probabilities of Events

In thist study, we develop a procedure to utilize error estimates for samples of a surrogate model to compute robust upper and lower bounds on estimates of probabilities of events. We show that these error estimates can also be used in an adaptive algorithm to simultaneously reduce the computational cost and increase the accuracy in estimating probabilities of events using computationally expensive high-fidelity models. Specifically, we introduce the notion of reliability of a sample of a surrogate model, and we prove that utilizing the surrogate model for the reliable samples and the high-fidelity model for the unreliable samples gives precisely the same estimate of the probability of the output event as would be obtained by evaluation of the original model for each sample. The adaptive algorithm uses the additional evaluations of the high-fidelity model for the unreliable samples to locally improve the surrogate model near the limit state, which significantly reduces the number of high-fidelity model evaluations as the limit state is resolved. Numerical results based on a recently developed adjoint-based approach for estimating the error in samples of a surrogate are provided to demonstrate (1) the robustness of the bounds on the probability of an event, and (2) that the adaptive enhancement algorithm provides a more accurate estimate of the probability of the QoI event than standard response surface approximation methods at a lower computational cost.

97 MATHEMATICS AND COMPUTING↗

Bounds and approximations for rapid evaluation of coherent MPSK error probabilities

The error probability for MPSK detection is expressed here as a sum of a familiar upper-bound approximation and a correction term which is well suited for numerical integration. An asymptotic expansion of the correction term is derived, from which simple and extremely tight upper and lower bounds are obtained. Relative errors in using these bounds and approximations of them are graphed for cases of practical interest.

Chie, C. M.↗

Fully implicit Particle-in-cell algorithms for multiscale plasma simulation

The outline of the paper is as follows: Particle-in-cell (PIC) methods for fully ionized collisionless plasmas, explicit vs. implicit PIC, 1D ES implicit PIC (charge and energy conservation, moment-based acceleration), and generalization to Multi-D EM PIC: Vlasov-Darwin model (review and motivation for Darwin model, conservation properties (energy, charge, and canonical momenta), and numerical benchmarks). The author demonstrates a fully implicit, fully nonlinear, multidimensional PIC formulation that features exact local charge conservation (via a novel particle mover strategy), exact global energy conservation (no particle self-heating or self-cooling), adaptive particle orbit integrator to control errors in momentum conservation, and canonical momenta (EM-PIC only, reduced dimensionality). The approach is free of numerical instabilities: ω pe Δt >> 1, and Δx >> λ D . It requires many fewer dofs (vs. explicit PIC) for comparable accuracy in challenging problems. Significant CPU gains (vs explicit PIC) have been demonstrated. The method has much potential for efficiency gains vs. explicit in long-time-scale applications. Moment-based acceleration is effective in minimizing N FE , leading to an optimal algorithm.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

L{sub 1/2} regularization based numerical method for effective reconstruction of bioluminescence tomography

Even though bioluminescence tomography (BLT) exhibits significant potential and wide applications in macroscopic imaging of small animals in vivo, the inverse reconstruction is still a tough problem that has plagued researchers in a related area. The ill-posedness of inverse reconstruction arises from insufficient measurements and modeling errors, so that the inverse reconstruction cannot be solved directly. In this study, an l{sub 1/2} regularization based numerical method was developed for effective reconstruction of BLT. In the method, the inverse reconstruction of BLT was constrained into an l{sub 1/2} regularization problem, and then the weighted interior-point algorithm (WIPA) was applied to solve the problem through transforming it into obtaining the solution of a series of l{sub 1} regularizers. The feasibility and effectiveness of the proposed method were demonstrated with numerical simulations on a digital mouse. Stability verification experiments further illustrated the robustness of the proposed method for different levels of Gaussian noise.

60 APPLIED LIFE SCIENCES↗

A B-spline based gradient-enhanced micropolar implicit material point method for large localized inelastic deformations

The quasi-brittle response of cohesive-frictional materials in numerical simulations is commonly represented by softening plasticity or continuum damage models, either individually or in combination. However, classical models, particularly when coupled with non-associated plasticity, often suffer from ill-posedness and a lack of objectivity in numerical simulations. Moreover, the performance of the finite element method significantly degrades in simulations involving finite strains when mesh distortion reaches excessive levels. This represents a challenge for modeling cohesive-frictional materials, given their tendency to experience strongly localized deformations, such as those occurring during shear band dominated failure. Hence, accurate modeling of the response of cohesive-frictional solids is a demanding task. To address these challenges, we present an extension of the material point method (MPM) for the unified gradient-enhanced micropolar continuum, aiming at the analysis of finite localized inelastic deformations in cohesive-frictional materials. The generalized gradient-enhanced micropolar continuum formulation is employed to tackle challenges related to localization and softening material behavior, while the MPM addresses issues arising from excessive deformations. The method utilizes a B-spline formulation for the rigid background mesh to mitigate the well-known cell crossing errors of the MPM. To demonstrate the performance of the method, 2D and 3D numerical studies on localized failure in sandstone in plane strain compression and triaxial extension tests are presented. A comparison with finite element results confirms the suitability of the formulation. Moreover, an efficient numerical implementation of the formulation is presented, and it is demonstrated that the additional MPM specific overhead is negligible.

B-spline↗

Galerkin v. discrete-optimal projection in nonlinear model reduction

Discrete-optimal 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 ow problems where standard Galerkin techniques have failed. However, 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 projection at the time-continuous level, while discrete-optimal techniques do so at the time-discrete level. This work provides a detailed theoretical and experimental 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 ndings, including conditions under which the discrete-optimal 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 experimentally that decreasing the time step does not necessarily decrease the error for the discrete-optimal 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- ow 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 discrete-optimal reduced-order model by an order of magnitude.

CFD↗

10-th order of accuracy for numerical solution of 3-D elasticity equations for heterogeneous materials on unfitted Cartesian meshes

We have developed the Optimal Local Truncation Error Method (OLTEM) with 10-th order of accuracy on unfitted Cartesian meshes for a system of 3-D elasticity equations with smooth irregular interfaces. 5 x 5 x 5 = 125-point stencils (similar to those for quadratic finite elements) for elastic heterogeneous materials are used for OLTEM. There are no unknowns at the interface points between different materials; the structure of the global discrete equations is the same for homogeneous and heterogeneous materials. The calculation of unknown stencil coefficients is based on the minimization of the local truncation error of the stencil equations and yields the optimal 10-th order of accuracy for OLTEM on unfitted Cartesian meshes, i.e., the increase by 7 orders in accuracy compared to quadratic finite elements on conformal meshes. A new post-processing procedure provides the 9-th order of accuracy for stresses in the 3-D case. Similar to basic computations it uses OLTEM with the 125-point stencils, the interface conditions and the elasticity equations. It was shown that the use of the elasticity equations for post-processing improves the accuracy of 0.1% stresses by 6 orders compared to post-processing without the use of PDEs. At an accuracy of for stresses, OLTEM with the new post-processing procedure reduces the number of degrees of freedom by 360 - 8000 times compared to quadratic finite elements with similar stencils. OLTEM with the 125-point stencils yields even more accurate results than high-order finite elements with much wider stencils. OLTEM provides accurate numerical results for compressible and nearly incompressible materials.

elasticity equations↗

Application of the multiple PRF technique to resolve Doppler centroid estimation ambiguity for spaceborne SAR

Estimation of the Doppler centroid ambiguity is a necessary element of the signal processing for SAR systems with large antenna pointing errors. Without proper resolution of the Doppler centroid estimation (DCE) ambiguity, the image quality will be degraded in the system impulse response function and the geometric fidelity. Two techniques for resolution of DCE ambiguity for the spaceborne SAR are presented; they include a brief review of the range cross-correlation technique and presentation of a new technique using multiple pulse repetition frequencies (PRFs). For SAR systems, where other performance factors control selection of the PRF's, an algorithm is devised to resolve the ambiguity that uses PRF's of arbitrary numerical values. The performance of this multiple PRF technique is analyzed based on a statistical error model. An example is presented that demonstrates for the Shuttle Imaging Radar-C (SIR-C) C-band SAR, the probability of correct ambiguity resolution is higher than 95 percent for antenna attitude errors as large as 3 deg.

Chang, C. Y.↗

Ab initio calculations of three-nucleon scattering

Results on three-nucleon (3N) elastic scattering below the pion production threshold are discussed with an emphasis on the need for a three-nucleon force (3NF). The large discrepancies found between a theory based on numerical solutions of 3N Faddeev equations with (semi)phenomenological NN potentials only and data point to the need for 3NF’s. This notion is supported by the fact that another possible reason for the discrepancies in elastic nucleon-deuteron (Nd) scattering, relativistic effects, turned out to be small. Results for new generation of chiral NN forces (up to N{sup 4}LO) together with theoretical truncation errors are shown.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Composite Qdrift-product formulas for quantum and classical simulations in real and imaginary time

Recent study has shown that it can be advantageous to implement a composite channel that partitions the Hamiltonian H for a given simulation problem into subsets A and B such that H = A + B , where the terms in A are simulated with a Trotter-Suzuki channel and the B terms are randomly sampled via the Qdrift algorithm. Here we extend Qdrift and composite product formulas to imaginary time, formulating candidate classical algorithms for quantum Monte Carlo calculations. We upper bound the induced Schatten- 1 → 1 norm on both imaginary-time Qdrift and composite channels. Another recent result demonstrated that simulations of lattice Hamiltonians containing geometrically local interactions can be improved using a Lieb-Robinson argument to decompose H into subsets that contain only terms supported on that subset of the lattice. Here, we provide a quantum algorithm by unifying this result with the composite approach into “local composite channels” and we upper bound the diamond distance. We provide exact numerical simulations of algorithmic cost by counting the number of gates of the form e − i H j t and e − H j β to meet a certain error tolerance ε . In doing so, we optimize the partitioning into sets A and B using gradient boosted tree models from machine learning. These numerical studies are important given that product formulas have been historically known to outperform analytic upper bounds. We show constant factor advantages for a variety of interesting Hamiltonians, the maximum of which is a ≈ 20 -fold speedup that occurs in the simulation of Jellium. Published by the American Physical Society 2024

Pocrnic, Matthew (ORCID:0000000203089376)↗

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

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

97 MATHEMATICS AND COMPUTING↗