Search results for "Regular polygon"
showing 10 items of 132 documents
The stability problem and noisy projections in discrete tomography
2004
Abstract The new field of research of discrete tomography will be described in this paper. It differs from standard computerized tomography in the reduced number of projections. It needs ad hoc algorithms which usually are based on the definition of the model of the object to reconstruct. The main problems will be introduced and an experimental simulation will prove the robustness of a slightly modified version of a well known method for the reconstruction of binary planar convex sets, even in case of projections affected by error. To the best of our knowledge this is one of the first experimental study of the stability problem with a statistical approach. Prospective applications include c…
Steady-state radiation heat transfer problem
1996
In Section 8.2, we shall see that the steady-state radiative heat transfer problem can be transformed to minimization of a smooth nonquadratic functional J over a convex and closed subset of a Banach space V. To this end we firstly shortly recall some basic definitions concerning differentiability of J, because these sometimes differ in the literature.
On Γ-convergence of pairs of dual functionals
2011
Abstract The paper considers a slightly modified notion of the Γ-convergence of convex functionals in uniformly convex Banach spaces and establishes that under standard coercitivity and growth conditions the Γ-convergence of a sequence of functionals { F j } to F ˜ implies that the corresponding sequence of dual functionals { F j ⁎ } converges in an analogous sense to the dual to F ˜ functional F ˜ ⁎ .
Branch-and-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs
2019
Two critical yet frequently conflicting objectives for logistics and transportation service companies are improving customer satisfaction and reducing transportation cost. In particular, given a network of customer requests with preferred service times, it is very challenging to find vehicle routes and service schedules simultaneously that respect all operating constraints and minimize the total transportation and customers’ inconvenience costs. In this paper, we introduce the vehicle routing problem with time windows and convex node costs (VRPTW-CNC), in which we model each customer’s inconvenience cost as a convex function of the service start time at that customer. The VRPTW-CNC combine…
Broken ray transform on a Riemann surface with a convex obstacle
2014
We consider the broken ray transform on Riemann surfaces in the presence of an obstacle, following earlier work of Mukhometov. If the surface has nonpositive curvature and the obstacle is strictly convex, we show that a function is determined by its integrals over broken geodesic rays that reflect on the boundary of the obstacle. Our proof is based on a Pestov identity with boundary terms, and it involves Jacobi fields on broken rays. We also discuss applications of the broken ray transform.
Measure differential inclusions: existence results and minimum problems
2020
AbstractWe focus on a very general problem in the theory of dynamic systems, namely that of studying measure differential inclusions with varying measures. The multifunction on the right hand side has compact non-necessarily convex values in a real Euclidean space and satisfies bounded variation hypotheses with respect to the Pompeiu excess (and not to the Hausdorff-Pompeiu distance, as usually in literature). This is possible due to the use of interesting selection principles for excess bounded variation set-valued mappings. Conditions for the minimization of a generic functional with respect to a family of measures generated by equiregulated left-continuous, nondecreasing functions and to…
Locally convex quasi $C^*$-normed algebras
2012
Abstract If A 0 [ ‖ ⋅ ‖ 0 ] is a C ∗ -normed algebra and τ a locally convex topology on A 0 making its multiplication separately continuous, then A 0 ˜ [ τ ] (completion of A 0 [ τ ] ) is a locally convex quasi ∗-algebra over A 0 , but it is not necessarily a locally convex quasi ∗-algebra over the C ∗ -algebra A 0 ˜ [ ‖ ⋅ ‖ 0 ] (completion of A 0 [ ‖ ⋅ ‖ 0 ] ). In this article, stimulated by physical examples, we introduce the notion of a locally convex quasi C ∗ -normed algebra, aiming at the investigation of A 0 ˜ [ τ ] ; in particular, we study its structure, ∗-representation theory and functional calculus.
Maximal Operators with Respect to the Numerical Range
2018
Let $\mathfrak{n}$ be a nonempty, proper, convex subset of $\mathbb{C}$. The $\mathfrak{n}$-maximal operators are defined as the operators having numerical ranges in $\mathfrak{n}$ and are maximal with this property. Typical examples of these are the maximal symmetric (or accretive or dissipative) operators, the associated to some sesquilinear forms (for instance, to closed sectorial forms), and the generators of some strongly continuous semi-groups of bounded operators. In this paper the $\mathfrak{n}$-maximal operators are studied and some characterizations of these in terms of the resolvent set are given.
Inflection points and topology of surfaces in 4-space
2000
We consider asymptotic line fields on generic surfaces in 4-space and show that they are globally defined on locally convex surfaces, and their singularities are the inflection points of the surface. As a consequence of the generalized Poincare-Hopf formula, we obtain some relations between the number of inflection points in a generic surface and its Euler number. In particular, it follows that any 2-sphere, generically embedded as a locally convex surface in 4-space, has at least 4 inflection points.
Convex semi-infinite games
1986
This paper introduces a generalization of semi-infinite games. The pure strategies for player I involve choosing one function from an infinite family of convex functions, while the set of mixed strategies for player II is a closed convex setC inRn. The minimax theorem applies under a condition which limits the directions of recession ofC. Player II always has optimal strategies. These are shown to exist for player I also if a certain infinite system verifies the property of Farkas-Minkowski. The paper also studies certain conditions that guarantee the finiteness of the value of the game and the existence of optimal pure strategies for player I.