Search results for "Mathematical optimization"
showing 10 items of 1300 documents
Multi Stage Strategies for Single Point Incremental Forming of a Cup
2008
A five stage forming strategy for Single Point Incremental Forming of a circular cylindrical cup with a height/radius ratio of one is presented. Geometrical relations are discussed and theoretical strains are calculated. The influence of forming direction (upwards or downwards) is investigated for the second stage comparing explicit FE analysis with experiments. Good agreement is found between calculated and measured thickness distribution, overall geometry and strains. Using the proposed multi stage strategy it is shown possible to produce a cup with a height close to the radius and sides parallel to the symmetry axis in about half of the depth.
Geometric optimal control of the contrast problem in Magnetic Resonance Imaging
2012
Abstract The control of the dynamics of spin systems by magnetic fields has opened intriguing possibilities in quantum computing and in Nuclear Magnetic Resonance spectroscopy. In this framework, optimal control theory has been used to design control fields able to realize a given task while minimizing a prescribed cost such as the energy of the field or the duration of the process. However, some of the powerful tools of optimal control had not been used yet for NMR applications in medical imagery. Here, we show that the geometric control theory approach can be advantageously combined with NMR methods to crucially optimize the imaging contrast. This approach is applied to a benchmark proble…
Limit Analysis of Structures with Stochastic Strength Variations∗
1972
Abstract On the basis of a probabilistic fomulation of the fundamental theorems of “limit analysis,” a procedure is developed which allows, with a very limited amount of computing work, the determination of a domain containing the probability distribution curve of the collapse load factor of any structure that satisfies the usual conditions for validity of the limit analysis, but has randomly distributed limit strengths. Further improvements of the bounds thus obtained can be achieved by the equivalent of either the equilibrium or the kinematic methods of limit analysis.
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.
A non-hydrostatic pressure distribution solver for the nonlinear shallow water equations over irregular topography
2016
Abstract We extend a recently proposed 2D depth-integrated Finite Volume solver for the nonlinear shallow water equations with non-hydrostatic pressure distribution. The proposed model is aimed at simulating both nonlinear and dispersive shallow water processes. We split the total pressure into its hydrostatic and dynamic components and solve a hydrostatic problem and a non-hydrostatic problem sequentially, in the framework of a fractional time step procedure. The dispersive properties are achieved by incorporating the non-hydrostatic pressure component in the governing equations. The governing equations are the depth-integrated continuity equation and the depth-integrated momentum equation…
Monotonic solution of flow and transport problems in heterogeneous media using Delaunay unstructured triangular meshes
2013
Transport problems occurring in porous media and including convection, diffusion and chemical reactions, can be well represented by systems of Partial Differential Equations. In this paper, a numerical procedure is proposed for the fast and robust solution of flow and transport problems in 2D heterogeneous saturated media. The governing equations are spatially discretized with unstructured triangular meshes that must satisfy the Delaunay condition. The solution of the flow problem is split from the solution of the transport problem and it is obtained with an approach similar to the Mixed Hybrid Finite Elements method, that always guarantees the M-property of the resulting linear system. The…
Biased Modern Heuristics for the OCST Problem
2011
Biasing modern heuristics is an appropriate possibility in designing problem-specific and high-quality modern heuristics. If we have knowledge about a problem we can bias the design elements of modern heuristics, namely the representation and search operator, fitness function, the initial solution, or even the search strategy. This chapter presents a case study on how the performance of modern heuristics can be increased by biasing the design elements towards high-quality solutions. Results show that problem-specific and biased modern heuristics outperform standard variants and even for large problem instances high-quality solutions can be found.
Genetic algorithms for 3d reconstruction with supershapes
2009
Supershape model is a recent primitive that represents numerous 3D shapes with several symmetry axes. The main interest of this model is its capability to reconstruct more complex shape than superquadric model with only one implicit equation. In this paper we propose a genetic algorithms to re-construct a point cloud using those primitives. We used the pseudo-Euclidean distance to introduce a threshold to handle real data imperfection and speed up the process. Simulations using our proposed fitness functions and a fitness function based on inside-outside function show that our fitness function based on the pseudo-Euclidean distance performs better.
Finding all optimal solutions to the network flow problem
1986
The problem examined in this paper is as follows: Given a feasible optimum basic solution (f.o.b.s) of the minimum cost network flow problem, find all the f.o.b.s of this problem. The existence of alternative f.o.b.s is characterized by means of elementary circuits of zero cost and length greater than two in the incremental graph associated to the given f.o.b.s. It is shown that any alternative f.o.b.s. can be obtained from the original one by circulating flow through elementary circuits belonging to a succession of incremental graphs. This result leads to the construction of an efficient algorithm to obtain all f.o.b.s. of the network flow problem.
Two-Sided Guaranteed Estimates of the Cost Functional for Optimal Control Problems with Elliptic State Equations
2014
In the paper, we discuss error estimation methods for optimal control problems with distributed control functions entering the right-hand side of the corresponding elliptic state equations. Our analysis is based on a posteriori error estimates of the functional type, which were derived in the last decade for many boundary value problems. They provide guaranteed two-sided bounds of approximation errors for any conforming approximation. If they are applied to approximate solutions of state equations, then we obtain new variational formulations of optimal control problems and guaranteed bounds of the cost functional. Moreover, for problems with linear state equations this procedure leads to gu…