scholarly journals Upper and lower bounds in limit analysis: Adaptive meshing strategies and discontinuous loading

2009 ◽  
Vol 77 (4) ◽  
pp. 471-501 ◽  
Author(s):  
J. J. Muñoz ◽  
J. Bonet ◽  
A. Huerta ◽  
J. Peraire
Keyword(s):  
Lower Bounds ◽  
Limit Analysis ◽  
Upper And Lower Bounds ◽  
Adaptive Meshing

scholarly journals Bounds for the Collapse Load of a Beam Compressed by Three Dies

1956 ◽  
Vol 9 (4) ◽  
pp. 419
Author(s):  
W Freiberger
Keyword(s):  
Plastic Deformation ◽  
Plastic Flow ◽  
Lower Bounds ◽  
Limit Analysis ◽  
Velocity Fields ◽  
The Other ◽  
Upper And Lower Bounds ◽  
Collapse Load ◽  
Plastic Yielding ◽  
Plane Plastic

This paper deals with the problem of the plastic deformation of a beam under the action of three perfectly rough rigid dies, two dies applied to one side, one die to the other side of the beam, the single die being situated between the two others. It is treated as a problem of plane plastic flow. Discontinuous stress and velocity fields are assumed and upper and lower bounds for the pressure sufficient to cause pronounced plastic yielding determined by limit analysis.

Limit Analysis of Nonsymmetrically Loaded Spherical Shells

1972 ◽  
Vol 39 (2) ◽  
pp. 422-430 ◽  
Author(s):  
S. Palusamy ◽  
N. C. Lind
Keyword(s):  
Lower Bounds ◽  
Limit Analysis ◽  
Upper And Lower Bounds ◽  
Spherical Shells ◽  
Limit Loads ◽  
Analytical Results

Upper and lower bounds are found for limit loads on nonsymmetrically loaded spherical shells. The influence of geometrical and load parameters are discussed. The analytical results are compared with the results of tests on four steel models.

Numerical Methods for the Limit Analysis of Plates

1968 ◽  
Vol 35 (4) ◽  
pp. 796-802 ◽  
Author(s):  
P. G. Hodge ◽  
T. Belytschko
Keyword(s):  
Finite Element ◽  
Numerical Methods ◽  
Mathematical Programming ◽  
Rectangular Plate ◽  
Yield Point ◽  
Lower Bounds ◽  
Limit Analysis ◽  
Upper And Lower Bounds ◽  
Mathematical Programming Problems

The determination of upper and lower bounds on the yield-point loads of plates are formulated as mathematical programming problems by using finite element representations for the velocity and moment fields. Results are presented for a variety of square and rectangular plate problems and are compared to other available solutions.

Limit Analysis of Symmetrically Loaded Thin Shells of Revolution

1959 ◽  
Vol 26 (1) ◽  
pp. 61-68
Author(s):  
D. C. Drucker ◽  
R. T. Shield
Keyword(s):  
Cylindrical Shell ◽  
Lower Bounds ◽  
Yield Surface ◽  
Limit Analysis ◽  
Thin Shell ◽  
Upper And Lower Bounds ◽  
Thin Shells ◽  
Hexagonal Prism ◽  
Shells Of Revolution ◽  
Thin Cylindrical Shell

Abstract The yield surface for a thin cylindrical shell is shown to be a very good approximation to the yield surface for any symmetrically loaded thin shell of revolution. Hexagonal prism approximations to this yield surface, appropriate for pressure vessel analysis, are described and discussed in terms of limit analysis. Procedures suitable for finding upper and lower bounds on the limit pressure for the complete vessel are developed and evaluated. They are applied for illustration to a portion of a toroidal zone or knuckle held rigidly at the two bounding planes. The combined end force and moment which can be carried by an unflanged cylinder also is discussed.

scholarly journals On the Generalized Distance Energy of Graphs

Mathematics ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 17 ◽  
Author(s):  
Abdollah Alhevaz ◽  
Maryam Baghipur ◽  
Hilal A. Ganie ◽  
Yilun Shang
Keyword(s):  
Lower Bounds ◽  
Complete Graph ◽  
Connected Graph ◽  
Distance Matrix ◽  
Wiener Index ◽  
Diagonal Matrix ◽  
Upper And Lower Bounds ◽  
Star Graph ◽  
Extremal Graphs ◽  
Generalized Distance

The generalized distance matrix D α ( G ) of a connected graph G is defined as D α ( G ) = α T r ( G ) + ( 1 − α ) D ( G ) , where 0 ≤ α ≤ 1 , D ( G ) is the distance matrix and T r ( G ) is the diagonal matrix of the node transmissions. In this paper, we extend the concept of energy to the generalized distance matrix and define the generalized distance energy E D α ( G ) . Some new upper and lower bounds for the generalized distance energy E D α ( G ) of G are established based on parameters including the Wiener index W ( G ) and the transmission degrees. Extremal graphs attaining these bounds are identified. It is found that the complete graph has the minimum generalized distance energy among all connected graphs, while the minimum is attained by the star graph among trees of order n.

scholarly journals Hadamard k-fractional inequalities of Fejér type for GA-s-convex mappings and applications

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Hui Lei ◽  
Gou Hu ◽  
Zhi-Jie Cao ◽  
Ting-Song Du
Keyword(s):  
Lower Bounds ◽  
Hypergeometric Functions ◽  
Upper And Lower Bounds ◽  
Weighted Inequalities ◽  
Convex Mappings ◽  
Special Means

Abstract The main aim of this paper is to establish some Fejér-type inequalities involving hypergeometric functions in terms of GA-s-convexity. For this purpose, we construct a Hadamard k-fractional identity related to geometrically symmetric mappings. Moreover, we give the upper and lower bounds for the weighted inequalities via products of two different mappings. Some applications of the presented results to special means are also provided.

scholarly journals On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 512
Author(s):  
Maryam Baghipur ◽  
Modjtaba Ghorbani ◽  
Hilal A. Ganie ◽  
Yilun Shang
Keyword(s):  
Lower Bounds ◽  
Complete Graph ◽  
Distance Matrix ◽  
Upper And Lower Bounds ◽  
Laplacian Eigenvalue ◽  
Signless Laplacian ◽  
Graph Parameters ◽  
Simple Connected Graph ◽  
Second Largest Eigenvalue ◽  
Reciprocal Distance Matrix

The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as RQ(G)=diag(RH(G))+RD(G). Here, RD(G) is the Harary matrix (also called reciprocal distance matrix) while diag(RH(G)) represents the diagonal matrix of the total reciprocal distance vertices. In the present work, some upper and lower bounds for the second-largest eigenvalue of the signless Laplacian reciprocal distance matrix of graphs in terms of various graph parameters are investigated. Besides, all graphs attaining these new bounds are characterized. Additionally, it is inferred that among all connected graphs with n vertices, the complete graph Kn and the graph Kn−e obtained from Kn by deleting an edge e have the maximum second-largest signless Laplacian reciprocal distance eigenvalue.

scholarly journals Multilevel Monte Carlo methods and lower–upper bounds in initial margin computations

2020 ◽  
Vol 26 (2) ◽  
pp. 131-161
Author(s):  
Florian Bourgey ◽  
Stefano De Marco ◽  
Emmanuel Gobet ◽  
Alexandre Zhou
Keyword(s):  
Monte Carlo ◽  
Lower Bounds ◽  
Asymptotic Optimality ◽  
Upper Bounds ◽  
Upper And Lower Bounds ◽  
Independent Random Variables ◽  
Outer Function ◽  
Control Problems ◽  
Multilevel Monte Carlo ◽  
Primal Dual

AbstractThe multilevel Monte Carlo (MLMC) method developed by M. B. Giles [Multilevel Monte Carlo path simulation, Oper. Res. 56 2008, 3, 607–617] has a natural application to the evaluation of nested expectations {\mathbb{E}[g(\mathbb{E}[f(X,Y)|X])]}, where {f,g} are functions and {(X,Y)} a couple of independent random variables. Apart from the pricing of American-type derivatives, such computations arise in a large variety of risk valuations (VaR or CVaR of a portfolio, CVA), and in the assessment of margin costs for centrally cleared portfolios. In this work, we focus on the computation of initial margin. We analyze the properties of corresponding MLMC estimators, for which we provide results of asymptotic optimality; at the technical level, we have to deal with limited regularity of the outer function g (which might fail to be everywhere differentiable). Parallel to this, we investigate upper and lower bounds for nested expectations as above, in the spirit of primal-dual algorithms for stochastic control problems.

Sign in / Sign up

Export Citation Format

Share Document