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

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.↗
NASA NTRS1988

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.↗
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↗
NASA NTRS1965

Studies in Perturbation Theory. XI. Lower Bounds to Energy Eigenvalues, Ground State, and Excited States

The bracketing theorem in the partitioning technique for solving the Schrödinger equation may be used in principle to determine upper and lower bounds to energy eigenvalues. Practical lower bounds of any accuracy desired may be evaluated by utilizing the properties of ``inner projections'' on finite manifolds in the Hilbert space. The method is here applied to the ground state and excited states of a Hamiltonian H=H(sub 0)+V having a positive definite perturbation V. Even if inspiration is derived from the method of intermediate Hamiltonians, the final results are of bracketing type and independent of this approach. The method is numerically illustrated in some accompanying papers.

Loewdin, Per-Olov↗
NASA NTRS1992

Primary-backup protocols: Lower bounds and optimal implementations

A formal specification of primary-backup is presented. We then prove lower bounds on the degree of replication, failover time, and worst-case response time to client requests assuming different failure models. Finally, we outline primary-backup protocols and indicate which of our lower bounds are tight.

Budhiraja, Navin↗
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↗
NASA NTRS1976

Dynamic polarizabilities of two-electron atoms, with rigorous upper and lower bounds

Methods are described for calculating rigorous upper and lower bounds to dynamic dipole polarizabilities for frequencies up to and beyond the first excitation threshold, even when (as usual) the field-free problem cannot be solved exactly. These methods were employed to calculate rigorous bounds to the dynamic polarizabilities of the two-electron atoms H(-), He, and Li(+), using well correlated trial wavefunctions up to 135 terms in length. The majority of previous theoretical and experimental results for these atoms can thereby be ruled out, including the highly precise Starkschall-Gordon values, which had heretofore appeared to be the most accurate available.

Glover, R. M.↗
NASA NTRS1977

Dynamic polarizabilities of metastable 2/1,3S/ excited states of He and Li/+/, with rigorous upper and lower bounds

Methods previously described for calculating rigorous upper and lower bounds to dynamic dipole polarizabilities are applied to the metastable 2(1S) and 2(2S) excited states of He and Li(+), using highly correlated variational trial functions. For each of these species, the bounds rigorously establish the values of the frequency-dependent dipole polarizability to within about 1% and appear to represent the first determination of this property at frequencies above the first excitation threshold.

Glover, R. M.↗
DOE OSTI2013

A lower bound on the mass of cold thermal dark matter from Planck

We show that the new measurement of the effective number of neutrinos (N{sub eff}) by the Planck satellite can be used to set a robust lower bound on the mass of cold thermal dark matter of O(MeV). Our limit applies if the dark matter remains in thermal equilibrium by coupling to electrons and photons or through interactions with neutrinos, and applies regardless of whether the dark matter annihilation cross-section is s-wave or p-wave. To illustrate our bounds we apply them to a model of a supersymmetric neutralino annihilating to neutrinos, via a light mixed left-right handed sneutrino mediator. While this scenario was not constrained by previous data, the Planck limits on N{sub eff} allow us to set a lower bound on the neutralino dark matter mass of 3.5 MeV.

79 ASTRONOMY AND ASTROPHYSICS↗
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↗