Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical 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,693 records · Page 94

Sparsity of the electron repulsion integral tensor using different localized virtual orbital representations in local second-order Møller–Plesset theory

Utilizing localized orbitals, local correlation theory can reduce the unphysically high system-size scaling of post-Hartree–Fock (post-HF) methods to linear scaling in insulating molecules. The sparsity of the four-index electron repulsion integral (ERI) tensor is central to achieving this reduction. For second-order Møller–Plesset theory (MP2), one of the simplest post-HF methods, only the (ia|jb) ERIs are needed, coupling occupied orbitals i, j and virtuals a, b. In this paper, we compare the numerical sparsity (called the “ragged list”) and two other approaches revealing the low-rank sparsity of the ERI. The ragged list requires only one set of (localized) virtual orbitals, and we find that the orthogonal valence virtual-hard virtual set of virtuals originally proposed by Subotnik et al. gives the sparsest ERI tensor. To further compress the ERI tensor, the pair natural orbital (PNO) type representation uses different sets of virtual orbitals for different occupied orbital pairs, while the occupied-specific virtual (OSV) approach uses different virtuals for each occupied orbital. Here, our results indicate that while the low-rank PNO representation achieves significant rank reduction, it also requires more memory than the ragged list. The OSV approach requires similar memory to that of the ragged list, but it involves greater algorithmic complexity. An approximation (called the “fixed sparsity pattern”) for solving the local MP2 equations using the numerically sparse ERI tensor is proposed and tested to be sufficiently accurate and to have highly controllable error. A low-scaling local MP2 algorithm based on the ragged list and the fixed sparsity pattern is therefore promising.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Sequential Kalman tuning of the t -preconditioned Crank-Nicolson algorithm: efficient, adaptive and gradient-free inference for Bayesian inverse problems

Ensemble Kalman Inversion (EKI) has been proposed as an efficient method for the approximate solution of Bayesian inverse problems with expensive forward models. However, when applied to the Bayesian inverse problem EKI is only exact in the regime of Gaussian target measures and linear forward models. Here, in this work we propose embedding EKI and Flow Annealed Kalman Inversion, its normalizing flow (NF) preconditioned variant, within a Bayesian annealing scheme as part of an adaptive implementation of the t-preconditioned Crank-Nicolson (tpCN) sampler. The tpCN sampler differs from standard pCN in that its proposal is reversible with respect to the multivariate t-distribution. The more flexible tail behaviour allows for better adaptation to sampling from non-Gaussian targets. Within our Sequential Kalman Tuning (SKT) adaptation scheme, EKI is used to initialize and precondition the tpCN sampler for each annealed target. The subsequent tpCN iterations ensure particles are correctly distributed according to each annealed target, avoiding the accumulation of errors that would otherwise impact EKI. We demonstrate the performance of SKT for tpCN on three challenging numerical benchmarks, showing significant improvements in the rate of convergence compared to adaptation within standard SMC with importance weighted resampling at each temperature level, and compared to similar adaptive implementations of standard pCN. The SKT scheme applied to tpCN offers an efficient, practical solution for solving the Bayesian inverse problem when gradients of the forward model are not available. Code implementing the SKT schemes for tpCN is available at https://github.com/RichardGrumitt/KalmanMC.

97 MATHEMATICS AND COMPUTING↗

Quantum process identification: a method for characterizing non-markovian quantum dynamics

Established methods for characterizing quantum information processes do not capture non-Markovian (history-dependent) behaviors that occur in real systems. These methods model a quantum process as a fixed map on the state space of a predefined system of interest. Such a map averages over the system's environment, which may retain some effect of its past interactions with the system and thus have a history-dependent influence on the system. Although the theory of non-Markovian quantum dynamics is currently an active area of research, a systematic characterization method based on a general representation of non-Markovian dynamics has been lacking. In this article we present a systematic method for experimentally characterizing the dynamics of open quantum systems. Our method, which we call quantum process identification (QPI), is based on a general theoretical framework which relates the (non-Markovian) evolution of a system over an extended period of time to a time-local (Markovian) process involving the system and an effective environment. In practical terms, QPI uses time-resolved tomographic measurements of a quantum system to construct a dynamical model with as many dynamical variables as are necessary to reproduce the evolution of the system. Through numerical simulations, we demonstrate that QPI can be used to characterize qubit operations with non-Markovian errors arising from realistic dynamics including control drift, coherent leakage, and coherent interaction with material impurities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analytic Theory for the Dynamics of Wide Quantum Neural Networks

Here, parametrized quantum circuits can be used as quantum neural networks and have the potential to outperform their classical counterparts when trained for addressing learning problems. To date, much of the results on their performance on practical problems are heuristic in nature. In particular, the convergence rate for the training of quantum neural networks is not fully understood. Here, we analyze the dynamics of gradient descent for the training error of a class of variational quantum machine learning models. We define wide quantum neural networks as parametrized quantum circuits in the limit of a large number of qubits and variational parameters. Then, we find a simple analytic formula that captures the average behavior of their loss function and discuss the consequences of our findings. For example, for random quantum circuits, we predict and characterize an exponential decay of the residual training error as a function of the parameters of the system. Finally, we validate our analytic results with numerical experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Validity of a finite temperature expansion for dense nuclear matter

In this work we provide a new, well-controlled expansion of the equation of state of dense matter from zero to finite temperatures (𝑇) while covering a wide range of charge fractions (𝑌 𝑄 ), from pure neutron to isospin symmetric nuclear matter. Our expansion can be used to describe neutron star mergers using the equation of state inferred from neutron star observations. We discuss how knowledge from low-energy nuclear experiments and heavy-ion collisions can be directly incorporated into the expansion. We also suggest new thermodynamic quantities of interest that can be calculated from theoretical models or directly inferred by experimental data that can be used to infer the finite temperature equation of state. With our new method, we can quantify the uncertainty in our finite 𝑇 and 𝑌 𝑄 expansions without making assumptions about the underlying degrees of freedom. We can reproduce results from a microscopic equation of state up to 𝑇 = 100 MeV for baryon chemical potential 𝜇 𝐵 ≳ 1100 MeV [≈(1–2)⁢𝑛 sat ] within 5% error, with even better results for larger 𝜇 𝐵 and/or lower 𝑇. We investigate the sources of numerical and theoretical uncertainty and discuss future directions of study.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Low dose dynamic CT myocardial perfusion imaging using a statistical iterative reconstruction method

Purpose: Dynamic CT myocardial perfusion imaging has the potential to provide both functional and anatomical information regarding coronary artery stenosis. However, radiation dose can be potentially high due to repeated scanning of the same region. The purpose of this study is to investigate the use of statistical iterative reconstruction to improve parametric maps of myocardial perfusion derived from a low tube current dynamic CT acquisition. Methods: Four pigs underwent high (500 mA) and low (25 mA) dose dynamic CT myocardial perfusion scans with and without coronary occlusion. To delineate the affected myocardial territory, an N-13 ammonia PET perfusion scan was performed for each animal in each occlusion state. Filtered backprojection (FBP) reconstruction was first applied to all CT data sets. Then, a statistical iterative reconstruction (SIR) method was applied to data sets acquired at low dose. Image voxel noise was matched between the low dose SIR and high dose FBP reconstructions. CT perfusion maps were compared among the low dose FBP, low dose SIR and high dose FBP reconstructions. Numerical simulations of a dynamic CT scan at high and low dose (20:1 ratio) were performed to quantitatively evaluate SIR and FBP performance in terms of flow map accuracy, precision, dose efficiency, and spatial resolution. Results: Forin vivo studies, the 500 mA FBP maps gave −88.4%, −96.0%, −76.7%, and −65.8% flow change in the occluded anterior region compared to the open-coronary scans (four animals). The percent changes in the 25 mA SIR maps were in good agreement, measuring −94.7%, −81.6%, −84.0%, and −72.2%. The 25 mA FBP maps gave unreliable flow measurements due to streaks caused by photon starvation (percent changes of +137.4%, +71.0%, −11.8%, and −3.5%). Agreement between 25 mA SIR and 500 mA FBP global flow was −9.7%, 8.8%, −3.1%, and 26.4%. The average variability of flow measurements in a nonoccluded region was 16.3%, 24.1%, and 937.9% for the 500 mA FBP, 25 mA SIR, and 25 mA FBP, respectively. In numerical simulations, SIR mitigated streak artifacts in the low dose data and yielded flow maps with mean error <7% and standard deviation <9% of mean, for 30×30 pixel ROIs (12.9 × 12.9 mm{sup 2}). In comparison, low dose FBP flow errors were −38% to +258%, and standard deviation was 6%–93%. Additionally, low dose SIR achieved 4.6 times improvement in flow map CNR{sup 2} per unit input dose compared to low dose FBP. Conclusions: SIR reconstruction can reduce image noise and mitigate streaking artifacts caused by photon starvation in dynamic CT myocardial perfusion data sets acquired at low dose (low tube current), and improve perfusion map quality in comparison to FBP reconstruction at the same dose.

60 APPLIED LIFE SCIENCES↗

Hardness Prediction by Incorporating Heat Transfer and Molten Pool Fluid Flow in a Multi-pass, Multi-layer Weld for Onsite Repair of Grade 91 steel

Introduction: In the current fleet of fossil-fired power plants, creep strength enhanced ferritic steels (CSEF) are used to sustain the harsh service conditions. Enhanced properties of Grade 91 steel result from tempered martensite with a fine distribution of MX and M23C6 carbides. Grade 91 steel is subjected to onsite welding repair to remedy their degradation due to extreme service condition. Knowledge of weld repairability of these steels, such as as-welded hardness distribution, is essential to establishing sound repair procedures. Experimental trial and error tests can consume a lot of time as many welding variables need to be studied. For numerical modelling, most of the multi-pass multi-layer models are based on finite element method, which are limited to solve the heat conduction equation and ignore convective heat transfer due to melt flow. Moreover, the mesh has to be pre-built based on a known or assumed weld cross-section geometry. These finite element based models thus have limited predictive capability as defects are not considered and nugget size are pre-assumed. This research aims at developing a thermal and microstructure evolution model incorporating molten pool dynamics in a multi-pass multi-layer material deposition to predict the as-welded hardness distribution. Technical Approach: All the thermal, physical, and metallurgical properties of Grade 91 as a function of temperature are collected from the literature and inputted into the thermo-fluid model based on Flow-3D, a computational fluid dynamics software. A multi-pass, multi-layer material deposition is simulated where the melting of filler wire into the molten pool is directly considered based on the volume of fluid (VOF) method. The flow behaviour of the molten pool is used to understand the formation of deposition geometry and defects. The temperature profiles during the multi-pass, multi-layer welding are calculated. The results computed using the new model are compared against the experimental data of fusion zone geometry and thermal cycles. Hardness prediction in the heat-affected zone (HAZ) are made using Johnson-Mehl-Avrami (JMA) equation for solid-state phase transformation kinetics. The JMA parameters are extracted from the experimental data available in the literature. For comparison, a standard finite element heat conduction model is also developed to predict the thermal cycles and hardness distribution in the multi-pass, multi-layer weld. Expected Result: Results obtained using the molten pool dynamic simulation versus the finite element heat conduction model are compared. Specifically, the effects of convective heat transfer on the accuracy of the calculated thermal history, bead shape and size, and HAZ hardness distribution are examined.

Modeling, Grade 91 steel, Multi-pass multi-layer d↗

Numerical Studies of the On-Line Reactivity Monitoring Techniques in Subcritical Systems: Revisit of the Area-Ratio Method, the Neutron Source-Modulation Method, and the Flux-to-Current Ratio Method

In the subcritical systems, the subcriticality level must be monitored continuously to ensure the safe operation of the systems. Techniques such as the neutron source-modulation method and the flux-to-current ratio method have been proposed for on-line reactivity measurements of the subcritical systems. However, the accuracy of these methods is unknown in the actual applications. In this report, the fundamental concepts of these techniques are visited, with numerical simulation techniques developed to validate these on-line reactivity monitoring methodologies. Specifically, the Monte Carlo numerical simulation results show that the neutron source-modulation method is not accurate in determining the reactivity of the subcritical systems. The flux-to-current ratio method can provide on-line reactivity measurements, and its spatial effects have been studied and well understood through the numerical simulations of the fuel loading of the neutron source facility of Ukraine. In addition, a modified version of the area-ratio method is proposed for the on-line measurements of the absolute reactivity of the subcritical systems. Monte Carlo numerical simulations showed that this method can provide the absolute reactivity of the subcritical systems within ~5% error, if the neutron detectors are placed close to the fuel assembly interface with the reflector zone or in the reflector zones away from the neutron source.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Error Correction for Tandem Data-Transmission Paths

Mathematical analysis for digital data transmission calculates optimum number of binary error-correcting repeaters to install in given number of wideband channel links. Asymptotic results compared to computed numerical results.

Posner, E. C.↗

Random element method for numerical modeling of diffusional processes

The random element method is a generalization of the random vortex method that was developed for the numerical modeling of momentum transport processes as expressed in terms of the Navier-Stokes equations. The method is based on the concept that random walk, as exemplified by Brownian motion, is the stochastic manifestation of diffusional processes. The algorithm based on this method is grid-free and does not require the diffusion equation to be discritized over a mesh, it is thus devoid of numerical diffusion associated with finite difference methods. Moreover, the algorithm is self-adaptive in space and explicit in time, resulting in an improved numerical resolution of gradients as well as a simple and efficient computational procedure. The method is applied here to an assortment of problems of diffusion of momentum and energy in one-dimension as well as heat conduction in two-dimensions in order to assess its validity and accuracy. The numerical solutions obtained are found to be in good agreement with exact solution except for a statistical error introduced by using a finite number of elements, the error can be reduced by increasing the number of elements or by using ensemble averaging over a number of solutions.

Ghoniem, A. F.↗

Three-dimensional Navier-Stokes calculations of multiple interacting vortex rings

Results from a finite-difference Navier-Stokes code for three-dimensional, unsteady, vortical flows in unbounded domains are presented and analyzed in this paper. The vortical flows presented are representative of vortex rings and other closed vortical tubes or structures in fluid mechanics. Such structures are important elements in fluid flows such as jets, atmospheric turbulence, and the far-field wakes of aircraft, and studies of their interaction may aid in an understanding of complex fluid flows. The paper demonstrates that computational methods can be used as a viable alternative or supplement to experimental techniques for studying the physics of vortex flows. The separate visualization of vortex stretching, convection, and diffusion is presented in this paper for a single elliptical vortex ring.The calculations employ a truncated series expansion technique to simulate the unbounded nature of the fluid flow with a finite computational domain, which is a more accurate technique than the conventional freestream boundary specification. The numerical divergence of the three-dimensional vorticity field is considered as a useful estimate of truncation error, and the use of a kinetic energy decay law as a calculation check is demonstrated. Results from the Navier-Stokes code are presented for the unsteady motion of two and four vortex rings along parallel axes, and the results agree qualitatively with experimental flow visualization.

Chamberlain, J. P.↗

Unsteady lifting-line theory as a singular-perturbation problem

Unsteady lifting-line theory is developed for a wing of large aspect ratio oscillating at low frequency in inviscid incompressible flow. The wing is assumed to have a rigid chord but a flexible span. Use of the method of matched asymptotic expansions reduces the problem from a singular integral equation to quadrature. The pressure field and airloads, for a prescribed wing shape and motion, are obtained in closed form as expansions in inverse aspect ratio. A rigorous definition of unsteady induced downwash is also obtained. Numerical calculations are presented for an elliptic wing in pitch and heave; compared with numerical lifting-surface theory, computation time is reduced significantly. The present work also identifies and resolves errors in the unsteady lifting line theory of James (1975), and points out a limitation in that of Van Holten (1975, 1976, 1977).

Ahmadi, A.↗

Mean-square error bounds for reduced-error linear state estimators

The mean-square error of reduced-order linear state estimators for continuous-time linear systems is investigated. Lower and upper bounds on the minimal mean-square error are presented. The bounds are readily computable at each time-point and at steady state from the solutions to the Ricatti and the Lyapunov equations. The usefulness of the error bounds for the analysis and design of reduced-order estimators is illustrated by a practical numerical example.

Baram, Y.↗

Mean-square-error bounds for reduced-order linear state estimators

The mean-square error of reduced-order linear state estimators for continuous-time linear systems is investigated. Lower and upper bounds on the minimal mean-square error are presented. The bounds are readily computable at each time-point and at steady state from the solutions to the Ricatti and the Liapunov equations. The usefulness of the error bounds for the analysis and design of reduced-order estimators is illustrated by a practical numerical example.

Baram, Y.↗

Efficient computer algebra algorithms for polynomial matrices in control design

The theory of polynomial matrices plays a key role in the design and analysis of multi-input multi-output control and communications systems using frequency domain methods. Examples include coprime factorizations of transfer functions, cannonical realizations from matrix fraction descriptions, and the transfer function design of feedback compensators. Typically, such problems abstract in a natural way to the need to solve systems of Diophantine equations or systems of linear equations over polynomials. These and other problems involving polynomial matrices can in turn be reduced to polynomial matrix triangularization procedures, a result which is not surprising given the importance of matrix triangularization techniques in numerical linear algebra. Matrices with entries from a field and Gaussian elimination play a fundamental role in understanding the triangularization process. In the case of polynomial matrices, matrices with entries from a ring for which Gaussian elimination is not defined and triangularization is accomplished by what is quite properly called Euclidean elimination. Unfortunately, the numerical stability and sensitivity issues which accompany floating point approaches to Euclidean elimination are not very well understood. New algorithms are presented which circumvent entirely such numerical issues through the use of exact, symbolic methods in computer algebra. The use of such error-free algorithms guarantees that the results are accurate to within the precision of the model data--the best that can be hoped for. Care must be taken in the design of such algorithms due to the phenomenon of intermediate expressions swell.

Baras, J. S.↗

High-resolution processing of long-pulse-lidar data

The purpose of this work is to demonstrate the performance of the Fourier-deconvolution technique developed to improve the resolution of the long-pulse coherent lidar power profile, and to take into account the multiplicative fluctuations. The behavior of the error due to the power fluctuations and a method to reduce it are analyzed theoretically and simulated numerically. A processing of real data obtained from the National Oceanic and Atmospheric Administration (NOAA) ground-based Doppler lidar is also presented. Similar problems were investigated using a different approach based on introducing a correction function to the lidar equation.

Gurdev, L. L.↗

Practical aspects of spatially high accurate methods

The computational qualities of high order spatially accurate methods for the finite volume solution of the Euler equations are presented. Two dimensional essentially non-oscillatory (ENO), k-exact, and 'dimension by dimension' ENO reconstruction operators are discussed and compared in terms of reconstruction and solution accuracy, computational cost and oscillatory behavior in supersonic flows with shocks. Inherent steady state convergence difficulties are demonstrated for adaptive stencil algorithms. An exact solution to the heat equation is used to determine reconstruction error, and the computational intensity is reflected in operation counts. Standard MUSCL differencing is included for comparison. Numerical experiments presented include the Ringleb flow for numerical accuracy and a shock reflection problem. A vortex-shock interaction demonstrates the ability of the ENO scheme to excel in simulating unsteady high-frequency flow physics.

Godfrey, Andrew G.↗

Damage detection in elastic structures using vibratory residual forces and weighted sensitivity

A methodology is presented for detecting structural damage in elastic structures by nondestructive means. Measured modal test data along with a correlated analytical structural model are used to locate potentially damaged regions using residual modal force vectors and to conduct a weighted sensitivity analysis to assess the extent of mass and/or stiffness variations, where damage is characterized as a stiffness reduction. The current approach is unique among other approaches in that it accounts for (1) variations in system mass, system stiffness, and mass center (locations), (2) perturbations of both the natural frequencies and modal vectors, and (3) statistical confidence factors for the structural parameters and potential experimental instrumentation error. Moreover, this procedure can be used with either full or reduced models. A wide variety of numerical examples are presented that show that the current method provides a precise indication of both the location and the extent of structural damage.

Ricles, J. M.↗