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 685 records · Page 38

Instrumentation System Diagnoses a Thermocouple

An improved self-validating thermocouple (SVT) instrumentation system not only acquires readings from a thermocouple but is also capable of detecting deterioration and a variety of discrete faults in the thermocouple and its lead wires. Prime examples of detectable discrete faults and deterioration include open- and short-circuit conditions and debonding of the thermocouple junction from the object, the temperature of which one seeks to measure. Debonding is the most common cause of errors in thermocouple measurements, but most prior SVT instrumentation systems have not been capable of detecting debonding. The improved SVT instrumentation system includes power circuitry, a cold-junction compensator, signal-conditioning circuitry, pulse-width-modulation (PWM) thermocouple-excitation circuitry, an analog-to-digital converter (ADC), a digital data processor, and a universal serial bus (USB) interface. The system can operate in any of the following three modes: temperature measurement, thermocouple validation, and bonding/debonding detection. The software running in the processor includes components that implement statistical algorithms to evaluate the state of the thermocouple and the instrumentation system. When the power is first turned on, the user can elect to start a diagnosis/ monitoring sequence, in which the PWM is used to estimate the characteristic times corresponding to the correct configuration. The user also has the option of using previous diagnostic values, which are stored in an electrically erasable, programmable read-only memory so that they are available every time the power is turned on.

Perotti, Jose↗

Assimilation of Active MW and Radar Observations in the NWP Models

Passive instruments lack the ability to provide vertically resolved measurements of clouds and precipitation, which can be obtained by active radar instruments. However, incorporating these active measurements into data assimilation systems presents challenges due to the absence of fast forward radiative transfer models and difficulties in error modeling. This talk focuses on the development, evaluation, and sensitivity analysis of a forward radar model integrated into CRTM. The forward radar model utilizes scattering properties obtained from hydrometeor lookup tables generated using the discrete dipole approximation. By utilizing CRTM instrument-specific coefficients, the model can calculate both reflectivity and attenuated reflectivity for any given radar instrument and zenith angles. Evaluation using CloudSat measurements demonstrates a strong agreement between simulations and observations when the input profiles of hydrometeors align with the measured reflectivity profiles.

Isaac Moradi↗

A parallel p ‐adaptive discontinuous Galerkin method for the Euler equations with dynamic load‐balancing on tetrahedral grids

Abstract A novel p ‐adaptive discontinuous Galerkin (DG) method has been developed to solve the Euler equations on three‐dimensional tetrahedral grids. Hierarchical orthogonal basis functions are adopted for the DG spatial discretization while a third order TVD Runge‐Kutta method is used for the time integration. A vertex‐based limiter is applied to the numerical solution in order to eliminate oscillations in the high order method. An error indicator constructed from the solution of order and is used to adapt degrees of freedom in each computational element, which remarkably reduces the computational cost while still maintaining an accurate solution. The developed method is implemented with under the Charm++ parallel computing framework. Charm++ is a parallel computing framework that includes various load‐balancing strategies. Implementing the numerical solver under Charm++ system provides us with access to a suite of dynamic load balancing strategies. This can be efficiently used to alleviate the load imbalances created by p ‐adaptation. A number of numerical experiments are performed to demonstrate both the numerical accuracy and parallel performance of the developed p ‐adaptive DG method. It is observed that the unbalanced load distribution caused by the parallel p ‐adaptive DG method can be alleviated by the dynamic load balancing from Charm++ system. Due to this, high performance gain can be achieved. For the testcases studied in the current work, the parallel performance gain ranged from 1.5× to 3.7×. Therefore, the developed p ‐adaptive DG method can significantly reduce the total simulation time in comparison to the standard DG method without p ‐adaptation.

97 MATHEMATICS AND COMPUTING↗

A numerical extension of the spatially-filtered Euler equations for contact discontinuities

Solving the spatially-filtered Euler equations with a kinetic energy-preserving centered discretization is an efficient framework for simulating shock-dominated flows. Here, the present work describes a numerical treatment of the spatially-filtered Euler equations to minimize oscillations when simulating contact discontinuities. To counteract dispersive errors inherent to centered schemes, a WENO-like correction term is applied to the enthalpy transport in the energy equation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Low-order aquifer thermal energy storage model for geothermal system simulation

This paper presents a low-order aquifer thermal energy storage (ATES) model for simulation of combined subsurface and above-surface energy systems. The model is included in the Modelica IBPSA Library, which is a free open-source library with basic models for building and district energy and control systems. The model uses a lumped-component method, in which the transient conductive-convective heat and mass transfer equation is radially discretized. To verify the accuracy of the model, we present an inter-model comparison from a simulation test suite. Results show that the Modelica ATES model is in good agreement, with a normalized mean bias error for yearly variation of aquifer temperatures of 1.6×10−2 and 9×10−5 at 1 m and 10 m distance from the well.

Maccarini, Alessandro↗

A comparison of orthogonal transformations for digital speech processing.

Discrete forms of the Fourier, Hadamard, and Karhunen-Loeve transforms are examined for their capacity to reduce the bit rate necessary to transmit speech signals. To rate their effectiveness in accomplishing this goal the quantizing error (or noise) resulting for each transformation method at various bit rates is computed and compared with that for conventional companded PCM processing. Based on this comparison, it is found that Karhunen-Loeve provides a reduction in bit rate of 13.5 kbits/s, Fourier 10 kbits/s, and Hadamard 7.5 kbits/s as compared with the bit rate required for companded PCM. These bit-rate reductions are shown to be somewhat independent of the transmission bit rate.

Campanella, S. J.↗

An algorithm for a general class of routing problems derived from Huygens' principle

If a set of N points or nodes with a nonnegative cost associated with each ordered pair is known, it is desired to find a path from one given node to another given node which minimizes the cost sum. An algorithm is presented which yields a global minimum solution after at most N - 1 iterations or on a typical large third-generation computer, after 1 hour of computation time for a 10,000-node problem. The rapid-access data storage capacity demanded by the algorithm is approximately 3N words for costs read in from slow-access storage or 2N words for calculable costs. The time-storage requirements of the algorithm known to the authors. When the problem is viewed as a discretized optimal control problem, after N-1 iterations, an optimal control or node transition is established for each of the N nodes or states; thus, the algorithm can be applied to situations were there may be errors in the control that necessitate a closed loop control that necessitate a closed loop control philosophy.

Avis, L. M.↗

The dispersed fluorescence spectrum of NaAr - Ground and excited state potential curves

Potential curves for the ground state and the first excited state of NaAr were determined. The van der Waals molecule NaAr was prepared by supersonic free jet expansion of a mixture of sodium, argon, and helium. The electronic transition from the ground state to the first excited state A2pi was excited by a tunable dye laser and the resulting fluorescence was studied. The dispersed fluorescence spectra show discrete and diffuse features, corresponding to transitions from excited vibrational levels of the A state to bound and unbound levels of the x state. The characteristic reflection structure in the bound-free spectra permits an unambiguous assignment of the vibrational numbering in the A state, and this assignment together with previously measured spectroscopic constants are used to calculate the potential curve of the A state. The discrete structure in the fluorescence spectra is used to determine the potential curve of the x state in the well region, and the repulsive part of the X curve is then deduced through trial-and-error simulation of the bound-free spectra.

Tellinghuisen, J.↗

High-resolution frequency determination of discrete signal components

An important problem in many applications involves the determination of the frequency of a limited set of sinusoidal components in a time domain signal. The Fourier transform is used as the fundamental tool for conversion to the frequency domain. In the present investigation, an analysis is conducted of the errors inherent in the use of the Fourier transform without time domain windowing, and an algorithm is developed which makes it possible to obtain the frequency of the component signals with high accuracy. This algorithm combines the advantages of the Gaussian window with the computational efficiency of the Fast Fourier Transform (FFT).

Walton, E. K.↗

Nonoverlapping block smoothers for the Stokes equations

Overlapping block smoothers efficiently damp the error contributions from highly oscillatory components within multigrid methods for the Stokes equations but they are computationally expensive. This paper is concentrated on the development and analysis of new block smoothers for the Stokes equations that are discretized on staggered grids. These smoothers are nonoverlapping and therefore desirable due to reduced computational costs. Traditional geometric multigrid methods are based on simple pointwise smoothers. However, using multigrid methods to efficiently solve more difficult problems such as the Stokes equations leads to computationally more expensive smoothers, for example, overlapping block smoothers. Nonoverlapping smoothers are less expensive, but have been considered less efficient in the literature. In this paper, we develop new nonoverlapping smoothers, the so-called triad-wise smoothers, and show their efficiency within multigrid methods to solve the Stokes equations. In addition, we compare overlapping and nonoverlapping smoothers by measuring their computational costs and analyzing their behavior by the use of local Fourier analysis.

97 MATHEMATICS AND COMPUTING↗

1-D coupled surface flow and transport equations revisited via the physics-informed neural network approach

The de Saint-Venant equation (SVE) and advection–diffusion equation (ADE) are commonly employed to solve solute transport problems in surface water. In this work, we propose a mesh-free method based on the physics-informed neural network (PINN) to solve the one dimensional (1-D) SVE, ADE, and the coupled SVE and ADE (SVE-ADE) under various initial and boundary conditions. The PINN model extends the architecture of deep neural networks (DNNs) with implementation of loss function, which are additionally subject to constraints imposed by the physical laws of SVE and ADE, along with their initial and boundary conditions. In such a manner, PINNs can be quickly steered to the true solution while obeying the physical laws. The results of PINN model are compared with the analytical and/or numerical solutions under various conditions to investigate its accuracy and efficiency in solving the SVE, ADE, and SVE-ADE. Our results indicate PINN can accurately simulate the shock wave morphology and avoid numerical dissipation in unsteady flow condition. The PINN method outweighed traditional numerical methods in several aspects, including its ability to function with small amounts of data, no grid discretization, and random selection of sampling points, etc. Additionally, the PINN method is also suitable for solving inverse problems with sparse and noisy data. With 1% noise and 2000 initial and boundary condition points (N u ), the errors of the estimated flow rate (v) and diffusion coefficient (D) are 0.003% and 0.105%, respectively, which indicate the accuracy and robustness of the proposed method. Finally, our results indicate the capability and robustness of the proposed PINN methodology for solving multi-physics problems, irrespective of the presence of sparse and noisy data in the training dataset.

54 ENVIRONMENTAL SCIENCES↗

Holographic codes from hyperinvariant tensor networks

Holographic quantum-error correcting codes are models of bulk/boundary dualities such as the anti-de Sitter/conformal field theory (AdS/CFT) correspondence, where a higher-dimensional bulk geometry is associated with the code’s logical degrees of freedom. Previous discrete holographic codes based on tensor networks have reproduced the general code properties expected from continuum AdS/CFT, such as complementary recovery. However, the boundary states of such tensor networks typically do not exhibit the expected correlation functions of CFT boundary states. In this work, we show that a new class of exact holographic codes, extending the previously proposed hyperinvariant tensor networks into quantum codes, produce the correct boundary correlation functions. This approach yields a dictionary between logical states in the bulk and the critical renormalization group flow of boundary states. Furthermore, these codes exhibit a state-dependent breakdown of complementary recovery as expected from AdS/CFT under small quantum gravity corrections.

97 MATHEMATICS AND COMPUTING↗

Adaptive control in the presence of unmodeled dynamics

Stability and robustness properties of a wide class of adaptive control algorithms in the presence of unmodeled dynamics and output disturbances were investigated. The class of adaptive algorithms considered are those commonly referred to as model reference adaptive control algorithms, self-tuning controllers, and dead beat adaptive controllers, developed for both continuous-time systems and discrete-time systems. A unified analytical approach was developed to examine the class of existing adaptive algorithms. It was discovered that all existing algorithms contain an infinite gain operator in the dynamic system that defines command reference errors and parameter errors; it is argued that such an infinite gain operator appears to be generic to all adaptive algorithms, whether they exhibit explicit or implicit parameter identification. It is concluded that none of the adaptive algorithms considered can be used with confidence in a practical control system design, because instability will set in with a high probability.

Rohrs, C. E.↗

Prediction of unsteady aerodynamic loads in cascades using the linearized Euler equations on deforming grids

A linearized Euler solver for calculating unsteady flows in turbomachinery blade rows due to both incident gusts and blade motion is presented. Using the linearized Euler technique, one decomposes the flow into a mean (or steady) flow plus an unsteady, harmonically varying, small disturbance flow. Linear variable coefficient equations describe the small disturbance behavior of the flow, and are solved using a pseudo-time marching Lax-Wendroff scheme. For the blade motion problem, a harmonically deforming computational rid that conforms to the motion of vibrating blades eliminates large error producing mean flow gradient terms that would otherwise appear in the unsteady flow tangency boundary condition. The paper also presents a new, numerically exact, nonreflecting far-field boundary condition based on an eigenanalysis of the discretized equations. Computed flow solutions demonstrate the computational accuracy and efficiency of the present method. The solution of the linearized Euler equations requires one to two orders of magnitude less computer time than solution of the nonlinear Euler equations using traditional time-accurate time-marching techniques. In addition, the deformable grid significantly improves the accuracy of the solution.

Hall, Kenneth C.↗

Divergence analysis report for the bodies of revolution model support systems

This report documents the sting divergence analyses of nine different model and model support systems that were performed in preparation for a series of wind tunnel tests at the National Transonic Facility at NASA Langley Research Center in Hampton, Virginia. The models were missile shaped bodies of revolution and the model support systems included a force and moment balance and tapered sting sections. The sting divergence results were obtained from a computer program that solved a two-point boundary value problem which used a second order Runge-Kutta integration technique. The computer solution was based on constant section properties between discrete stations along the sting sections, a procedure was developed and included to evaluate the properties for the minimum number of stations along the tapered sections that would produce no more than one half of one percent error in the divergence results. Also included in the report are development of the aerodynamic input data, listings of all input and output computer data, and summary sheets that highlight the input and the critical sting divergence dynamic pressure for each respective configuration.

Rash, Larry C.↗

Performance of a Discrete Wavelet Transform for Compressing Plasma Count Data and its Application to the Fast Plasma Investigation on NASA's Magnetospheric Multiscale Mission

Plasma measurements in space are becoming increasingly faster, higher resolution, and distributed over multiple instruments. As raw data generation rates can exceed available data transfer bandwidth, data compression is becoming a critical design component. Data compression has been a staple of imaging instruments for years, but only recently have plasma measurement designers become interested in high performance data compression. Missions will often use a simple lossless compression technique yielding compression ratios of approximately 2:1, however future missions may require compression ratios upwards of 10:1. This study aims to explore how a Discrete Wavelet Transform combined with a Bit Plane Encoder (DWT/BPE), implemented via a CCSDS standard, can be used effectively to compress count information common to plasma measurements to high compression ratios while maintaining little or no compression error. The compression ASIC used for the Fast Plasma Investigation (FPI) on board the Magnetospheric Multiscale mission (MMS) is used for this study. Plasma count data from multiple sources is examined: resampled data from previous missions, randomly generated data from distribution functions, and simulations of expected regimes. These are run through the compression routines with various parameters to yield the greatest possible compression ratio while maintaining little or no error, the latter indicates that fully lossless compression is obtained. Finally, recommendations are made for future missions as to what can be achieved when compressing plasma count data and how best to do so.

Particles↗

Analysis and application of minimum variance discrete time system identification

An on-line minimum variance parameter identifier is developed which embodies both accuracy and computational efficiency. The formulation results in a linear estimation problem with both additive and multiplicative noise. The resulting filter which utilizes both the covariance of the parameter vector itself and the covariance of the error in identification is proven to be mean square convergent and mean square consistent. The MV parameter identification scheme is then used to construct a stable state and parameter estimation algorithm.

Kaufman, H.↗

Analysis and application of minimum variance discrete time system identification

An on-line minimum variance parameter identifier is developed which embodies both accuracy and computational efficiency. The formulation results in a linear estimation problem with both additive and multiplicative noise. The resulting filter which utilizes both the covariance of the parameter vector itself and the covariance of the error in identification is proven to be mean square convergent and mean square consistent. The MV parameter identification scheme is then used to construct a stable state and parameter estimation algorithm.

Kotob, S.↗