Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “inequality”

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 145 records · Page 8

Locality in collider tests of quantum mechanics with top quark pairs

Tests of quantum properties of fundamental particles in high energy colliders are starting to appear. Entanglement and Bell inequality violation in top and antitop quark system is of particular interest since top quarks are unstable particles that undergo a cascade decay. We argue for criteria for the spacelike separation between top and antitop quarks at their different decay stages. We considered causal separation at three different instances: at the top quark decay, at the 𝑊 boson decay, and at the lepton/jet contact with the macroscopic apparatus. We showed that the spacelike fraction of events is the smallest, when requiring that both top quarks and 𝑊 bosons decay within the spacelike interval. For high invariant masses, typically required for the Bell inequality violation, this is almost identical to just the top quark decay requirement. We also include an option for the angular correlation of the 𝑏 quarks from top quark decay to be used for the spin correlation measurement. We require that both top quark and 𝑏 hadron decays are spacelike separated. Again, we find that at high invariant masses it is almost identical to just the requirement of spacelike separation between top and antitop quarks. We provide numerical values for our proposed criteria. If such a criterion is satisfied, the system is guaranteed to not be in a causal connection.

Entanglement in field theory↗

Universal Bound on Effective Central Charge and Its Saturation

The effective central charge (denoted by 𝑐 eff ) is a measure of entanglement through a conformal interface, while the transmission coefficient (encoded in the coefficient 𝑐 𝐿⁢𝑅 of the two-point function of the energy-momentum tensor across the interface) is a measure of energy transmission through the interface. It has been pointed out that these two are generally different. In this Letter, we propose the inequalities, 0 ≤ 𝑐 𝐿⁢𝑅 ≤ 𝑐 eff ≤ min⁡(𝑐 𝐿 ,𝑐 𝑅 ). They have the simple but important implication that the amount of energy transmission can never exceed the amount of information transmission. We verify them using the AdS/CFT correspondence, using the perturbation method, and in examples beyond holography. We also show that these inequalities are sharp by constructing a class of interfaces that saturate them.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Mutual information bounded by Fisher information

We derive a general upper bound to mutual information in terms of the Fisher information. The bound may be further used to derive a lower bound for the Bayesian quadratic cost. These two provide alternatives to other inequalities in the literature (e.g., the van Trees inequality) that are useful also for cases where the latter ones give trivial bounds. We then generalize them to the quantum case, where they bound the Holevo information in terms of the quantum Fisher information. We illustrate the usefulness of our bounds with a case study in quantum phase estimation. Here, they allow us to adapt to mutual information (useful for global strategies where the prior plays an important role), the known and highly nontrivial bounds for the Fisher information in the presence of noise. The results are also useful in the context of quantum communication, both for continuous and discrete alphabets. Published by the American Physical Society 2025

97 MATHEMATICS AND COMPUTING↗

A Comprehensive Analysis of Uncertainties in Warm-Rain Parameterizations in Climate Models Based on In Situ Measurements

Abstract Because of the coarse grid size of Earth system models (ESMs), representing warm-rain processes in ESMs is a challenging task involving multiple sources of uncertainty. Previous studies evaluated warm-rain parameterizations mainly according to their performance in emulating collision–coalescence rates for local droplet populations over a short period of a few seconds. The representativeness of these local process rates comes into question when applied in ESMs for grid sizes on the order of 100 km and time steps on the order of 20–30 min. We evaluate several widely used warm-rain parameterizations in ESM application scenarios. In the comparison of local and instantaneous autoconversion rates, the two parameterization schemes based on numerical fitting to stochastic collection equation (SCE) results perform best. However, because of Jessen’s inequality, their performance deteriorates when grid-mean, instead of locally resolved, cloud properties are used in their simulations. In contrast, the effect of Jessen’s inequality partly cancels the overestimation problem of two semianalytical schemes, leading to an improvement in the ESM-like comparison. In the assessment of uncertainty due to the large time step of ESMs, it is found that the rainwater tendency simulated by the SCE is roughly linear for time steps smaller than 10 min, but the nonlinearity effect becomes significant for larger time steps, leading to errors up to a factor of 4 for a time step of 20 min. After considering all uncertainties, the grid-mean and time-averaged rainwater tendency based on the parameterization schemes is mostly within a factor of 4 of the local benchmark results simulated by SCE.

Meteorology & Atmospheric Sciences↗

Cylinders’ percolation: Decoupling and applications

In this paper we establish a strong decoupling inequality for the cylinder’s percolation process introduced by Tykesson and Windisch (Probab. Theory Related Fields 154 (2012) 165–191). This model features a very strong dependency structure, making it difficult to study, and this is why such decoupling inequalities are desirable. It is important to notice that the type of dependencies featured by cylinder’s percolation is particularly intricate, given that the cylinders have infinite range (unlike some models like Boolean percolation) while at the same time being rigid bodies (unlike processes such as random interlacements). Here our work introduces a new notion of fast decoupling, proves that it holds for the model in question and finishes with an application. More precisely, we prove that for a small enough density of cylinders, a random walk on a connected component of the vacant set is transient for all dimensions d≥3.

97 MATHEMATICS AND COMPUTING↗

Computational work and time on finite machines.

Measures of the computational work and computational delay required by machines to compute functions are given. Exchange inequalities are developed for random access, tape, and drum machines to show that product inequalities between storage and time, number of drum tracks and time, number of bits in an address and time, etc., must be satisfied to compute finite functions on bounded machines.

Savage, J. E.↗

Function space quasi-Newton algorithms for optimal control problems with bounded controls and singular arcs

Two existing function space algorithms, Davidon and projected gradient, are modified so that they may handle directly control variable inequality constraints. A third quasi-Newton type algorithm developed by C. G. Broyden is extended to optimal control problems. The Broyden algorithm is further modified so that it also may handle directly control variable inequality constraints. These methods along with a pure gradient and two conjugate gradient algorithms are simulated on three relatively simple yet representative bounded control problems, two of which have singular subarcs. Overall the Broyden algorithm was found to be superior. The most notable result of the study was the clear superiority of the Broyden and Davidon algorithms in producing a sharp interior control subarc.

Edge, E. R.↗

On the fractional weight of distinct binary n-tuples

It is shown that the fraction p of ones in the Mn positions of M distinct binary n-tuples satisfies a given inequality. This inequality, which simplifies the derivation of the distance property of the Justesen codes, is proved using an elegant information-theoretic argument due to Kriz.

Massey, J. L.↗

Steady state decoupling and design of linear multivariable systems

A constructive criterion for decoupling the steady states of linear multivariable systems is developed. The criterion consists of n(n-1) inequalities with the type numbers of the compensator transfer functions as the unknowns. These unknowns can be chosen to satisfy the inequalities and hence achieve a steady state decoupling scheme. It turns out that pure integrators in the loops play an important role. An extended root locus design method is then developed to take care of the stability and transient response. The overall procedure is applied to the compensation design for STOL C-8A aircraft in the approach mode.

Huang, J. Y.↗

Optimal rocket thrust profile shaping using third degree spline function interpolation

Optimal solid-rocket thrust profiles for the parallel-burn, solid-rocket-assisted space shuttle are investigated. Solid-rocket thrust profiles are simulated by using third-degree spline functions, with the values of the thrust ordinates defined as parameters. The profiles are optimized parametrically, using the Davidon-Fletcher-Powell penalty function method, by minimizing propellant weight subject to state and control inequality constraints and to terminal boundary conditions. This study shows that optimizing a control variable parametrically by using third-degree spline function interpolation allows the control to be shaped so that inequality constraints are strictly adhered to and all corners are eliminated. The absence of corners, which is realistic in nature, makes this method attractive from the viewpoint of solid rocket grain design.

Johnson, I. L.↗

Function-space quasi-Newton algorithms for optimal control problems with bounded controls and singular arcs

Two existing function-space quasi-Newton algorithms, the Davidon algorithm and the projected gradient algorithm, are modified so that they may handle directly control-variable inequality constraints. A third quasi-Newton-type algorithm, developed by Broyden, is extended to optimal control problems. The Broyden algorithm is further modified so that it may handle directly control-variable inequality constraints. From a computational viewpoint, dyadic operator implementation of quasi-Newton methods is shown to be superior to the integral kernel representation. The quasi-Newton methods, along with the steepest descent method and two conjugate gradient algorithms, are simulated on three relatively simple (yet representative) bounded control problems, two of which possess singular subarcs. Overall, the Broyden algorithm was found to be superior. The most notable result of the simulations was the clear superiority of the Broyden and Davidon algorithms in producing a sharp singular control subarc.

Edge, E. R.↗

Generalization of the Manley-Rowe relations for non-periodic signals constrained in bandwidth with finite energy

General relations for the energy spectral densities of nonperiodic signals constrained in bandwidth in nonlinear reactances are derived. It is assumed that the charge-voltage characteristics of the reactances are polynomials. In addition certain conditions for the frequency bands of the signals must be met. By contrast with the Manley-Rowe relations integrals with respect to frequency appear instead of the ratios power over frequency. The integrands are energy spectral densities divided by frequency. For parametric devices inequalities can be derived for the ratios of the energy levels in the different circuits and the limiting frequencies of the energy spectral densities. With these inequalities it is possible to determine limits for the energy levels.

Proksch, P.↗

The condition of a finite Markov chain and perturbation bounds for the limiting probabilities

The inequalities bounding the relative error the norm of w- w squiggly/the norm of w are exhibited by a very simple function of E and A. Let T denote the transition matrix of an ergodic chain, C, and let A = I - T. Let E be a perturbation matrix such that T squiggly = T - E is also the transition matrix of an ergodic chain, C squiggly. Let w and w squiggly denote the limiting probability (row) vectors for C and C squiggly. The inequality is the best one possible. This bound can be significant in the numerical determination of the limiting probabilities for an ergodic chain. In addition to presenting a sharp bound for the norm of w-w squiggly/the norm of w an explicit expression for w squiggly will be derived in which w squiggly is given as a function of E, A, w and some other related terms.

Meyer, C. D., Jr.↗

Optimal air-breathing launch vehicle design

A generalized two-point boundary problem methodology, similar to techniques used in deterministic optimal control studies, is applied to the design and flight analysis of a two-stage air-breathing launch vehicle. Simultaneous consideration is given to configuration and trajectory by treating geometry, dynamic discontinuities, and time-dependent flight variables all as controls to be optimized with respect to a single mathematical performance measure. While minimizing fuel consumption, inequality constraints are applied to dynamic pressure and specific force. The optimal system fuel consumption and staging Mach number are found to vary little with changes in the inequality constraints due to substantial geometry and trajectory adjustments. Staging, from an air-breathing first stage to a rocket-powered second stage, consistently occurs near Mach 3.5. The dynamic pressure bound has its most pronounced effects on vehicle geometry, particularly the air-breathing propulsion inlet area, and on the first-stage altitude profile. The specific force has its greatest influence on the second-stage thrust history.

Hattis, P. D.↗

Detection of amblyopia utilizing generated retinal reflexes

Investigation confirmed that GRR images can be consistently obtained and that these images contain information required to detect the optical inequality of one eye compared to the fellow eye. Digital analyses, electro-optical analyses, and trained observers were used to evaluate the GRR images. Two and three dimensional plots were made from the digital analyses results. These plotted data greatly enhanced the GRR image content, and it was possible for nontrained observers to correctly identify normal vs abnormal ocular status by viewing the plots. Based upon the criteria of detecting equality or inequality of ocular status of a person's eyes, the trained observer correctly identified the ocular status of 90% of the 232 persons who participated in this program.

Kerr, J. H.↗

Design of supercritical swept wings

Computational fluid dynamics are used to discuss problems inherent to transonic three-dimensional flow past supercritical swept wings. The formulation for a boundary value problem for the flow past the wing is provided, including consideration of weak shock waves and the use of parabolic coordinates. A swept wing code is developed which requires a mesh of 152 x 10 x 12 points and 200 time cycles. A formula for wave drag is calculated, based on the idea that the conservation form of the momentum equation becomes an entropy inequality measuring the drag, expressible in terms of a small-disturbance equation for a potential function in two dimensions. The entropy inequality has been incorporated in a two-dimensional code for the analysis of transonic flow over airfoils. A method of artificial viscosity is explored for optimum pressure distributions with design, and involves a free boundary problem considering speed over only a portion of the wing.

Garabedian, P.↗

A robust Feasible Directions algorithm for design synthesis

A nonlinear optimization algorithm is developed which combines the best features of the Method of Feasible Directions and the Generalized Reduced Gradient Method. This algorithm utilizes the direction-finding sub-problem from the Method of Feasible Directions to find a search direction which is equivalent to that of the Generalized Reduced Gradient Method, but does not require the addition of a large number of slack variables associated with inequality constraints. This method provides a core-efficient algorithm for the solution of optimization problems with a large number of inequality constraints. Further optimization efficiency is derived by introducing the concept of infrequent gradient calculations. In addition, it is found that the sensitivity of the optimum design to changes in the problem parameters can be obtained using this method without the need for second derivatives or Lagrange multipliers. A numerical example is given in order to demonstrate the efficiency of the algorithm and the sensitivity analysis.

Vanderplaats, G. N.↗

High resolution schemes and the entropy condition

A systematic procedure for constructing semidiscrete, second order accurate, variation diminishing, five point band width, approximations to scalar conservation laws, is presented. These schemes are constructed to also satisfy a single discrete entropy inequality. Thus, in the convex flux case, convergence is proven to be the unique physically correct solution. For hyperbolic systems of conservation laws, this construction is used formally to extend the first author's first order accurate scheme, and show (under some minor technical hypotheses) that limit solutions satisfy an entropy inequality. Results concerning discrete shocks, a maximum principle, and maximal order of accuracy are obtained. Numerical applications are also presented.

Osher, S.↗