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.
A fast and robust computational modeling approach for density and shape predictions in powder metallurgy hot isostatic pressing
Powder metallurgy hot isostatic pressing (PM-HIP) is an advanced manufacturing process that produces near-net-shape parts with high material utilization and uniform microstructures. PM-HIP is frequently used for producing small-scale parts with complicated geometries and is potentially economical for producing large-scale parts. However, excessive post-HIP shape distortions can reduce its effectiveness and economic advantage, especially for larger parts. A PM-HIP computational model can predict and help mitigate these distortions. However, due to complex deformation mechanisms and thermo-mechanical coupling present in PM-HIP processes, these non-linear computational models sometimes become numerically unstable. The numerical instabilities in these models can lead to very slow convergence or no convergence at all, which often translates to slow and unreliable models. These limitations are more pronounced in large models with complicated geometries. Hence, in this work, an alternative modeling approach is presented that improves numerical stability and computational performance. The presented approach achieves these improvements through approximating the fully coupled thermo-mechanical PM-HIP model as a decoupled model and adding inertial damping to the model’s mechanical part. In conclusion, a comparison with the fully coupled model indicated a slight dip in prediction accuracy (<5% error) but significant improvements in numerical stability (>20 times larger time step size) and computational performance (5-10 times speed-up with less computational resource usage) when using the presented approach.
Introduction to Numerical Methods [Slides]
These are slides for a lecture for the Parallel Computing Summer Research Internship at the National Security Education Center. This gives an introduction to numerical methods. Repetitive algorithms are used to obtain approximate solutions to mathematical problems, using sorting, searching, root finding, optimization, interpolation, extrapolation, least squares regression, Eigenvalue problems, ordinary differential equations, and partial differential equations. Many equations are shown. Discretizations allow us to approximate solutions to mathematical models of physical systems using a repetitive algorithm and introduce errors that can lead to numerical instabilities if we are not careful.
Discrete distributed strain sensing of intelligent structures
Techniques are developed for the design of discrete highly distributed sensor systems for use in intelligent structures. First the functional requirements for such a system are presented. Discrete spatially averaging strain sensors are then identified as satisfying the functional requirements. A variety of spatial weightings for spatially averaging sensors are examined, and their wave number characteristics are determined. Preferable spatial weightings are identified. Several numerical integration rules used to integrate such sensors in order to determine the global deflection of the structure are discussed. A numerical simulation is conducted using point and rectangular sensors mounted on a cantilevered beam under static loading. Gage factor and sensor position uncertainties are incorporated to assess the absolute error and standard deviation of the error in the estimated tip displacement found by numerically integrating the sensor outputs. An experiment is carried out using a statically loaded cantilevered beam with five point sensors. It is found that in most cases the actual experimental error is within one standard deviation of the absolute error as found in the numerical simulation.
Numerical and experimental studies of the natural convection within a horizontal cylinder
Numerical solutions are obtained for the quasi-compressible Navier-Stokes equations governing the time-dependent natural convection within a horizontal cylinder. The early flow development and wall heat transfer are obtained after a uniformly cold wall is imposed as a boundary condition on the cylinder. Results are also obtained for a time-varying cold wall as a boundary condition with windward explicit differencing used for the numerical solutions. The viscous truncation error associated with this scheme is controlled so that first-order accuracy is maintained in time and space. Experiments within a small-scale instrumented horizontal cylinder revealed the time development of the temperature distribution across the boundary layer as well as the decay of wall heat transfer with time. Agreement between temperature distributions obtained experimentally and numerically was generally good. The time decay of the dimensionless ratio of the Nusselt number to the one-fourth power of the Grashof number is found both numerically and experimentally, and good agreement is obtained between these two results over most of the cylinder wall.
Numerical Descriptions of Cosmic-Ray Transport
The behavior of energetic particles in the solar system is described by a well known Fokker-Planck equation. Although analytic methods yield insight into the nature of its solutions, especially in the diffusion regime, calculations that go beyond diffusion are very complicated. The reliability of these calculations is of concern, because numerical methods are notorious for their errors and artifacts. The well known Milne problem of classical transport theory was analyzed with the aid of three different numerical methods. These are: (1) The method of eigenfunctions in which the distribution function is approximated by a sum of eigenfunctions of the scattering operator, (2) Numerical solutions of a finite difference aquation; and (3) Direct simulation of the scattering and streaming of individual particles with the aid of Monte Carlo methods.
Understanding Global Model Systematic Shortwave Radiation Errors in Subtropical Marine Boundary Layer Cloud Regimes
Abstract Global numerical weather prediction and climate models are subject to long‐standing systematic shortwave radiation errors due to deficiencies in the representation of boundary layer clouds over the ocean. In the subtropics, clouds are typically too reflective in the cumulus regime and not reflective enough in the stratocumulus regime. Potential sources of error include cloud cover, liquid water path, effective radius, and subgrid heterogeneity, but diagnosing the absolute contributions of each to the radiation bias is hampered by uncertainties and sometimes contradictory information from different observational products. This paper draws on a set of ship‐based observations of boundary layer clouds obtained during the ARM MAGIC campaign along a northeast Pacific Ocean transect, crossing both stratocumulus and shallow cumulus cloud regimes. The surface‐based observations of cloud properties are compared with various satellite products, taking account of the diurnal cycle, to provide an improved quantitative assessment of the deficiencies in the European Centre for Medium‐Range Weather Forecasts global numerical weather prediction model. A series of off‐line radiation calculations are then performed to assess the impact on the shortwave radiation bias of correcting each of the model's deficiencies in cloud characteristics along the transect. A reduction in the bias is achieved by improving the agreement between modeled and observed in‐cloud liquid water path frequency distributions. In the cumulus regime, this is accomplished primarily by reducing the all‐sky water path, while for the stratocumulus regime, an underestimate of cloud cover and liquid water and an overestimate in effective radius and subgrid heterogeneity all contribute to a lack of reflected shortwave radiation.
Generalizing global error estimation for ordinary differential equations by using coupled time-stepping methods
Here, this study introduces new time-stepping strategies with built-in global error estimators. The new methods propagate the defect along with the numerical solution much like solving for the correction or Zadunaisky’s procedure; however, the proposed approach allows for overlapped internal computations and, therefore, represents a generalization of the classical numerical schemes for solving differential equations with global error estimation. The resulting algorithms can be effectively represented as general linear methods. Finally, several explicit self-starting schemes akin to Runge–Kutta methods with global error estimation are introduced, and the theoretical considerations are illustrated in several examples.
Blocking Losses With a Photon Counter
It was not known how to assess accurately losses in a communications link due to photodetector blocking, a phenomenon wherein a detector is rendered inactive for a short time after the detection of a photon. When used to detect a communications signal, blocking leads to losses relative to an ideal detector, which may be measured as a reduction in the communications rate for a given received signal power, or an increase in the signal power required to support the same communications rate. This work involved characterizing blocking losses for single detectors and arrays of detectors. Blocking may be mitigated by spreading the signal intensity over an array of detectors, reducing the count rate on any one detector. A simple approximation was made to the blocking loss as a function of the probability that a detector is unblocked at a given time, essentially treating the blocking probability as a scaling of the detection efficiency. An exact statistical characterization was derived for a single detector, and an approximation for multiple detectors. This allowed derivation of several accurate approximations to the loss. Methods were also derived to account for a rise time in recovery, and non-uniform illumination due to diffraction and atmospheric distortion of the phase front. It was assumed that the communications signal is intensity modulated and received by an array of photon-counting photodetectors. For the purpose of this analysis, it was assumed that the detectors are ideal, in that they produce a signal that allows one to reproduce the arrival times of electrons, produced either as photoelectrons or from dark noise, exactly. For single detectors, the performance of the maximum-likelihood (ML) receiver in blocking is illustrated, as well as a maximum-count (MC) receiver, that, when receiving a pulse-position-modulated (PPM) signal, selects the symbol corresponding to the slot with the largest electron count. Whereas the MC receiver saturates at high count rates, the ML receiver may not. The loss in capacity, symbol-error-rate (SER), and count-rate were numerically computed. It was shown that the capacity and symbol-error-rate losses track, whereas the count-rate loss does not generally reflect the SER or capacity loss, as the slot-statistics at the detector output are no longer Poisson. It is also shown that the MC receiver loss may be accurately predicted for dead times on the order of a slot.
Accuracy of earth albedo estimates from wide-angle radiation measurements
The instantaneous resolution and accuracy that can be expected from two inversion techniques to be used in the Earth Radiation Budget Experiment (ERBE) are examined. It is shown that measurement errors are magnified by the numerical filter and that this magnification is a function of the magnitude of the inversion factor. By using singular value decomposition, these magnitudes can be reduced to improve the estimates. A simulation of the estimation process using an albedo field derived from scanning radiometer data shows that retaining 6 of the 13 singular values gives the best results. If there are no bidirectional model errors the medium-field-of-view data give the best estimates. However, when bidirectional model errors are considered, the wide-field-of-view measurements give better estimates since they are less sensitive to these errors.
QMR: A Quasi-Minimal Residual method for non-Hermitian linear systems
The biconjugate gradient (BCG) method is the natural generalization of the classical conjugate gradient algorithm for Hermitian positive definite matrices to general non-Hermitian linear systems. Unfortunately, the original BCG algorithm is susceptible to possible breakdowns and numerical instabilities. A novel BCG like approach is presented called the quasi-minimal residual (QMR) method, which overcomes the problems of BCG. An implementation of QMR based on a look-ahead version of the nonsymmetric Lanczos algorithm is proposed. It is shown how BCG iterates can be recovered stably from the QMR process. Some further properties of the QMR approach are given and an error bound is presented. Finally, numerical experiments are reported.
Discretization error estimation and exact solution generation using the method of nearby problems.
The Method of Nearby Problems (MNP), a form of defect correction, is examined as a method for generating exact solutions to partial differential equations and as a discretization error estimator. For generating exact solutions, four-dimensional spline fitting procedures were developed and implemented into a MATLAB code for generating spline fits on structured domains with arbitrary levels of continuity between spline zones. For discretization error estimation, MNP/defect correction only requires a single additional numerical solution on the same grid (as compared to Richardson extrapolation which requires additional numerical solutions on systematically-refined grids). When used for error estimation, it was found that continuity between spline zones was not required. A number of cases were examined including 1D and 2D Burgers equation, the 2D compressible Euler equations, and the 2D incompressible Navier-Stokes equations. The discretization error estimation results compared favorably to Richardson extrapolation and had the advantage of only requiring a single grid to be generated.
Analysis of the Runge-Kutta-Fehlberg method
Stability and error analysis of Runge-Kutta- Fehlberg numerical integration method
Massively Parallel Assimilation of TOGA/TAO and Topex/Poseidon Measurements into a Quasi Isopycnal Ocean General Circulation Model Using an Ensemble Kalman Filter
A massively parallel ensemble Kalman filter (EnKF)is used to assimilate temperature data from the TOGA/TAO array and altimetry from TOPEX/POSEIDON into a Pacific basin version of the NASA Seasonal to Interannual Prediction Project (NSIPP)ls quasi-isopycnal ocean general circulation model. The EnKF is an approximate Kalman filter in which the error-covariance propagation step is modeled by the integration of multiple instances of a numerical model. An estimate of the true error covariances is then inferred from the distribution of the ensemble of model state vectors. This inplementation of the filter takes advantage of the inherent parallelism in the EnKF algorithm by running all the model instances concurrently. The Kalman filter update step also occurs in parallel by having each processor process the observations that occur in the region of physical space for which it is responsible. The massively parallel data assimilation system is validated by withholding some of the data and then quantifying the extent to which the withheld information can be inferred from the assimilation of the remaining data. The distributions of the forecast and analysis error covariances predicted by the ENKF are also examined.
A reactor core on-line monitoring program - COMP
A program named COMP is developed for on-line monitoring PWRs' in-core power distribution in this paper. Harmonics expansion method is used in COMP. The Unit 1 reactor of Daya Bay Nuclear Power Plant (Daya Bay NPP) in China is considered for verification. The numerical results show that the maximum relative error between measurement and reconstruction results from COMP is less than 5%, and the computing time is short, indicating that COMP is capable for online monitoring PWRs. (authors)
One- and two-qubit gate infidelities due to motional errors in trapped ions and electrons
In this work, we derive analytic formulas that determine the effect of error mechanisms on one- and two-qubit gates in trapped ions and electrons. First, we analyze and derive expressions for the effect of driving field inhomogeneities on one-qubit gate fidelities. Second, we derive expressions for two-qubit gate errors, including static motional frequency shifts, trap anharmonicities, field inhomogeneities, heating, and motional dephasing. We show that, for small errors, each of our expressions for infidelity converges to its respective numerical simulation; this shows that our formulas are sufficient for determining error budgets for high-fidelity gates, obviating numerical simulations in future projects. All of the derivations are general to any internal qubit state, and any mixed state of the ion crystal's motion that is diagonal in the Fock state basis. Our treatment of static motional frequency shifts, trap anharmonicities, heating, and motional dephasing apply to both laser-based and laser-free gates, while our treatment of field inhomogeneities applies to laser-free systems.
Numerical solutions of FitzHugh–Nagumo equation by exact finite-difference and NSFD schemes
In this paper, numerical solution of the FitzHugh–Nagumo (FN) equation is presented based on the nonstandard finite-difference (NSFD) scheme. At first, two exact finite-difference schemes for FN equation are obtained. Moreover, two NSFD schemes are presented for this equation. The positivity, boundedness, and local truncation error of the schemes are discussed. The numerical results obtained by the NSFD schemes are compared with the exact solution and some available methods, to verify the accuracy and efficiency of the NSFD schemes.
Recursive linearization of multibody dynamics equations of motion
The equations of motion of a multibody system are nonlinear in nature, and thus pose a difficult problem in linear control design. One approach is to have a first-order approximation through the numerical perturbations at a given configuration, and to design a control law based on the linearized model. Here, a linearized model is generated analytically by following the footsteps of the recursive derivation of the equations of motion. The equations of motion are first written in a Newton-Euler form, which is systematic and easy to construct; then, they are transformed into a relative coordinate representation, which is more efficient in computation. A new computational method for linearization is obtained by applying a series of first-order analytical approximations to the recursive kinematic relationships. The method has proved to be computationally more efficient because of its recursive nature. It has also turned out to be more accurate because of the fact that analytical perturbation circumvents numerical differentiation and other associated numerical operations that may accumulate computational error, thus requiring only analytical operations of matrices and vectors. The power of the proposed linearization algorithm is demonstrated, in comparison to a numerical perturbation method, with a two-link manipulator and a seven degrees of freedom robotic manipulator. Its application to control design is also demonstrated.