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 1,045 records · Page 58

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↗

Variational Integration for Ideal MHD with Built-in Advection Equations

Newcomb's Lagrangian for ideal MHD in Lagrangian labeling is discretized using discrete exterior calculus. Variational integrators for ideal MHD are derived thereafter. Besides being symplectic and momentum preserving, the schemes inherit built-in advection equations from Newcomb's formulation, and therefore avoid solving them and the accompanying error and dissipation. We implement the method in 2D and show that numerical reconnection does not take place when singular current sheets are present. We then apply it to studying the dynamics of the ideal coalescence instability with multiple islands. The relaxed equilibrium state with embedded current sheets is obtained numerically.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

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

Calibration of linear contact stiffnesses in discrete element models using a hybrid analytical-computational framework

Efficient selections of particle-scale contact parameters in discrete element modelling remain an open question. The purpose of this study is to provide a hybrid calibration framework to estimate linear contact stiffnesses (normal and tangential) for both two-dimensional and three-dimensional simulations. Analytical formulas linking macroscopic parameters (Young's modulus, Poisson's ratio) to mesoscopic particle parameters for granular systems are derived based on statistically isotropic packings under small-strain isotropic stress conditions. By taking the derived analytical solutions as initial approximations, the gradient descent algorithm automatically obtains a reliable numerical estimation. The introduced framework is validated with several numerical cases including randomly distributed monodisperse and polydisperse packings. The results show that this hybrid method practically reduces the time for artificial trials and errors to obtain reasonable stiffness parameters. The proposed framework can also be extended to other parameter calibration problems in DEM.

Calibration method↗

Deterministic Modeling of the High Temperature Test Reactor

Idaho National Laboratory (INL) is tasked with the development of reactor physics analysis capability of the Next Generation Nuclear Power (NGNP) project. In order to examine INL’s current prismatic reactor deterministic analysis tools, the project is conducting a benchmark exercise based on modeling the High Temperature Test Reactor (HTTR). This exercise entails the development of a model for the initial criticality, a 19 column thin annular core, and the fully loaded core critical condition with 30 columns. Special emphasis is devoted to the annular core modeling, which shares more characteristics with the NGNP base design. The DRAGON code is used in this study because it offers significant ease and versatility in modeling prismatic designs. Despite some geometric limitations, the code performs quite well compared to other lattice physics codes. DRAGON can generate transport solutions via collision probability (CP), method of characteristics (MOC), and discrete ordinates (Sn). A fine group cross section library based on the SHEM 281 energy structure is used in the DRAGON calculations. HEXPEDITE is the hexagonal z full core solver used in this study and is based on the Green’s Function solution of the transverse integrated equations. In addition, two Monte Carlo (MC) based codes, MCNP5 and PSG2/SERPENT, provide benchmarking capability for the DRAGON and the nodal diffusion solver codes. The results from this study show a consistent bias of 2–3% for the core multiplication factor. This systematic error has also been observed in other HTTR benchmark efforts and is well documented in the literature. The ENDF/B VII graphite and U235 cross sections appear to be the main source of the error. The isothermal temperature coefficients calculated with the fully loaded core configuration agree well with other benchmark participants but are 40% higher than the experimental values. This discrepancy with the measurement stems from the fact that during the experiments the control rods were adjusted to maintain criticality, whereas in the model, the rod positions were fixed. In addition, this work includes a brief study of a cross section generation approach that seeks to decouple the domain in order to account for neighbor effects. This spectral interpenetration is a dominant effect in annular HTR physics. This analysis methodology should be further explored in order to reduce the error that is systematically propagated in the traditional generation of cross sections.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

On fast simulation of dynamical system with neural vector enhanced numerical solver

The large-scale simulation of dynamical systems is critical in numerous scientific and engineering disciplines. However, traditional numerical solvers are limited by the choice of step sizes when estimating integration, resulting in a trade-off between accuracy and computational efficiency. To address this challenge, we introduce a deep learning-based corrector called Neural Vector (NeurVec), which can compensate for integration errors and enable larger time step sizes in simulations. Our extensive experiments on a variety of complex dynamical system benchmarks demonstrate that NeurVec exhibits remarkable generalization capability on a continuous phase space, even when trained using limited and discrete data. NeurVec significantly accelerates traditional solvers, achieving speeds tens to hundreds of times faster while maintaining high levels of accuracy and stability. Moreover, NeurVec’s simple-yet-effective design, combined with its ease of implementation, has the potential to establish a new paradigm for fast-solving differential equations based on deep learning.

97 MATHEMATICS AND COMPUTING↗

Variational integration for ideal magnetohydrodynamics with built-in advection equations

Newcomb's Lagrangian for ideal magnetohydrodynamics (MHD) in Lagrangian labeling is discretized using discrete exterior calculus. Variational integrators for ideal MHD are derived thereafter. Besides being symplectic and momentum-preserving, the schemes inherit built-in advection equations from Newcomb's formulation, and therefore avoid solving them and the accompanying error and dissipation. We implement the method in 2D and show that numerical reconnection does not take place when singular current sheets are present. We then apply it to studying the dynamics of the ideal coalescence instability with multiple islands. The relaxed equilibrium state with embedded current sheets is obtained numerically.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Modelling and computationally efficient time domain linear equalisation of nonlinear bandlimited QPSK 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. In traditional models, computations are usually performed in the frequency domain and solutions are based on complex numerical techniques. A discrete time model is used to represent the satellite link with both uplink and downlink white Gaussian noise. Under conditions of practical interest, a simple and computationally efficient time-domain design technique for the minimum mean square error linear equalizer is presented. The efficiency of this technique is enhanced by the use of a fast and simple iterative algorithm for the computation of the autocorrelation coefficients of the output of the nonlinear channel. Numerical results on the evaluations of bit error probability and other relevant parameters needed in the design and analysis of a nonlinear bandlimited QPSK system demonstrate the simplicity and computational efficiency of the proposed approach.

Konstantinides, K.↗