نتایج جستجو برای: lower and upper bound

تعداد نتایج: 16900213  

Journal: :international journal of civil engineering 0
faradjollah askari orang farzaneh

although some 3d slope stability algorithms have been proposed in recent three decades, still role of pore pressures in three dimensional slope stability analyses and considering the effects of pore water pressure in 3d slope stability studies needs to be investigated. in this paper, a limit analysis formulation for investigation of role of the pore water pressure in three dimensional slope sta...

Caren Abrinia Jalal Pour Hosseini Baboddashti

In this paper the eccentric forward extrusion of sections has been simulated and analyzed using FEM Abaqus-explicit. The results have been compared to those obtained from upper bound theorem and experimental works. Close agreements was observed between the FEM and experimental work and as compared with the upper bound data more realistic and better predictions were made by the authors’ method. ...

For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...

This paper is devoted to the concepts of fuzzy upper and fuzzy lower contra-continuous multifunctions and also some characterizations of them are considered.

Journal: :Inf. Comput. 1992
Shiva Chaudhuri Jaikumar Radhakrishnan

India jaikumar~tcs.tifr.res.in We show non-triviallower bounds for several prefix problems in the CReW PRAM model. Our main result is an O( a( n)) lower bound for the chaining problem, matching the previously known upper bound. We give a reduction to show that the same lower bound applies to a parenthesis matching problem, again matching the previously known upper bound. We also give reductions...

2004
DENIS BELOMESTNY GRIGORI N. MILSTEIN

We develop a new approach for pricing both continuous-time and discretetime American options which is based on the fact that any American option is equivalent to a European one with a consumption process involved. This approach admits the construction of an upper bound (a lower bound) on the true price using some lower bound (an upper bound) by Monte Carlo simulation. A number of effective esti...

2015
Clive Elphick Chia-An Liu

The best degree-based upper bound for the spectral radius is due to Liu and Weng. This paper begins by demonstrating that a (forgotten) upper bound for the spectral radius dating from 1983 is equivalent to their much more recent bound. This bound is then used to compare lower bounds for the clique number. A series of line graph degree-based upper bounds for the Q-index is then proposed and comp...

Journal: :Comput. Geom. 2009
Kevin Buchin Andreas Razen Takeaki Uno Uli Wagner

For a planar point set we consider the graph of crossing-free straight-line spanning trees where two spanning trees are adjacent in the graph if their union is crossing-free. An upper bound on the diameter of this graph implies an upper bound on the diameter of the flip graph of pseudo-triangulations of the underlying point set. We prove a lower bound of Ω ( log(n)/ log(log(n)) ) for the diamet...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید