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 613 records · Page 34

FUN3D Manual: 13.7

This manual describes the installation and execution of FUN3D version 13.7, including optional dependent packages. FUN3D is a suite of computational fluid dynamics simulation and design tools that uses mixed-element unstructured grids in a large number of formats, including structured multiblock and overset grid systems. A discretely-exact adjoint solver may be used for formal design optimization, error estimation, and mesh adaptation. FUN3D also offers a reacting, real-gas capability and provides GPU acceleration of many common simulation options.

FUN3D↗

FUN3D Manual: 14.0.2

This manual describes the installation and execution of FUN3D version 14.0.2, including optional dependent packages. FUN3D is a suite of computational fluid dynamics simulation and design tools that uses mixed-element unstructured grids in a large number of formats, including structured multiblock and overset grid systems. A discretely-exact adjoint solver may be used for formal design optimization, error estimation, and mesh adaptation. FUN3D also offers a reacting, real-gas capability and provides GPU acceleration of many common simulation options.

William K Anderson↗

FUN3D Manual: 14.1

This manual describes the installation and execution of FUN3D version 14.1, including optional dependent packages. FUN3D is a suite of computational fluid dynamics simulation and design tools that uses mixed-element unstructured grids in a large number of formats, including structured multiblock and overset grid systems. A discretely-exact adjoint solver may be used for formal design optimization, error estimation, and mesh adaptation. FUN3D also offers a reacting, real-gas capability and provides GPU acceleration of many common simulation options.

William K Anderson↗

Hidden Markov Modeling for Weigh-In-Motion Estimation

This paper describes a hidden Markov model to assist in the weight measurement error that arises from complex vehicle oscillations of a system of discrete masses. Present reduction of oscillations is by a smooth, flat, level approach and constant, slow speed in a straight line. The model uses this inherent variability to assist in determining the true total weight and individual axle weights of a vehicle. The weight distribution dynamics of a generic moving vehicle were simulated. The model estimation converged to within 1% of the true mass for simulated data. The computational demands of this method, while much greater than simple averages, took only seconds to run on a desktop computer.

99 GENERAL AND MISCELLANEOUS↗

Newton-Krylov Method in Applications of Solving Two-phase Problems using Drift Flux Model

In this paper, Jacobian-free Newton-Krylov (JFNK) method is investigated in an application to implicitly solve two-phase flow problems using four-equation drift flux model. The closure models include the EPRI drift flux correlations and additional constitutive models to determine flow regimes, wall boiling and interfacial heat/mass transfer, two-phase flow wall friction, etc. Different from many traditional computer codes, fully implicit methods are used for the time integration. The resulted nonlinear discretized equation system is solved using the JFNK method. Expensive and error prone derivation and implementation of the analytical Jacobian matrix are avoided. Numerical results are successfully validated using existing experimental data on flow boiling under forced convection conditions in both pipe and rod bundle geometries.

42 ENGINEERING↗

Estimation in a discrete tail rate family of recapture sampling models

In the context of recapture sampling design for debugging experiments the problem of estimating the error or hitting rate of the faults remaining in a system is considered. Moment estimators are derived for a family of models in which the rate parameters are assumed proportional to the tail probabilities of a discrete distribution on the positive integers. The estimators are shown to be asymptotically normal and fully efficient. Their fixed sample properties are compared, through simulation, with those of the conditional maximum likelihood estimators.

Gupta, Rajan↗

Asymptotic errors in adiabatic evolution

The adiabatic theorem in quantum mechanics implies that if a system is in a discrete eigenstate of a Hamiltonian and the Hamiltonian evolves in time arbitrarily slowly, the system will remain in the corresponding eigenstate of the evolved Hamiltonian. Understanding corrections to the adiabatic result that arise when the evolution of the Hamiltonian is slow—but not arbitrarily slow—has become increasingly important, especially since adiabatic evolution has been proposed as a method of state preparation in quantum computing. Here, this paper identifies two regimes, an adiabatic regime in which corrections are generically small and can depend on details of the evolution throughout the path, and a hyperadiabatic regime in which the error is given by a form similar to an asymptotic expansion in the inverse of the evolution time with the coefficients depending principally on the behavior at the endpoints. However, the error in this hyperadiabatic regime is neither given by a true asymptotic series nor solely dependent on the endpoints: the coefficients combine the contributions from both endpoints, with relative phase factors that depend on the average spectral gaps along the trajectory, multiplied by the evolution time. The central result of this paper is to identify a quantity, referred to as the typical error, which is obtained by appropriately averaging the error over evolution times that are small compared to the evolution time itself. This typical error is characterized by an asymptotic series and depends solely on the endpoints of the evolution, remaining independent of the details of the intermediate evolution.

adiabatic approximation↗

Coarse Spaces by Algebraic Multigrid: Multigrid Convergence and Upscaled Error Estimates

We give an overview of a number of algebraic multigrid methods targeting finite element discretization problems. The focus is on the properties of the constructed hierarchy of coarse spaces that guarantee (two-grid) convergence. In particular, a necessary condition known as 'weak approximation property', and a sufficient one, referred to as 'strong approximation property' are discussed. Their role in proving convergence of the TG method (as iterative method) and also on the approximation properties of the AMG coarse spaces if used as discretization tool is pointed out. Some preliminary numerical results illustrating the latter aspect are also reported.

97 MATHEMATICS AND COMPUTING↗

Semimajor Axis Estimation Strategies

This paper extends previous analysis on the impact of sensing noise for the navigation and control aspects of formation flying spacecraft. We analyze the use of Carrier-phase Differential GPS (CDGPS) in relative navigation filters, with a particular focus on the filter correlation coefficient. This work was motivated by previous publications which suggested that a "good" navigation filter would have a strong correlation (i.e., coefficient near -1) to reduce the semimajor axis (SMA) error, and therefore, the overall fuel use. However, practical experience with CDGPS-based filters has shown this strong correlation seldom occurs (typical correlations approx. -0.1), even when the estimation accuracies are very good. We derive an analytic estimate of the filter correlation coefficient and demonstrate that, for the process and sensor noises levels expected with CDGPS, the expected value will be very low. It is also demonstrated that this correlation can be improved by increasing the time step of the discrete Kalman filter, but since the balance condition is not satisfied, the SMA error also increases. These observations are verified with several linear simulations. The combination of these simulations and analysis provide new insights on the crucial role of the process noise in determining the semimajor axis knowledge.

How, Jonathan P.↗

A posteriori error analysis for a cut cell finite volume method

We study the solution of a diffusive process in a domain where the diffusion coefficient changes discontinuously across a curved interface. We consider discretizations that use regularly-shaped meshes, so that the interface “cuts” through the cells (elements or volumes) without respecting the regular geometry of the mesh. Consequently, the discontinuity in the diffusion coefficients has a strong impact on the accuracy and convergence of the numerical method. This motivates the derivation of computational error estimates that yield accurate estimates for specified quantities of interest. For this purpose, we adapt the well-known adjoint based a posteriori error analysis technique used for finite element methods. In order to employ this method, we describe a systematic approach to discretizing a cut-cell problem that handles complex geometry in the interface in a natural fashion yet reduces to the well-known Ghost Fluid Method in simple cases. We test the accuracy of the estimates in a series of examples.

97 MATHEMATICS AND COMPUTING↗

Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators

It is widely known that neural networks (NNs) are universal approximators of continuous functions. However, a less known but powerful result is that a NN with a single hidden layer can accurately approximate any nonlinear continuous operator. This universal approximation theorem of operators is suggestive of the structure and potential of deep neural networks (DNNs) in learning continuous operators or complex systems from streams of scattered data. Here, in this work, we thus extend this theorem to DNNs. We design a new network with small generalization error, the deep operator network (DeepONet), which consists of a DNN for encoding the discrete input function space (branch net) and another DNN for encoding the domain of the output functions (trunk net). We demonstrate that DeepONet can learn various explicit operators, such as integrals and fractional Laplacians, as well as implicit operators that represent deterministic and stochastic differential equations. We study different formulations of the input function space and its effect on the generalization error for 16 different diverse applications.

97 MATHEMATICS AND COMPUTING↗

Effects of Inflow Spatiotemporal Discretization on Wake Meandering and Turbine Structural Response using FAST.Farm

FAST.Farm is a newly developed multiphysics, midfidelity engineering tool that can be used to predict turbine power and structural loads of wind turbines in a wind farm with minimal computational expense. Previous studies have shown similarities and differences in wind turbine performance between FAST.Farm and high-fidelity large-eddy simulations (LES) using both LES precursor-generated inflow and TurbSim-generated synthetic inflow. While conservative resolutions have been used to date, no formal spatial or temporal discretization study has been performed for the FAST.Farm model wind domains. This work aims to study the effects of varying the spatial and temporal discretization of the wind domains on wake meandering (low-resolution domain) and turbine structural response (high-resolution domains) and resulting wake and load calculations. The purpose of this study is to establish convergence criteria and recommendations for discretization values in terms of rotor diameter (D, expressed in meters) that will maximize computational efficiency. To ensure a percent error of ≤ 1% in standard deviation of wake center position relative to the finest included resolution, a low-resolution time step of 0.024D s, 0.016D s, and 0.0079D s and a low-resolution spatial discretization of 0.079D m, 0.16D m, and 0.24D m is recommended for 8 m/s, 12 m/s, and 18 m/s mean ambient wind speed at hub height, respectively. These guidelines are likely applicable to other implementations of the dynamic wake meandering model. To ensure a percent error of ≤ 1% in standard deviation of all considered structural response outputs, a high-resolution time step that captures the highest influential excitation and natural frequencies in the system and a high-resolution spatial discretization comparable to the maximum airfoil cord length is recommended. Lastly, these guidelines are likely applicable to any aeroelastic analysis.

17 WIND ENERGY↗

Finite-size effects in periodic coupled cluster calculations

Here, we provide the first rigorous study of the finite-size error in the simplest and representative coupled cluster theory, namely the coupled cluster doubles (CCD) theory, for gapped periodic systems. Given exact Hartree-Fock orbitals and their corresponding orbital energies, we demonstrate that the correlation energy obtained from the approximate CCD method, after a finite number of fixed-point iterations over the amplitude equation, exhibits a finite-size error scaling as $\mathcal{O}(N^{-\frac{1}{3}}_k)$. Here $N_k$ is the number of discretization points in the Brillouin zone and characterizes the system size. Under additional assumptions ensuring the convergence of the fixed-point iterations, we demonstrate that the CCD correlation energy also exhibits a finite-size error scaling as $\mathcal{O}(N^{-\frac{1}{3}}_k)$. Our analysis shows that the dominant error lies in the coupled cluster amplitude calculation, and the convergence of the finite-size error in energy calculation can be boosted to $\mathcal{O}(N^{-1}_k)$ with accurate amplitudes. This also provides the first proof of the scaling of the finite-size error in the third order Møller-Plesset perturbation theory (MP3) for periodic systems.

97 MATHEMATICS AND COMPUTING↗

Shadow Lagrangian dynamics for superfluidity

Motivated by a similar approach for Born-Oppenheimer molecular dynamics, this paper proposes an extended "shadow" Lagrangian density for quantum states of superfluids. The extended Lagrangian contains an additional field variable that is forced to follow the wave function of the quantum state through a rapidly oscillating extended harmonic oscillator. By considering the adiabatic limit for large frequencies of the harmonic oscillator, we can derive the two equations of motions, a Schrödinger-type equation for the quantum state and a wave equation for the extended field variable. The equations are coupled in a nonlinear way, but each equation individually is linear with respect to the variable that it defines. The computational advantage of this new system is that it can be easily discretized using linear time stepping methods, where we propose to use a Crank-Nicolson-type approach for the Schrödinger equation and an extended leapfrog scheme for the wave equation. Furthermore, the difference between the quantum state and the extended field variable defines a consistency error that should go to zero if the frequency tends to infinity. By coupling the time-step size in our discretization to the frequency of the harmonic oscillator we can extract an easily computable consistency error indicator that can be used to estimate the numerical error without additional costs. The findings are illustrated in numerical experiments.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A study of differentiation errors in large-eddy simulations based on the EDQNM theory

This paper is concerned with the investigation of numerical errors in large-eddy simulations by means of two-point turbulence modeling. Based on the eddy-damped quasi-normal Markovian (EDQNM) theory, a stochastic model is developed in order to predict the time evolution of the kinetic energy spectrum obtained by a large-eddy simulation (LES), including the effects of the numerics. Using this framework, the influence of the accuracy of the approximate space differencing schemes on LES quality is studied, for decaying homogeneous isotropic incompressible turbulence, with Reynolds numbers Re{sub {lambda}} based on the transverse Taylor scale equal to 780, 2500 and 8000. The results show that the discretization of the filtered Navier-Stokes equations leads to differentiation and aliasing errors. Error spectra are also presented, and indicate that the numerical errors are mainly originating from the approximate differentiation. In addition, increasing the order of accuracy of the differencing schemes or using algorithms optimized in the Fourier space is found to widen the range of well-resolved scales. Unfortunately, for all the schemes, the smaller scales with wavenumbers close to the grid cut-off wavenumber, are badly calculated and generate differentiation errors over the whole energy spectrum. The eventual use of explicit filtering to remove spurious motions with short wavelength is finally shown to significantly improve LES accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comparing field data using Alpert multi-wavelets

In this paper we introduce a method to compare sets of full-field data using Alpert tree-wavelet transforms. The Alpert tree-wavelet methods transform the data into a spectral space allowing the comparison of all points in the fields by comparing spectral amplitudes. The methods are insensitive to translation, scale and discretization and can be applied to arbitrary geometries. This makes them especially well suited for comparison of field data sets coming from two different sources such as when comparing simulation field data to experimental field data. We have developed both global and local error metrics to quantify the error between two fields. Additionally, we verify the methods on two-dimensional and three-dimensional discretizations of analytical functions. Furthermore, we then deploy the methods to compare full-field strain data from a simulation of elastomeric syntactic foam.

42 ENGINEERING↗

Compressed/reconstructed test images for CRAF/Cassini

A set of compressed, then reconstructed, test images submitted to the Comet Rendezvous Asteroid Flyby (CRAF)/Cassini project is presented as part of its evaluation of near lossless high compression algorithms for representing image data. A total of seven test image files were provided by the project. The seven test images were compressed, then reconstructed with high quality (root mean square error of approximately one or two gray levels on an 8 bit gray scale), using discrete cosine transforms or Hadamard transforms and efficient entropy coders. The resulting compression ratios varied from about 2:1 to about 10:1, depending on the activity or randomness in the source image. This was accomplished without any special effort to optimize the quantizer or to introduce special postprocessing to filter the reconstruction errors. A more complete set of measurements, showing the relative performance of the compression algorithms over a wide range of compression ratios and reconstruction errors, shows that additional compression is possible at a small sacrifice in fidelity.

Dolinar, S.↗

Implementation of higher-order velocity mapping between marker particles and grid in the particle-in-cell code XGC

The global total-f gyrokinetic particle-in-cell code XGC, used to study transport in magnetic fusion plasmas or to couple with a core gyrokinetic code while functioning as an edge gyrokinetic code, implements a 5-dimensional (5D) continuum grid to perform the dissipative operations, such as plasma collisions, or to exchange the particle distribution function information with a core code. To transfer the distribution function between marker particles and a rectangular 2D velocity-space grid, XGC employs a bilinear mapping. The conservation of particle density and momentum is accurate enough in this bilinear operation, but the error in the particle energy conservation can become undesirably large and cause non-negligible numerical heating in a steep edge pedestal. In the present work we update XGC to use a novel mapping technique, based on the calculation of a pseudo-inverse, to exactly preserve moments up to the order of the discretization space. We describe the details of the implementation and we demonstrate the reduced interpolation error for a tokamak test plasma by using 1st- and 2nd-order elements with the pseudo-inverse method and comparing to the bilinear mapping.

Fusion Plasma↗