Search NASA⌕ Search

SEARCH · Search NASA

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

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↗

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↗

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↗

Lower bound on reliability for Weibull distribution when shape parameter is not estimated accurately

The mathematical relationships between the shape parameter Beta and estimates of reliability and a life limit lower bound for the two parameter Weibull distribution are investigated. It is shown that under rather general conditions, both the reliability lower bound and the allowable life limit lower bound (often called a tolerance limit) have unique global minimums over a range of Beta. Hence lower bound solutions can be obtained without assuming or estimating Beta. The existence and uniqueness of these lower bounds are proven. Some real data examples are given to show how these lower bounds can be easily established and to demonstrate their practicality. The method developed here has proven to be extremely useful when using the Weibull distribution in analysis of no-failure or few-failures data. The results are applicable not only in the aerospace industry but anywhere that system reliabilities are high.

Huang, Zhaofeng↗

Lower bound on reliability for Weibull distribution when shape parameter is not estimated accurately

The mathematical relationships between the shape parameter Beta and estimates of reliability and a life limit lower bound for the two parameter Weibull distribution are investigated. It is shown that under rather general conditions, both the reliability lower bound and the allowable life limit lower bound (often called a tolerance limit) have unique global minimums over a range of Beta. Hence lower bound solutions can be obtained without assuming or estimating Beta. The existence and uniqueness of these lower bounds are proven. Some real data examples are given to show how these lower bounds can be easily established and to demonstrate their practicality. The method developed here has proven to be extremely useful when using the Weibull distribution in analysis of no-failure or few-failures data. The results are applicable not only in the aerospace industry but anywhere that system reliabilities are high.

Huang, Zhaofeng↗

Lower Bounds for the Energy Levels of Anharmonic Oscillators

The lower‐bounds method presented by Löwdin in the preceding paper has been applied to oscillators perturbed by third‐ and fourth‐power terms in the potential‐energy expression. For favorable cases agreement between upper and lower bounds is easily carried to many more figures than are likely to be physically significant. In many cases the lower bounds agreed more closely to the true eigenvalue than did the corresponding upper bounds. For a given basis set, this method gives closer bounds than that of Bazley and Fox, except for energy levels too high to be satisfactorily treated in the given basis. The only disadvantage found was that for close bounds double precision proved necessary, indicating more than ordinary loss of computational accuracy.

Reid, Charles E.↗

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↗

The Effects of Geometric and Loading Imperfections on the Response and Lower-Bound Buckling Load of a Compression-Loaded Cylindrical Shell

Results from a numerical study of the buckling response of a thin-walled compressionloaded isotropic circular cylindrical shell with initial geometric and loading imperfections are used to determine a lower bound buckling load estimate suitable for preliminary design. The lower bound prediction techniques presented herein include an imperfection caused by a lateral perturbation load, an imperfection in the shape of a single stress-free dimple (similar to the lateral pertubation imperfection), and a distributed load imperfection that induces a nonuniform load in the shell. The ABAQUS finite element code is used for the analyses. Responses of the cylinders for selected imperfection amplitudes and imperfection types are considered, and the effect of each imperfection is compared to the response of a geometrically perfect cylinder. The results indicate that compression-loaded shells subjected to a lateral perturbation load or a single dimple imperfection, and a nonuniform load imperfection, exhibit similar buckling behavior and lower bound trends and the predicted lower bounds are much less conservative than the corresponding design recommendation NASA SP-8007 for the design of buckling-critical shells. In addition, the lateral perturbation technique and the distributed load imperfection produce response characteristics that are physically meaningful and can be validated via laboratory testing.

Kriegesmann, Benedikt↗

A lower bound on the minimum Euclidean distance of trellis-coded modulation schemes

A lower bound on the minimum free Euclidean distance of trellis-coded modulation (TCM) is derived that guarantees the existence of good TCM codes of any complexity. The bound is used to compare trellis codes combined with phase-shift keying, pulse amplitude modulation, and quadrature amplitude-shift keying modulation. This random coding bound is the first lower bound on the free distance of trellis codes, is tighter than any upper bound for large constraint lengths, and predicts the asymptotic performance of TCM when the complexity of the code becomes large. The bound can be used with any code rate and any modulation scheme and shows that the free distance increases linearly with the constraint length for large values of the constraint length.

Rouanne, Marc↗

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↗

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↗

Comparison of Methods to Predict Lower Bound Buckling Loads of Cylinders Under Axial Compression

Results from a numerical study of the buckling response of two different orthogrid stiffened circular cylindrical shells with initial imperfections and subjected to axial compression are used to compare three different lower bound buckling load prediction techniques. These lower bound prediction techniques assume different imperfection types and include an imperfection based on a mode shape from an eigenvalue analysis, an imperfection caused by a lateral perturbation load, and an imperfection in the shape of a single stress-free dimple. The STAGS finite element code is used for the analyses. Responses of the cylinders for ranges of imperfection amplitudes are considered, and the effect of each imperfection is compared to the response of a geometrically perfect cylinder. Similar behavior was observed for shells that include a lateral perturbation load and a single dimple imperfection, and the results indicate that the predicted lower bounds are much less conservative than the corresponding results for the cylinders with the mode shape imperfection considered herein. In addition, the lateral perturbation technique and the single dimple imperfection produce response characteristics that are physically meaningful and can be validated via testing.

Haynie, Waddy T.↗

A lower bound for the decoder error probability of the linear MDS code

A lower bound for the decoder error probability (P sub E (u)) of a linear maximum distance separable (MDS) code is derived by counting the dominant types of decoding words around code words. It is shown that the lower bound derived is similar in form, and close numerically, to the upper bound derived.

Cheung, K.-M.↗

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↗