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 973 records · Page 54

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

An Hp-Adaptive Minimum Action Method Based on a Posteriori Error Estimate

In this work, we develop an hp-adaptive minimum action method (MAM). MAM plays an important role to minimize the Freidlin-Wentzell action functional, which is the central object of the Freidlin-Wentzell theory of large deviations for transitions induced by small random perturbations. Because of the demanding computation cost, especially in spatially extended systems, numerical efficiency is a critical issue for MAM. Difficulties come from discretizations of both time and space. One hurdle for the application of MAM to large scale systems is the global reparametrization in time direction, which is required by most versions of MAM. We recently introduced a new version of MAM in [25], called tMAM, where we used some simple heuristic criteria to demonstrate that tMAM can be effectively coupled with h-adaptivity. The target of this paper is to integrate hp-adaptivity into tMAM using a posterior error estimation techniques. More specifically, we use the arc length constraint given by geometric minimum action method (gMAM) to define an indicator of the effect of linear time scaling in tMAM, and the derivative recovery technique to construct an error indicator and a regularity indicator for hp-refinement. Numerical results are presented.

Wan, Xiaoliang↗

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↗

Empirical Mode Decomposition Technique with Conditional Mutual Information for Denoising Operational Sensor Data

A new approach is developed for denoising signals using the Empirical Mode Decomposition (EMD) technique and the Information-theoretic method. The EMD technique is applied to decompose a noisy sensor signal into the so-called intrinsic mode functions (IMFs). These functions are of the same length and in the same time domain as the original signal. Therefore, the EMD technique preserves varying frequency in time. Assuming the given signal is corrupted by high-frequency Gaussian noise implies that most of the noise should be captured by the first few modes. Therefore, our proposition is to separate the modes into high-frequency and low-frequency groups. We applied an information-theoretic method, namely mutual information, to determine the cut-off for separating the modes. A denoising procedure is applied only to the high-frequency group using a shrinkage approach. Upon denoising, this group is combined with the original low-frequency group to obtain the overall denoised signal. We illustrate our approach with simulated and real-world data sets. The results are compared to two popular denoising techniques in the literature, namely discrete Fourier transform (DFT) and discrete wavelet transform (DWT). We found that our approach performs better than DWT and DFT in most cases, and comparatively to DWT in some cases in terms of: (i) mean square error, (ii) recomputed signal-to-noise ratio, and (iii) visual quality of the denoised signals.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Hybrid Finite Element--Spectral Method for the Fractional Laplacian: Approximation Theory and Efficient Solver

Here, a numerical scheme is presented for approximating fractional order Poisson problems in two and three dimensions. The scheme is based on reformulating the original problem posed over $\Omega$ on the extruded domain $\mathcal{C}=\Omega\times[0,\infty)$ following. The resulting degenerate elliptic integer order PDE is then approximated using a hybrid FEM-spectral scheme. Finite elements are used in the direction parallel to the problem domain $\Omega$, and an appropriate spectral method is used in the extruded direction. The spectral part of the scheme requires that we approximate the true eigenvalues of the integer order Laplacian over $\Omega$. We derive an a priori error estimate which takes account of the error arising from using an approximation in place of the true eigenvalues. We further present a strategy for choosing approximations of the eigenvalues based on Weyl's law and finite element discretizations of the eigenvalue problem. The system of linear algebraic equations arising from the hybrid FEM-spectral scheme is decomposed into blocks which can be solved effectively using standard iterative solvers such as multigrid and conjugate gradient. Numerical examples in two and three dimensions suggest that the approach is quasi-optimal in terms of complexity.

97 MATHEMATICS AND COMPUTING↗

The fully nonconforming virtual element method for biharmonic problems

Here in this paper, we address the numerical approximation of linear fourth-order elliptic problems on polygonal meshes. In particular, we present a novel nonconforming virtual element discretization of arbitrary order of accuracy for biharmonic problems. The approximation space is made of possibly discontinuous functions, thus giving rise to the fully nonconforming virtual element method. We derive optimal error estimates in a suitable (broken) energy norm and present numerical results to assess the validity of the theoretical estimates.

97 MATHEMATICS AND COMPUTING↗

Final Report - Summer Visit 2010

During my visit to LLNL during the summer of 2010, I worked on algebraic multilevel solvers for large sparse systems of linear equations arising from discretizations of partial differential equations. The particular solver of interest is based on ILU decomposition. The setup phase for this AMG solve is just the single ILU decomposition, and its corresponding error matrix. Because the ILU uses a minimum degree or similar sparse matrix ordering, most of the fill-in, and hence most of the error, is concentrated in the lower right corner of the factored matrix. All of the major multigrid components - the smoother, the coarse level correction matrices, and the fine-to-coarse and coarse-to-fine rectangular transfer matrices, are defined in terms of various blocks of the ILU factorization. Although such a strategy is not likely to be optimal in terms of convergence properties, it has a relatively low setup cost, and therefore is useful in situations where setup costs for more traditional AMG approaches cannot be amortized over the solution of many linear systems using the same matrix. Such a situation arises in adaptive methods, where often just one linear system is solved at each step of an adaptive feedback loop, or in solving nonlinear equations by approximate Newton methods, where the approximate Jacobian might change substantially from iteration to iteration. In general terms, coarse levels are defined in terms of successively smaller lower right blocks of the matrix, typically decreasing geometrically in order. The most difficult issue was the coarse grid correction matrix. The preconditioner/smoother for a given level is just the corresponding lower right blocks of the ILU factorization. The coarse level matrix itself is just the Schur complement; this matrix is not known exactly using just the ILU decomposition in the setup phase. Thus we approximate this matrix using various combinations of the preconditioning matrix and the error matrix. During my visit, several approximations of this type were implemented and tested. While some improved the convergence rate of the overall method, these gains had to be balanced against the additional costs involved in creating and applying these matrices. By this more stringent criterion, none of the improved approximations could be characterized as an unqualified success.

97 MATHEMATICS AND COMPUTING↗

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

Galerkin/Runge-Kutta discretizations for semilinear parabolic equations

A new class of fully discrete Galerkin/Runge-Kutta methods is constructed and analyzed for semilinear parabolic initial boundary value problems. Unlike any classical counterpart, this class offers arbitrarily high, optimal order convergence. In support of this claim, error estimates are proved, and computational results are presented. Furthermore, it is noted that special Runge-Kutta methods allow computations to be performed in parallel so that the final execution time can be reduced to that of a low order method.

Keeling, Stephen L.↗

Dynamic-overlapped-grid simulation of aerodynamically determined relative motion

Currently, there is a need to develop a means of analyzing and studying unsteady flowfields which involve multiple component configurations with at least one of the components in relative motion with respect to the others. Two of the important phenomena that such analyses can help to understand are the unsteady aerodynamic interference and the boundary-induced component of the flowfield. With this motivation, a computational method is developed which couples the governing equations of the unsteady flowfield and the rigid-body dynamics in six degrees-of-freedom. These equations are solved on composite meshes of overlapped subdomain grids which can move with respect to each other. Initially, several measures that reduce the numerical error are studied and compared with the exact solution of a moving normal shock in a tube. It is concluded that a second-order accurate method, for spatial and temporal discretizations as well as for the moving subdomain interpolations, is needed as a minimum measure. Furthermore, the CFL numbers should be restricted to unity. Then, the method is used to simulate the flowfield history and predict the aerodynamically determined trajectory of a store dropped from its initial position under a wing.

Yen, Guan-Wei↗

Wind Tunnel Application of a Pressure-Sensitive Paint Technique to a Faceted Missile Model at Subsonic and Transonic Speeds

A pressure-sensitive paint (PSP) technique was applied in a wind tunnel experiment in the NASA Langley Research Center 8-Foot Transonic Pressure Tunnel to quantify the vortex-induced surface static pressures on a slender, faceted missile model at subsonic and transonic speeds. Satisfactory global calibrations of the PSP were obtained at =0.70, 0.90, and 1.20, angles of attack from 10 degrees to 20 degrees, and angles of sideslip of 0 and 2.5 degrees using an in-situ method featuring the simultaneous acquisition of electronically-scanned pressures (ESP) at 57 discrete locations on the model. Both techniques clearly revealed the significant influence on the surface pressure distributions of the vortices shed from the sharp, chine-like leading edges. The mean error in the PSP measurements relative to the ESP data was approximately 0.6 percent at M infinity =0.70 and 2.6 percent at M infinity =0.90 and 1.20. The vortex surface pressure signatures obtained from the PSP and ESP techniques were correlated with the off-surface vortex cross-flow structures obtained using a laser vapor screen (LVS) flow visualization technique. The on-surface and off-surface techniques were complementary, since each provided details of the vortex-dominated flow that were not clear or apparent in the other.

Erickson, Gary E.↗

Automated Guided-Wave Scanning Developed to Characterize Materials and Detect Defects

The Nondestructive Evaluation (NDE) Group of the Optical Instrumentation Technology Branch at the NASA Glenn Research Center has developed a scanning system that uses guided waves to characterize materials and detect defects. The technique uses two ultrasonic transducers to interrogate the condition of a material. The sending transducer introduces an ultrasonic pulse at a point on the surface of the specimen, and the receiving transducer detects the signal after it has passed through the material. The aim of the method is to correlate certain parameters in both the time and frequency domains of the detected waveform to characteristics of the material between the two transducers. The scanning system is shown. The waveform parameters of interest include the attenuation due to internal damping, waveform shape parameters, and frequency shifts due to material changes. For the most part, guided waves are used to gauge the damage state and defect growth of materials subjected to various mechanical or environmental loads. The technique has been applied to polymer matrix composites, ceramic matrix composites, and metal matrix composites as well as metallic alloys. Historically, guided wave analysis has been a point-by-point, manual technique with waveforms collected at discrete locations and postprocessed. Data collection and analysis of this type limits the amount of detail that can be obtained. Also, the manual movement of the sensors is prone to user error and is time consuming. The development of an automated guided-wave scanning system has allowed the method to be applied to a wide variety of materials in a consistent, repeatable manner. Experimental studies have been conducted to determine the repeatability of the system as well as compare the results obtained using more traditional NDE methods. The following screen capture shows guided-wave scan results for a ceramic matrix composite plate, including images for each of nine calculated parameters. The system can display up to 18 different wave parameters. Multiple scans of the test specimen demonstrated excellent repeatability in the measurement of all the guided-wave parameters, far exceeding the traditional point-by-point technique. In addition, the scan was able to detect a subsurface defect that was confirmed using flash thermography This technology is being further refined to provide a more robust and efficient software environment. Future hardware upgrades will allow for multiple receiving transducers and the ability to scan more complex surfaces. This work supports composite materials development and testing under the Ultra-Efficient Engine Technology (UEET) Project, but it also will be applied to other material systems under development for a wide range of applications.

Martin, Richard E.↗

Erratum: Extracting (n,(gamma)) direct capture cross sections from Coulomb dissociation: application to 14C(n,(gamma))15C

In Ref. [1] we proposed a systematic methodology to extract neutron capture cross sections from Coulomb Dissociation data. Using the Continuum Discretized Coupled Channel formalism to describe the {sup 15}C breakup process, the asymptotic normalization coefficient (ANC) for the ground state is extracted through a {chi}{sup 2} fit. The corresponding error bar is defined using {chi}{sub min}{sup 2} + 1. We discovered a mistake in the calculation of the errors associated with the extracted ANC and here we present the corrected values. The experimental data from which the ANC is extracted covers a range of energies up to 4 MeV, and the value obtained for the full energy range is C{sub 0} = 1.31 {+-} 0.07 fm{sup -1/2}. We find that the ANC is better determined if the high energy data is discarded and the maximum energy is cut at 1.2 MeV. This is justified since the direct measurements we are comparing to, and the peak of the cross section (Fig. 1 in Ref. [1]), all lie below this cut. The higher energy data is more uncertain and lies in a region where the theoretical cross section is insensitive to the ANC, thus adding unwarranted uncertainty to the extracted ANC. With this energy cut one can better determine the ANC as C{sub 0} = 1.32 {+-} 0.04 fm{sup -1/2}. All conclusions in our previous paper [1] hold. More details on the fitting procedure can be found in Ref. [2]. Figure 2 of Ref. [1] should be replaced by the figure below, where the shaded area is the range of uncertainty for an ANC of C{sub 0} = 1.32 {+-} 0.04 fm{sup -1/2}, extracted from data up to E = 1.2 MeV.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Extension of the discrete generalized multigroup method using SPH factors

The discrete generalized multigroup (DGM) method provides a way to treat the energy dependence of neutron transport similarly to the standard multigroup approximation. However, DGM uses an orthogonal basis to retain the energy dependence in higher-order terms. Using correction factors similar to traditional Superhomogénéisation (SPH) factors, the DGM method may be extended to produce cross sections that are homogenized over both space and energy. Additionally, since some fine-group energy dependence is retained, the resulting homogenized cross sections are more problem-independent than cross sections homogenized by SPH factors alone. In particular, a 44-group set of cross sections is collapsed to approximately a 1% error in the pincell fission densities for a test problem using three DOF per coarse energy group.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

L{sup ∞} error bound of conservative compact difference scheme for the generalized symmetric regularized long-wave (GSRLW) equations

In this paper, we design a compact finite difference scheme which preserves the original conservative properties to solve the generalized symmetric regularized long-wave equations. The existence of the difference solution is proved by the Brouwer fixed-point theorem. Applying the discrete energy method, the convergence and stability of the difference scheme is obtained, and its numerical convergence order is O(τ{sup 2}+h{sup 4}) in the L{sup ∞}-norm for u and ρ. For computing the nonlinear algebraic system generated by the compact scheme, a decoupled iterative algorithm is constructed and proved to be convergent. Numerical experiment results show that the theory is accurate and the method is efficient and reliable.

97 MATHEMATICS AND COMPUTING↗