Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Spectral Bounds on Hyperbolic 3-Manifolds: Associativity and the Trace Formula

We constrain the low-energy spectra of Laplace operators on closed hyperbolic manifolds and orbifolds in three dimensions, including the standard Laplace--Beltrami operator on functions and the Laplacian on powers of the cotangent bundle. Our approach employs linear programming techniques to derive rigorous bounds by leveraging two types of spectral identities. The first type, inspired by the conformal bootstrap, arises from the consistency of the spectral decomposition of the product of Laplace eigensections, and involves the Laplacian spectra as well as integrals of triple products of eigensections. We formulate these conditions in the language of representation theory of PSL 2 (C) and use them to prove upper bounds on the first and second Laplacian eigenvalues. The second type of spectral identities follows from the Selberg trace formula. We use them to find upper bounds on the spectral gap of the Laplace--Beltrami operator on hyperbolic 3-orbifolds, as well as on the systole length of hyperbolic 3-manifolds, as a function of the volume. Further, we prove that the spectral gap λ 1 of the Laplace--Beltrami operator on all closed hyperbolic 3-manifolds satisfies λ 1 < 47.32. Along the way, we use the trace formula to estimate the low-energy spectra of a large set of example orbifolds and compare them with our general bounds, finding that the bounds are nearly sharp in several cases.

Bonifacio, James [University of Mississippi, MS (U↗
DOE OSTI2024

Compressing branch-and-bound trees

A branch-and-bound (BB) tree certifies a dual bound on the value of an integer program. In this work, we introduce the tree compression problem (TCP): Given a BB tree T that certifies a dual bound, can we obtain a smaller tree with the same (or stronger) bound by either (1) applying a different disjunction at some node in T or (2) removing leaves from T? Here we believe such post-hoc analysis of BB trees may assist in identifying helpful general disjunctions in BB algorithms. We initiate our study by considering computational complexity and limitations of TCP. We then conduct experiments to evaluate the compressibility of realistic branch-and-bound trees generated by commonly-used branching strategies, using both an exact and a heuristic compression algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Competitive exchange between divalent metal ions [Cu(II), Zn(II), Ca(II)] and Hg(II) bound to thiols and natural organic matter

Mercuric Hg(II) ion forms exceptionally strong complexes with various organic ligands, particularly thiols and dissolved organic matter (DOM) in natural water. Few studies, however, have experimentally determined whether or not the presence of base cations and transition metal ions, such as Ca(II), Cu(II), and Zn(II), would compete with Hg(II) bound to these ligands, as concentrations of these metal ions are usually orders of magnitude higher than Hg(II) in aquatic systems. Different from previous model predictions, a significant fraction of Hg(II) bound to cysteine (CYS), glutathione (GSH), or DOM was found to be competitively exchanged by Cu(II), but not by Zn(II) or Ca(II). About 20–75% of CYS-bound-Hg(II) [at 2:1 CYS:Hg(II)] and 14–40% of GSH-bound-Hg(II) [at 1:1 GSH:Hg(II)] were exchanged by Cu(II) at concentrations 1–3 orders of magnitude greater than Hg(II). Competitive exchange was also observed between Cu(II) and Hg(II) bound to DOM, albeit to a lower extent, depending on relative abundances of thiol and carboxylate functional groups on DOM and their equilibrium time with Hg(II). When complexed with ethylenediaminetetraacetate (EDTA), most Hg(II) could be exchanged by Cu(II) and Zn(II), as well as Ca(II) at increasing concentrations. Furthermore, these results shed additional light on competitive exchange reactions between Hg(II) and coexisting metal ions and have important implications in Hg(II) chemical speciation and biogeochemical transformation, particularly in contaminated environments containing relatively high concentrations of Hg(II) and metal ions.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Understanding the Conductivity and Transference Trade-Off in Polymer Electrolytes Using a Robeson-Inspired Upper Bound

The development of high-performance electrolytes is crucial for advancing next-generation lithium and sodium battery technologies. Since the cation is the working ion in both technologies, electrolytes exhibiting the rapid cation transport are essential for making progress. Pathways to optimize electrolytes are unclear due to the inherent trade-off between conductivity and cation transference. While this trade-off is sometimes recognized, there are no well-accepted methodologies for quantifying it. Inspired by the Robeson upper bound for the permeability–selectivity trade-off in gas separation membranes, we propose an approach for quantifying the trade-off in electrolytes using Newman’s concentrated solution theory. We suggest calling this the Newman upper bound. By analyzing published data from 30 polymer electrolytes containing univalent lithium and sodium salts, the Newman upper bound is expressed as κ = 2.0­(1/ρ+ – 1) where κ (mS/cm) is conductivity and ρ+ is the current fraction measured in a symmetric cell as first described by Bruce et al. [J. Electroanal. Chem. Interfacial Electrochem. 1987, 225 (1), 1–17]. This formulation of the upper bound introduces a critical guiding metric for designing next-generation polymer electrolytes; it highlights factors underlying the trade-off, including the salt diffusion coefficient (D), cation transference number relative to solvent velocity ( t + 0 ), and thermodynamic factor (1 + (d lnγ+–)/(d lnm)), where γ+– is the mean molar activity coefficient and m is the molality. These parameters have been measured for very few electrolytes. We posit that establishing the molecular properties that govern these parameters will lead to improved electrolytes that greatly exceed the current upper bound.

He, Zirong↗
DOE OSTI2022

Magnetically brightened dark electron-phonon bound states in a van der Waals antiferromagnet

In van der Waals (vdW) materials, strong coupling between different degrees of freedom can hybridize elementary excitations into bound states with mixed character. Correctly identifying the nature and composition of these bound states is key to understanding their ground state properties and excitation spectra. Here, we use ultrafast spectroscopy to reveal bound states of d-orbitals and phonons in 2D vdW antiferromagnet NiPS 3 . These bound states manifest themselves through equally spaced phonon replicas in frequency domain. These states are optically dark above the Néel temperature and become accessible with magnetic order. By launching this phonon and spectrally tracking its amplitude, we establish the electronic origin of bound states as localized d–d excitations. Our data directly yield electron-phonon coupling strength which exceeds the highest known value in 2D systems. These results demonstrate NiPS 3 as a platform to study strong interactions between spins, orbitals and lattice, and open pathways to coherent control of 2D magnets.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Iron and iron-bound phosphate accumulate in surface soils of ice-wedge polygons in arctic tundra

Phosphorus (P) is a limiting or co-limiting nutrient to plants and microorganisms in diverse ecosystems that include the arctic tundra. Certain soil minerals can adsorb or co-precipitate with phosphate, and this mineral-bound P provides a potentially large P reservoir in soils. Iron (Fe) oxyhydroxides have a high capacity to adsorb phosphate; however, the ability of Fe oxyhydroxides to adsorb phosphate and limit P bioavailability in organic tundra soils is not known. In this study, we examined the depth distribution of soil Fe and P species in the active layer (<30 cm) of low-centered and high-centered ice-wedge polygons at the Barrow Environmental Observatory on the Alaska North Slope. Soil reservoirs of Fe and P in bulk horizons and in narrower depth increments were characterized using sequential chemical extractions and synchrotron-based X-ray absorption spectroscopy (XAS). Organic horizons across all polygon features ( e.g. , trough, ridge, and center) were enriched in extractable Fe and P relative to mineral horizons. Soil Fe was dominated by organic-bound Fe and short-range ordered Fe oxyhydroxides, while soil P was primarily associated with oxides and organic matter in organic horizons but apatite and/or calcareous minerals in mineral horizons. Iron oxyhydroxides and Fe-bound inorganic P (P i ) were most enriched at the soil surface and decreased gradually with depth, and Fe-bound P i was >4× greater than water-soluble P i . These results demonstrate that Fe-bound P i is a large and ecologically important reservoir of phosphate. We contend that Fe oxyhydroxides and other minerals may regulate P i solubility under fluctuating redox conditions in organic surface soils on the arctic tundra.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

An upper bound for extreme temperatures over midlatitude land

Heatwaves damage societies worldwide and are intensifying with global warming. Several mechanistic drivers of heatwaves, such as atmospheric blocking and soil moisture-atmosphere feedback, are well-known for their ability to raise surface air temperature. However, what limits the maximum surface air temperature in heatwaves remains unclear; this became evident during recent Northern Hemisphere heatwaves which achieved temperatures far beyond the upper tail of the observed statistical distribution. Here, we present evidence for the hypothesis that convective instability limits annual maximum surface air temperatures (TXx) over midlatitude land. We provide a theory for the corresponding upper bound of midlatitude temperatures, which accurately describes the observed relationship between temperatures at the surface and in the midtroposphere. We show that known heatwave drivers shift the position of the atmospheric state in the phase space described by the theory, changing its proximity to the upper bound. This theory suggests that the upper bound for midlatitude TXx should increase 1.9 times as fast as 500-hPa temperatures at the time and location of TXx occurrences. Using empirical 500-hPa warming, we project that the upper bound of TXx over Northern Hemisphere midlatitude land (40°N to 65°N) will increase about twice as fast as global mean surface air temperature, and TXx will increase faster than this bound over regions that dry on the hottest days.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

Bound states of Ω baryons in light nuclei

Here, we investigate bound states of light Ω 3⁢𝑥 clusters (𝑥=𝑠,𝑐), motivated by the Ω 3⁢𝑠 ⁢𝑁 potential recently developed by the HAL QCD collaboration. To regularize this potential, we remove the deeply attractive core at 𝑟 < 0.4 fm and parametrize the long-range component (𝑟 > 0.4 fm) using a two-range Gaussian form. This procedure preserves the relevant two-body bound-state energy while having a negligible effect on the Ω 3⁢𝑠⁢ 𝑁⁢𝑁 and Ω 3⁢𝑠⁢ Ω 3⁢𝑠 ⁢𝑁 systems. An effective Ω 3⁢𝑠 ⁢𝛼 potential is then constructed by fitting a two-range Gaussian function to the long-range component of the folding potential, enabling calculations of the bound-state energies of the Ω 3⁢𝑠⁢ 𝛼, Ω 3⁢𝑠⁢ 𝛼⁢𝛼, and Ω 3⁢𝑠 ⁢Ω 3⁢𝑠 ⁢𝛼 systems. The regularization procedure leads to a substantial reduction in bound-state energies compared to those obtained with the original potential. We further extend the analysis to Ω 3⁢𝑐 -cluster systems by introducing an Ω 3⁢𝑐 ⁢𝑁 interaction, derived by comparing the existing Ω 3⁢𝑠⁢ Ω 3⁢𝑠 and Ω 3⁢𝑐 ⁢Ω 3⁢𝑐 potentials. Our results suggest that several parametrizations predict bound states in Ω 3⁢𝑐 -containing clusters. Finally, the Ω 3⁢𝑠 ⁢Ω 3⁢𝑠 interaction is described using a contactlike potential approach, motivated by the effective field theory.

binding energy & masses↗
DOE OSTI2021

Optimizing Error-Bounded Lossy Compression for Scientific Data by Dynamic Spline Interpolation

Today's scientific simulations are producing vast volumes of data that cannot be stored and transferred efficiently because of limited storage capacity, parallel I/O bandwidth, and network bandwidth. The situation is getting worse over time because of the ever-increasing gap between relatively slow data transfer speed and fast-growing computation power in modern supercomputers. Error-bounded lossy compression is becoming one of the most critical techniques for resolving the big scientific data issue, in that it can significantly reduce the scientific data volume while guaranteeing that the reconstructed data is valid for users because of its compression-error-bounding feature. In this paper, we present a novel error-bounded lossy compressor based on a state-of-the-art prediction-based compression framework. Our solution exhibits substantially better compression quality than all of the existing error-bounded lossy compressors, with comparable compression speed. Specifically, our contribution is threefold. (1) We provide an in-depth analysis of why the best-existing prediction-based lossy compressor can only minimally improve the compression quality. (2) We propose a dynamic spline interpolation approach with a series of optimization strategies that can significantly improve the data prediction accuracy, substantially improving the compression quality in turn. (3) We perform a thorough evaluation using six real-world scientific simulation datasets across different science domains to evaluate our solution vs. all other related works. Experiments show that the compression ratio of our solution is higher than that of the second-best lossy compressor by 20%similar to 460% with the same error bound in most of the cases.

Zhao, Kai↗
DOE OSTI2022

Ultrafast Error-bounded Lossy Compression for Scientific Datasets

Today's scientific high-performance computing applications and advanced instruments are producing vast volumes of data across a wide range of domains, which impose a serious burden on data transfer and storage. Error-bounded lossy compression has been developed and widely used in the scientific community because it not only can significantly reduce the data volumes but also can strictly control the data distortion based on the user-specified error bound. Existing lossy compressors, however, cannot offer ultrafast compression speed, which is highly demanded by numerous applications or use cases (such as in-memory compression and online instrument data compression). In this paper, we propose a novel ultrafast error-bounded lossy compressor that can obtain fairly high compression performance on both CPUs and GPUs and with reasonably high compression ratios. The key contributions are threefold. (1) We propose a generic error-bounded lossy compression framework---called SZx---that achieves ultrafast performance through its novel design comprising only lightweight operations such as bitwise and addition/subtraction operations, while still keeping a high compression ratio. (2) We implement SZx on both CPUs and GPUs and optimize the performance according to their architectures. (3) We perform a comprehensive evaluation with six real-world production-level scientific datasets on both CPUs and GPUs. Experiments show that SZx is 2~16x faster than the second-fastest existing error-bounded lossy compressor (either SZ or ZFP) on CPUs and GPUs, with respect to both compression and decompression.

Yu, Xiaodong↗
DOE OSTI2021

Heuristic methods and performance bounds for photonic design

In the photonic design problem, a scientist or engineer chooses the physical parameters of a device to best match some desired device behavior. Many instances of the photonic design problem can be naturally stated as a mathematical optimization problem that is computationally difficult to solve globally. Because of this, several heuristic methods have been developed to approximately solve such problems. These methods often produce very good designs, and, in many practical applications, easily outperform ‘traditional’ designs that rely on human intuition. Yet, because these heuristic methods do not guarantee that the approximate solution found is globally optimal, the question remains of just how much better a designer might hope to do. This question is addressed by performance bounds or impossibility results, which determine a performance level that no design can achieve. We focus on algorithmic performance bounds, which involve substantial computation to determine. We illustrate a variety of both heuristic methods and performance bounds on two examples. In these examples (and many others not reported here) the performance bounds show that the heuristic designs are nearly optimal, and can be considered globally optimal in practice. This review serves to clearly set up the photonic design problem and unify existing approaches for calculating performance bounds, while also providing some natural generalizations and properties.

Angeris, Guillermo (ORCID:0000000249503990)↗
DOE OSTI2022

A posteriori superlinear convergence bounds for block conjugate gradient

In this paper, we extend to the block case the a posteriori bound showing superlinear convergence of the conjugate gradient method developed by van der Vorst and Vuik in [J. Comput. Applied Math., 48 (1993), pp. 327–341]. That is, we obtain similar bounds but now for the block conjugate gradient method. We also present a series of computational experiments, illustrating the validity of the bound developed here as well as the bound by Simoncini and Szyld from [SIAM Review, 47 (2005), pp. 247–272] using angles between subspaces. Using these bounds, we make some observations on the onset of superlinearity and how this onset depends on the eigenvalue distribution and the block size.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

What exactly does Bekenstein bound?

The Bekenstein bound posits a maximum entropy for matter with finite energy confined to a spatial region. It is often interpreted as a fundamental limit on the information that can be stored by physical objects. In this work, we test this interpretation by asking whether the Bekenstein bound imposes constraints on a channel's communication capacity, a context in which information can be given a mathematically rigorous and operationally meaningful definition. We study specifically the Unruh channel that describes a stationary Alice exciting different species of free scalar fields to send information to an accelerating Bob, who is confined to a Rindler wedge and exposed to the noise of Unruh radiation. We show that the classical and quantum capacities of the Unruh channel obey the Bekenstein bound that pertains to the decoder Bob. In contrast, even at high temperatures, the Unruh channel can transmit a significant number of zero-bits , which are quantum communication resources that can be used for quantum identification and many other primitive protocols. Therefore, unlike classical bits and qubits, zero-bits and their associated information processing capability are generally not constrained by the Bekenstein bound. However, we further show that when both the encoder and the decoder are restricted, the Bekenstein bound does constrain the channel capacities, including the zero-bit capacity.

Hayden, Patrick [Stanford University, CA (United S↗
NASA NTRS1974

Upper bounds on sequential decoding performance parameters

This paper presents the best obtainable random coding and expurgated upper bounds on the probabilities of undetectable error, of t-order failure (advance to depth t into an incorrect subset), and of likelihood rise in the incorrect subset, applicable to sequential decoding when the metric bias G is arbitrary. Upper bounds on the Pareto exponent are also presented. The G-values optimizing each of the parameters of interest are determined, and are shown to lie in intervals that in general have nonzero widths. The G-optimal expurgated bound on undetectable error is shown to agree with that for maximum likelihood decoding of convolutional codes, and that on failure agrees with the block code expurgated bound. Included are curves evaluating the bounds for interesting choices of G and SNR for a binary-input quantized-output Gaussian additive noise channel.

Jelinek, F.↗
NASA NTRS1974

Free distance bounds for convolutional codes

The best asymptotic bounds presently known on free distance for convolutional codes are presented from a unified point of view. Upper and lower bounds for both time-varying and fixed codes are obtained. A comparison is made between bounds for nonsystematic and systematic codes which shows that more free distance is available with nonsystematic codes. This result is important when selecting codes for use with sequential or maximum-likelihood (Viterbi) decoding since the probability of decoding error is closely related to the free distance of the code. An ancillary result, used in proving the lower bound on free distance for time-varying nonsystematic codes, furnishes a generalization of two earlier bounds on the definite decoding minimum distance of convolutional codes.

Costello, D. J., Jr.↗
NASA NTRS1987

Comparing hard and soft prior bounds in geophysical inverse problems

In linear inversion of a finite-dimensional data vector y to estimate a finite-dimensional prediction vector z, prior information about X sub E is essential if y is to supply useful limits for z. The one exception occurs when all the prediction functionals are linear combinations of the data functionals. Two forms of prior information are compared: a soft bound on X sub E is a probability distribution p sub x on X which describeds the observer's opinion about where X sub E is likely to be in X; a hard bound on X sub E is an inequality Q sub x(X sub E, X sub E) is equal to or less than 1, where Q sub x is a positive definite quadratic form on X. A hard bound Q sub x can be softened to many different probability distributions p sub x, but all these p sub x's carry much new information about X sub E which is absent from Q sub x, and some information which contradicts Q sub x. Both stochastic inversion (SI) and Bayesian inference (BI) estimate z from y and a soft prior bound p sub x. If that probability distribution was obtained by softening a hard prior bound Q sub x, rather than by objective statistical inference independent of y, then p sub x contains so much unsupported new information absent from Q sub x that conclusions about z obtained with SI or BI would seen to be suspect.

Backus, George E.↗
NASA NTRS1988

Comparing hard and soft prior bounds in geophysical inverse problems

In linear inversion of a finite-dimensional data vector y to estimate a finite-dimensional prediction vector z, prior information about X sub E is essential if y is to supply useful limits for z. The one exception occurs when all the prediction functionals are linear combinations of the data functionals. Two forms of prior information are compared: a soft bound on X sub E is a probability distribution p sub x on X which describes the observer's opinion about where X sub E is likely to be in X; a hard bound on X sub E is an inequality Q sub x(X sub E, X sub E) is equal to or less than 1, where Q sub x is a positive definite quadratic form on X. A hard bound Q sub x can be softened to many different probability distributions p sub x, but all these p sub x's carry much new information about X sub E which is absent from Q sub x, and some information which contradicts Q sub x. Both stochastic inversion (SI) and Bayesian inference (BI) estimate z from y and a soft prior bound p sub x. If that probability distribution was obtained by softening a hard prior bound Q sub x, rather than by objective statistical inference independent of y, then p sub x contains so much unsupported new information absent from Q sub x that conclusions about z obtained with SI or BI would seen to be suspect.

Backus, George 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↗