Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “discretization error”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 127 records · Page 7

Rotational wind indicator enhances control of rotated displays

Rotation by 108 deg of the spatial mapping between a visual display and a manual input device produces large spatial errors in a discrete aiming task. These errors are not easily corrected by voluntary mental effort, but the central nervous system does adapt gradually to the new mapping. Bernotat (1970) showed that adding true hand position to a 90 deg rotated display improved performance of a compensatory tracking task, but tracking error rose again upon removal of the explicit cue. This suggests that the explicit error signal did not induce changes in the neural mapping, but rather allowed the operator to reduce tracking error using a higher mental strategy. In this report, we describe an explicit visual display enhancement applied to a 108 deg rotated discrete aiming task. A 'wind indicator' corresponding to the effect of the mapping rotation is displayed on the operator-controlled cursor. The human operator is instructed to oppose the virtual force represented by the indicator, as one would do if flying an airplane in a crosswind. This enhancement reduces spatial aiming error in the first 10 minutes of practice by an average of 70 percent when compared to a no enhancement control condition. Moreover, it produces adaptation aftereffect, which is evidence of learning by neural adaptation rather than by mental strategy. Finally, aiming error does not rise upon removal of the explicit cue.

Cunningham, H. A.↗

An improved upper bound on the block coding error exponent for binary input discrete memoryless channels

For coded telemetry systems it is important to know the tradeoff between the error probability and the complexity of implementation. For systems using block codes, the block coding error exponent is a good way to estimate this tradeoff. The new upper bounds on the minimum distance of binary codes result in improved upper bounds on the coding error exponents for binary input memoryless channels.

Mceliece, R. J.↗

Choice of method for discretization of continuous systems

The paper discusses and compares several common methods of discretizing the transfer function of a continuous control system so that a digital computer can be used. The discretization effect on the frequency response attenuation of the simple transfer function G(s) = 1/(s + 1) is illustrated for the Tusting, Boxer-Thaler, Madwed, linear segment approximation, and stair-step with half period advanced methods. The input frequency must be significantly lower than one-half the sampling error to have negligible discretization error. Phase differences due to discretization are also plotted, and it is seen that the zero-order hold contributes much more phase shift than that due to discretization. In situations where zero-order hold must follow a computer, the method of discretization of a continuous system is not a major factor if phase shift is important.

Mcvey, E. S.↗

Discrete model reference adaptive control with an augmented error signal

A method for designing discrete model reference adaptive control systems when one has access to only the plant's input and output signals is given. Controllers for single-input, single-output, nonlinear, nonautonomous plants are developed via Liapunov's second method. Anticipative values of the plant output are not required, but are replaced by signals easily obtained from a low-pass filter operating on the plant's output. The augmented error signal method is employed, ensuring finally that the normally used error signal also approaches zero asymptotically.

Ionescu, T.↗

Error analysis and correction of discrete solutions from finite element codes

Many structures are an assembly of individual shell components. Therefore, results for stresses and deflections from finite element solutions for each shell component should agree with the equations of shell theory. This paper examines the problem of applying shell theory to the error analysis and the correction of finite element results. The general approach to error analysis and correction is discussed first. Relaxation methods are suggested as one approach to correcting finite element results for all or parts of shell structures. Next, the problem of error analysis of plate structures is examined in more detail. The method of successive approximations is adapted to take discrete finite element solutions and to generate continuous approximate solutions for postbuckled plates. Preliminary numerical results are included.

Thurston, G. A.↗

Modeling error analysis of stationary linear discrete-time filters

The performance of Kalman-type, linear, discrete-time filters in the presence of modeling errors is considered. The discussion is limited to stationary performance, and bounds are obtained for the performance index, the mean-squared error of estimates for suboptimal and optimal (Kalman) filters. The computation of these bounds requires information on only the model matrices and the range of errors for these matrices. Consequently, a design can easily compare the performance of a suboptimal filter with that of the optimal filter, when only the range of errors in the elements of the model matrices is available.

Patel, R.↗

A comparison of locally adaptive multigrid methods: LDC, FAC and FIC

This study is devoted to a comparative analysis of three 'Adaptive ZOOM' (ZOom Overlapping Multi-level) methods based on similar concepts of hierarchical multigrid local refinement: LDC (Local Defect Correction), FAC (Fast Adaptive Composite), and FIC (Flux Interface Correction)--which we proposed recently. These methods are tested on two examples of a bidimensional elliptic problem. We compare, for V-cycle procedures, the asymptotic evolution of the global error evaluated by discrete norms, the corresponding local errors, and the convergence rates of these algorithms.

Khadra, Khodor↗

Solving Upwind-Biased Discretizations: Multigrid Solver Using Semicoarsening - 2

This paper studies a novel multigrid approach to the solution for a second order upwind biased discretization of the convection equation in two dimensions. This approach is based on semi-coarsening and well balanced explicit correction terms added to coarse-grid operators to maintain on coarse-grid the same cross-characteristic interaction as on the target (fine) grid. Colored relaxation schemes are used on all the levels allowing a very efficient parallel implementation. The results of the numerical tests can be summarized as follows: 1) The residual asymptotic convergence rate of the proposed V(0, 2) multigrid cycle is about 3 per cycle. This convergence rate far surpasses the theoretical limit (4/3) predicted for standard multigrid algorithms using full coarsening. The reported efficiency does not deteriorate with increasing the cycle, depth (number of levels) and/or refining the target-grid mesh spacing. 2) The full multi-grid algorithm (FMG) with two V(0, 2) cycles on the target grid and just one V(0, 2) cycle on all the coarse grids always provides an approximate solution with the algebraic error less than the discretization error. Estimates of the total work in the FMG algorithm are ranged between 18 and 30 minimal work units (depending on the target (discretizatioin). Thus, the overall efficiency of the FMG solver closely approaches (if does not achieve) the goal of the textbook multigrid efficiency. 3) A novel approach to deriving a discrete solution approximating the true continuous solution with a relative accuracy given in advance is developed. An adaptive multigrid algorithm (AMA) using comparison of the solutions on two successive target grids to estimate the accuracy of the current target-grid solution is defined. A desired relative accuracy is accepted as an input parameter. The final target grid on which this accuracy can be achieved is chosen automatically in the solution process. the actual relative accuracy of the discrete solution approximation obtained by AMA is always better than the required accuracy; the computational complexity of the AMA algorithm is (nearly) optimal (comparable with the complexity of the FMG algorithm applied to solve the problem on the optimally spaced target grid).

Diskin, Boris↗

Error in interpolation and choice of the range of discreteness in measurements in a hydrophysical field

Errors in interpolation and the choosing of the range of discreteness when making measurements in a hydrophysical field are discussed. Equations for optimum interpolating based on the theory of linear interpolation of stationary random sequences are presented; analogous equations are derived for the case of data collected at stations located at the apices of a right triangle.

Zudin, O. F.↗

A head-up display format for application to transport aircraft approach and landing

A head up display (HUD) format used in simulator studies of the application of HUD to the landing of civil transport aircraft is described in detail. The display features an indication of the aircraft's instantaneous flightpath that constitutes the primary controlled element. Discrete ILS error and altitude signals are scaled and positioned to provide precise guidance modes when tracked with the flightpath symbol. Consideration is given to both the availability and nonavailability of inertial velocity information in the aircraft.

Bray, R. S.↗

Analysis of Subpixel Registration Accuracy

Geometric and probabilistic models for subpixel accuracy are developed. The geometric models bound the error in offset estimation using the pixels in an observed digital straight line. One probabilistic model bounds the estimate of error offset for continuous images. The other model bounds the error for discrete images given that one is in the correct pixel.

Lavine, D.↗

Metric analysis and data validation across FORTRAN projects

The desire to predict the effort in developing or explaining the quality of software has led to the proposal of several metrics. As a step toward validating these metrics, the Software Engineering Laboratory (SEL) has analyzed the software science metrics, cyclomatic complexity, and various standard program measures for their relation to effort (including design through acceptance testing), development errors (both discrete and weighted according to the amount of time to locate and fix), and one another. The data investigated are collected from a project FORTRAN environment and examined across several projects at once, within individual projects and by reporting accuracy checks demonstrating the need to validate a database. When the data comes from individual programmers or certain validated projects, the metrics' correlations with actual effort seem to be strongest. For modules developed entirely by individual programmers, the validity ratios induce a statistically significant ordering of several of the metrics' correlations. When comparing the strongest correlations, neither software science's E metric cyclomatic complexity not source lines of code appears to relate convincingly better with effort than the others.

Basili, Victor R.↗

An error estimation procedure for plate bending elements

Procedures for identifying and eliminating errors inherent in individual finite elements and those due to the discretization of the continuum are presented. The elemental errors are identified through the use of an element formulation procedure based on physically interpretable strain gradient interpolation functions. The use of physically interpretable notation allows these errors to be eliminated using rational arguments. The discretization errors are identified by comparing the finite-element solution with a smoothed superconvergent solution. The errors thus identified are used to guide an adaptive mesh refinement procedure which produces improved results.

Dow, John O.↗

Directional errors of movements and their correction in a discrete tracking task

Subjects can correct their own errors of movement more quickly than they can react to external stimuli by using three general categories of feedback: (1) knowledge of results, primarily visually mediated; (2) proprioceptive or kinaesthetic such as from muscle spindles and joint receptors, and (3) corollary discharge or efference copy within the central nervous system. The effects of these feedbacks on simple reaction time, choice reaction time, and error correction time were studied in four normal human subjects. The movement used was plantarflexion and dorsiflexion of the ankle joint. The feedback loops were modified, by changing the sign of the visual display to alter the subject's perception of results, and by applying vibration at 100 Hz simultaneously to both the agonist and antagonist muscles of the ankle joint. The central processing was interfered with when the subjects were given moderate doses of alcohol (blood alcohol concentration levels of up to 0.07%). Vibration and alcohol increase both the simple and choice reaction times but not the error correction time.

Jaeger, R. J.↗

Numerical analysis of Weyl's method for integrating boundary layer equations

A fast method for accurate numerical integration of Blasius equation is proposed. It is based on the limit interchange in Weyl's fixed point method formulated as an iterated limit process. Each inner limit represents convergence to a discrete solution. It is shown that the error in a discrete solution admits asymptotic expansion in even powers of step size. An extrapolation process is set up to operate on a sequence of discrete solutions to reach the outer limit. Finally, this method is extended to related boundary layer equations.

Najfeld, I.↗

Textbook Multigrid Efficiency for Leading Edge Stagnation

A multigrid solver is defined as having textbook multigrid efficiency (TME) if the solutions to the governing system of equations are attained in a computational work which is a small (less than 10) multiple of the operation count in evaluating the discrete residuals. TME in solving the incompressible inviscid fluid equations is demonstrated for leading- edge stagnation flows. The contributions of this paper include (1) a special formulation of the boundary conditions near stagnation allowing convergence of the Newton iterations on coarse grids, (2) the boundary relaxation technique to facilitate relaxation and residual restriction near the boundaries, (3) a modified relaxation scheme to prevent initial error amplification, and (4) new general analysis techniques for multigrid solvers. Convergence of algebraic errors below the level of discretization errors is attained by a full multigrid (FMG) solver with one full approximation scheme (F.4S) cycle per grid. Asymptotic convergence rates of the F.4S cycles for the full system of flow equations are very fast, approaching those for scalar elliptic equations.

Diskin, Boris↗

Textbook Multigrid Efficiency for Leading Edge Stagnation

A multigrid solver is defined as having textbook multigrid efficiency (TME) if the solutions to the governing system of equations are attained in a computational work which is a small (less than 10) multiple of the operation count in evaluating the discrete residuals. TME in solving the incompressible inviscid fluid equations is demonstrated for leading-edge stagnation flows. The contributions of this paper include (1) a special formulation of the boundary conditions near stagnation allowing convergence of the Newton iterations on coarse grids, (2) the boundary relaxation technique to facilitate relaxation and residual restriction near the boundaries, (3) a modified relaxation scheme to prevent initial error amplification, and (4) new general analysis techniques for multigrid solvers. Convergence of algebraic errors below the level of discretization errors is attained by a full multigrid (FMG) solver with one full approximation scheme (FAS) cycle per grid. Asymptotic convergence rates of the FAS cycles for the full system of flow equations are very fast, approaching those for scalar elliptic equations.

Diskin, Boris↗