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 595 records · Page 33

Should Pruning be a Pre-Processor of any Linear System?

There are many real-world problems whose mathematical models turn out to be linear systems Ax = b , where A is an m by x n matrix. Each equation of the linear system is an information. An information, in a physical problem, such as 4 mangoes, 6 bananas, and 5 oranges cost $10, is mathematically modeled as 4x(sub 1) + 6x(sub 2) + 5x (sub 3) = 10, where x(sub 1), x(sub 2), x(sub 3) are each cost of one mango, that of one banana, and that of one orange, respectively. All the information put together in a specified context, constitutes the physical problem and need not be all distinct. Some of these could be redundant, which cannot be readily identified by inspection. The resulting mathematical model will thus have equations corresponding to this redundant information and hence are linearly dependent and thus superfluous. Consequently, these equations once identified should be better pruned in the process of solving the system. The benefits are (i) less computation and hence less error and consequently a better quality of solution and (ii) reduced storage requirements. In literature, the pruning concept is not in vogue so far although it is most desirable. In a numerical linear system, the system could be slightly inconsistent or inconsistent of varying degree. If the system is too inconsistent, then we should fall back on to the physical problem (PP), check the correctness of the PP derived from the material universe, modify it, if necessary, and then check the corresponding mathematical model (MM) and correct it. In nature/material universe, inconsistency is completely nonexistent. If the MM becomes inconsistent, it could be due to error introduced by the concerned measuring device and/or due to assumptions made on the PP to obtain an MM which is relatively easily solvable or simply due to human error. No measuring device can usually measure a quantity with an accuracy greater that 0.005% or, equivalently with a relative error less than 0.005%. Hence measurement error is unavoidable in a numerical linear system when the quantities are continuous (or even discrete with extremely large number). Assumptions, though not desirable, are usually made when we find the problem sufficiently difficult to be solved within the available means/tools/resources and hence distort the PP and the corresponding MM. The error thus introduced in the system could (not always necessarily though) make the system somewhat inconsistent. If the inconsistency (contradiction) is too much then one should definitely not proceed to solve the system in terms of getting a least-squares solution or a minimum norm solution or the minimum-norm least-squares solution. All these solutions will be invariably of no real-world use. If, on the other hand, inconsistency is reasonably low, i.e. the system is near-consistent or, equivalently, has near-linearly-dependent rows, then the foregoing solutions are useful. Pruning in such a near-consistent system should be performed based on the desired accuracy and on the definition of near-linear dependence. In this article, we discuss pruning over various kinds of linear systems and strongly suggest its use as a pre-processor or as a part of an algorithm. Ideally pruning should (i) be a part of the solution process (algorithm) of the system, (ii) reduce both computational error and complexity of the process, and (iii) take into account the numerical zero defined in the context. These are precisely what we achieve through our proposed O(mn2) algorithm presented in Matlab, that uses a subprogram of solving a single linear equation and that has embedded in it the pruning.

Sen, Syamal K.↗

Should Pruning be a Pre-Processor of any Linear System?

There are many real-world problems whose mathematical models turn out to be linear systems Ax = b, where A is an m x n matrix. Each equation of the linear system is an information. An information, in a physical problem, such as 4 mangoes, 6 bananas, and 5 oranges cost $10, is mathematically modeled as an equation 4x(sub 1) + 6x(sub 2) + 5x(sub 3) = 10 , where x(sub 1), x(sub 2), x(sub 3) are each cost of one mango, that of one banana, and that of one orange, respectively. All the information put together in a specified context, constitutes the physical problem and need not be all distinct. Some of these could be redundant, which cannot be readily identified by inspection. The resulting mathematical model will thus have equations corresponding to this redundant information and hence are linearly dependent and thus superfluous. Consequently, these equations once identified should be better pruned in the process of solving the system. The benefits are (i) less computation and hence less error and consequently a better quality of solution and (ii) reduced storage requirements. In literature, the pruning concept is not in vogue so far although it is most desirable. It is assumed that at least one information, i.e. one equation is known to be correct and which will be our first equation. In a numerical linear system, the system could be slightly inconsistent or inconsistent of varying degree. If the system is too inconsistent, then we should fall back on to the physical problem (PP), check the correctness of the PP derived from the material universe, modify it, if necessary, and then check the corresponding mathematical model (MM) and correct it. In nature/material universe, inconsistency is completely nonexistent. If the MM becomes inconsistent, it could be due to error introduced by the concerned measuring device and/or due to assumptions made on the PP to obtain an MM which is relatively easily solvable or simply due to human error. No measuring device can usually measure a quantity with an accuracy greater that 0.005% or, equivalently with a relative error less than 0.005%. Hence measurement error is unavoidable in a numerical linear system when the quantities are continuous (or even discrete with extremely large number). Assumptions, though not desirable, are usually made when we find the problem sufficiently difficult to be solved within the available means/tools/resources and hence distort the PP and the corresponding MM. The . error thus introduced in the system could (not always necessarily though) make the system somewhat inconsistent. If the inconsistency (contradiction) is too much then one should definitely not proceed to solve the system in terms of getting a least-squares solution or the minimum-norm least-squares solution. All these solutions will be invariably of no real-world use. If, on the other hand, inconsistency is reasonably low, i.e. the system is near-consistent or, equivalently, has near-linearly-dependent rows, then the foregoing solutions are useful. Pruning in such a near-consistent system should be performed based on the desired accuracy and on the definition of near-linear dependence. In this article, we discuss pruning over various kinds of linear systems and strongly suggest its use as a pre-processor or as a part of an algorithm. Ideally pruning should (i) be a part of the solution process (algorithm) of the system, (ii) reduce both computational error and complexity of the process, and (iii) take into account the numerical zero defined in the context. These are precisely what we achieve through our proposed O(mn2) algorithm presented in Matlab, that uses a subprogram of solving a single linear equation and that has embedded in it the pruning.

Sen, Syamal K.↗

Digital image gathering and minimum mean-square error restoration

Most digital image restoration algorithms are inherently incomplete because they are conditioned on a discrete-input, discrete-output model which only accounts for blurring during image gathering and additive noise. For those restoration applications where sampling and reconstruction are important, the restoration algorithm should be based on a more comprehensive end-to-end model which also accounts for the potentially important noiselike effects of aliasing and the low-pass filtering effects of interpolative reconstruction. It is demonstrated that although the mathematics of this more comprehensive model is more complex, the increase in complexity is not so great as to prevent a complete development and analysis of the associated minimum mean-square error (Wiener) restoration filter.

Park, Stephen K.↗

A fully implicit scheme for global numerical weather prediction

A fast-slow factored scheme is presented for use with shallow-water primitive equation numerical weather prediction models. The technique was developed to reduce the rotational mode errors which arise when the fast and slow terms of the governing differential equations are treated simultaneously. The method factors out the fast and slow terms along the coordinate directions by means of a modified Crank-Nicolson scheme. A finite-difference spatial discretization is carried out in the zonal and meridional directions to reduce the factorization error to near-zero, and that time steps of 60-90 min can be used to obtain acceptably accurate results, even in the presence of fine spatial structures in the flow.

Augenbaum, J. M.↗

Hybrid Modeling for Testing Intelligent Software for Lunar-Mars Closed Life Support

Intelligent software is being developed for closed life support systems with biological components, for human exploration of the Moon and Mars. The intelligent software functions include planning/scheduling, reactive discrete control and sequencing, management of continuous control, and fault detection, diagnosis, and management of failures and errors. Four types of modeling information have been essential to system modeling and simulation to develop and test the software and to provide operational model-based what-if analyses: discrete component operational and failure modes; continuous dynamic performance within component modes, modeled qualitatively or quantitatively; configuration of flows and power among components in the system; and operations activities and scenarios. CONFIG, a multi-purpose discrete event simulation tool that integrates all four types of models for use throughout the engineering and operations life cycle, has been used to model components and systems involved in the production and transfer of oxygen and carbon dioxide in a plant-growth chamber and between that chamber and a habitation chamber with physicochemical systems for gas processing.

Malin, Jane T.↗

A kinematic comparison of meshfree and mesh-based Lagrangian approximations using manufactured extreme deformation fields

Meshfree methods for solid mechanics have been in development since the early 1990's. Initial motivations included alleviation of the burden of mesh creation and the desire to overcome the limitations of traditional mesh-based discretizations for extreme deformation applications. Here, the accuracy and robustness of both mesh-free and meshbased Lagrangian discretizations are compared using manufactured extreme-deformation fields. For the meshfree discretizations, both moving least squares and maximum entropy are considered. Quantitative error and convergence results are presented for the best approximation in the H 1 norm.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Experimental verification of a method to create a variable energy neutron beam from a monoenergetic, isotropic source using neutron elastic scatter and time of flight

An experiment was performed to determine the neutron energy of near-monoergetic deuterium–deu-terium (D–D) neutrons that elastically scatter in a hydrogenous target. The experiment used two liquid scintillators to perform time of flight (TOF) measurements to determine neutron energy, with the start detector also serving as the scatter target. The stop detector was placed 1.0 m away and at scatter angles of π/6, π/4, and π/3 rad, and 1.5 m at a scatter angle of π/4 rad. When discrete 1 ns increments were implemented, the TOF peaks had estimated errors between 21.2 and 3.6% relative to their expected locations. Full widths at half-maximum (FWHM) ranged between 9.6 and 20.9 ns, or approximately 0.56–0.66 MeV. Monte Carlo simulations were also conducted that approximated the experimental setup and had both D–D and deuterium–tritium (DT) neutrons. The simulated results had errors between -17.2 and 0.0% relative to their expected TOF peaks when 1 ns increments were applied. The largest D–D and D–T FWHMs were 26.7 and 13.7 ns, or approximately 0.85 and 4.98 MeV, respectively. These values, however, can be reduced through manipulation of the dimensions of the system components. Lastly, the results encourage further study of the neutron elastic scatter TOF system with particular interest in application to active neutron interrogation to search for conventional explosives.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Hybrid particle-spectral method for kinetic plasma simulations

A hybrid model for numerical solutions of the Vlasov–Poisson equations is presented, which blends spectral and particle approaches. The model splits the distribution function for plasma species into both spectral and particle representations in the velocity space to combine the advantages of each approach. The spectral representation leverages asymmetrically weighted Hermite basis, whereas the particle representation leverages the particle-in-cell method. Configuration phase space is decomposed with the Fourier method, which is well suited for periodic problems. We derive conservation equations for mass, momentum, and energy for the proposed combined method. It is shown that the coupling error between the two methods is absent in the semi-discrete setting (not taking into account time discretization). Finally, numerical test cases are presented simulating a weak electron beam interaction with plasma, leading to beam–plasma instability. The initially localized electron beam evolved into a highly non-equilibrium distribution function in the velocity space. A small growth rate and the resonance nature of instability make it difficult to obtain accurate solutions for purely particle methods due to noise, which falls as ∼1/Np with a number of particles. At the same time, purely spectral methods may require a large number of modes to capture the highly non-equilibrium state of the evolved beam. We show that the hybrid method is well suited for such problems: it reproduces the linear stage as well as nonlinear dynamics with sufficient accuracy using a highly non-equilibrium distribution function.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Quantum algorithm for simulating the wave equation

We present a quantum algorithm for simulating the wave equation under Dirichlet and Neumann boundary conditions. The algorithm uses Hamiltonian simulation and quantum linear system algorithms as subroutines. It relies on factorizations of discretized Laplacian operators to allow for polynomially improved scaling in truncation errors and improved scaling for state preparation relative to general purpose quantum algorithms for solving linear differential equations. Relative to classical algorithms for simulating the D-dimensional wave equation, our quantum algorithm achieves exponential space savings and achieves a speedup which is polynomial for fixed D and exponential in D. Furthermore, we also consider using Hamiltonian simulation for Klein-Gordon equations and Maxwell's equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Clarke Transformation-Based DFT Phasor and Frequency Algorithm for Wide Frequency Range

Despite its wide applications in power grid monitoring, the classic discrete Fourier transform (DFT)-based synchrophasor estimation algorithms suffer from significant errors when the power system operates under off-nominal frequency conditions. This phenomenon is caused by spectral leakage of DFT and becomes even more severe for single-phase synchrophasor estimation. To address this issue, a theory to eliminate the spectral leakage-caused errors is proposed and a Clarke transformation-based DFT synchrophasor estimation algorithm is proposed to implement the theory in this paper. The Clarke transformation constructs a second signal that has exactly 90° phase angle difference from the original single-phase input signal and helps eliminate the estimation errors for a wide frequency range. The proposed algorithm is tested under the conditions required in the phasor measurement unit standard C37.118.1-2011 and C37.118.1a-2014, as well as the harmonic and noise conditions not required in the standard to verify its performance. More importantly, the idea of using Clarke transformation can be used for other DFT-based synchrophasor algorithms in order to achieve higher synchrophasor measurement accuracy under dynamic conditions. An example is presented at last to demonstrate the expandability of the proposed idea.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Hybrid particle-spectral method for kinetic plasma simulations

A hybrid model for numerical solutions of the Vlasov–Poisson equations is presented, which blends spectral and particle approaches. The model splits the distribution function for plasma species into both spectral and particle representations in the velocity space to combine the advantages of each approach. The spectral representation leverages asymmetrically weighted Hermite basis, whereas the particle representation leverages the particle-in-cell method. Configuration phase space is decomposed with the Fourier method, which is well suited for periodic problems. We derive conservation equations for mass, momentum, and energy for the proposed combined method. It is shown that the coupling error between the two methods is absent in the semi-discrete setting (not taking into account time discretization). Finally, numerical test cases are presented simulating a weak electron beam interaction with plasma, leading to beam–plasma instability. The initially localized electron beam evolved into a highly non-equilibrium distribution function in the velocity space. A small growth rate and the resonance nature of instability make it difficult to obtain accurate solutions for purely particle methods due to noise, which falls as ~1/$\sqrt{N_p}$ with a number of particles. At the same time, purely spectral methods may require a large number of modes to capture the highly nonequilibrium state of the evolved beam. We show that the hybrid method is well suited for such problems: it reproduces the linear stage as well as nonlinear dynamics with sufficient accuracy using a highly non-equilibrium distribution function.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A dynamic transformation method for modal synthesis.

This paper presents a condensation method for large discrete parameter vibration analysis of complex structures that greatly reduces truncation errors and provides accurate definition of modes in a selected frequency range. A dynamic transformation is obtained from the partitioned equations of motion that relates modes not explicity in the condensed solution to the retained modes at a selected system frequency. The generalized mass and stiffness matrices, obtained with existing modal synthesis methods, are reduced using this transformation and solved. Revised solutions are then obtained using new transformations at the calculated eigenvalues and are also used to assess the accuracy of the results. If all the modes of interest have not been obtained, the results are used to select a new set of retained coordinates and a new transformation frequency, and the procedure is repeated for another group of modes.

Kuhar, E. J.↗

Realizable optimal control for a remotely piloted research vehicle

The design of a control system using the linear-quadratic regulator (LQR) control law theory for time invariant systems in conjunction with an incremental gradient procedure is presented. The incremental gradient technique reduces the full-state feedback controller design, generated by the LQR algorithm, to a realizable design. With a realizable controller, the feedback gains are based only on the available system outputs instead of being based on the full-state outputs. The design is for a remotely piloted research vehicle (RPRV) stability augmentation system. The design includes methods for accounting for noisy measurements, discrete controls with zero-order-hold outputs, and computational delay errors. Results from simulation studies of the response of the RPRV to a step in the elevator and frequency analysis techniques are included to illustrate these abnormalities and their influence on the controller design.

Dunn, H. J.↗

Modeling and analysis of pinhole occulter experiment

The objectives were to improve pointing control system implementation by converting the dynamic compensator from a continuous domain representation to a discrete one; to determine pointing stability sensitivites to sensor and actuator errors by adding sensor and actuator error models to treetops and by developing an error budget for meeting pointing stability requirements; and to determine pointing performance for alternate mounting bases (space station for example).

Ring, J. R.↗

Optimal post-experiment estimation of poorly modeled dynamic systems

Recently, a novel strategy for post-experiment state estimation of discretely-measured dynamic systems has been developed. The method accounts for errors in the system dynamic model equations in a more general and rigorous manner than do filter-smoother algorithms. The dynamic model error terms do not require the usual process noise assumptions of zero-mean, symmetrically distributed random disturbances. Instead, the model error terms require no prior assumptions other than piecewise continuity. The resulting state estimates are more accurate than filters for applications in which the dynamic model error clearly violates the typical process noise assumptions, and the available measurements are sparse and/or noisy. Estimates of the dynamic model error, in addition to the states, are obtained as part of the solution of a two-point boundary value problem, and may be exploited for numerous reasons. In this paper, the basic technique is explained, and several example applications are given. Included among the examples are both state estimation and exploitation of the model error estimates.

Mook, D. Joseph↗

Simulation Of Unsteady, Viscous, Incompressible Flow

Method for numerical solution of Navier-Stokes equations of viscous, incompressible flow developed based on use of fractional-step procedure. Accurate to second order in both space and time. Attempt made to minimize Poisson-equation difficulties by choosing pressures at centers and volume fluxes across faces of computational cells as dependent variables instead of familiar Cartesian components of velocity. Choice ensures satisfaction of discrete equation of conservation of mass to within round-off errors in any coordinate system and has favorable effects on convergence properties.

Rosenfeld, Moshe↗

Using Covariance Analysis to Assess Pointing Performance

A Pointing Covariance Analysis Tool (PCAT) has been developed for evaluating the expected performance of the pointing control system for NASA s Space Interferometry Mission (SIM). The SIM pointing control system is very complex, consisting of multiple feedback and feedforward loops, and operating with multiple latencies and data rates. The SIM pointing problem is particularly challenging due to the effects of thermomechanical drifts in concert with the long camera exposures needed to image dim stars. Other pointing error sources include sensor noises, mechanical vibrations, and errors in the feedforward signals. PCAT models the effects of finite camera exposures and all other error sources using linear system elements. This allows the pointing analysis to be performed using linear covariance analysis. PCAT propagates the error covariance using a Lyapunov equation associated with time-varying discrete and continuous-time system matrices. Unlike Monte Carlo analysis, which could involve thousands of computational runs for a single assessment, the PCAT analysis performs the same assessment in a single run. This capability facilitates the analysis of parametric studies, design trades, and "what-if" scenarios for quickly evaluating and optimizing the control system architecture and design.

Bayard, David↗