Search NASA⌕ Search

SEARCH · Search NASA

Results for “upper bounds”

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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
NASA NTRS2010

A Computational Framework to Control Verification and Robustness Analysis

This paper presents a methodology for evaluating the robustness of a controller based on its ability to satisfy the design requirements. The framework proposed is generic since it allows for high-fidelity models, arbitrary control structures and arbitrary functional dependencies between the requirements and the uncertain parameters. The cornerstone of this contribution is the ability to bound the region of the uncertain parameter space where the degradation in closed-loop performance remains acceptable. The size of this bounding set, whose geometry can be prescribed according to deterministic or probabilistic uncertainty models, is a measure of robustness. The robustness metrics proposed herein are the parametric safety margin, the reliability index, the failure probability and upper bounds to this probability. The performance observed at the control verification setting, where the assumptions and approximations used for control design may no longer hold, will fully determine the proposed control assessment.

Crespo, Luis G.↗
NASA NTRS1975

Improved upper limit on the photon rest mass

It is shown that application of standard MHD arguments to hydromagnetic waves observed in the Crab Nebula dramatically improves the upper bound on photon rest mass. The standard argument that massive photons are governed by the Phoca field equations is outlined and applied to wisp features (identified as hydromagnetic waves) observed in the Crab. The results imply an upper limit for the photon rest mass of between 3 by 10 to the -54th power and 3 by 10 to the -53rd power gram, which is smaller than the best previous limits by a factor of 10,000 to 100,000. It is noted that although the present limit is probably valid in order of magnitude, some doubt remains since there are inconsistencies in the standard arguments.

Barnes, A.↗
NASA NTRS1991

Analysis of upper and lower bounds of the frame noise in linear detector arrays

This paper estimates the upper and lower bounds of the frame noise of a linear detector array that uses a one-dimensional scan pattern. Using chi-square distribution, it is analytically shown why it is necessary to use the average of the variances and not the average of the standard deviations to estimate these bounds. Also, a criteria for determining whether any excessively noisy lines exist among the detectors is derived from these bounds. Using a Gaussian standard random variable generator, these bounds are demonstrated to be accurate within the specified confidence interval. A silicon detector array is then used for actual dark current measurements. The criterion developed for determination of noisy detectors is checked on the experimentally obtained data.

Jaggi, S.↗
DOE OSTI2026

Quantum Routing and Entanglement Dynamics Through Bottlenecks

To implement arbitrary quantum circuits in architectures with restricted interactions, one may effectively simulate all-to-all connectivity by routing quantum information. We consider the entanglement dynamics and routing between two regions only connected through an intermediate “bottleneck” region with few qubits. In such systems, where the entanglement rate is restricted by a vertex boundary rather than an edge boundary of the underlying interaction graph, existing results such as the small incremental entangling theorem give only a trivial constant lower bound on the routing time (the minimum time to perform an arbitrary permutation). We significantly improve the lower bound on the routing time in systems with a vertex bottleneck. Specifically, for any system with two regions 𝐿,𝑅 with 𝑁 𝐿 ,𝑁 𝑅 qubits, respectively, coupled only through an intermediate region 𝐶 with 𝑁 𝐶 qubits, for any 𝛿 > 0 we show a lower bound of Ω⁢(𝑁$^{1−𝛿}_{𝑅}$/√𝑁 𝐿⁢ 𝑁 𝐶 ) on the Hamiltonian quantum routing time when using piecewise time-independent Hamiltonians, or time-dependent Hamiltonians subject to a smoothness condition. We also prove an upper bound on the average amount of bipartite entanglement between 𝐿 and 𝐶,𝑅 that can be generated in time 𝑡 by such architecture-respecting Hamiltonians in systems constrained by vertex bottlenecks, improving the scaling in the system size from 𝑂⁡(𝑁 𝐿⁢ 𝑡) to 𝑂⁡(√𝑁 𝐿⁢ 𝑡). As a special case, when applied to the star graph (i.e., one vertex connected to 𝑁 leaves), we obtain an Ω⁡(√𝑁 1−𝛿 ) lower bound on the routing time and on the time to prepare 𝑁/2 Bell pairs between the vertices. We also show that, in systems of free particles, we can route optimally on the star graph in time Θ⁡(√𝑁) using Hamiltonian quantum routing, obtaining a speedup over gate-based routing, which takes time Θ⁡(𝑁).

97 MATHEMATICS AND COMPUTING↗
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 NTRS2007

Robust Design Optimization via Failure Domain Bounding

This paper extends and applies the strategies recently developed by the authors for handling constraints under uncertainty to robust design optimization. For the scope of this paper, robust optimization is a methodology aimed at problems for which some parameters are uncertain and are only known to belong to some uncertainty set. This set can be described by either a deterministic or a probabilistic model. In the methodology developed herein, optimization-based strategies are used to bound the constraint violation region using hyper-spheres and hyper-rectangles. By comparing the resulting bounding sets with any given uncertainty model, it can be determined whether the constraints are satisfied for all members of the uncertainty model (i.e., constraints are feasible) or not (i.e., constraints are infeasible). If constraints are infeasible and a probabilistic uncertainty model is available, upper bounds to the probability of constraint violation can be efficiently calculated. The tools developed enable approximating not only the set of designs that make the constraints feasible but also, when required, the set of designs for which the probability of constraint violation is below a prescribed admissible value. When constraint feasibility is possible, several design criteria can be used to shape the uncertainty model of performance metrics of interest. Worst-case, least-second-moment, and reliability-based design criteria are considered herein. Since the problem formulation is generic and the tools derived only require standard optimization algorithms for their implementation, these strategies are easily applicable to a broad range of engineering problems.

Crespo, Luis G.↗
NASA NTRS1988

Effect of a shallow low-viscosity zone on the formation of midplate swells

A finite-element numerical method is used here to analyze the effect of a low-viscosity zone on convection driven by heating from below in the upper mantle, in particular on the formation of midplate swells. The convective temperature and velocity solutions are calculated for different combinations of the viscosity in the top layer, the fluid layer thicknesses, and the Rayleigh number based on the viscosity in the bottom layer. The temperature solutions are used to calculate the geoid, topography, and heat flow anomalies, the elastic plate thickness, the depth of compensation, and an upper bound on the uplift time that result from the flow. The results are compared to data at the Hawaii, Bermuda, Cape Verde, and Marquesas swells. The magnitudes and the trend with age are consistent with theoretical and other estimates of the viscosity variation in the shallow upper mantle. Convective models can therefore explain the uplift and observed anomalies at midplate swells.

Robinson, E. M.↗
NASA NTRS2021

On the origin & thermal stability of Arrokoth's and Pluto's ice

In this paper we discuss in a thermodynamic, geologically empirical way the long-term nature of the stable majority ices that could be present in Kuiper Belt object (KBO) 2014 MU69 (also called Arrokoth; hereafter “MU(69)”) after its 4.6 Gyr residence in the Edgeworth-Kuiper belt (EKB) as a cold classical object. We compare the upper bounds for the gas production rate (~10^(24) molecules/s) measured by the New Horizons (NH) spacecraft flyby on 01 Jan 2019 to estimates for the outgassing flux rates from a suite of common cometary and KBO ices at the average ~ 40 K sunlit surface temperature of MU69, but do not find the upper limit very constraining except for the most volatile of species (e.g. CO, N2, CH4). More constraining is the stability versus sublimation into vacuum requirement over Myr to Gyr, and from this we find only 3 common ices that are truly refractory: HCN, CH3OH, and H2O (in order of increasing stability), while NH3 and H2CO ices are marginally stable and may be removed by any positive temperature excursions in the EKB, as produced every 10^(8)–10^(9) years by nearby supernovae and passing O/B stars. To date the NH team has reported the presence of abundant CH3OH and H2O on MU69's surface (Stern et al., 2019; Grundy et al., 2020). NH3 has been searched for, but not found. We predict that future absorption feature detections, if any are ever derived from higher signal-to-noise ratio spectra, will be due to an HCN or poly-H2CO based species. Consideration of the conditions present in the EKB region during the formation era of MU69 lead us to state that it is highly likely that it “formed in the dark”, in an optically thick mid-plane, unable to see the nascent, variable, highly luminous Young Stellar Object (YSO)/TTauri Sun, and that KBOs contain HCN and CH3OH ice phases in addition to the H2O ice phases found in their short period (SP) comet descendants. Finally, when we apply our ice thermal stability analysis to bodies/populations related to MU69, we find that methanol ice is likely ubiquitous in the outer solar system; that if Pluto isn't a fully differentiated body, then it must have gained its hypervolatile ices from proto-planetary disk (PPD) sources in the first few Myr of the solar system's existence; and that hypervolatile rich, highly primordial comet C/2016 R2 was placed onto an Oort Cloud orbit on a similar few Myr timescale.

Pluto↗
NASA NTRS1988

A communication channel model of the software process

Beginning research into a noisy communication channel analogy of software development process productivity, in order to establish quantifiable behavior and theoretical bounds is discussed. The analogy leads to a fundamental mathematical relationship between human productivity and the amount of information supplied by the developers, the capacity of the human channel for processing and transmitting information, the software product yield (object size) the work effort, requirements efficiency, tool and process efficiency, and programming environment advantage. An upper bound to productivity is derived that shows that software reuse is the only means that can lead to unbounded productivity growth; practical considerations of size and cost of reusable components may reduce this to a finite bound.

Tausworthe, Robert C.↗
NASA NTRS2023

A Confidence-Based Approach to Including Survivors in a Probabilistic TID Failure Assessment

A probabilistic total ionizing dose (TID) failure assessment is extended to include survivor data, enabling the bounding of failure probability to a desired confidence level (CL) without failure data. The extension provides an avenue for analyzing microelectronics tested for TID without reaching a failure mode, a scenario often encountered by missions utilizing commercial-off-the-shelf (COTS) technologies. Using the type-I censored likelihood formulation and a realistic upper bound on expected device performance, the failure probability space is bounded by confidence contours within the context of a variable environment. The framework accommodates any type of distribution assumed for the part failure or the environment under consideration. Furthermore, the framework can be utilized pre-emptively to plan future device TID tests, minimizing costs while meeting survival requirements. Heritage data may also be used as survivors to further minimize testing costs when parts are from the same lot, but the amount of constraint derived from heritage is limited. Altogether, the framework enables a formal, mathematically rigorous analysis of radiation tolerant devices tested to a maximum dose, as well as flight heritage, in a hardness assurance methodology.

confidence↗
NASA NTRS1988

A communication channel model of the software process

Reported here is beginning research into a noisy communication channel analogy of software development process productivity, in order to establish quantifiable behavior and theoretical bounds. The analogy leads to a fundamental mathematical relationship between human productivity and the amount of information supplied by the developers, the capacity of the human channel for processing and transmitting information, the software product yield (object size), the work effort, requirements efficiency, tool and process efficiency, and programming environment advantage. Also derived is an upper bound to productivity that shows that software reuse is the only means than can lead to unbounded productivity growth; practical considerations of size and cost of reusable components may reduce this to a finite bound.

Tausworthe, R. C.↗
NASA NTRS2009

Bounded Linear Stability Analysis - A Time Delay Margin Estimation Approach for Adaptive Control

This paper presents a method for estimating time delay margin for model-reference adaptive control of systems with almost linear structured uncertainty. The bounded linear stability analysis method seeks to represent the conventional model-reference adaptive law by a locally bounded linear approximation within a small time window using the comparison lemma. The locally bounded linear approximation of the combined adaptive system is cast in a form of an input-time-delay differential equation over a small time window. The time delay margin of this system represents a local stability measure and is computed analytically by a matrix measure method, which provides a simple analytical technique for estimating an upper bound of time delay margin. Based on simulation results for a scalar model-reference adaptive control system, both the bounded linear stability method and the matrix measure method are seen to provide a reasonably accurate and yet not too conservative time delay margin estimation.

Nguyen, Nhan T.↗
DOE OSTI2026

Strong-Drive Limits in Josephson Circuits: From Chaos to an Unbound-Resonance Threshold

Strong microwave drives enable fast measurement and parametric control in superconducting circuits but can induce transitions out of the intended low-energy manifold. We develop a unified description of strong-drive limits in flux- and charge-driven Josephson circuits across drive frequency and dc flux bias. Using classical phase-space analysis and Floquet--Markov simulations, we identify distinct low- and high-frequency mechanisms. At low frequency, we characterize bound-state resonances and separatrix chaos and find that the flux-drive chaos threshold depends strongly on dc flux bias. At high frequency, these mechanisms are suppressed, and the dissipative steady state transfers from the central bound-state sector to outer resonances formed by above-barrier running trajectories. The resulting unbound-resonance threshold is nearly independent of drive frequency and circuit parameters over the regime studied and is controlled primarily by dc flux bias. Coherent simulations show that parametric operation persists beyond this threshold, but at a reduced rate, setting an effective upper bound on the achievable operation speed. We derive analytical criteria for both thresholds, validate them numerically, and experimentally confirm the predicted dc-bias dependence of the low-frequency threshold in a flux-driven SQUID. We also determine the timescales for transfer into the unbound-resonance regime and relaxation back to the bound-state manifold after the drive is removed. Finally, we relate the stability limits to a complementary picture based on the junction critical current and extend the framework to multitone drives and inductively shunted circuits. Together, these results identify the mechanisms limiting strong driving and suggest routes to extend the stable operating range of Josephson circuits.

You, Xinyuan [Fermilab] (ORCID:0000000291789419)↗
DOE OSTI2024

HP-FLEX MPC v0.1.0

HP-FLEX MPC is control software developed by Lawrence Berkeley National Laboratory with support from the California Energy Commission (CEC) through EPIC-19-301. HP-FLEX aims to provide load flexibility for heat pumps (HPs) in response to dynamic grid signals (including Time-of-Use, Dynamic Pricing, and Critical Peak Pricing) while maintaining thermostat temperatures within user-specified bounds. The software includes a system-identification module, which models the dynamics of the building envelope with thermostat data, and a control module based on a model predictive controller (MPC) to make optimal decisions. HP-FLEX receives forecasts of outdoor air temperature, solar irradiation, and internal gain (if available), as well as trajectories of energy price, temperature lower and upper bounds over a prediction horizon. It then optimizes heating and cooling capacities to minimize energy cost and peak power (with a user-defined weight on peak power) over the prediction horizon, while maintaining room air temperature within the temperature constraints, and outputs the optimal thermostat setpoints.

Kim, Donghun↗
NASA NTRS1974

Studies of heat source driven natural convection

Natural convection energy transport in a horizontal layer of internally heated fluid with a zero heat flux lower boundary, and an isothermal upper boundary, has been studied. Quantitative information on the time-mean temperature distribution and the fluctuating component of temperature about the mean temperature in steady turbulent convection are obtained from a small thermocouple inserted into the layer through the upper bounding plate. Data are also presented on the development of temperature at several vertical positions when the layer is subject to both a sudden increase and to a sudden decrease in power input. For changes of power input from zero to a value corresponding to a Rayleigh number much greater than the critical linear stability theory value, a slight hysteresis in temperature profiles near the upper boundary is observed between the heat-up and cool-down modes.

Kulacki, F. A.↗
DOE OSTI2026

Assessment of the Loss of Vacuum on the Local Metal Temperature in the TEX Experiment Assembly

A four-part assessment using analytical methods and semi-analytical simulation tools finds that the maximum temperature variation in the highly enriched uranium (HEU) Jemima plate assembly is less than ten Kelvin (< 10 K) in an abrupt loss of vacuum scenario. The temperature variation in the metals is likely to be one to four Kelvin (1 K – 4 K) based on the most realistic conditions in the assessment. The four assessment parts include: (1) the peak gas temperature bound for the initial influx of the ambient air; (2) the high-heat transfer limit during the high-speed forced convection period in an insulated HEU plate; (3) the high-heat transfer limit during the high-speed forced convection period with aluminum spacers; and (4) the longer-time thermal equilibration period between the air and metal stack. The four-part assessment serves as conservative upper bound on the temperature variation in the metal stack and remains well below the 40 Kelvin limit where the temperature-induced stresses could lead to permanent, plastic deformation.

42 ENGINEERING↗
DOE OSTI2025

Bounding entanglement entropy with Clifford double cosets

Following on our previous work studying the orbits of quantum states under Clifford circuits via reachability graphs, we introduce contracted graphs whose vertices represent classes of quantum states with the same entropy vector. These contracted graphs represent the double cosets of the Clifford group, where the left cosets are built from the stabilizer subgroup of the starting state and the right cosets are built from the entropy-preserving operators. We study contracted graphs for stabilizer states, as well as 𝑊 states and Dicke states, discussing how the diameter of a state's contracted graph constrains the entropic diversity of its two-qubit Clifford orbit. We derive an upper bound on the number of entropy vectors that can be generated using any 𝑛-qubit Clifford circuit, for any quantum state. Here, we speculate on the holographic implications for the relative proximity of gravitational duals of states within the same Clifford orbit. Although we concentrate on how entropy evolves under the Clifford group, our double-coset formalism, and thus the contracted graph picture, is extendable to generic gate sets and generic state properties.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1987

WHAMII - An enumeration and insertion procedure with binomial bounds for the stochastic time-constrained traveling salesman problem

This paper presents an algorithm (WHAMII) designed to solve the Artificial Intelligence Design Challenge at the 1987 AIAA Guidance, Navigation and Control Conference. The problem under consideration is a stochastic generalization of the traveling salesman problem in which travel costs can incur a penalty with a given probability. The variability in travel costs leads to a probability constraint with respect to violating the budget allocation. Given the small size of the problem (eleven cities), an approach is considered that combines partial tour enumeration with a heuristic city insertion procedure. For computational efficiency during both the enumeration and insertion procedures, precalculated binomial probabilities are used to determine an upper bound on the actual probability of violating the budget constraint for each tour. The actual probability is calculated for the final best tour, and additional insertions are attempted until the actual probability exceeds the bound.

Dahl, Roy W.↗