Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “lower bounding”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2013

Lower bounds to the spectral gap of Davies generators

We construct lower bounds to the spectral gap of a family of Lindblad generators known as Davies maps. These maps describe the thermalization of quantum systems weakly coupled to a heat bath. The steady state of these systems is given by the Gibbs distribution with respect to the system Hamiltonian. The bounds can be evaluated explicitly, when the eigenbasis and the spectrum of the Hamiltonian is known. A crucial assumption is that the spectrum of the Hamiltonian is non-degenerate. Furthermore, we provide a counterexample to the conjecture, that the convergence rate is always determined by the gap of the associated Pauli master equation. We conclude that the full dynamics of the Lindblad generator has to be considered. Finally, we present several physical example systems for which the bound to the spectral gap is evaluated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Symmetry Parameter Constraints from a Lower Bound on Neutron-matter Energy

We propose the existence of a lower bound on the energy of pure neutron matter (PNM) on the basis of unitary-gas considerations. We discuss its justification from experimental studies of cold atoms as well as from theoretical studies of neutron matter. We demonstrate that this bound results in limits to the density-dependent symmetry energy, which is the difference between the energies of symmetric nuclear matter and PNM. In particular, this bound leads to a lower limit to the volume symmetry energy parameter S {sub 0}. In addition, for assumed values of S {sub 0} above this minimum, this bound implies both upper and lower limits to the symmetry energy slope parameter L , which describes the lowest-order density dependence of the symmetry energy. A lower bound on neutron-matter incompressibility is also obtained. These bounds are found to be consistent with both recent calculations of the energies of PNM and constraints from nuclear experiments. Our results are significant because several equations of state that are currently used in astrophysical simulations of supernovae and neutron star mergers, as well as in nuclear physics simulations of heavy-ion collisions, have symmetry energy parameters that violate these bounds. Furthermore, below the nuclear saturation density, the bound on neutron-matter energies leads to a lower limit to the density-dependent symmetry energy, which leads to upper limits to the nuclear surface symmetry parameter and the neutron-star crust–core boundary. We also obtain a lower limit to the neutron-skin thicknesses of neutron-rich nuclei. Above the nuclear saturation density, the bound on neutron-matter energies also leads to an upper limit to the symmetry energy, with implications for neutron-star cooling via the direct Urca process.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2015

A halo-independent lower bound on the dark matter capture rate in the Sun from a direct detection signal

We show that a positive signal in a dark matter (DM) direct detection experiment can be used to place a lower bound on the DM capture rate in the Sun, independent of the DM halo. For a given particle physics model and DM mass we obtain a lower bound on the capture rate independent of the local DM density, velocity distribution, galactic escape velocity, as well as the scattering cross section. We illustrate this lower bound on the capture rate by assuming that upcoming direct detection experiments will soon obtain a significant signal. When comparing the lower bound on the capture rate with limits on the high-energy neutrino flux from the Sun from neutrino telescopes, we can place upper limits on the branching fraction of DM annihilation channels leading to neutrinos. With current data from IceCube and Super-Kamiokande non-trivial limits can be obtained for spin-dependent interactions and direct annihilations into neutrinos. In some cases also annihilations into ττ or bb start getting constrained. For spin-independent interactions current constraints are weak, but they may become interesting for data from future neutrino telescopes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation

Multiple tensor-times-matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimensional data analysis. Here, we establish communication lower bounds that determine how much data movement is required (under mild conditions) to perform the Multi-TTM computation in parallel. The crux of the proof relies on analytically solving a constrained, nonlinear optimization problem. We also present a parallel algorithm to perform this computation that organizes the processors into a logical grid with twice as many modes as the input tensor. We show that, with correct choices of grid dimensions, the communication cost of the algorithm attains the lower bounds and is therefore communication optimal. Finally, we show that our algorithm can significantly reduce communication compared to the straightforward approach of expressing the computation as a sequence of tensor-times-matrix operations when the input and output tensors vary greatly in size.

HBL-inequalities↗
DOE OSTI2015

Lower bound on the electroweak wall velocity from hydrodynamic instability

The subsonic expansion of bubbles in a strongly first-order electroweak phase transition is a convenient scenario for electroweak baryogenesis. For most extensions of the Standard Model, stationary subsonic solutions (i.e., deflagrations) exist for the propagation of phase transition fronts. However, deflagrations are known to be hydrodynamically unstable for wall velocities below a certain critical value. We calculate this critical velocity for several extensions of the Standard Model and compare with an estimation of the wall velocity. In general, we find a region in parameter space which gives stable deflagrations as well as favorable conditions for electroweak baryogenesis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Neutron star kick velocity induced by neutrino chirality flip and a lower bound for the neutrino magnetic moment

We study the neutrino chirality flip during the birth of a neutron star, produced in a core made of strange quark matter. This mechanism is applied to the neutron star kick velocity problem and we show that it is efficient when the neutrino magnetic moment is not smaller than 4.7 × 10 −15 μ B , where μ B is the Bohr magneton. When this lower bound is combined with the most stringent upper bound, our results set a range for the neutrino magnetic moment given by 4.7 × 10 −15 ≤ μ ν / μ B ≤ (0.1 − 0.4) × 10 −11 . The obtained kick velocities for natal conditions are consistent with the observed ones and span the correct range of radii for typical magnetic field intensities.

Ayala, Alejandro↗
DOE OSTI2016

Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs

We present a method for computing lower bounds in the progressive hedging algorithm (PHA) for two-stage and multi-stage stochastic mixed-integer programs. Computing lower bounds in the PHA allows one to assess the quality of the solutions generated by the algorithm contemporaneously. The lower bounds can be computed in any iteration of the algorithm by using dual prices that are calculated during execution of the standard PHA. In conclusion, we report computational results on stochastic unit commitment and stochastic server location problem instances, and explore the relationship between key PHA parameters and the quality of the resulting lower bounds.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Computing a Non-trivial Lower Bound on the Joint Entropy between Two Images

In this report, a non-trivial lower bound on the joint entropy of two non-identical images is developed, which is greater than the individual entropies of the images. The lower bound is the least joint entropy possible among all pairs of images that have the same histograms as those of the given images. New algorithms are presented to compute the joint entropy lower bound with a computation time proportional to S log S where S is the number of histogram bins of the images. This is faster than the traditional methods of computing the exact joint entropy with a computation time that is quadratic in S .

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

A Lower Bound on Adiabatic Heating of Compressed Turbulence for Simulation and Model Validation

The energy in turbulent flow can be amplied by compression, when the compression occurs on a timescale shorter than the turbulent dissipation time. This mechanism may play a part in sustaining turbulence in various astrophysical systems, including molecular clouds. The amount of turbulent amplification depends on the net effect of the compressive forcing and turbulent dissipation. By giving an argument for a bound on this dissipation, we give a lower bound for the scaling of the turbulent velocity with compression ratio in compressed turbulence. That is, turbulence undergoing compression will be enhanced at least as much as the bound given here, subject to a set of caveats that will be outlined. Used as a validation check, this lower bound suggests that some models of compressing astrophysical turbulence are too dissipative. As a result, the technique used highlights the relationship between compressed turbulence and decaying turbulence.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2017

Monte Carlo simulations of time-of-flight PET with double-ended readout: calibration, coincidence resolving times and statistical lower bounds

Here, this paper demonstrates through Monte Carlo simulations that a practical positron emission tomograph with (1) deep scintillators for efficient detection, (2) double-ended readout for depth-of-interaction information, (3) fixed-level analog triggering, and (4) accurate calibration and timing data corrections can achieve a coincidence resolving time (CRT) that is not far above the statistical lower bound. One Monte Carlo algorithm simulates a calibration procedure that uses data from a positron point source. Annihilation events with an interaction near the entrance surface of one scintillator are selected, and data from the two photodetectors on the other scintillator provide depth-dependent timing corrections. Another Monte Carlo algorithm simulates normal operation using these corrections and determines the CRT. A third Monte Carlo algorithm determines the CRT statistical lower bound by generating a series of random interaction depths, and for each interaction a set of random photoelectron times for each of the two photodetectors. The most likely interaction times are determined by shifting the depth-dependent probability density function to maximize the joint likelihood for all the photoelectron times in each set. Example calculations are tabulated for different numbers of photoelectrons and photodetector time jitters for three 3 × 3 × 30 mm 3 scintillators: Lu 2 SiO 5 :Ce,Ca (LSO), LaBr 3 :Ce, and a hypothetical ultra-fast scintillator. To isolate the factors that depend on the scintillator length and the ability to estimate the DOI, CRT values are tabulated for perfect scintillator-photodetectors. For LSO with 4000 photoelectrons and single photoelectron time jitter of the photodetector J = 0.2 ns (FWHM), the CRT value using the statistically weighted average of corrected trigger times is 0.098 ns FWHM and the statistical lower bound is 0.091 ns FWHM. For LaBr 3 :Ce with 8000 photoelectrons and J = 0.2 ns FWHM, the CRT values are 0.070 and 0.063 ns FWHM, respectively. For the ultra-fast scintillator with 1 ns decay time, 4000 photoelectrons, and J = 0.2 ns FWHM, the CRT values are 0.021 and 0.017 ns FWHM, respectively. Lastly, the examples also show that calibration and correction for depth-dependent variations in pulse height and in annihilation and optical photon transit times are necessary to achieve these CRT values.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2014

On lower bounds for possible blow-up solutions to the periodic Navier-Stokes equation

We show a new lower bound on the H{sup .3/2} (T{sup 3}) norm of a possible blow-up solution to the Navier-Stokes equation, and also comment on the extension of this result to the whole space. This estimate can be seen as a natural limiting result for Leray's blow-up estimates in L{sup p}(R{sup 3}), 3 < p < ∞. We also show a lower bound on the blow-up rate of a possible blow-up solution of the Navier-Stokes equation in H{sup .5/2} (T{sup 3}), and give the corresponding extension to the case of the whole space.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations

In this article, we focus on the communication costs of three symmetric matrix computations: (i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) (ii) adding the result of the multiplication of a matrix with the transpose of another matrix and the transpose of that result, known as a symmetric rank-2k update (SYR2K) (iii) performing matrix multiplication with a symmetric input matrix (SYMM). All three computations appear in the Level 3 Basic Linear Algebra Subroutines (BLAS) and have wide use in applications involving symmetric matrices. We establish communication lower bounds for these kernels using sequential and distributed-memory parallel computational models, and we show that our bounds are tight by presenting communication-optimal algorithms for each setting. Our lower bound proofs rely on applying a geometric inequality for symmetric computations and analytically solving constrained nonlinear optimization problems. As a result, the symmetric matrix and its corresponding computations are accessed and performed according to a triangular block partitioning scheme in the optimal algorithms.

Al Daas, Hussam [Rutherford Appleton Laboratory, D↗
DOE OSTI2021

Lower bounds on circuit depth of the quantum approximate optimization algorithm

The quantum approximate optimization algorithm (QAOA) is a method of approximately solving combinatorial optimization problems. While QAOA is developed to solve a broad class of combinatorial optimization problems, it is not clear which classes of problems are best suited for it. One factor in demonstrating quantum advantage is the relationship between a problem instance and the circuit depth required to implement the QAOA method. As errors in noisy intermediate-scale quantum (NISQ) devices increase exponentially with circuit depth, identifying lower bounds on circuit depth can provide insights into when quantum advantage could be feasible. In this work, we identify how the structure of problem instances can be used to identify lower bounds for circuit depth for each iteration of QAOA and examine the relationship between problem structure and the circuit depth for a variety of combinatorial optimization problems including MaxCut and MaxIndSet. Specifically, we show how to derive a graph, G, that describes a general combinatorial optimization problem and show that the depth of circuit is at least the chromatic index of G. By looking at the scaling of circuit depth, we argue that MaxCut, MaxIndSet, and some instances of vertex covering and Boolean satisfiability problems are suitable for QAOA approaches while knapsack and traveling salesperson problems are not.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

LOWER BOUND ON THE COSMIC TeV GAMMA-RAY BACKGROUND RADIATION

The Fermi gamma-ray space telescope has revolutionized our understanding of the cosmic gamma-ray background radiation in the GeV band. However, investigation on the cosmic TeV gamma-ray background radiation still remains sparse. Here, we report the lower bound on the cosmic TeV gamma-ray background spectrum placed by the cumulative flux of individual detected extragalactic TeV sources including blazars, radio galaxies, and starburst galaxies. The current limit on the cosmic TeV gamma-ray background above 0.1 TeV is obtained as 2.8 × 10{sup −8}(E/100 GeV){sup −0.55} exp(−E/2100GeV)[GeV cm{sup −2} s{sup −1} sr{sup −1}] < E{sup 2}dN/dE < 1.1 × 10{sup −7}(E/100 GeV){sup −0.49} [GeV cm{sup −2} s{sup −1} sr{sup −1}], where the upper bound is set by requirement that the cascade flux from the cosmic TeV gamma-ray background radiation can not exceed the measured cosmic GeV gamma-ray background spectrum. Two nearby blazars, Mrk 421 and Mrk 501, explain ∼70% of the cumulative background flux at 0.8–4 TeV, while extreme blazars start to dominate at higher energies. We also provide the cumulative background flux from each population, i.e., blazars, radio galaxies, and starburst galaxies which will be the minimum requirement for their contribution to the cosmic TeV gamma-ray background radiation.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Lower Bounds on Quantum Annealing Times

The adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more general quantum annealing protocols, rigorous results beyond the adiabatic regime are rare. Here, we provide such a result, deriving lower bounds on the time needed to successfully perform quantum annealing. The bounds are asymptotically saturated by three toy models where fast annealing schedules are known: the Roland and Cerf unstructured search model, the Hamming spike problem, and the ferromagnetic p-spin model. Our bounds demonstrate that these schedules have optimal scaling. Herein, our results also show that rapid annealing requires coherent superpositions of energy eigenstates, singling out quantum coherence as a computational resource.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Exotic equilibria of Harary graphs and a new minimum degree lower bound for synchronization

This work is concerned with stability of equilibria in the homogeneous (equal frequencies) Kuramoto model of weakly coupled oscillators. In 2012 [R. Taylor, J. Phys. A: Math. Theor. 45, 1–15 (2012)], a sufficient condition for almost global synchronization was found in terms of the minimum degree–order ratio of the graph. In this work, a new lower bound for this ratio is given. The improvement is achieved by a concrete infinite sequence of regular graphs. Besides, non standard unstable equilibria of the graphs studied in Wiley et al. [Chaos 16, 015103 (2006)] are shown to exist as conjectured in that work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

The Age of Evapotranspiration: Lower‐Bound Constraints From Distributed Water Fluxes Across the Continental United States

Abstract Unlike streamflow, which can be sampled in aggregate at the catchment outlet, evapotranspiration (ET) is spatially dispersed, challenging large‐scale age estimation. Here, we introduce an approach for constraining the age of ET via mass balance and present the minimum flux‐weighted age of ET across the continental United States using distributed, publicly available water flux data sets. The lower‐bound constraint on ET age can be calculated by assuming that ET is preferentially sourced from the most recent precipitation through a last‐in, first‐out algorithm. From 2012 to 2017, ET was at least several months old across large areas of the western continental United States, including in Mediterranean and (semi‐)arid climate zones and shrub and evergreen needleleaf plant communities. The primary limitation of this approach is that it provides only a minimum flux‐weighted average age to satisfy the mass balance of outgoing fluxes; true ET fluxes are composed of distributions of ages and may be composed of much older water. The primary advantage of the approach is that flux time series of precipitation and ET are sufficient to constrain ET age, and model parameterization is unnecessary. ET ages can be used to validate tracer‐aided and modeling approaches and inform studies of biogeochemistry, water‐rock interactions, and plant water sourcing under drought.

Hahm, W. J.↗