𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New bounds for the height limit of a vertical slope

✍ Scribed by Pastor, J.; Thai, T-H.; Francescato, P.


Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
313 KB
Volume
24
Category
Article
ISSN
0363-9061

No coin nor oath required. For personal study only.

✦ Synopsis


Using the "nite element method, the static and kinematic methods of limit analysis provide tools to solve many stability problems in mechanics of continuous media. The classic problem of the height limit of a Tresca or Mises vertical slope subjected to the action of gravity stems naturally from this theory in plane strain. Although the exact solution to this problem remains unknown, the present work has produced precise bounds using the static and kinematic approaches conjointly: the height limit is now between 3)760 and 3)786 C/ , being the weight per unit volume and C the soil cohesion. These tests also show that both methods, used on current workstations with industrial optimization codes such as XPRESS or OSL, are capable of solving any plane problem of limit loads in geotechnics or in structural calculus.


πŸ“œ SIMILAR VOLUMES


Bounds for the Height of a Factor of a P
✍ David W. Boyd πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 436 KB

Let \(f(x)\) be a polynomial of degree \(n\) with complex coefficients, which factors as \(f(x)=\) \(g(x) h(x)\). Let \(H(g)\) be the maximum of the absolute value of the coefficients of \(g\). For \(1 \leq p \leq \infty\), let \([f]_{p}\) denote the \(p^{\text {th }}\) Bombieri norm of \(f\). This

Some new bounds for the maximum number o
✍ Byer, Owen D. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 126 KB πŸ‘ 3 views

Let f (v, e, Ξ») denote the maximum number of proper vertex colorings of a graph with v vertices and e edges in Ξ» colors. In this paper we present some new upper bounds for f (v, e, Ξ»). In particular, a new notion of pseudoproper colorings of a graph is given, which allows us to significantly improve

New upper bounds for the greatest number
✍ Felix Lazebnik πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 185 KB

## Abstract Let 𝒻 denote the family of simple undirected graphs on __v__ vertices having __e__ edges ((__v__, __e__)‐graphs) and __P__(__G__; Ξ») be the chromatic polynomial of a graph __G.__ For the given integers __v__, __e__, and Ξ», let __f__(__v__, __e__, Ξ») denote the greatest number of proper