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,117 records · Page 62

Process Simulation of Cold Pressing and Sintering of Armstrong CP-Ti Powders

A computational methodology is presented for the process simulation of cold pressing and sintering of Armstrong CP-Ti powders. Since the powder consolidation is governed by specific pressure-dependent constitutive equations, solution algorithms were developed for the ABAQUS user material subroutine, UMAT, for computing the plastic strain increments based on an implicit integration of the nonlinear yield function, flow rule, and hardening equations. Sintering was simulated using a model based on diffusional creep using the user subroutine CREEP. The initial mesh, stress, and density for the simulation of sintering were obtained from the results of the cold pressing simulation, minimizing the errors from decoupling the cold pressing and sintering simulations. Numerical simulation results are presented for the cold compaction followed by a sintering step of the Ti powders. The numerical simulation results for the relative density were compared to those measured from experiments before and after sintering, showing that the relative density can be accurately predicted. Notice: This manuscript has been authored by UT-Battelle, LLC, under Contract No. DE-AC05-00OR22725 with the U.S. Department of Energy. The United States Government retains and the publisher, by accepting the article for publication, acknowledges that the United States Government retains a non-exclusive, paid-up, irrevocable, world-wide license to publish or reproduce the published form of this manuscript, or allow others to do so, for United States Government purposes. ACKNOWLEDGEMENTS This research was sponsored by the U.S. DOE, and carried out at ORNL, under Contract DE-AC05-00OR22725 with UT-Battelle, LLC. This research was sponsored by the U.S. DOE, EERE Industrial Technology Program Office under CPS Agreement # 17881.

36 MATERIALS SCIENCE↗

Generation of a crowned pinion tooth surface by a surface of revolution

A method of generating crowned pinion tooth surfaces using a surface of revolution is developed. The crowned pinion meshes with a regular involute gear and has a prescribed parabolic type of transmission errors when the gears operate in the aligned mode. When the gears are misaligned the transmission error remains parabolic with the maximum level still remaining very small (less than 0.34 arc sec for the numerical examples). Tooth contact analysis (TCA) is used to simulate the conditions of meshing, determine the transmission error, and determine the bearing contact.

Litvin, F. L.↗

Crowned spur gears - Methods for generation and Tooth Contact Analysis. II - Generation of the pinion tooth surface by a surface of revolution

A method for generation of crowned pinion tooth surfaces using a surface of revolution is developed. The crowned pinion meshes with a regular involute gear and has a prescribed parabolic type of transmission errors when the gears operate in the aligned mode. When the gears are misaligned the transmission error remains parabolic with the maximum level still remaining very small (less than 0.34 arc second for the numerical examples). Tooth Contact Analysis (TCA) is used to simulate the conditions of meshing, determine the transmission error, and the bearing contact.

Litvin, F. L.↗

NSLS-II HIGH LEVEL APPLICATION INFRASTRUCTURE AND CLIENT API DESIGN

The beam commissioning software framework of NSLS-II project adopts a client/server based architecture to replace the more traditional monolithic high level application approach. It is an open structure platform, and we try to provide a narrow API set for client application. With this narrow API, existing applications developed in different language under different architecture could be ported to our platform with small modification. This paper describes system infrastructure design, client API and system integration, and latest progress. As a new 3rd generation synchrotron light source with ultra low emittance, there are new requirements and challenges to control and manipulate the beam. A use case study and a theoretical analysis have been performed to clarify requirements and challenges to the high level applications (HLA) software environment. To satisfy those requirements and challenges, adequate system architecture of the software framework is critical for beam commissioning, study and operation. The existing traditional approaches are self-consistent, and monolithic. Some of them have adopted a concept of middle layer to separate low level hardware processing from numerical algorithm computing, physics modelling, data manipulating, plotting, and error handling. However, none of the existing approaches can satisfy the requirement. A new design has been proposed by introducing service oriented architecture technology. The HLA is combination of tools for accelerator physicists and operators, which is same as traditional approach. In NSLS-II, they include monitoring applications and control routines. Scripting environment is very important for the later part of HLA and both parts are designed based on a common set of APIs. Physicists and operators are users of these APIs, while control system engineers and a few accelerator physicists are the developers of these APIs. With our Client/Server mode based approach, we leave how to retrieve information to the developers of APIs and how to use them to form a physics application to the users. For example, how the channels are related to magnet and what the current real-time setting of a magnet is in physics unit are the internals of APIs. Measuring chromaticities are the users of APIs. All the users of APIs are working with magnet and instrument names in a physics unit. The low level communications in current or voltage unit are minimized. In this paper, we discussed our recent progress of our infrastructure development, and client API.

43 PARTICLE ACCELERATORS↗

Robust volume calculations for Constructive Solid Geometry (CSG) components in Monte Carlo transport calculations

In this paper we consider a new generalized algorithm for the efficient calculation of component object volumes given their equivalent constructive solid geometry (CSG) definition. The new method relies on domain decomposition to recursively subdivide the original component into smaller pieces with volumes that can be computed analytically or stochastically, if needed. Unlike simpler brute-force approaches, the proposed decomposition scheme is guaranteed to be robust and accurate to within a user-defined tolerance. The new algorithm is also fully general and can handle any valid CSG component definition, without the need for additional input from the user. The new technique has been specifically optimized to calculate volumes of component definitions commonly found in models used for Monte Carlo particle transport simulations for criticality safety and reactor analysis applications. However, the algorithm can be easily extended to any application which uses CSG representations for component objects. The paper provides a complete description of the novel volume calculation algorithm, along with a discussion of the conjectured error bounds on volumes calculated within the method. In addition, numerical results comparing the new algorithm with a standard stochastic volume calculation algorithm are presented for a series of problems spanning a range of representative component sizes and complexities. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Additive Runge-Kutta Schemes for Convection-Diffusion-Reaction Equations

Additive Runge-Kutta (ARK) methods are investigated for application to the spatially discretized one-dimensional convection-diffusion-reaction (CDR) equations. First, accuracy, stability, conservation, and dense output are considered for the general case when N different Runge-Kutta methods are grouped into a single composite method. Then, implicit-explicit, N = 2, additive Runge-Kutta ARK2 methods from third- to fifth-order are presented that allow for integration of stiff terms by an L-stable, stiffly-accurate explicit, singly diagonally implicit Runge-Kutta (ESDIRK) method while the nonstiff terms are integrated with a traditional explicit Runge-Kutta method (ERK). Coupling error terms are of equal order to those of the elemental methods. Derived ARK2 methods have vanishing stability functions for very large values of the stiff scaled eigenvalue, z(exp [I]) goes to infinity, and retain high stability efficiency in the absence of stiffness, z(exp [I]) goes to zero. Extrapolation-type stage-value predictors are provided based on dense-output formulae. Optimized methods minimize both leading order ARK2 error terms and Butcher coefficient magnitudes as well as maximize conservation properties. Numerical tests of the new schemes on a CDR problem show negligible stiffness leakage and near classical order convergence rates. However, tests on three simple singular-perturbation problems reveal generally predictable order reduction. Error control is best managed with a PID-controller. While results for the fifth-order method are disappointing, both the new third- and fourth-order methods are at least as efficient as existing ARK2 methods while offering error control and stage-value predictors.

Kennedy, Christopher A.↗

Additive Runge-Kutta Schemes for Convection-Diffusion-Reaction Equations

Additive Runge-Kutta (ARK) methods are investigated for application to the spatially discretized one- dimensional convection-diffusion-reaction (CDR) equations. Accuracy, stability, conservation, and dense-output are first considered for the general case when N different Runge-Kutta methods are grouped into a single composite method. Then, implicit-explicit, (N = 2), additive Runge-Kutta (ARK(sub 2)) methods from third- to fifth-order are presented that allow for integration of stiff terms by an L-stable, stiffly-accurate explicit, singly diagonally implicit Runge-Kutta (ESDIRK) method while the nonstiff terms are integrated with a traditional explicit Runge-Kutta method (ERK). Coupling error terms of the partitioned method are of equal order to those of the elemental methods. Derived ARK(sub 2) methods have vanishing stability functions for very large values of the stiff scaled eigenvalue, z['] yields -infinity, and retain high stability efficiency in the absence of stiffness, z['] yield 0. Extrapolation-type stage- value predictors are provided based on dense-output formulae. Optimized methods minimize both leading order ARK(sub 2) error terms and Butcher coefficient magnitudes as well as maximize conservation properties. Numerical tests of the new schemes on a CDR problem show negligible stiffness leakage and near classical order convergence rates. However, tests on three simple singular-perturbation problems reveal generally predictable order reduction. Error control is best managed with a PID-controller. While results for the fifth-order method are disappointing, both the new third- and fourth-order methods are at least as efficient as existing ARK(sub 2) methods.

Kennedy, Christopher A.↗

FPDetect: Efficient Reasoning About Stencil Programs Using Selective Direct Evaluation

We present FPDetect, a low-overhead approach for detecting logical errors and soft errors affecting stencil computations without generating false positives. We develop an offline analysis that tightly estimates the number of floating-point bits preserved across stencil applications. This estimate rigorously bounds the values expected in the data space of the computation. Violations of this bound can be attributed with certainty to errors. FPDetect helps synthesize error detectors customized for user-specified levels of accuracy and coverage. FPDetect also enables overhead reduction techniques based on deploying these detectors coarsely in space and time. Experimental evaluations demonstrate the practicality of our approach.

97 MATHEMATICS AND COMPUTING↗

Updating finite element dynamic models using an element-by-element sensitivity methodology

A sensitivity-based methodology for improving the finite element model of a given structure using test modal data and a few sensors is presented. The proposed method searches for both the location and sources of the mass and stiffness errors and does not interfere with the theory behind the finite element model while correcting these errors. The updating algorithm is derived from the unconstrained minimization of the squared L sub 2 norms of the modal dynamic residuals via an iterative two-step staggered procedure. At each iteration, the measured mode shapes are first expanded assuming that the model is error free, then the model parameters are corrected assuming that the expanded mode shapes are exact. The numerical algorithm is implemented in an element-by-element fashion and is capable of 'zooming' on the detected error locations. Several simulation examples which demonstate the potential of the proposed methodology are discussed.

Farhat, Charbel↗

Gravity gradient measurements

It is shown that, for floated satellite gradiometers subject to very low levels of unmodeled forces and torques, dynamic estimation can dramatically reduce rotation correction errors. The filter structure is developed, and the value of factorization techniques is examined. Numerical examples are given for a few practical cases using plausible instrument ensembles. To achieve these early results, great simplifications have been made, and important error sources have been suppressed.

Sonnabend, D.↗

A mixed $\ell_1$ regularization approach for sparse simultaneous approximation of parameterized PDEs

We introduce and assess a novel sparse polynomial technique for the simultaneous approximation of parameterized partial differential equations (PDEs) with deterministic and stochastic inputs. Our approach treats the numerical solution as a jointly sparse reconstruction problem through the reformulation of the standard basis pursuit denoising, where the set of jointly sparse vectors is infinite. To achieve global reconstruction of sparse solutions to parameterized elliptic PDEs over both physical and parametric domains, we combine the standard measurement scheme developed for compressed sensing in the context of bounded orthonormal systems with a novel mixed-norm based $\ell_1$ regularization method that exploits both energy and sparsity. Moreover, we are able to prove that, with minimal sample complexity, error estimates comparable to the best $s$-term and quasi-optimal approximations are achievable, while requiring only {\em a priori} bounds on polynomial truncation error with respect to the energy norm.Finally, we perform extensive numerical experiments on several high-dimensional parameterized elliptic PDE models to demonstrate the superior recovery properties of the proposed approach.

97 MATHEMATICS AND COMPUTING↗

Prognostic Validation of a Neural Network Unified Physics Parameterization

Weather and climate models approximate diabatic and sub-grid-scale processes in terms of grid-scale variables using parameterizations. Current parameterizations are designed by humans based on physical understanding, observations, and process modeling. As a result, they are numerically efficient and interpretable, but potentially oversimplified. However, the advent of global high-resolution simulations and observations enables a more robust approach based on machine learning. In this letter, a neural network-based parameterization is trained using a near-global aqua-planet simulation with a 4-km resolution (NG-Aqua). The neural network predicts the apparent sources of heat and moisture averaged onto (160 km)2 grid boxes. A numerically stable scheme is obtained by minimizing the prediction error over multiple time steps rather than single one. In prognostic single-column model tests, this scheme matches both the fluctuations and equilibrium of NG-Aqua simulation better than the Community Atmosphere Model does.

54 ENVIRONMENTAL SCIENCES↗

A Bayesian analysis of classical shadows

Abstract The method of classical shadows proposed by Huang, Kueng, and Preskill heralds remarkable opportunities for quantum estimation with limited measurements. Yet its relationship to established quantum tomographic approaches, particularly those based on likelihood models, remains unclear. In this article, we investigate classical shadows through the lens of Bayesian mean estimation (BME). In direct tests on numerical data, BME is found to attain significantly lower error on average, but classical shadows prove remarkably more accurate in specific situations—such as high-fidelity ground truth states—which are improbable in a fully uniform Hilbert space. We then introduce an observable-oriented pseudo-likelihood that successfully emulates the dimension-independence and state-specific optimality of classical shadows, but within a Bayesian framework that ensures only physical states. Our research reveals how classical shadows effect important departures from conventional thinking in quantum state estimation, as well as the utility of Bayesian methods for uncovering and formalizing statistical assumptions.

97 MATHEMATICS AND COMPUTING↗

Trojan Horse cross section measurements and their impact on primordial nucleosynthesis

Big Bang Nucleosynthesis (BBN) nucleosynthesis requires several nuclear physics inputs and, among them, an important role is played by nuclear reaction rates. They are among the most important input for a quantitative description of the early Universe. An up-to-date compilation of direct cross sections of d(d,p)t, d(d,n) 3 He and 3 He(d,p) 4 He reactions is given, being these ones among the most uncertain bare-nucleus cross sections. An intense experimental effort has been carried on in the last decade to apply the Trojan Horse Method (THM) to study reactions of relevance for the BBN and measure their astrophysical S(E)-factor. The result of these recent measurements is reviewed and compared with the available direct data. The reaction rates and the relative error for the four reactions of interest are then numerically calculated in the temperature ranges of relevance for BBN (0.01 9 <10) and compared with up-to-date reaction rate compilations. Their value were therefore used as input physics for primordial nucleosynthesis calculations in order to evaluate their impact on the calculated primordial abundances of D, 3,4 He and 7 Li. These ones were then compared with the observational primordial abundance estimates in different astrophysical sites. A comparison was also performed with calculations using other reaction rates compilations available in literature.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Determining an unknown state of a high-dimensional quantum system with a single, factorized observable

One can uniquely identify an unknown state of a quantum system S by measuring a ''quorum'' consisting of a complete set of noncommuting observables. It is also possible to determine the quantum state by repeated measurements of a single and factorized observable, when the system S is coupled to an assistant system A whose initial state is known. This is because that the redistribution of the information about the unknown quantum state into the composite system A+S results in a one-to-one mapping between the unknown density matrix elements and the probabilities of the occurrence of the eigenvalues of a single, factorized observable of the composite system. Here we focus on quantum state tomography of high-dimensional quantum systems (e.g., a spin greater than 1/2) via a single observable. We determine the condition for the best determination and the upper bound to achieve the most robust measurements. From the experimental view we require a suitable interaction Hamiltonian to maximize the measure efficiency. For this we numerically investigate a three-level system. Moreover, the error analysis for the different-dimensional quantum states shows that the present measurement method is still very effective in determining an unknown state of a high-dimensional quantum system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adamantine 1.0: A Thermomechanical Simulator for Additive Manufacturing

Adamantine is a thermomechanical simulation code that is written in C++ and built on top of deal.II (Arndt et al., 2023), p4est (Burstedde et al., 2011), ArborX (Lebrun-Grandié et al., 2020), Trilinos (The Trilinos Project Team, 2020), and Kokkos (Trott et al., 2022). Adamantine was developed with additive manufacturing in mind and it is particularly well adapted to simulate fused filament fabrication, directed energy deposition, and powder bed fusion. Adamantine employs the finite element method with adaptive mesh refinement to solve a nonlinear anisotropic heat equation, enabling support for various additive manufacturing processes. It can also perform elastoplastic and thermoelastoplastic simulations. It can handle materials in three distinct phases (solid, liquid, and powder) to accurately reflect the physical state during different stages of the manufacturing process. To enhance simulation accuracy, adamantine incorporates data assimilation techniques (Asch et al., 2016). This allows it to integrate experimental data from sensors like thermocouples and infrared (IR) cameras. This combined approach helps account for errors arising from input parameters, material properties, models, and numerical calculations, leading to more realistic simulations that reflect what occurs in a particular print.

36 MATERIALS SCIENCE↗

A separate phase drag model and a surrogate approximation for simulation of the steam assisted gravity drainage (SAGD) process

General ensemble phase averaged equations for multiphase flows have been specialized for the simulation of the steam assisted gravity drainage (SAGD) process. In the average momentum equation, fluid-solid and fluid-fluid viscous interactions are represented by separate force terms. This equation has a form similar to that of Darcy’s law for multiphase flow but augmented by the fluid-fluid viscous forces. Models for these fluid-fluid interactions are suggested and implemented into the numerical code CartaBlanca. Numerical results indicate that the model captures the main features of the multiphase flow in the SAGD process, but the detailed features, such as plumes are missed. We find that viscous coupling among the fluid phases is important. Advection time scales for the different fluids differ by several orders of magnitude because of vast viscosity differences. Numerically resolving all of these time scales is time consuming. To address this problem, we introduce a steam surrogate approximation to increase the steam advection time scale, while keeping the mass and energy fluxes well approximated. This approximation leads to about a 40-fold speed-up in execution speed of the numerical calculations at the cost of a few percent error in the relevant quantities.

02 PETROLEUM↗

Toward Higher-order Accuracy in Self-gravitating Hydrodynamics

High-order algorithms have emerged in numerical astrophysics as a promising avenue to reduce truncation error (proportional to a power of the linear resolution Δ x ) with only a moderate increase to computational expense. Significant effort has been placed in the development of finite-volume algorithms for (magneto)hydrodynamics; however, state-of-the-art astrophysical simulations tightly couple a plenitude of physics, additionally including gravity, photon transport, cosmic-ray transport, chemistry, and/or diffusion, to name a few. Algorithms frequently operator-split this additional physics (often a first-order error in time) and/or adopt a model wherein their evaluation is limited to second-order accuracy in space. In this work, we present a fourth-order-accurate finite-volume scheme for self-gravitating hydrodynamics on a uniform Cartesian grid. The method supplies source terms for the gravitational acceleration ( ρ g ) and gravitational energy release ( ρ v · g ) associated with fourth-order-accurate solutions to the Poisson equation. Our scheme (1) guarantees the conservation of total linear momentum while (2) decreasing (in proportion to Δ x 4 ) the effects of spurious heating and/or cooling associated with truncation error in the gravity. We demonstrate expected convergence rates for the algorithm by measuring errors in test problems evolving self-gravity modified linear waves and 3D polytropic equilibria. We test robustness of the algorithm by integrating an induced “inside-out” adiabatic collapse. We also discuss a method to smoothly downgrade the solution to second-order spatial accuracy to avoid spurious overshoots near steep density and/or pressure gradients.

79 ASTRONOMY AND ASTROPHYSICS↗