搜索结果: 1-15 共查到“应用数学 bound”相关记录15条 . 查询时间(0.073 秒)
ERRATUM:BOSE–EINSTEIN CONDENSATION BEYOND MEAN FIELD:MANY-BODY BOUND STATE OF PERIODIC MICROSTRUCTURE
Bose–Einstein condensation homogenization many-body perturbation theory two-scale expansion singular perturbation mean field limit bound state
font style='font-size:12px;'>
2015/10/16
This is a correction to the author’s article [Multiscale Model. Simul.,10 (2012), pp.383–417].
A bound from below for the temperature in compressible Navier-Stokes equations
below for the temperature compressible Navier-Stokes equations
font style='font-size:12px;'>
2015/10/15
We consider the full system of compressible Navier-Stokes equations for heat conducting fluid. We show that the temperature is uniformly positive for t ≥ t0 (for any t0 > 0) for any solutions with fin...
A lower bound for eigenvalues of the poly-Laplacian with arbitrary order
the eigenvalue problem a lower bound for eigenvalues
font style='font-size:12px;'>
2011/1/21
In this paper, we study eigenvalues of the poly-Laplacian with arbitrary order on a bounded domain in an n-dimensional Euclidean space and obtain a lower bound for eigenvalues, which gives an importan...
On the constant in Burgess' bound for the number of consecutive residues or non-residues
consecutive residues or non-residues math
font style='font-size:12px;'>
2010/11/23
We give an explicit version of a result due to D. Burgess. Let $\chi$ be a non-principal Dirichlet character modulo a prime $p$. We show that the maximum number of consecutive integers for which $\ch...
An upper bound for the Hosoya index of trees
Hosoya index of graphs tree eigenvalue of graphs
font style='font-size:12px;'>
2010/9/13
The Hosoya index of a graph G is defined as the sum of all the numbers of k - matchings (k ≥ 0) in G. An upper bound for the Hosoya index of trees is presented in this note.
A New Upper Bound of the Logarithmic Mean
Logarithmic mean Power mean Heron mean Best constant
font style='font-size:12px;'>
2008/7/3
A New Upper Bound of the Logarithmic Mean.
A Bound on the Deviation Probability for Sums of Non-Negative Random Variables
Deviation bounds Bernstein's inequality Hoeffdings inequality
font style='font-size:12px;'>
2008/7/3
A simple bound is presented for the probability that the sum of nonnegative independent random variables is exceeded by its expectation by more than a positive number t. If the variables have the same...
On an Upper Bound for the Deviations from the Mean Value
Arithmetic mean Square mean Cauchy-Schwarz-Buniakovski inequality Triangle inequality
font style='font-size:12px;'>
2008/6/30
A completely elementary proof of a known upper bound for the deviations from the mean value is given. Related inequalities are also discussed. Applications to triangle inequalities provide characteriz...
A branch and bound-PSO hybrid algorithm for solving integer separable concave programming problems
Integer programming separable concave programming
font style='font-size:12px;'>
2010/9/15
A branch and bound-PSO hybrid algorithm for solving integer separable concave programming problems is proposed, in which the lower bound of the optimal value was determined by solving linear programmi...
A Note on the Perturbation Bound of Q-factors
Polar decomposition perturbation norm
font style='font-size:12px;'>
2007/12/11
In this note we present a perturbation bound of unitarypolar factors. We add the orthogonal projectors into the bound; asa result, a uniform perturbation bound of $Q$-factors is obtained,and the previ...
A TIGHTER BOUND FOR FFd ALGORITHM
Binpacking FFD algorithm
font style='font-size:12px;'>
2007/12/11
For the bin-packing FFD algorithm we give a.proof of FFD (L) ≤■ OPT (L) +■. The best bound before was FFD (L)≤■ OPT (L) +1 given by Yue Minyi.
On the Upper Bound of Second Eigenvalues for Uniformly Elliptic Operators of any Orders
uniformly elliptic operators of any orders
font style='font-size:12px;'>
2007/12/10
r + 1. We consider the eigenvalue problems (1.1) and (1.2), and obtain Theorem 1 and Theorem 2, which generalize the results in [1,2,5].
Bound on m-restricted Edge Connectivity
regular graph bound restricted edge connectivity
font style='font-size:12px;'>
2007/12/10
An m-restricted edge cut is an edge cut that separates a connected graph into a disconnected one with no components having order less than m. m-restricted edge connectivity λ_m is the cardinality of a...
A TIGHT LOWER BOUND ON THE MAXIMUM GENUS OF 3-EDGE CONNECTED LOOPLESS GRAPHS
Maximum genus 3-edge connect
font style='font-size:12px;'>
2007/12/10
It is shown that the lower bound on the maximum genus of a 3-edge connected loopless graph is at least one-third of its cycle rank. Moreover, this lower bound is tight. There are infinitely such graph...
The Interaction of Dirac Particles with Non-Abelian Gauge Fields and Gravity - Bound States
Dirac Particles Non-Abelian Gauge Fields Gravity - Bound States
font style='font-size:12px;'>
2010/11/2
We consider a spherically symmetric, static system of a Dirac particle interacting with classical gravity and an SU(2) Yang-Mills field. The corresponding Einstein-Dirac-Yang/Mills equations are deriv...