Computational & Technology Resources
an online resource for computational,
engineering & technology publications
PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL STRUCTURES TECHNOLOGY
Edited by: B.H.V. Topping and C.A. Mota Soares
Solution of the Dynamical Problem of Pantograph-Catenary Interaction: A High Performance Computing Approach
E. Arias+, J. Benet*, P. Bruis#, F. Cuartero+ and T. Rojo+
+Computer Science Depatment, University of Castilla-La Mancha, Albacete, Spain
E. Arias, J. Benet, P. Brui, F. Cuartero, T. Rojo, "Solution of the Dynamical Problem of Pantograph-Catenary Interaction: A High Performance Computing Approach", in B.H.V. Topping, C.A. Mota Soares, (Editors), "Proceedings of the Seventh International Conference on Computational Structures Technology", Civil-Comp Press, Stirlingshire, UK, Paper 230, 2004. doi:10.4203/ccp.79.230
Keywords: high performance computing, interaction pantograph/catenary, dynamic equation, sparse linear algebra libraries.
Nowadays, society claims for better transport media, that mean, faster and more confortable. In a railway environment, faster transport can be seen as a problem of energy transmission. This energy transmission is produced in the interaction of the pantograph and catenary. An accurate model of this interaction becames essential due to the fact that a loss of contact between the pantograph and the catenary results in a loss of velocity. A very useful tool to study the behaviour of the model is the simulation by means of a set of algorithms. In this work, the calculation of the dynamical equation of the pantograph-catenary interaction in a stitched span is considered, not only from a mechanical point of view (an accurate model of the system), but also from the simulation point of view by means of a High Performance Computing Algorithm.
It is well known that in order to obtain an adequate behaviour in the pantograph/catenary system, it is necessary the existence of adequate conditions in the line, and this requires, among other aspects, a very precise mechanical calculus. Recent investigations have focused on dynamical behaviour by dynamical simulations in order to allow a better interaction of the pantograph and the catenary [4,2]; in this paper we will follow a more traditional approach, focusing in the catenary, modeled, as usual, by a set of coupled strings.
In this paper, a High Performance Computing Algorithm has been developed to obtain the solution of the dynamic problem of the pantograph/catenary system considering the stitched catenary which presents a better dynamical behaviour, because it maintains a more uniform stiffness along the span. Of course, the price to be paid consists on a greater complexity due to the existence of two kinds of carriers, the main and the secondary ones. Then, the amount of memory storage is considerable. So, it is necessary to deal with this kind of problem according to its sparse nature in order to reduce the memory requirements.
Sequential implementations of the resulting algorithm have been carried out by using standard libraries as BLAS  and SPARSKIT , in order to achieve good performance, portability, robutness and efficiency. In  the HPC algorihms allow us to reduce the execution time. Lower memory requirements also allow us to deal with more realistic (bigger) problems and, of course, to better solve the dynamic problem, in particular with the stitched catenary. The experimental results show a spectacular reduction not only in memory storage requirements but also in execution time.
purchase the full-text of this paper (price £20)