Search results for "Theorem"
showing 10 items of 1250 documents
An Iterative Method for Bifurcation-Free Resonant Inductive Power Transfer System Design
2021
The development of electric mobility makes the charging systems one of the main discussed topic. Among the different technologies, Resonant Inductive Power Transfer (RIPT) systems are in deep study. Several aspects, including the choice of coils, the compensation network and the bifurcation phenomenon are necessary for a proper design of the system. In this paper an iterative method for bifurcation-free RIPT system design is provided as a valid solution to the need of accurate models requiring low computational efforts.
Optimality conditions for shakedown design of trusses
1995
This paper deals with optimal shakedown design of truss structures constituted by elastic perfectly plastic material. The design problem is formulated by means of a statical approach on the grounds of the shakedown lower bound theorem, and by means of a kinematical approach on the grounds of the shakedown upper bound theorem. In both cases two different types of design problem are formulated: one searches for the minimum volume design whose shakedown limit load is assigned; the other searches for the maximum shakedown limit load design whose volume is assigned. The Kuhn-Tucker equations of the four problems here above mentioned are found by utilizing a variational approach; these equations …
Dynamic Coalitional TU Games: Distributed Bargaining among Players' Neighbors
2013
We consider a sequence of transferable utility (TU) games where, at each time, the characteristic function is a random vector with realizations restricted to some set of values. The game differs from other ones in the literature on dynamic, stochastic or interval valued TU games as it combines dynamics of the game with an allocation protocol for the players that dynamically interact with each other. The protocol is an iterative and decentralized algorithm that offers a paradigmatic mathematical description of negotiation and bargaining processes. The first part of the paper contributes to the definition of a robust (coalitional) TU game and the development of a distributed bargaining protoc…
Limit analysis of arch-beam structures by dynamic programming
1974
We study one-dimensional structures like arch-beams in the limit state of plastic collapse, on the ground of a two-dimensional yielding surface (bending moment and normal generalized stress). The proposed method, which is able to give a numerical solution of the problem of finding the limit load, rests on the upper bound theorem of limit analysis and uses dynamic programming. We examine also some questions linked with numerical procedures. A future work devoted to applications will complete the treatment.
Recent Developments on Fixed Point Theory in Function Spaces and Applications to Control and Optimization Problems
2015
1Department of Mathematics, Disha Institute of Management and Technology, Satya Vihar, Vidhansabha-Chandrakhuri Marg, Mandir Hasaud, Raipur, Chhattisgarh 492101, India 2Department of Mathematics and AppliedMathematics, University of Pretoria, Private Bag X20, Hatfield, Pretoria 0028, South Africa 3Departement de Mathematiques et de Statistique, Universite de Montreal, CP 6128, Succursale Centre-Ville, Montreal, QC, Canada H3C 3J7 4Department of Mathematics and Informatics, University of Palermo, Via Archirafi 34, 90123 Palermo, Italy
Detecting All Dependences in Systems of Geometric Constraints Using the Witness Method
2007
In geometric constraints solving, the detection of dependences and the decomposition of the system into smaller subsystems are two important steps that characterize any solving process, but nowadays solvers, which are graph-based in most of the cases, fail to detect dependences due to geometric theorems and to decompose such systems. In this paper, we discuss why detecting all dependences between constraints is a hard problem and propose to use the witness method published recently to detect both structural and non structural dependences.We study various examples of constraints systems and show the promising results of the witness method in subtle dependences detection and systems decomposi…
Solving the pentahedron problem
2015
Nowadays, all geometric modelers provide some tools for specifying geometric constraints. The 3D pentahedron problem is an example of a 3D Geometric Constraint Solving Problem (GCSP), composed of six vertices, nine edges, five faces (two triangles and three quadrilaterals), and defined by the lengths of its edges and the planarity of its quadrilateral faces. This problem seems to be the simplest non-trivial problem, as the methods used to solve the Stewart platform or octahedron problem fail to solve it. The naive algebraic formulation of the pentahedron yields an under-constrained system of twelve equations in eighteen unknowns. Even if the use of placement rules transforms the pentahedron…
A Koebe distortion theorem for quasiconformal mappings in the Heisenberg group
2017
We prove a Koebe distortion theorem for the average derivative of a quasiconformal mapping between domains in the sub-Riemannian Heisenberg group $\mathbb{H}_1$. Several auxiliary properties of quasiconformal mappings between subdomains of $\mathbb{H}_1$ are proven, including distortion of balls estimates and local BMO-estimates for the logarithm of the Jacobian of a quasiconformal mapping. Applications of the Koebe theorem include diameter bounds for images of curves, comparison of integrals of the average derivative and the operator norm of the horizontal differential, as well as the study of quasiconformal densities and metrics in domains in $\mathbb{H}_1$. The theorems are discussed for…
Rigidity and sharp stability estimates for hypersurfaces with constant and almost-constant nonlocal mean curvature
2018
We prove that the boundary of a (not necessarily connected) bounded smooth set with constant nonlocal mean curvature is a sphere. More generally, and in contrast with what happens in the classical case, we show that the Lipschitz constant of the nonlocal mean curvature of such a boundary controls its $C^2$-distance from a single sphere. The corresponding stability inequality is obtained with a sharp decay rate.
On the shape of compact hypersurfaces with almost constant mean curvature
2015
The distance of an almost constant mean curvature boundary from a finite family of disjoint tangent balls with equal radii is quantitatively controlled in terms of the oscillation of the scalar mean curvature. This result allows one to quantitatively describe the geometry of volume-constrained stationary sets in capillarity problems.