Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 631 records · Page 35

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.↗

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↗

The discrete correlation function - A new method for analyzing unevenly sampled variability data

A method for measuring correlation functions without interpolating in the temporal domain is proposed which provides an assumption-free representation of the correlation measured in the data and allows meaningful error estimates. Physical interpretation of the cross-correlation function of two series believed to be related by a convolution is shown to require knowledge of the input function's fluctuation power spectrum. Application of the method to two systems reveals no correlation for the optical data of Akn 120, but a strong correlation for the UV data of NGC 4151, placing bounds of between 1.2 and 20 light days on the size of the line-emitting region.

Edelson, R. A.↗

A function space approach to state and model error estimation for elliptic systems

An approach is advanced for the concurrent estimation of the state and of the model errors of a system described by elliptic equations. The estimates are obtained by a deterministic least-squares approach that seeks to minimize a quadratic functional of the model errors, or equivalently, to find the vector of smallest norm subject to linear constraints in a suitably defined function space. The minimum norm solution can be obtained by solving either a Fredholm integral equation of the second kind for the case with continuously distributed data or a related matrix equation for the problem with discretely located measurements. Solution of either one of these equations is obtained in a batch-processing mode in which all of the data is processed simultaneously or, in certain restricted geometries, in a spatially scanning mode in which the data is processed recursively. After the methods for computation of the optimal estimates are developed, an analysis of the second-order statistics of the estimates and of the corresponding estimation error is conducted. Based on this analysis, explicit expressions for the mean-square estimation error associated with both the state and model error estimates are then developed.

Rodriguez, G.↗

A function space approach to state and model error estimation for elliptic systems

An approach is advanced for the concurrent estimation of the state and of the model errors of a system described by elliptic equations. The estimates are obtained by a deterministic least-squares approach that seeks to minimize a quadratic functional of the model errors, or equivalently, to find the vector of smallest norm subject to linear constraints in a suitably defined function space. The minimum norm solution can be obtained by solving either a Fredholm integral equation of the second kind for the case with continuously distributed data or a related matrix equation for the problem with discretely located measurements. Solution of either one of these equations is obtained in a batch-processing mode in which all of the data is processed simultaneously or, in certain restricted geometries, in a spatially scanning mode in which the data is processed recursively. After the methods for computation of the optimal esimates are developed, an analysis of the second-order statistics of the estimates and of the corresponding estimation error is conducted. Based on this analysis, explicit expressions for the mean-square estimation error associated with both the state and model error estimates are then developed. While this paper focuses on theoretical developments, applications arising in the area of large structure static shape determination are contained in a closely related paper (Rodriguez and Scheid, 1982).

Rodriguez, G.↗

Simplified Models of the Bicarbonate Buffer for Scaled Simulations of CO 2 Electrolyzers

Bicarbonate electrolytes are used in a range of chemical processes; however, resolved simulation of these electrolytes is difficult, as disparate reaction time scales lead to numerical stiffness and the formation of fine boundary layers. Based on several physically motivated approximations, we reduce the full set of chemical reactions within a bicarbonate electrolyte to a simpler subset, eliminating the numerical stiffness. We supported this simplification via a two-variable singular perturbation expansion and demonstrated that under neutral conditions (6 < pH < 10) typically found within a fluid-fed CO 2 electrolyzer, the simplifications lead to negligible error. Here, we also discuss two alternative simplifications, one valid at high pH and another valid at arbitrary pH. These simplifications reduce the condition number of the matrices resulting from spatiotemporal discretization by up to 10 orders of magnitude and enable three-dimensional (3D) simulation of CO 2 electrolyzers containing carbonate solutions.

10 SYNTHETIC FUELS↗

Extensions of the discrete-average models for converter power stages

An improved power converter model is developed by combining the average and discrete modeling techniques. The parameter determination of the proposed discrete-average model is shown to be dependent on the type of duty cycle control law, and the accuracy of the model is shown to depend on the nature of the error processor used in the feedback loop.

Shortt, D. J.↗

Modeling and equalization of nonlinear bandlimited satellite channels

The problem of modeling and equalization of a nonlinear satellite channel is considered. The channel is assumed to be bandlimited and exhibits both amplitude and phase nonlinearities. A discrete time satellite link is modeled under both uplink and downlink white Gaussian noise. Under conditions of practical interest, a simple and computationally efficient design technique for the minimum mean square error linear equalizer is presented. The bit error probability and some numerical results for a binary phase shift keyed (BPSK) system demonstrate that the proposed equalization technique outperforms standard linear receiver structures.

Konstantinides, K.↗