Computational and experimental studies of fluid flow and heat transfer in a Calandria based reactor

CFD investigations are carried out to study the heat flux and temperature distribution in the calandria using a 3–Dimensional RANS code. Internal flow computations and experimental studies are carried out for a calandria embedded with a matrix of tubes working together as a reactor. Numerical investigations are carried on the Calandria reactor vessel with horizontal inlets and outlets located on top and the bottom to study the flow pattern and the associated temperature distribution. The computations have been carried out to simulate fluid flow and convective heat transfer for assigned near–to working conditions with different moderator injection rates and reacting heat fluxes. The results of computations provide an estimate of the tolerance bands for safe working limits for the heat dissipation at different working conditions by virtue of prediction of the hot spots in the calandria. The isothermal CFD results are validated by a set of experiments on a specially designed scaled model conducted over a range of flows and simulation parameters. The comparison of CFD results with experiments show good agreement.

Partial Flow Sensitivity

Compiler optimizations need precise and scalable analyses to discover program properties. We propose a partially flow-sensitive framework that tries to draw on the scalability of flow-insensitive algorithms while providing more precision at some specific program points. Provided with a set of critical nodes — basic blocks at which more precise information is desired — our partially flow-sensitive algorithm computes a reduced control-flow graph by collapsing some sets of non-critical nodes. The algorithm is more scalable than a fully flow-sensitive one as, assuming that the number of critical nodes is small, the reduced flow-graph is much smaller than the original flow-graph. At the same time, a much more precise information is obtained at certain program points than would had been obtained from a flow-insensitive algorithm.

A family of Runge-Kutta based explicit methods for rotational dynamics

The present paper develops a family of explicit algorithms for rotational dynamics and presents their comparison with several existing methods. For rotational motion the configuration space is a non-linear manifold, not a Euclidean vector space. As a consequence the rotation vector and its time derivatives correspond to different tangent spaces of rotation manifold at different time instants. This renders the usual integration algorithms for Euclidean space inapplicable for rotation. In the present algorithms this problem is circumvented by relating the equation of motion to a particular tangent space. It has been accomplished with the help of already existing relation between rotation increments which belongs to two different tangent spaces. The suggested method could in principle make any integration algorithm on Euclidean space, applicable to rotation. However, the present paper is restricted only within explicit Runge-Kutta enabled to handle rotation. The algorithms developed here are explicit and hence computationally cheaper than implicit methods. Moreover, they appear to have much higher local accuracy and hence accurate in predicting any constants of motion for reasonably longer time. The numerical results for solutions as well as constants of motion, indicate superior performance by most of our algorithms, when compared to some of the currently known algorithms, namely ALGO-C1, STW, LIEMID[EA], MCG, SUBCYC-M.