Two-dimensional isostatic meshes in the finite element method

In a Finite Element (FE) analysis of elastic solids several items are usually considered, namely, type and shape of the elements, number of nodes per element, node positions, FE mesh, total number of degrees of freedom (dot) among others. In this paper a method to improve a given FE mesh used for a particular analysis is described. For the improvement criterion different objective functions have been chosen (Total potential energy and Average quadratic error) and the number of nodes and dof's of the new mesh remain constant and equal to the initial FE mesh. In order to find the mesh producing the minimum of the selected objective function the steepest descent gradient technique has been applied as optimization algorithm. However this efficient technique has the drawback that demands a large computation power. Extensive application of this methodology to different 2-D elasticity problems leads to the conclusion that isometric isostatic meshes (ii-meshes) produce better results than the standard reasonably initial regular meshes used in practice. This conclusion seems to be independent on the objective function used for comparison. These ii-meshes are obtained by placing FE nodes along the isostatic lines, i.e. curves tangent at each point to the principal direction lines of the elastic problem to be solved and they should be regularly spaced in order to build regular elements. That means ii-meshes are usually obtained by iteration, i.e. with the initial FE mesh the elastic analysis is carried out. By using the obtained results of this analysis the net of isostatic lines can be drawn and in a first trial an ii-mesh can be built. This first ii-mesh can be improved, if it necessary, by analyzing again the problem and generate after the FE analysis the new and improved ii-mesh. Typically, after two first tentative ii-meshes it is sufficient to produce good FE results from the elastic analysis. Several example of this procedure are presented.

Optimized design of the prestress in continuous bridge decks

In this paper a method for automatic design of the prestress in continuous bridge decks is presented. In a first step of the procedure the optimal prestressed force for a completely geometrically defined and feasible prestress layout is obtained by means of linear programming techniques. Further on, in a second step the prestress geometry and minimum force are automatically found by steepest descent optimization techniques. Finally this methodology is applied to two-span continuous bridge decks and from the obtained results some preliminary design rules can be drawn.

Registration and fusion of contrast-enhanced MRI myocardial substrate maps and X-ray angiograms

The aim of this work is to provide the necessary methods to register and fuse the endo-epicardial signal intensity (SI) maps extracted from contrast-enhanced magnetic resonance imaging (ceMRI) with X-ray coronary ngiograms using an intrinsic registrationbased algorithm to help pre-planning and guidance of catheterization procedures. Fusion of angiograms with SI maps was treated as a 2D-3D pose estimation, where each image point is projected to a Plücker line, and the screw representation for rigid motions is minimized using a gradient descent method. The resultant transformation is applied to the SI map that is then projected and fused on each angiogram. The proposed method was tested in clinical datasets from 6 patients with prior myocardial infarction. The registration procedure is optionally combined with an iterative closest point algorithm (ICP) that aligns the ventricular contours segmented from two ventriculograms.

Optimization of prestressed concrete bridge decks

In this paper a summary of the methods presently used for optimization of prestressed concrete bridge decks is given. By means of linear optimization the sizes of the prestressing cables with a given fixed geometry are obtained. This simple procedure of linear optimization is also used to obtain the ‘best’ cable profile, by combining a series of feasible cable profiles. The results are compared with the ones obtained by other researchers. A step ahead in the field of optimization of prestressed bridge decks is the simultaneous search of the geometry and size of the prestressing cables. A non-linear programming for optimization is used, namely, ‘the steepest gradient method’. The results obtained are compared with the ones computed previously by means of linear programming techniques. Finally, the general problem of structural optimization is considered. This problem consists in finding the sizes and geometries of the prestressing cables as well as the longitudinal variation of the concrete section.