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 955 records · Page 53

An equilibrium-preserving discretization for the nonlinear Rosenbluth–Fokker–Planck operator in arbitrary multi-dimensional geometry

Here, the Fokker–Planck collision operator is an advection-diffusion operator which describe dynamical systems such as weakly coupled plasmas, photonics in high temperature environment biological, and even social systems. For plasmas in the continuum, the Fokker–Planck collision operator supports such important physical properties as conservation of number, momentum, and energy, as well as positivity. It also obeys the Boltzmann's H-theorem, i.e., the operator increases the system entropy while simultaneously driving the distribution function towards a Maxwellian. In the discrete, when these properties are not ensured, numerical simulations can either fail catastrophically or suffer from significant numerical pollution. There is strong emphasis in the literature on developing numerical techniques to solve the Fokker–Planck equation while preserving these properties. In this short note, we focus on the analytical equilibrium preserving property, meaning that the Fokker–Planck collision operator vanishes when acting on an analytical Maxwellian distribution function. The equilibrium preservation property is especially important, for example, when one is attempting to capture subtle transport physics. Since transport arises from small Ο(ϵ) corrections to the equilibrium (where ϵ is a small expansion parameter), numerical truncation error present in the equilibrium solution may dominate, overwhelming transport dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Toward textbook multigrid efficiency for fully implicit resistive magnetohydrodynamics

Multigrid methods can solve some classes of elliptic and parabolic equations to accuracy below the truncation error with a work-cost equivalent to a few residual calculations - so-called 'textbook' multigrid efficiency. We investigate methods to solve the system of equations that arise in time dependent magnetohydrodynamics (MHD) simulations with textbook multigrid efficiency. We apply multigrid techniques such as geometric interpolation, full approximate storage, Gauss-Seidel smoothers, and defect correction for fully implicit, nonlinear, second-order finite volume discretizations of MHD. We apply these methods to a standard resistive MHD benchmark problem, the GEM reconnection problem, and add a strong magnetic guide field, which is a critical characteristic of magnetically confined fusion plasmas. We show that our multigrid methods can achieve near textbook efficiency on fully implicit resistive MHD simulations.

97 MATHEMATICS AND COMPUTING↗

Digital atomic scale fabrication an inverse Moore's Law – A path to atomically precise manufacturing

There is an exciting opportunity to start a second digital revolution that will supersede the first digital revolution in information technology (IT) as the primary driver of scientific, technological, and economic growth. This new revolution will be digital fabrication technology. Here, the digital IT revolution has been largely driven by digital algorithms such as error detection and correction and Moore's Law which has given us an exponential trend in product capabilities. However, the longstanding trend in improving manufacturing precision which has enabled Moore's Law simply cannot be continued much longer because we are running into the limits imposed by the quantized nature of matter. At this scale, matter can no longer be treated in an analogue fashion i.e. as an infinitely divisible medium, but must be treated as an integer number of discrete atomic distances, i.e. in a digital fashion. By embracing this digital nature of matter, we can conceive of a digital fabrication technology, where the digital processes are the making and breaking of chemical bonds, there is a digital address grid that is spatial in nature, and error detection and correction processes can be developed. This digital fabrication technology will have the similarly huge advantages over analog fabrication that digital IT has over analog IT. We remind the reader that effective digital technologies are not exclusively digital in their operation. Digital electronics is carried out by analog transistors that are embedded in circuitry designed to accept their output in a digital fashion. Digital fabrication technology is not synonymous with Atomically Precise Manufacturing (APM) but should lead to that important capability. Furthermore this digital fabrication technology will start a new exponential manufacturing trend that will replace Moore's law and will not be just for information processing and therefore will have an even larger impact than Moore's Law. Like any exponential trend Digital Fabrication will start slowly in a few niche markets, but the time for investing in the development of this new technology is now.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Small Body GN&C Research Report: A G-Guidance Enhancement to Increase Mission Functionality

G-Guidance is a robust G&C (guidance and control) algorithm developed under the small-body GN&C task. The G-Guidance scheme utilizes a model predictive control approach, along with a convexification of the governing dynamics, control constraints, and trajectory/state constraints. This report details an enhancement to the FY2005 G-Guidance algorithm; the addition of a fire-second approach helps to nullify velocity errors and hit desired final velocities much more precisely than the original Fire-first scheme developed in FY2005. The enhancement preserves the primary benefit of the algorithm, which is to ensure required thruster silent times during trajectory maneuvers. The fire-second scheme increases the versatility of the algorithm for missions employing G-Guidance. For instance, a landing sequence could employ the fire-second scheme to ensure a null final velocity at landing, whereas an ascent sequence could utilize a fire-first scheme to ensure there is no drift of the spacecraft toward the ground at the beginning of the maneuver. Examples are provided within to demonstrate a fire-first versus fire-second guidance scheme. As in the existing G-Guidance algorithm, the examples and schemes incorporate gravity models and thruster firing times into discrete dynamics that are solved as a optimal control problem to minimize fuel consumption or thruster energy expenditure.

velocity errors↗

Analysis of the weighted shifted boundary method for the Poisson and Stokes problems

The Shifted Boundary Method (SBM) belongs to the class of unfitted (or immersed, or embedded) finite element methods, and relies on reformulating the original boundary value problem over a surrogate (approximate) computational domain. Accuracy is maintained by properly shifting the location and values of the boundary conditions. This avoids integration over cut cells and the associated implementation issues. Recently, the Weighted SBM (WSBM) was proposed for the Navier-Stokes equations with free surfaces and the Stokes flow with moving boundaries. The attribute “weighted” in the name WSBM stems from the fact that its variational form is weighted with the elemental volume fraction of active fluid. The motivation for the development of the WSBM was the preservation of the volume of active fluid to a higher degree of accuracy, which in turn resulted in improved stability and robustness characteristics in moving-boundary, time-dependent simulations. In this article, we present the numerical analysis of the WSBM formulations for the Poisson and Stokes problems. We give mathematical conditions under which the bilinear forms defining the discrete variational formulations are uniformly coercive (Poisson problem) or inf-sup stable (Stokes problem). By these results, stability and optimal convergence is proven in the natural norm; L2-error estimates can also be derived.

Approximate domain boundaries↗

Landslide monitoring using seismic refraction tomography – The importance of incorporating topographic variations

Seismic refraction tomography provides images of the elastic properties of subsurface materials in landslide settings. Seismic velocities are sensitive to changes in moisture content, which is a triggering factor in the initiation of many landslides. However, the application of the method to long-term monitoring of landslides is rarely used, given the challenges in undertaking repeat surveys and in handling and minimizing the errors arising from processing time-lapse surveys. This work presents a simple method and workflow for producing a reliable time-series of inverted seismic velocity models. This method is tested using data acquired during a recent, novel, long-term seismic refraction monitoring campaign at an active landslide in the UK. Potential sources of error include those arising from inaccurate and inconsistent determination of first-arrival times, inaccurate receiver positioning, and selection of inappropriate inversion starting models. At our site, a comparative analysis of variations in seismic velocity to real-world variations in topography over time shows that topographic error alone can account for changes in seismic velocity of greater than ±10% in a significant proportion (23%) of the data acquired. The seismic velocity variations arising from real material property changes at the near-surface of the landslide, linked to other sources of environmental data, are demonstrated to be of a similar magnitude. Over the monitoring period we observe subtle variations in the bulk seismic velocity of the sliding layer that are demonstrably related to variations in moisture content. This highlights the need to incorporate accurate topographic information for each time-step in the monitoring time-series. The goal of the proposed workflow is to minimize the sources of potential errors, and to preserve the changes observed by real variations in the subsurface. Following the workflow produces spatially comparable, time-lapse velocity cross-sections formulated from disparate, discretely-acquired datasets. These practical steps aim to aid the use of the seismic refraction tomography method for the long-term monitoring of landslides prone to hydrological destabilization.

Whiteley, J. S.↗

Enhancement of flow measurements using fluid-dynamic constraints

Novel experimental modalities acquire spatially resolved velocity measurements for steady state and transient flows which are of interest for engineering and biological applications. One of the drawbacks of such high resolution velocity data is their susceptibility to measurement errors. In this paper, we propose a novel filtering strategy that allows enhancement of the noisy measurements to obtain reconstruction of smooth divergence free velocity and corresponding pressure fields which together approximately comply to a prescribed flow model. The main step in our approach consists of the appropriate use of the velocity measurements in the design of a linearized flow model which can be shown to be well-posed and consistent with the true velocity and pressure fields up to measurement and modeling errors. The reconstruction procedure is then formulated as an optimal control problem for this linearized flow model. The resulting filter has analyzable smoothing and approximation properties. We briefly discuss the discretization of the approach by finite element methods and comment on the efficient solution by iterative methods. The capability of the proposed filter to significantly reduce data noise is demonstrated by numerical tests including the application to experimental data. In addition, we compare with other methods like smoothing and solenoidal filtering.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Resolution of a Challenge for Solvation Modeling: Calculation of Dicarboxylic Acid Dissociation Constants Using Mixed Discrete-Continuum Solvation Models

First and second dissociation constants (pK a values) of oxalic acid, malonic acid, and adipic acid were computed by using a number of theoretical protocols based on density functional theory and using both continuum solvation models and mixed discrete-continuum solvation models. We show that fully implicit solvation models (in which the entire solvent is represented by a dielectric continuum) fail badly for dicarboxylic acids with mean unsigned errors averaged over six pK a values) of 2.4-9.0 log units, depending on the particular implicit model used. The use of water-solute clusters and accounting for multiple conformations in solution significantly improve the performance of both generalized Born solvation models and models that solve the nonhomogeneous dielectric Poisson equation for bulk electrostatics. The four most successful models have mean unsigned errors of only 0.6-0.8 log units.

Environmental Molecular Sciences Laboratory↗

Optimized Finite-Difference Coefficients for Acoustic Modeling.

Although using standard Taylor series coefficients for finite-difference operators is optimal in the sense that in the limit of infinitesimal space and time discretization, the solution approaches the correct analytic solution to the acousto-dynamic system of differential equations, other finite-difference operators may provide optimal computational run time given certain error bounds or source bandwidth constraints. This report describes the results of investigation of alternative optimal finite-difference coefficients based on several optimization/accuracy scenarios and provides recommendations for minimizing run time while retaining error within given error bounds.

58 GEOSCIENCES↗

Boundary conditions for the numerical solution of elliptic equations in exterior regions

Elliptic equations in exterior regions frequently require a boundary condition at infinity to ensure the well-posedness of the problem. Examples of practical applications include the Helmholtz equation and Laplace's equation. Computational procedures based on a direct discretization of the elliptic problem require the replacement of the condition on a finite artificial surface. Direct imposition of the condition at infinity along the finite boundary results in large errors. A sequence of boundary conditions is developed which provides increasingly accurate approximations to the problem in the infinite domain. Estimates of the error due to the finite boundary are obtained for several cases. Computations are presented which demonstrate the increased accuracy that can be obtained by the use of the higher order boundary conditions. The examples are based on a finite element formulation but finite difference methods can also be used.

Bayliss, A.↗

Spectral methods for solution of the boundary-layer equations

The basic principles of spectral methods are reviewed, and their application to the two-dimensional incompressible boundary-layer equations is discussed. It is shown that spectral collocation methods provide an accuracy sufficient for engineering applications on extremely coarse grids, and the machine time requirements are small. Although for a given stream-wise discretization, the fully spectral scheme requires more computational effort than the marching scheme, the higher accuracy of the former yields a large net gain in efficiency when considered at equivalent error levels.

Streett, C. L.↗

Numerical solution of the unsteady Navier-Stokes equation

The construction and the analysis of nonoscillatory shock capturing methods for the approximation of hyperbolic conservation laws are discussed. These schemes share many desirable properties with total variation diminishing schemes, but TVD schemes have at most first-order accuracy, in the sense of truncation error, at extrema of the solution. In this paper a uniformly second-order approximation is constructed, which is nonoscillatory in the sense that the number of extrema of the discrete solution is not increasing in time. This is achieved via a nonoscillatory piecewise linear reconstruction of the solution from its cell averages, time evolution through an approximate solution of the resulting initial value problem, and averaging of this approximate solution over each cell.

Osher, Stanley J.↗

Dynamical Approach Study of Spurious Steady-State Numerical Solutions of Nonlinear Differential Equations: Global Asymptotic Behavior of Time Discretizations - 2

The global asymptotic nonlinear behavior of 1 1 explicit and implicit time discretizations for four 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations (ODES) is analyzed. The objectives are to gain a basic understanding of the difference in the dynamics of numerics between the scalars and systems of nonlinear autonomous ODEs and to set a baseline global asymptotic solution behavior of these schemes for practical computations in computational fluid dynamics. We show how 'numerical' basins of attraction can complement the bifurcation diagrams in gaining more detailed global asymptotic behavior of time discretizations for nonlinear differential equations (DEs). We show how in the presence of spurious asymptotes the basins of the true stable steady states can be segmented by the basins of the spurious stable and unstable asymptotes. One major consequence of this phenomenon which is not commonly known is that this spurious behavior can result in a dramatic distortion and, in most cases, a dramatic shrinkage and segmentation of the basin of attraction of the true solution for finite time steps. Such distortion, shrinkage and segmentation of the numerical basins of attraction will occur regardless of the stability of the spurious asymptotes, and will occur for unconditionally stable implicit linear multistep methods. In other words, for the same (common) steady-state solution the associated basin of attraction of the DE might be very different from the discretized counterparts and the numerical basin of attraction can be very different from numerical method to numerical method. The results can be used as an explanation for possible causes of error, and slow convergence and nonconvergence of steady-state numerical solutions when using the time-dependent approach for nonlinear hyperbolic or parabolic PDES.

Yee, H. C.↗

Perceptually Lossless Wavelet Compression

The Discrete Wavelet Transform (DWT) decomposes an image into bands that vary in spatial frequency and orientation. It is widely used for image compression. Measures of the visibility of DWT quantization errors are required to achieve optimal compression. Uniform quantization of a single band of coefficients results in an artifact that is the sum of a lattice of random amplitude basis functions of the corresponding DWT synthesis filter, which we call DWT uniform quantization noise. We measured visual detection thresholds for samples of DWT uniform quantization noise in Y, Cb, and Cr color channels. The spatial frequency of a wavelet is r 2(exp -1), where r is display visual resolution in pixels/degree, and L is the wavelet level. Amplitude thresholds increase rapidly with spatial frequency. Thresholds also increase from Y to Cr to Cb, and with orientation from low-pass to horizontal/vertical to diagonal. We propose a mathematical model for DWT noise detection thresholds that is a function of level, orientation, and display visual resolution. This allows calculation of a 'perceptually lossless' quantization matrix for which all errors are in theory below the visual threshold. The model may also be used as the basis for adaptive quantization schemes.

Watson, Andrew B.↗

Dynamical Approach Study of Spurious Steady-State Numerical Solutions of Nonlinear Differential Equations: Global Asymptotic Behavior of Time Discretizations - Part 2

The global asymptotic nonlinear behavior of 11 explicit and implicit time discretizations for four 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations (ODEs) is analyzed. The objectives are to gain a basic understanding of the difference in the dynamics of numerics between the scalars and systems of nonlinear autonomous ODEs and to set a baseline global asymptotic solution behavior of these schemes for practical computations in computational fluid dynamics. We show how 'numerical' basins of attraction can complement the bifurcation diagrams in gaining more detailed global asymptotic behavior of time discretizations for nonlinear differential equations (DEs). We show how in the presence of spurious asymptotes the basins of the true stable steady states can be segmented by the basins of the spurious stable and unstable asymptotes. One major consequence of this phenomenon which is not commonly known is that this spurious behavior can result in a dramatic distortion and, in most cases, a dramatic shrinkage and segmentation of the basin of attraction of the true solution for finite time steps. Such distortion, shrinkage and segmentation of the numerical basins of attraction will occur regardless of the stability of the spurious asymptotes, and will occur for unconditionally stable implicit linear multistep methods. In other words, for the same (common) steady-state solution the associated basin of attraction of the DE might be very different from the discretized counterparts and the numerical basin of attraction can be very different from numerical method to numerical method. The results can be used as an explanation for possible causes of error, and slow convergence and nonconvergence of steady-state numerical solutions when using the time-dependent approach for nonlinear hyperbolic or parabolic PDEs.

Yee, H. C.↗

Visibility of Wavelet Quantization Noise

The Discrete Wavelet Transform (DWT) decomposes an image into bands that vary in spatial frequency and orientation. It is widely used for image compression. Measures of the visibility of DWT quantization errors are required to achieve optimal compression. Uniform quantization of a single band of coefficients results in an artifact that is the sum of a lattice of random amplitude basis functions of the corresponding DWT synthesis filter, which we call DWT uniform quantization noise. We measured visual detection thresholds for samples of DWT uniform quantization noise in Y, Cb, and Cr color channels. The spatial frequency of a wavelet is r 2(exp)-L , where r is display visual resolution in pixels/degree, and L is the wavelet level. Amplitude thresholds increase rapidly with spatial frequency. Thresholds also increase from Y to Cr to Cb, and with orientation from low-pass to horizontal/vertical to diagonal. We describe a mathematical model to predict DWT noise detection thresholds as a function of level, orientation, and display visual resolution. This allows calculation of a "perceptually lossless" quantization matrix for which all errors are in theory below the visual threshold. The model may also be used as the basis for adaptive quantization schemes.

Watson, Andrew B.↗

Visibility of wavelet quantization noise

The discrete wavelet transform (DWT) decomposes an image into bands that vary in spatial frequency and orientation. It is widely used for image compression. Measures of the visibility of DWT quantization errors are required to achieve optimal compression. Uniform quantization of a single band of coefficients results in an artifact that we call DWT uniform quantization noise; it is the sum of a lattice of random amplitude basis functions of the corresponding DWT synthesis filter. We measured visual detection thresholds for samples of DWT uniform quantization noise in Y, Cb, and Cr color channels. The spatial frequency of a wavelet is r 2-lambda, where r is display visual resolution in pixels/degree, and lambda is the wavelet level. Thresholds increase rapidly with wavelet spatial frequency. Thresholds also increase from Y to Cr to Cb, and with orientation from lowpass to horizontal/vertical to diagonal. We construct a mathematical model for DWT noise detection thresholds that is a function of level, orientation, and display visual resolution. This allows calculation of a "perceptually lossless" quantization matrix for which all errors are in theory below the visual threshold. The model may also be used as the basis for adaptive quantization schemes.

NASA Center ARC↗

Preliminary Measurement of Lunar Particle Shapes.

Particle shape is a basic parameter and essential for many engineering applications. Very little data is published on the shape of lunar particles. An unpublished review found that even where the same samples were studied the results were contradictory, probably because of extremely small sample sizes. Other workers have made fundamental errors in algorithms. There are many ways to measure particle shape. One common approach is to examine the particles as intersected by a plain, such as a thin section. If discrete particles can be segmented from the image, programs such as ImageJ can readily obtain shape measurements for each particle.

Rickman, Doug↗