scholarly journals Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra

2005 ◽  
pp. 19-34 ◽  
Author(s):  
Roberto Bagnara ◽  
Enric Rodríguez-Carbonell ◽  
Enea Zaffanella
Keyword(s):  
Convex Polyhedra ◽  
Algebraic Invariants

scholarly journals Data-based polyhedron model for optimization of engineering structures involving uncertainties

2021 ◽  
Vol 2 ◽  
Author(s):  
Zhiping Qiu ◽  
Han Wu ◽  
Isaac Elishakoff ◽  
Dongliang Liu
Keyword(s):  
Linear Programming ◽  
Convex Polyhedron ◽  
Linear Optimization ◽  
Optimal Solution ◽  
Composite Plates ◽  
Convex Polyhedra ◽  
Chebyshev Inequality ◽  
Engineering Structures ◽  
Load Bearing ◽  
Polyhedron Model

Abstract This paper studies the data-based polyhedron model and its application in uncertain linear optimization of engineering structures, especially in the absence of information either on probabilistic properties or about membership functions in the fussy sets-based approach, in which situation it is more appropriate to quantify the uncertainties by convex polyhedra. Firstly, we introduce the uncertainty quantification method of the convex polyhedron approach and the model modification method by Chebyshev inequality. Secondly, the characteristics of the optimal solution of convex polyhedron linear programming are investigated. Then the vertex solution of convex polyhedron linear programming is presented and proven. Next, the application of convex polyhedron linear programming in the static load-bearing capacity problem is introduced. Finally, the effectiveness of the vertex solution is verified by an example of the plane truss bearing problem, and the efficiency is verified by a load-bearing problem of stiffened composite plates.

Convex polyhedra in hyperbolic space and interpolation of functions

2011 ◽  
Vol 84 (3) ◽  
pp. 850-853
Author(s):  
O. P. Gladunova ◽  
E. D. Rodionov ◽  
V. V. Slavskii
Keyword(s):  
Hyperbolic Space ◽  
Convex Polyhedra ◽  
Interpolation Of Functions

Pseudo minimum translational distance between convex polyhedra (II)

2001 ◽  
Vol 44 (4) ◽  
pp. 337-344 ◽  
Author(s):  
Xiangyang Zhu ◽  
Han Ding ◽  
Youlun Xiong
Keyword(s):  
Convex Polyhedra ◽  
Pseudo Minimum Translational Distance

Elements of Spectral Theory for Generalized Derivations II : The Semifredholm Domain

1981 ◽  
Vol 33 (5) ◽  
pp. 1205-1231 ◽  
Author(s):  
Lawrence A. Fialkow
Keyword(s):  
Hilbert Spaces ◽  
Simple Formula ◽  
Decomposition Theorem ◽  
Linear Operators ◽  
Generalized Derivations ◽  
Bounded Linear ◽  
Infinite Dimensional ◽  
Hilbert Space Operators ◽  
Algebraic Invariants ◽  
Fredholm Theorem

Let and denote infinite dimensional Hilbert spaces and let denote the space of all bounded linear operators from to . For A in and B in , let τAB denote the operator on defined by τAB(X) = AX – XB. The purpose of this note is to characterize the semi-Fredholm domain of τAB (Corollary 3.16). Section 3 also contains formulas for ind(τAB – λ). These results depend in part on a decomposition theorem for Hilbert space operators corresponding to certain “singular points” of the semi-Fredholm domain (Theorem 2.2). Section 4 contains a particularly simple formula for ind(τAB – λ) (in terms of spectral and algebraic invariants of A and B) for the case when τAB – λ is Fredholm (Theorem 4.2). This result is used to prove that (τBA) = –ind(τAB) (Corollary 4.3). We also prove that when A and B are bi-quasi-triangular, then the semi-Fredholm domain of τAB contains no points corresponding to nonzero indices.

High Order Schemes on Three-Dimensional General Polyhedral Meshes — Application to the Level Set Method

2012 ◽  
Vol 12 (1) ◽  
pp. 1-41 ◽  
Author(s):  
Thibault Pringuey ◽  
R. Stewart Cant
Keyword(s):  
Level Set ◽  
Three Dimensional ◽  
Unstructured Meshes ◽  
High Order ◽  
Convex Polyhedra ◽  
Two Phase ◽  
High Order Schemes ◽  
Flow Problems ◽  
Mixed Element ◽  
Areas Of Interest

AbstractIn this article, we detail the methodology developed to construct arbitrarily high order schemes — linear and WENO — on 3D mixed-element unstructured meshes made up of general convex polyhedral elements. The approach is tailored specifically for the solution of scalar level set equations for application to incompressible two-phase flow problems. The construction of WENO schemes on 3D unstructured meshes is notoriously difficult, as it involves a much higher level of complexity than 2D approaches. This due to the multiplicity of geometrical considerations introduced by the extra dimension, especially on mixed-element meshes. Therefore, we have specifically developed a number of algorithms to handle mixed-element meshes composed of convex polyhedra with convex polygonal faces. The contribution of this work concerns several areas of interest: the formulation of an improved methodology in 3D, the minimisation of computational runtime in the implementation through the maximum use of pre-processing operations, the generation of novel methods to handle complex 3D mixed-element meshes and finally the application of the method to the transport of a scalar level set.

Simultaneous blending of convex polyhedra by algebraic splines

2007 ◽  
Vol 39 (11) ◽  
pp. 1003-1011 ◽  
Author(s):  
Haining Mou ◽  
Guohui Zhao ◽  
Zhirui Wang ◽  
Zhixun Su
Keyword(s):  
Convex Polyhedra
Sign in / Sign up

Export Citation Format

Share Document