Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “error bound”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
NASA NTRS2006

Genetic Algorithm for Optimization: Preprocessing with n Dimensional Bisection and Error Estimation

A knowledge of the appropriate values of the parameters of a genetic algorithm (GA) such as the population size, the shrunk search space containing the solution, crossover and mutation probabilities is not available a priori for a general optimization problem. Recommended here is a polynomial-time preprocessing scheme that includes an n-dimensional bisection and that determines the foregoing parameters before deciding upon an appropriate GA for all problems of similar nature and type. Such a preprocessing is not only fast but also enables us to get the global optimal solution and its reasonably narrow error bounds with a high degree of confidence.

Sen, S. K.↗
NASA NTRS2016

Application of Design of Experiments and Surrogate Modeling within the NASA Advanced Concepts Office, Earth-to-Orbit Design Process

Decisions made during early conceptual design have a large impact upon the expected life-cycle cost (LCC) of a new program. It is widely accepted that up to 80% of such cost is committed during these early design phases [1]. Therefore, to help minimize LCC, decisions made during conceptual design must be based upon as much information as possible. To aid in the decision making for new launch vehicle programs, the Advanced Concepts Office (ACO) at NASA Marshall Space Flight Center (MSFC) provides rapid turnaround pre-phase A and phase A concept definition studies. The ACO team utilizes a proven set of tools to provide customers with a full vehicle mass breakdown to tertiary subsystems, preliminary structural sizing based upon worst-case flight loads, and trajectory optimization to quantify integrated vehicle performance for a given mission [2]. Although the team provides rapid turnaround for single vehicle concepts, the scope of the trade space can be limited due to analyst availability and the manpower requirements for manual execution of the analysis tools. In order to enable exploration of a broader design space, the ACO team has implemented an advanced design methods (ADM) based approach. This approach applies the concepts of design of experiments (DOE) and surrogate modeling to more exhaustively explore the trade space and provide the customer with additional design information to inform decision making. This paper will first discuss the automation of the ACO tool set, which represents a majority of the development effort. In order to fit a surrogate model within tolerable error bounds a number of DOE cases are needed. This number will scale with the number of variable parameters desired and the complexity of the system's response to those variables. For all but the smallest design spaces, the number of cases required cannot be produced within an acceptable timeframe using a manual process. Therefore, automation of the tools was a key enabler for the successful application of an ADM approach to an ACO design study. Following the overview of the tool set automation, an example problem will be given to illustrate the implementation of the ADM approach. The example problem will first cover the inclusion of ground rules and assumptions (GR&A) for a study. The GR&A are very important to the study as they determine the constraints within which a trade study can be conducted. These trades must ultimately reconcile with the customer's desired output and any anticipated "what if" questions.

Zwack, Mathew R.↗
NASA NTRS2018

Validation of MODIS 3 km Land Aerosol Optical Depth from NASA's EOS Terra and Aqua Missions

In addition to the standard resolution product (10km), the MODerate resolution Imaging Spectroradiometer (MODIS) Collection 6 (C006) data release included a higher resolution (3km). Other than accommodations for the two different resolutions, the 10 and 3km Dark Target (DT) algorithms are basically the same. In this study, we perform global validation of the higher-resolution aerosol optical depth (AOD) over global land by comparing against AErosol RObotic NETwork (AERONET) measurements. The MODIS-AERONET collocated data sets consist of 161410 high-confidence AOD pairs from 2000 to 2015 for Terra MODIS and 2003 to 2015 for Aqua MODIS. We find that 62.5 and 68.4% of AODs retrieved from Terra MODIS and Aqua MODIS, respectively, fall within previously published expected error bounds of +/-(0.05+0.2 × AOD), with a high correlation (R = 0.87). The scatter is not random, but exhibits a mean positive bias of ∼ 0.06 for Terra and ∼ 0.03 for Aqua. These biases for the 3km product are approximately 0.03 larger than the biases found in similar validations of the 10km product. The validation results for the 3km product did not have a relationship to aerosol loading (i.e., true AOD), but did exhibit dependence on quality flags, region, viewing geometry, and aerosol spatial variability. Time series of global MODIS-AERONET differences show that validation is not static, but has changed over the course of both sensors' lifetimes, with Terra MODIS showing more change over time. The likely cause of the change of validation over time is sensor degradation, but changes in the distribution of AERONET stations and differences in the global aerosol system itself could be contributing to the temporal variability of validation.

Gupta, Pawan↗
NASA NTRSDate not supplied

PRECiSA: a static analysis tool for floating-point programs

This presentation introduces PRECiSA, a static analysis framework for analyzing floating-point programs. PRECiSA computes round-off error bounds for a class of floating-point programs, and produces a formal proof certificate of the correctness of these bounds. PRECiSA also has the capability of generating C code which is instrumented to detect unstable branching conditions from a real-number algorithm specification.

Floating-point↗
NASA NTRSDate not supplied

A Proposed Clock Synchronization Method for the Solar System Internet

Networked communications in space are necessary to achieve scalability in terms of the number of communicating nodes but also in terms of the overall system complexity. A key component to such a system is the ability to synchronize clocks, which is the focus of this paper. The so-called Solar System Internet (SSI) will be built upon Delay Tolerant Networking (DTN), which, in analogy to the Internet Protocol (IP), can be considered a suite of protocols necessary for networking in the space domain. Therefore, our goal is to extend this suite to include a DTN clock synchronization capability, analogous to the Network Time Protocol (NTP) used in the Internet. A motivating example of a network in space is NASA’s LunaNet, a vision for a multi-hop multi-path network extending to the moon wherein not all nodes will have direct connections to an authoritative reference clock. In this paper, we propose a general clock synchronization methodology and algorithm that could be used for LunaNet as well as more elaborate time-varying networks. In recent years, DTN has benefited from modeling efforts founded on the mathematical tool of sheaves. Here we continue this work to provide an approach to clock synchronization. Due to the time-varying nature of space networks, absolute consensus is not possible. However, the sheaf Laplacian provides a practical, distributed approach to approximating consensus by allowing data to diffuse through the network. In particular, the sheaf Laplacian is readily computable, lending our approach to implementation. Our approach is well suited to handle the difficulties of space networks. For instance, differences in clock accuracy mean certain nodes are more authoritative than others; we can account for these differences through hierarchies in the network, generalizing the strata in NTP. Furthermore, just as error estimation is an integral part of NTP, we are able to give concrete error bounds for our approach. Indeed, different applications (e.g., communications schedules, pointing, navigation, distributed science) will have different requirements, hence it is necessary to maintain clocks within a given tolerance. We outline some of the necessary steps to turn our approach into a practical network protocol that could be used in DTN, and we conclude the paper with suggestions for future research.

Michael Moy↗
NASA NTRS1996

Bounds on Block Error Probability for Multilevel Concatenated Codes

Maximum likelihood decoding of long block codes is not feasable due to large complexity. Some classes of codes are shown to be decomposable into multilevel concatenated codes (MLCC). For these codes, multistage decoding provides good trade-off between performance and complexity. In this paper, we derive an upper bound on the probability of block error for MLCC. We use this bound to evaluate difference in performance for different decompositions of some codes. Examples given show that a significant reduction in complexity can be achieved when increasing number of stages of decoding. Resulting performance degradation varies for different decompositions. A guideline is given for finding good m-level decompositions.

Lin, Shu↗
NASA NTRS1975

Stochastic process approximation for recursive estimation with guaranteed bound on the error covariance

An approach, is proposed for the design of approximate, fixed order, discrete time realizations of stochastic processes from the output covariance over a finite time interval, was proposed. No restrictive assumptions are imposed on the process; it can be nonstationary and lead to a high dimension realization. Classes of fixed order models are defined, having the joint covariance matrix of the combined vector of the outputs in the interval of definition greater or equal than the process covariance; (the difference matrix is nonnegative definite). The design is achieved by minimizing, in one of those classes, a measure of the approximation between the model and the process evaluated by the trace of the difference of the respective covariance matrices. Models belonging to these classes have the notable property that, under the same measurement system and estimator structure, the output estimation error covariance matrix computed on the model is an upper bound of the corresponding covariance on the real process. An application of the approach is illustrated by the modeling of random meteorological wind profiles from the statistical analysis of historical data.

Menga, G.↗
NASA NTRS1988

A lower bound for the decoder error probability of the linear MDS code

A lower bound for the decoder error probability (P sub E (u)) of a linear maximum distance separable (MDS) code is derived by counting the dominant types of decoding words around code words. It is shown that the lower bound derived is similar in form, and close numerically, to the upper bound derived.

Cheung, K.-M.↗
NASA NTRS1998

Experimental Robust Control of Structural Acoustic Radiation

This work addresses the design and application of robust controllers for structural acoustic control. Both simulation and experimental results are presented. H(infinity) and mu-synthesis design methods were used to design feedback controllers which minimize power radiated from a panel while avoiding instability due to unmodeled dynamics. Specifically, high order structural modes which couple strongly to the actuator-sensor path were poorly modeled. This model error was analytically bounded with an uncertainty model, which allowed controllers to be designed without artificial limits on control effort. It is found that robust control methods provide the control designer with physically meaningful parameters with which to tune control designs and can be very useful in determining limits of performance. Experimental results also showed, however, poor robustness properties for control designs with ad-hoc uncertainty models. The importance of quantifying and bounding model errors is discussed.

Cox, David E.↗
NASA NTRS1988

Bounds of the bit error probability of a linear cyclic code over GF(2 exp l) and its extended code

An upper bound on the bit-error probability (BEP) of a linear cyclic code over GF(2 exp l) with hard-decision (HD) maximum-likelihood (ML) decoding on memoryless symmetric channels is derived. Performance results are presented for Reed-Solomon codes on GF(32), GF(64), and GF(128). Also, a union upper bound on the BEP of a linear cyclic code with either HD or soft-decision (SD) ML decoding is developed, as well as the corresponding bounds for the extended code of a linear cyclic code. Using these bounds, which are tight at low bit error rate, the performance advantage of SD and HD ML over bounded-distance decoding is established.

Cheng, Unjeng↗
NASA NTRS1984

A Very Efficient Transfer Function Bounding Technique on Bit Error Rate for Viterbi Decoded, Rate 1/N Convolutional Codes

For rate 1/N convolutional codes, a recursive algorithm for finding the transfer function bound on bit error rate (BER) at the output of a Viterbi decoder is described. This technique is very fast and requires very little storage since all the unnecessary operations are eliminated. Using this technique, we find and plot bounds on the BER performance of known codes of rate 1/2 with K 18, rate 1/3 with K 14. When more than one reported code with the same parameter is known, we select the code that minimizes the required signal to noise ratio for a desired bit error rate of 0.000001. This criterion of determining goodness of a code had previously been found to be more useful than the maximum free distance criterion and was used in the code search procedures of very short constraint length codes. This very efficient technique can also be used for searches of longer constraint length codes.

Lee, P. J.↗
NASA NTRS1987

An adaptive pseudo-spectral method for reaction diffusion problems

The spectral interpolation error was considered for both the Chebyshev pseudo-spectral and Galerkin approximations. A family of functionals I sub r (u), with the property that the maximum norm of the error is bounded by I sub r (u)/J sub r, where r is an integer and J is the degree of the polynomial approximation, was developed. These functionals are used in the adaptive procedure whereby the problem is dynamically transformed to minimize I sub r (u). The number of collocation points is then chosen to maintain a prescribed error bound. The method is illustrated by various examples from combustion problems in one and two dimensions.

Bayliss, A.↗
NASA NTRS1989

An adaptive pseudo-spectral method for reaction diffusion problems

The spectral interpolation error was considered for both the Chebyshev pseudo-spectral and Galerkin approximations. A family of functionals I sub r (u), with the property that the maximum norm of the error is bounded by I sub r (u)/J sub r, where r is an integer and J is the degree of the polynomial approximation, was developed. These functionals are used in the adaptive procedure whereby the problem is dynamically transformed to minimize I sub r (u). The number of collocation points is then chosen to maintain a prescribed error bound. The method is illustrated by various examples from combustion problems in one and two dimensions.

Bayliss, A.↗
NASA NTRS1983

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.↗
NASA NTRSDate not supplied

Design of Safe Separation Bounds for Temporally Deconflicted Trajectories Under Bounded Uncertainties

This paper explores the derivation of safe separation bounds for a heterogeneous group of~$n$ Uncrewed Aerial Systems (UAS) that are assigned temporally deconflicted trajectories. Compared to spatially deconflicted trajectories, temporal deconfliction can lead to higher traffic capacities and a more efficient use of the available airspace. One challenge with this type of deconfliction is that collisions can occur if some cooperating UAS are behind or ahead of schedule. To overcome this risk, this paper derives a lower bound on the safety distance between two heterogeneous UAS in the presence of bounded uncertainties. This safety distance can be leveraged to inform trajectory generation algorithms. The proposed bound establishes a rigorous safety margin when the fleet deviates from the planned trajectories, both temporally and spatially. For its derivation the paper assumes the UAS implement a distributed coordination algorithm that allows the fleet to maintain their schedules synchronized within a bounded temporal error, and a path-following algorithm that lets the vehicles track a target that moves along the planned trajectory with a bounded spatial error.

autonomy↗
NASA NTRS1972

IBM system/360 assembly language interval arithmetic software

Computer software designed to perform interval arithmetic is described. An interval is defined as the set of all real numbers between two given numbers including or excluding one or both endpoints. Interval arithmetic consists of the various elementary arithmetic operations defined on the set of all intervals, such as interval addition, subtraction, union, etc. One of the main applications of interval arithmetic is in the area of error analysis of computer calculations. For example, it has been used sucessfully to compute bounds on sounding errors in the solution of linear algebraic systems, error bounds in numerical solutions of ordinary differential equations, as well as integral equations and boundary value problems. The described software enables users to implement algorithms of the type described in references efficiently on the IBM 360 system.

Phillips, E. J.↗