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 577 records · Page 32

Success of digital adiabatic simulation with large Trotter step

The simulation of adiabatic evolution has deep connections with adiabatic quantum computation, the quantum approximate optimization algorithm, and adiabatic state preparation. Here we address the error analysis problem in quantum simulation of adiabatic process using Trotter formulas. Here we show that with additional conditions, the circuit depth can be linear in simulation time T. The improvement comes from the observation that the fidelity error here can't be estimated by the norm distance between evolution operators. This phenomenon is termed the robustness of discretization in digital adiabatic simulation. It can be explained in three steps, from analytical and numerical evidence: (1) The fidelity error should be estimated by applying adiabatic theorem on the effective Hamiltonian instead. (2) Because of the specialty of Riemann-Lebesgue lemma, most adiabatic process is naturally robust against discretization. (3) As the Trotter step gets larger, the spectral gap of effective Hamiltonian tends to close, which results in the failure of digital adiabatic simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the convergence and convergence order of finite volume gradient schemes for oblique derivative boundary value problems

This work is an improvement of the previous note (Bradji in: Fuhrmann et al., Finite volumes for complex applications VII–methods, theoretical aspects. Proceedings of the FVCA 7, Berlin, 2014) which dealt with the convergence analysis of a finite volume scheme for the Poisson’s equation with a linear oblique derivative boundary condition. The formulation of the finite volume scheme given in Bradji (in: Fuhrmann et al., Finite volumes for complex applications VII–methods, theoretical aspects. Proceedings of the FVCA 7, Berlin, 2014) involves the discrete gradient introduced recently in Eymard et al. (IMA J Numer Anal 30(4):1009–1043, 2010). In this paper, we consider the convergence analysis of finite volume schemes involving the discrete gradient of Eymard et al. (IMA J Numer Anal 30(4):1009–1043, 2010) for elliptic and parabolic equations with linear oblique derivative boundary conditions. Linear oblique derivative boundary conditions arise for instance in the study of the motion of water in a canal, cf. Lesnic (Commun Numer Methods Eng 23(12):1071–1080, 2007). We derive error estimates in several norms which allow us to get error estimates for the approximations of the exact solutions and its first derivatives. In particular, we provide an error estimate between the gradient of the exact solutions and the discrete gradient of the approximate solutions. Convergence of the family of finite volume approximate solutions towards the exact solution under weak regularity assumption is also investigated. In the case of parabolic equations with oblique derivative boundary conditions, we develop a new discrete a priori estimate result. The proof of this result is based on the use of a discrete mean Poincaré–Wirtinger inequality. Thanks to the stated a priori estimate and to a comparison with an appropriately chosen auxiliary finite volume scheme, we derive the convergence results. This work can be viewed as a continuation of the previous work (Bradji and Gallouët in Int J Finite Vol 3(2):1–35, 2006) where a convergence analysis for a finite volume scheme, based on the admissible mesh of Eymard et al. (In: Ciarlet and Lions, Handbook of numerical analysis, North-Holland, Amsterdam, 2000), for the Poisson’s equation with a linear oblique derivative boundary conditions is given. The obtained convergence results do not require any relation between the mesh sizes of the spatial and time discretizations. Some numerical tests are presented for both elliptic and parabolic equations. In particular, we present three methods to compute the discrete solution.

97 MATHEMATICS AND COMPUTING↗

Windowed least-squares model reduction for dynamical systems

Here we propose a windowed least-squares (WLS) approach for model reduction of dynamical systems. The proposed approach sequentially minimizes the time-continuous full-order-model residual within a low-dimensional space–time trial subspace over time windows. The approach comprises a generalization of existing model reduction approaches, as particular instances of the methodology recover Galerkin, least-squares Petrov–Galerkin (LSPG), and space–time LSPG projection. In addition, the approach addresses key deficiencies in existing model reduction techniques, e.g., the dependence of LSPG and space–time LSPG projection on the time discretization and the exponential growth in time exhibited by a posteriori error bounds for both Galerkin and LSPG projection. We consider two types of space–time trial subspaces within the proposed approach: one that reduces only the spatial dimension of the full-order model, and one that reduces both the spatial and temporal dimensions of the full-order model. For each type of trial subspace, we consider two different solution techniques: direct (i.e., discretize then optimize) and indirect (i.e., optimize then discretize). Numerical experiments conducted using trial subspaces characterized by spatial dimension reduction demonstrate that the WLS approach can yield more accurate solutions with lower space–time residuals than Galerkin and LSPG projection.

97 MATHEMATICS AND COMPUTING↗

RELAP-7 Development Updates

RELAP-7 is a nuclear systems safety analysis code being developed at the Idaho National Laboratory, and is the next generation tool in the RELAP reactor safety/systems analysis application series. RELAP-7 development began in 2011 to support the Risk Informed Safety Margins Characterization (RISMC) Pathway of the Light Water Reactor Sustainability (LWRS) program. The overall design goal of RELAP-7 is to take advantage of the previous thirty years of advancements in computer architecture, software design, numerical methods, and physical models in order to provide capabilities needed for the RISMC methodology and to support nuclear power safety analysis. The code is being developed based on Idaho National Laboratory’s modern scientific software development framework – MOOSE (the Multi-Physics Object-Oriented Simulation Environment). The initial development goal of the RELAP-7 approach focused primarily on the development of an implicit algorithm capable of strong (nonlinear) coupling of the dependent hydrodynamic variables contained in the 1-D/2-D flow models with the various 0-D system reactor components that compose various boiling water reactor (BWR) and pressurized water reactor nuclear power plants (NPPs). During Fiscal Year (FY) 2015, the RELAP-7 code has been further improved with expanded capability to support boiling water reactor (BWR) and pressurized water reactor NPPs analysis. The accumulator model has been developed. The code has also been coupled with other MOOSE-based applications such as neutronics code RattleSnake and fuel performance code BISON to perform multiphysics analysis. A major design requirement for the implicit algorithm in RELAP-7 is that it is capable of second-order discretization accuracy in both space and time, which eliminates the traditional first-order approximation errors. The second-order temporal is achieved by a second-order backward temporal difference, and the one-dimensional second-order accurate spatial discretization is achieved with the Galerkin approximation of Lagrange finite elements. During FY-2015, we have done numerical verification work to verify that the RELAP-7 code indeed achieves 2nd-order accuracy in both time and space for single phase models at the system level.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Adaptive identification and control for manipulators without using joint accelerations

The authors present a new scheme for the adaptive control of mechanical manipulators along with proof of convergence. Difficulties encountered in the input-error type adaptive controller are remedied by combining an explicit identifier with discrete time updates of the parameter values along with a computed torque type control law. The new scheme requires no matrix inversion with its consequent drain on the computational power of the controller. A discussion is presented of the dynamic model of a manipulator, a computed torque adaptive scheme, an input error identifier, and a hybrid identifier.

Hsu, Ping↗

Hesitation in tracking induced by a concurrent manual task

When people are required to track with one hand and perform occasional discrete responses with the other hand, there is a strong possibility that errors will be induced in tracking attributable to the simultaneous action by the other. This problem was investigated by pairing pursuit tracking (right hand) with a handle movement response (left hand) guided by an auditory stimulus. Tracking is assumed to represent flight control and the left hand response to represent other aspects of aircraft system management. The general goal of this research is to identify the types of errors induced into tracking by the requirement of a secondary response with the other hand. An attempt is reported to determine if hesitations can be reduced further by combining tracking emphasis with a higher degree of practice. It is concluded that there is a tendency to freeze the tracking response when a discrete simultaneous response is required of the other hand. By contrast, practice seems to reduce hesitations while also improving left hand reaction time. Thus there appears to be a mode of control which permits tracking and discrete simultaneous responses to occur together.

Kelly, P. A.↗

Digital Material Assembly by Passive Means and Modular Isotropic Lattice Extruder System

A set of machines and related systems build structures by the additive assembly of discrete parts. These digital material assemblies constrain the constituent parts to a discrete set of possible positions and orientations. In doing so, the structures exhibit many of the properties inherent in digital communication such as error correction, fault tolerance and allow the assembly of precise structures with comparatively imprecise tools. Assembly of discrete cellular lattices by a Modular Isotropic Lattice Extruder System (MILES) is implemented by pulling strings of lattice elements through a forming die that enforces geometry constraints that lock the elements into a rigid structure that can then be pushed against and extruded out of the die as an assembled, loadbearing structure.

Carney, Matthew Eli↗

Digital Material Assembly by Passive Means and Modular Isotropic Lattice Extruder System

A set of machines and related systems build structures by the additive assembly of discrete parts. These digital material assemblies constrain the constituent parts to a discrete set of possible positions and orientations. In doing so, the structures exhibit many of the properties inherent in digital communication such as error correction, fault tolerance and allow the assembly of precise structures with comparatively imprecise tools. Assembly of discrete cellular lattices by a Modular Isotropic Lattice Extruder System (MILES) is implemented by pulling strings of lattice elements through a forming die that enforces geometry constraints that lock the elements into a rigid structure that can then be pushed against and extruded out of the die as an assembled, load bearing structure.

Carney, Matthew Eli↗

Identification of the Diffusion Parameter in Nonlocal Steady Diffusion Problems

The problem of identifying the diffusion parameter appearing in a nonlocal steady diffusion equation is considered. The identification problem is formulated as an optimal control problem having a matching functional as the objective of the control and the parameter function as the control variable. The analysis makes use of a nonlocal vector calculus that allows one to define a variational formulation of the nonlocal problem. In a manner analogous to the local partial differential equations counterpart, we demonstrate, for certain kernel functions, the existence of at least one optimal solution in the space of admissible parameters. We introduce a Galerkin finite element discretization of the optimal control problem and derive a priori error estimates for the approximate state and control variables. Using one-dimensional numerical experiments, we illustrate the theoretical results and show that by using nonlocal models it is possible to estimate non-smooth and discontinuous diffusion parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗

Implementation of a Spacer Grid Rod Thermal-Hydraulic Reconstruction (ROTHCON) Capability into the Thermal-Hydraulic Subchannel Code CTF

The Consortium for Advanced Simulation of Light Water Reactors is developing a core simulator capability known as the Virtual Environment for Reactor Applications (VERA) to address nuclear industry challenge problems such as crud-induced power shift (CIPS). The CTF thermal-hydraulic (T/H) subchannel code provides thermal feedback in the coupled neutronics, T/H, crud chemistry simulation that VERA performs. It has been discovered that the coarse meshing approach used by CTF (in which fuel rods are discretized into four azimuthal segments) can be a source of error in predicting crud growth and boron distribution in VERA CIPS calculations. Spacer grid effects lead to complex rod-to-fluid heat transfer behavior that, when not resolved, can lead to error in the prediction of crud growth and boron deposition. A higher-fidelity computational fluid dynamics approach can be used instead of CTF, but this leads to excessive simulation times. This paper presents an approach for using high-fidelity computational fluid dynamics data to create shape functions that are used in CTF to reconstruct rod surface heat transfer behavior as a function of spacer grid geometry. The approach is demonstrated for a 5 × 5 rod bundle facility with five mixing vane grids under a range of operating conditions encountered in nominal pressurized water reactor conditions. Furthermore, it is demonstrated that the grid heat transfer maps are successful at introducing a higher-fidelity heat transfer modeling capability into CTF.

CFD-informed↗

Optimal Piecewise Linear Basis Functions in Two Dimensions

We use a variational approach to optimize the center point coefficients associated with the piecewise linear basis functions introduced by Stone and Adams [1], for polygonal zones in two Cartesian dimensions. Our strategy provides optimal center point coefficients, as a function of the location of the center point, by minimizing the error induced when the basis function interpolation is used for the solution of the time independent diffusion equation within the polygonal zone. By using optimal center point coefficients, one expects to minimize the errors that occur when these basis functions are used to discretize diffusion equations, or transport equations in optically thick zones (where they approach the solution of the diffusion equation). Our optimal center point coefficients satisfy the requirements placed upon the basis functions for any location of the center point. We also find that the location of the center point can be optimized, but this requires numerical calculations. Curiously, the optimum center point location is independent of the values of the dependent variable on the corners only for quadrilaterals.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An error criterion for determining sampling rates in closed-loop control systems

The determination of an error criterion which will give a sampling rate for adequate performance of linear, time-invariant closed-loop, discrete-data control systems was studied. The proper modelling of the closed-loop control system for characterization of the error behavior, and the determination of an absolute error definition for performance of the two commonly used holding devices are discussed. The definition of an adequate relative error criterion as a function of the sampling rate and the parameters characterizing the system is established along with the determination of sampling rates. The validity of the expressions for the sampling interval was confirmed by computer simulations. Their application solves the problem of making a first choice in the selection of sampling rates.

Brecher, S. M.↗

A comparison of methods for DPLL loop filter design

Four design methodologies for loop filters for a class of digital phase-locked loops (DPLLs) are presented. The first design maps an optimum analog filter into the digital domain; the second approach designs a filter that minimizes in discrete time weighted combination of the variance of the phase error due to noise and the sum square of the deterministic phase error component; the third method uses Kalman filter estimation theory to design a filter composed of a least squares fading memory estimator and a predictor. The last design relies on classical theory, including rules for the design of compensators. Linear analysis is used throughout the article to compare different designs, and includes stability, steady state performance and transient behavior of the loops. Design methodology is not critical when the loop update rate can be made high relative to loop bandwidth, as the performance approaches that of continuous time. For low update rates, however, the miminization method is significantly superior to the other methods.

Aguirre, S.↗

WRLES: Wave Resolving Large-Eddy Simulation Code, Theory and Usage

A computational fluid dynamics code has been developed for large-eddy simulations (LES) of turbulent flow. The code uses high-order of accuracy and high-resolution numerical methods to minimize solution error and maximize the resolution of the turbulent structures. Spatial discretization is performed using explicit central differencing. The central differencing schemes in the code include 2nd- to 12th-order standard central difference methods as well as 7-, 9-, 11- and 13-point dispersion relation preserving schemes. Solution filtering and high-order shock capturing are included for stability. Time discretization is performed using multistage Runge-Kutta methods that are up to 4th order accurate. Several options are available to model turbulence including: Baldwin-Lomax and Spalart-Allmaras Reynolds-averaged Navier-Stokes turbulence models, and Smagorinsky, Dynamic Smagorinsky and Vreman sub-grid scale models for LES. This report presents the theory behind the numerical and physical models used in the code and provides a user's manual to the operation of the code.

High-Order↗

The MP{sub N} method: a new angular discretization method based on piecewise polynomial interfaces fluxes

In transport calculations, it is well known how S{sub N} method is extremely inefficient in problems where the particle physics is dominated by streaming. The ray-effect eventually produced by the insufficient angular discretization, appears to be extremely persistent with respect to the refinement of the angular quadrature. The MP{sub N} method, that relies on continuous angular representation, offers a robust remedy to such an issue. MP{sub N} is based on the decomposition of the unit sphere into solid angles and on a piecewise continuous definition of interface fluxes, which are expanded in polynomials in each solid angle. This allows propagating more than one angular degree of freedom simultaneously while maintaining unaltered the block-diagonal pattern of the displacement plus removal operator. The method is therefore well suited for the flux resolution by means of a conventional sweep algorithm. Furthermore, unlike the S{sub N} method, MP{sub N} does not rely on discrete directions and, thus, on an angular quadrature formula, but rather constructs a set of linear equations solving for the angular moments of the flux for all discrete solid angles within the sweep. MP{sub N} shows an error convergence rate higher than S{sub N} at the expense of an increased size of the coefficient matrices, so of the computational cost. Although MP{sub N} is not free from ray-effect, the latter is effectively mitigated and less persistent with respect to the increase of the angular refinement order. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A priori mesh quality estimation via direct relation between truncation error and mesh distortion

The purpose of the present work is the derivation and evaluation of a priori mesh quality indicators for structured, unstructured, as well as hybrid grids. Emphasis is placed on deriving direct relations between the indicators and mesh distortion. The work is based on use of the finite volume discretization for evaluation of first order spatial derivatives. The analytic form of the truncation error is derived and applied to elementary types of mesh distortion including typical hybrid grid interfaces. The corresponding analytic expressions provide direct relations between computational accuracy and the degree of stretching, skewness, shearing and non-alignment of the mesh.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Discretising the velocity distribution for directional dark matter experiments

Dark matter (DM) direct detection experiments which are directionally-sensitive may be the only method of probing the full velocity distribution function (VDF) of the Galactic DM halo. We present an angular basis for the DM VDF which can be used to parametrise the distribution in order to mitigate astrophysical uncertainties in future directional experiments and extract information about the DM halo. This basis consists of discretising the VDF in a series of angular bins, with the VDF being only a function of the DM speed v within each bin. In contrast to other methods, such as spherical harmonic expansions, the use of this basis allows us to guarantee that the resulting VDF is everywhere positive and therefore physical. We present a recipe for calculating the event rates corresponding to the discrete VDF for an arbitrary number of angular bins N and investigate the discretisation error which is introduced in this way. For smooth, Standard Halo Model-like distribution functions, only N=3 angular bins are required to achieve an accuracy of around 10–30% in the number of events in each bin. Shortly after confirmation of the DM origin of the signal with around 50 events, this accuracy should be sufficient to allow the discretised velocity distribution to be employed reliably. For more extreme VDFs (such as streams), the discretisation error is typically much larger, but can be improved with increasing N. This method paves the way towards an astrophysics-independent analysis framework for the directional detection of dark matter.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗