Results 61 to 70 of about 58,381 (161)
Upper and lower bounds for tunneling splittings in a symmetric double-well potential. [PDF]
Ronto M, Pollak E.
europepmc +1 more source
Upper and lower bounds for eigenvalues
AbstractThis paper presents a new method for computing upper and lower bounds for the eigenvalues of the system [r(x) y′]′ + λp(x) y = 0, y(a) = y(b) = 0. It permits one to approximate as closely as desired simultaneously to any finite subset of the eigenvalues, and the method is particularly well adapted to the use of a computer.
openaire +2 more sources
Fundamental performance bounds for multi-performance criteria in wireless ad hoc networks
In wireless ad hoc networks,the fundamental performance bounds could provide insight to improve network routing or resource allocation protocol as well as an upper bound against which to compare the performance of existing protocols.This work addresses ...
Qi WANG +6 more
doaj +2 more sources
By applying Pade approximants and continued fractions technique developed in [1, 2, 3, 24] we investigate a composite material of the effective modulus e(h) consisting of two components of real moduli 1 and 2, respectively, where h= 2/ 1.
Stanisław Tokarzewski +2 more
doaj
Upper and lower bounds on phase-space rearrangements
Broad classes of plasma phenomena can be understood in terms of phase-space rearrangements. For example, the net effect of a wave–particle interaction may consist of moving populations of particles from one region of phase space to another. Different phenomena drive rearrangements that obey different rules.
E. J. Kolmes, N. J. Fisch
openaire +2 more sources
Upper and Lower Bounds for Kazhdan–Lusztig Polynomials
The author gives upper and lower bounds for the Kazhdan-Lusztig polynomials of any Coxeter group \(W\) and shows that if \(W\) is finite then the \(k\)th coefficient of the Kazhdan-Lusztig polynomial of two elements \(u\), \(v\) of \(W\) is bounded from above by a polynomial (which depends only on \(k\)) in \(l(v)-l(u)\) for any \(k\geq 0\).
openaire +2 more sources
The n-shot classical capacity of the quantum erasure channel
We compute the n -shot classical capacity of the quantum erasure channel, providing upper bounds and almost-matching lower bounds for it, the latter achievable via large-minimum-distance classical linear codes for any n .
Matteo Rosati
doaj +1 more source
Bounds for the Ruin Probability in the Sparre–Andersen Model
We obtain the upper and lower bounds for the ruin probability in the Sparre–Andersen model. These bounds are established under various conditions: when the adjustment coefficient exists, when it does not exist, and when the interarrival distribution ...
Sotirios Losidis, Vaios Dermitzakis
doaj +1 more source
Upper and lower bounds for quadratic functionals
The paper gives a systematic procedure for obtaining monotone sequences of upper and lover bounds for quadratic integrals such as those encountered in torsional rigidity, capacity, and other physical quantities. The monotone sequences are obtained from Bessel's inequality, while maximum and minimum principles for the solutions of the boundary value ...
openaire +2 more sources
On Upper and Lower Bounded Spaces
In this thesis, we study a special types of Alexandroff spaces, called upper bounded and lower bounded T0 A-spaces. We prove that UB T0 A-spaces and g-Artinian T0 Aspaces are incomparable and containing Artinian T0 A-spaces in the regain of intersection. We introduce A-dcts as a proper subclass of UB T0 A-space.
openaire +1 more source

