Search NASA⌕ Search

SEARCH · Search NASA

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 1,117 records · Page 62

Spatially Accelerated Winding Numbers for Curved Geometry

The generalized winding number (GWN) is a scalar field that supports robust containment queries on curved geometry, including non-watertight, overlapping, and nested boundary representations. While queries can be easily parallelized over samples, direct evaluation on parametric curves and surfaces remains costly for large and complex models. Fast, state-of-the-art GWN approaches leverage a spatial index to approximate the GWN, typically coupled with a Taylor expansion which approximates the GWN contribution for far clusters of geometric primitives. However, such methods operate only on discrete inputs such as triangle meshes and point clouds, and would introduce containment errors near boundaries if applied to curved input. We extend support for fast GWN evaluation over arbitrary collections of NURBS curves in 2D and trimmed NURBS patches in 3D via a Bounding Volume Hierarchy that stores efficiently precomputed moment data in the hierarchy nodes. When querying the hierarchy, approximations for far clusters are used alongside direct evaluation for nearby NURBS primitives, achieving sub-linear complexity while preserving the geometric features in the vicinity of the query point. Central to our performance improvements is an adaptive subdivision strategy for NURBS primitives during a preprocessing phase, creating better spatial partitions while retaining the same accuracy for containment decisions as a direct evaluation. We demonstrate the performance and accuracy of our approach across a large collection of 2D and 3D datasets.

Computer science↗

Worst error performance of continuous Kalman filters

The worst error performance of estimation filters is investigated for continuous systems in this paper. The pathological performance study, without assuming any dynamical model such as Markov processes for perturbations, except for its bounded amplitude, will give practical and dependable criteria in establishing the navigation and maneuver strategy in deep space missions.

Nishimura, T.↗

Cockpit automation - In need of a philosophy

Concern has been expressed over the rapid development and deployment of automatic devices in transport aircraft, due mainly to the human interface and particularly the role of automation in inducing human error. The paper discusses the need for coherent philosophies of automation, and proposes several approaches: (1) flight management by exception, which states that as long as a crew stays within the bounds of regulations, air traffic control and flight safety, it may fly as it sees fit; (2) exceptions by forecasting, where the use of forecasting models would predict boundary penetration, rather than waiting for it to happen; (3) goal-sharing, where a computer is informed of overall goals, and subsequently has the capability of checking inputs and aircraft position for consistency with the overall goal or intentions; and (4) artificial intelligence and expert systems, where intelligent machines could mimic human reason.

Wiener, E. L.↗

Computational efficiency of parallel combinatorial OR-tree searches

The performance of parallel combinatorial OR-tree searches is analytically evaluated. This performance depends on the complexity of the problem to be solved, the error allowance function, the dominance relation, and the search strategies. The exact performance may be difficult to predict due to the nondeterminism and anomalies of parallelism. The authors derive the performance bounds of parallel OR-tree searches with respect to the best-first, depth-first, and breadth-first strategies, and verify these bounds by simulation. They show that a near-linear speedup can be achieved with respect to a large number of processors for parallel OR-tree searches. Using the bounds developed, the authors derive sufficient conditions for assuring that parallelism will not degrade performance and necessary conditions for allowing parallelism to have a speedup greater than the ratio of the numbers of processors. These bounds and conditions provide the theoretical foundation for determining the number of processors required to assure a near-linear speedup.

Li, Guo-Jie↗

An efficient approach to ARMA modeling of biological systems with multiple inputs and delays

This paper presents a new approach to AutoRegressive Moving Average (ARMA or ARX) modeling which automatically seeks the best model order to represent investigated linear, time invariant systems using their input/output data. The algorithm seeks the ARMA parameterization which accounts for variability in the output of the system due to input activity and contains the fewest number of parameters required to do so. The unique characteristics of the proposed system identification algorithm are its simplicity and efficiency in handling systems with delays and multiple inputs. We present results of applying the algorithm to simulated data and experimental biological data In addition, a technique for assessing the error associated with the impulse responses calculated from estimated ARMA parameterizations is presented. The mapping from ARMA coefficients to impulse response estimates is nonlinear, which complicates any effort to construct confidence bounds for the obtained impulse responses. Here a method for obtaining a linearization of this mapping is derived, which leads to a simple procedure to approximate the confidence bounds.

Non-NASA Center↗

Soil Moisture Initialization Error and Subgrid Variability of Precipitation in Seasonal Streamflow Forecasting

Offline simulations over the conterminous United States (CONUS) with a land surface model are used to address two issues relevant to the forecasting of large-scale seasonal streamflow: (i) the extent to which errors in soil moisture initialization degrade streamflow forecasts, and (ii) the extent to which a realistic increase in the spatial resolution of forecasted precipitation would improve streamflow forecasts. The addition of error to a soil moisture initialization field is found to lead to a nearly proportional reduction in streamflow forecast skill. The linearity of the response allows the determination of a lower bound for the increase in streamflow forecast skill achievable through improved soil moisture estimation, e.g., through satellite-based soil moisture measurements. An increase in the resolution of precipitation is found to have an impact on large-scale streamflow forecasts only when evaporation variance is significant relative to the precipitation variance. This condition is met only in the western half of the CONUS domain. Taken together, the two studies demonstrate the utility of a continental-scale land surface modeling system as a tool for addressing the science of hydrological prediction.

Streamflow Prediction↗

Predictive Modeling and Uncertainty Quantification in Condition Monitoring of Active Components: A Reactor Coolant Pump Use Case

This work develops data-driven models for onset of thermal barrier leakage in reactor coolant pumps. It incorporates uncertainty quantification to enhance the reliability and robustness of pre- dictions. Using synthetic data generated by the Generic Pressurized Water Reactor simulator, realistic degradation scenarios were simulated across lifecycle stages—beginning, middle, and end of life. Key variables, including differential pressure, flow rate, vibration, and temperatures, were analyzed using machine learning framework. The fully connected neural network models demonstrated exceptional performance, achieving R2 scores exceeding 0.99 and root mean square errors as low as around 8.23 × 10-2 gallon per minute (gpm) for the three stages of the lifecy- cle. UQ analysis further validated the model’s robustness, with narrow uncertainty bounds during steady-state operations and appropriately wider bounds during transitional phases, reflecting the physical behavior of the system. This work addresses important gaps in real-time condition moni- toring and regulatory compliance by integrating advanced condition monitoring technologies with UQ into IST programs. The ability to detect thermal barrier leakage early and quantify prediction reliability supports optimizing maintenance strategies while ensuring nuclear power plants’ safe and reliable operation.

99 - GENERAL AND MISCELLANEOUS↗

ON COMPUTING UPPER LIMITS TO SOURCE INTENSITIES

A common problem in astrophysics is determining how bright a source could be and still not be detected in an observation. Despite the simplicity with which the problem can be stated, the solution involves complicated statistical issues that require careful analysis. In contrast to the more familiar confidence bound, this concept has never been formally analyzed, leading to a great variety of often ad hoc solutions. Here we formulate and describe the problem in a self-consistent manner. Detection significance is usually defined by the acceptable proportion of false positives (background fluctuations that are claimed as detections, or Type I error), and we invoke the complementary concept of false negatives (real sources that go undetected, or Type II error), based on the statistical power of a test, to compute an upper limit to the detectable source intensity. To determine the minimum intensity that a source must have for it to be detected, we first define a detection threshold and then compute the probabilities of detecting sources of various intensities at the given threshold. The intensity that corresponds to the specified Type II error probability defines that minimum intensity and is identified as the upper limit. Thus, an upper limit is a characteristic of the detection procedure rather than the strength of any particular source. It should not be confused with confidence intervals or other estimates of source intensity. This is particularly important given the large number of catalogs that are being generated from increasingly sensitive surveys. We discuss, with examples, the differences between these upper limits and confidence bounds. Both measures are useful quantities that should be reported in order to extract the most science from catalogs, though they answer different statistical questions: an upper bound describes an inference range on the source intensity, while an upper limit calibrates the detection process. We provide a recipe for computing upper limits that applies to all detection algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Subsampling of Parametric Models with Bifidelity Boosting

Least squares regression is a ubiquitous tool for building emulators (a.k.a. surrogate models) of problems across science and engineering for purposes such as design space exploration and uncertainty quantification. When the regression data are generated using an experimental design process (e.g., a quadrature grid) involving computationally expensive models, or when the data size is large, sketching techniques have shown promise at reducing the cost of the construction of the regression model while ensuring accuracy comparable to that of the full data. However, random sketching strategies, such as those based on leverage scores, lead to regression errors that are random and may exhibit large variability. To mitigate this issue, we present a novel boosting approach that leverages cheaper, lower-fidelity data of the problem at hand to identify the best sketch among a set of candidate sketches. This in turn specifies the sketch of the intended high-fidelity model and the associated data. We provide theoretical analyses of this bifidelity boosting (BFB) approach and discuss the conditions the low- and high-fidelity data must satisfy for a successful boosting. In doing so, we derive a bound on the residual norm of the BFB sketched solution relating it to its ideal, but computationally expensive, high-fidelity boosted counterpart. Finally, empirical results on both manufactured and PDE data corroborate the theoretical analyses and illustrate the efficacy of the BFB solution in reducing the regression error, as compared to the nonboosted solution.

97 MATHEMATICS AND COMPUTING↗

Genetic algorithm optimization of a chemical kinetic mechanism for propane at engine relevant conditions

Propane has demonstrated significant potential for reductions in greenhouse gas and pollutant emissions in medium- and heavy-duty engine applications, but further improvements require accurate, compact, and scalable chemical kinetic mechanisms to design the next generation of propane fueled engines, particularly at the boosted operating conditions necessary to meet the power density demand of medium- and heavy-duty applications. In this work, six key chemical reactions were identified in a reduced mechanism with 70 species and 352 reactions through a sensitivity analysis performed at conditions typical of thermodynamic trajectories observed in a high compression ratio, long stroke engine operated on propane from throttled to boosted operating conditions. While the original mechanism was validated against rapid compression machine (RCM) data, it was found to overpredict experimental autoignition tendencies in 2-zone, 0-D SI engine simulations performed in Chemkin Pro. Subsequently, a genetic algorithm approach was used to optimize the six reaction rate parameters within established uncertainty bounds by performing RCM simulations and comparing to two independent sets of literature ignition delay times for propane, thus generating two new kinetic mechanisms. The first optimization achieved a mean absolute percent error (MPE) reduction in 2nd stage ignition delay of 61.4% in seven generations, while the second optimization utilized a newer experimental RCM dataset, and achieved MPE reduction of 56.7% in seven generations, and further marginal improvement to 57.8% reduction in 34 generations. Finally, the two mechanisms were then evaluated again in the 2-zone 0-D SI engine model in Chemkin Pro comparing typical mean and knocking cycle trajectories, and it was found that the second optimized mechanism provided better prediction of knock onset at the representative conditions evaluated in this work, particularly for higher load operating conditions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Holographic dark energy in a universe with spatial curvature and massive neutrinos: a full Markov Chain Monte Carlo exploration

In this paper, we report the results of constraining the holographic dark energy model with spatial curvature and massive neutrinos, based on a Markov Chain Monte Carlo global fit technique. The cosmic observational data include the full WMAP 7-yr temperature and polarization data, the type Ia supernova data from Union2.1 sample, the baryon acoustic oscillation data from SDSS DR7 and WiggleZ Dark Energy Survey, and the latest measurements of H{sub 0} from HST. To deal with the perturbations of dark energy, we adopt the parameterized post-Friedmann method. We find that, for the simplest holographic dark energy model without spatial curvature and massive neutrinos, the phenomenological parameter c < 1 at more than 4σ confidence level. The inclusion of spatial curvature enlarges the error bars and leads to c < 1 only in about 2.5σ range; in contrast, the inclusion of massive neutrinos does not have significant influence on c. We also find that, for the holographic dark energy model with spatial curvature but without massive neutrinos, the 3σ error bars of the current fractional curvature density Ω{sub k0} are still in order of 10{sup −2}; for the model with massive neutrinos but without spatial curvature, the 2σ upper bound of the total mass of neutrinos is Σm{sub ν} < 0.48 eV. Moreover, there exists clear degeneracy between spatial curvature and massive neutrinos in the holographic dark energy model, which enlarges the upper bound of Σm{sub ν} by more than 2 times. In addition, we demonstrate that, making use of the full WMAP data can give better constraints on the holographic dark energy model, compared with the case using the WMAP ''distance priors''.

79 ASTRONOMY AND ASTROPHYSICS↗

Structure of the Majorana Clifford group

In quantum information science, Clifford operators and stabilizer codes play a central role for systems of qubits (or qudits). In this study, we study their analogs for systems composed of Majorana fermions. In this case, a crucial role is played by fermion parity symmetry, which is an unbreakable symmetry present in any system with fundamentally fermionic degrees of freedom. We prove that the subgroup of parity-preserving Majorana Cliffords can be represented by the orthogonal group over the binary field 𝔽 2 , and we show how it can be generated by braiding operators and used to construct any (even-parity) Majorana stabilizer code. We also analyze the frame potential for this so-called p-Clifford group when acting on a fixed-parity sector of the Hilbert space, proving that it is equivalent to the frame potential of the ordinary Clifford group acting on the same sector.

Computational complexity↗

Error reduction program: A progress report

Five finite differences schemes were evaluated for minimum numerical diffusion in an effort to identify and incorporate the best error reduction scheme into a 3D combustor performance code. Based on this evaluated, two finite volume method schemes were selected for further study. Both the quadratic upstream differencing scheme (QUDS) and the bounded skew upstream differencing scheme two (BSUDS2) were coded into a two dimensional computer code and their accuracy and stability determined by running several test cases. It was found that BSUDS2 was more stable than QUDS. It was also found that the accuracy of both schemes is dependent on the angle that the streamline make with the mesh with QUDS being more accurate at smaller angles and BSUDS2 more accurate at larger angles. The BSUDS2 scheme was selected for extension into three dimensions.

Syed, S. A.↗

Error control techniques for satellite and space communications

The performance of bandwidth efficient trellis inner codes using two-dimensional MPSK signal constellations in a NASA concatenated coding is summarized. Work was also continued on trellis coded modulation using multi-dimensional signal sets. Achievable lower bounds on free distance trellis codes were proved and the existence of good trellis coded modulation (TCM) schemes were established for a variety of signal constellations. The performance of TCM schemes on fading channels is being investigated. Preliminary results indicate that bandwidth efficient trellis coding is feasible on such channels, but that the important design parameter is no longer the minimum free Euclidean distance.

Costello, Daniel J., Jr.↗

Non-intrusive reduced order modeling of natural convection in porous media using convolutional autoencoders: Comparison with linear subspace techniques

Natural convection in porous media is a highly nonlinear multiphysical problem relevant to many engineering applications (e.g., the process of CO 2 sequestration). Here, we extend and present a non-intrusive reduced order model of natural convection in porous media employing deep convolutional autoencoders for the compression and reconstruction and either radial basis function (RBF) interpolation or artificial neural networks (ANNs) for mapping parameters of partial differential equations (PDEs) on the corresponding nonlinear manifolds. To benchmark our approach, we also describe linear compression and reconstruction processes relying on proper orthogonal decomposition (POD) and ANNs. Further, we present comprehensive comparisons among different models through three benchmark problems. The reduced order models, linear and nonlinear approaches, are much faster than the finite element model, obtaining a maximum speed-up of 7 × 10 6 because our framework is not bound by the Courant–Friedrichs–Lewy condition; hence, it could deliver quantities of interest at any given time contrary to the finite element model. Our model’s accuracy still lies within a relative error of 7% in the worst-case scenario. We illustrate that, in specific settings, the nonlinear approach outperforms its linear counterpart and vice versa. We hypothesize that a visual comparison between principal component analysis (PCA) and t-Distributed Stochastic Neighbor Embedding (t-SNE) could indicate which method will perform better prior to employing any specific compression strategy.

97 MATHEMATICS AND COMPUTING↗

Mercury's Global Topography from Radar Ranging Data

When Mercury's radius is expanded in Legendre functions to the second degree and order, the systematic error in radar ranging data is reduced substantially. Previously, data spanning an observing interval from 1966 to 1990 were used to infer an equatorial ellipticity (a - b)/a = (540 +/- 54) X 10(exp -6) and a center-of-figure minus center-of-mass offset of (640 +/- 78) m. The magnitude of this equatorial center of figure offset implies an excess crustal thickness of 12 km or less, comparable to the Moon's excess. By comparing the equatorial ellipticity with the Mariner 10 gravity field, and assuming Airy isostatic compensation, bounds on crustal thickness can be derived. Mercury's crustal thickness is in the range from 100 to 300 km. The Mercury radar ranging observing interval has been extended from 1966 to the present. In addition, improvements in data reduction techniques have resulted in a set of Mercury ranging data less affected by systematic error, in particular the biases introduced by local topographic variations. We use this new set of reduced ranging data to improve Mercury's global topography and center-of-figure minus center-of-mass offset. New results on crustal thickness are derived, and prospects for further improvement with Mercury Orbiter data are discussed.

Anderson, J. D.↗

Determining an unknown state of a high-dimensional quantum system with a single, factorized observable

One can uniquely identify an unknown state of a quantum system S by measuring a ''quorum'' consisting of a complete set of noncommuting observables. It is also possible to determine the quantum state by repeated measurements of a single and factorized observable, when the system S is coupled to an assistant system A whose initial state is known. This is because that the redistribution of the information about the unknown quantum state into the composite system A+S results in a one-to-one mapping between the unknown density matrix elements and the probabilities of the occurrence of the eigenvalues of a single, factorized observable of the composite system. Here we focus on quantum state tomography of high-dimensional quantum systems (e.g., a spin greater than 1/2) via a single observable. We determine the condition for the best determination and the upper bound to achieve the most robust measurements. From the experimental view we require a suitable interaction Hamiltonian to maximize the measure efficiency. For this we numerically investigate a three-level system. Moreover, the error analysis for the different-dimensional quantum states shows that the present measurement method is still very effective in determining an unknown state of a high-dimensional quantum system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗