Direct numerical simulation of turbulent spots

A group of high-order finite-difference schemes for incompressible flow was implemented to simulate the evolution of turbulent spots in channel flows. The long-time accuracy of these schemes was tested by comparing the evolution of small disturbances to a plane channel flow against the growth rate predicted by linear theory. When the perturbation is the unstable eigenfunction at a Reynolds number of 7500, the solution grows only if there are a comparatively large number of (equispaced) grid points across the channel. Fifth-order upwind biasing of convection terms is found to be worse than second-order central differencing. But, for a decaying mode at a Reynolds number of 1000, about a fourth of the points suffice to obtain the correct decay rate. We show that this is due to the comparatively high gradients in the unstable eigenfunction near the walls. So, high-wave-number dissipation of the high-order upwind biasing degrades the solution especially. But for a well-resolved calculation, the weak dissipation does not degrade solutions even over the very long times (O(100)) computed in these tests. Some new solutions of spot evolution in Couette flows with pressure gradients are presented. The approach to self-similarity at long times can be seen readily in contour plots.

Accelerating Numerical Linear Algebra Kernels on a Scalable Run Time Reconfigurable Platform

Numerical Linear Algebra (NLA) kernels are at the heart of all computational problems. These kernels require hardware acceleration for increased throughput. NLA Solvers for dense and sparse matrices differ in the way the matrices are stored and operated upon although they exhibit similar computational properties. While ASIC solutions for NLA Solvers can deliver high performance, they are not scalable, and hence are not commercially viable. In this paper, we show how NLA kernels can be accelerated on REDEFINE, a scalable runtime reconfigurable hardware platform. Compared to a software implementation, Direct Solver (Modified Faddeev's algorithm) on REDEFINE shows a 29X improvement on an average and Iterative Solver (Conjugate Gradient algorithm) shows a 15-20% improvement. We further show that solution on REDEFINE is scalable over larger problem sizes without any notable degradation in performance.

Phase-plane techniques for the solution of transient-stability problems

The paper presents a graphical-numerical method for determining the transient stability limits of a two-machine system under the usual assumptions of constant input, no damping and constant voltage behind transient reactance. The method presented is based on the phase-plane criterion,1, 2 in contrast to the usual step-by-step and equal-area methods. For the transient stability limit of a two-machine system, under the assumptions stated, the sum of the kinetic energy and the potential energy, at the instant of fault clearing, should just be equal to the maximum value of the potential energy which the machines can accommodate with the fault cleared. The assumption of constant voltage behind transient reactance is then discarded in favour of the more accurate assumption of constant field flux linkages. Finally, the method is extended to include the effect of field decrement and damping. A number of examples corresponding to each case are worked out, and the results obtained by the proposed method are compared with those obtained by the usual methods.

On the solution of bivariate population balance equations for aggregation: X-discretization of space for expansion and contraction of computational domain

A new structured discretization of 2D space, named X-discretization, is proposed to solve bivariate population balance equations using the framework of minimal internal consistency of discretization of Chakraborty and Kumar [2007, A new framework for solution of multidimensional population balance equations. Chem. Eng. Sci. 62, 4112-4125] for breakup and aggregation of particles. The 2D space of particle constituents (internal attributes) is discretized into bins by using arbitrarily spaced constant composition radial lines and constant mass lines of slope -1. The quadrilaterals are triangulated by using straight lines pointing towards the mean composition line. The monotonicity of the new discretization makes is quite easy to implement, like a rectangular grid but with significantly reduced numerical dispersion. We use the new discretization of space to automate the expansion and contraction of the computational domain for the aggregation process, corresponding to the formation of larger particles and the disappearance of smaller particles by adding and removing the constant mass lines at the boundaries. The results show that the predictions of particle size distribution on fixed X-grid are in better agreement with the analytical solution than those obtained with the earlier techniques. The simulations carried out with expansion and/or contraction of the computational domain as population evolves show that the proposed strategy of evolving the computational domain with the aggregation process brings down the computational effort quite substantially; larger the extent of evolution, greater is the reduction in computational effort. (C) 2011 Elsevier Ltd. All rights reserved.

Effect of capillarity and heterogeneity in the numerical modelling of multiphase flow of fluids in unsaturated porous medium

The multiphase flow of fluids in the unsaturated porous medium is considered as a three phase flow of water, NAPL, and air simultaneously in the porous medium. The adaptive solution fully implicit modified sequential method is used for the numerical modelling. The effect of capillarity and heterogeneity effect at the interface between the media is studied and it is observed that the interface criteria has to be taken into account for the correct prediction of NAPL migration especially in heterogeneous media. The modified Newton Raphson method is used for the linearization and Hestines and Steifel Conjugate Gradient method is used as the solver.

A numerical study of variable coefficient elliptic Cauchy problem via projection method

In this paper, we investigate a numerical method for the solution of an inverse problem of recovering lacking data on some part of the boundary of a domain from the Cauchy data on other part for a variable coefficient elliptic Cauchy problem. In the process, the Cauchy problem is transformed into the problem of solving a compact linear operator equation. As a remedy to the ill-posedness of the problem, we use a projection method which allows regularization solely by discretization. The discretization level plays the role of regularization parameter in the case of projection method. The balancing principle is used for the choice of an appropriate discretization level. Several numerical examples show that the method produces a stable good approximate solution.

A Numerical Scheme for Three-Dimensional Front Propagation and Control of Jordan Mode

As an example of a front propagation, we study the propagation of a three-dimensional nonlinear wavefront into a polytropic gas in a uniform state and at rest. The successive positions and geometry of the wavefront are obtained by solving the conservation form of equations of a weakly nonlinear ray theory. The proposed set of equations forms a weakly hyperbolic system of seven conservation laws with an additional vector constraint, each of whose components is a divergence-free condition. This constraint is an involution for the system of conservation laws, and it is termed a geometric solenoidal constraint. The analysis of a Cauchy problem for the linearized system shows that when this constraint is satisfied initially, the solution does not exhibit any Jordan mode. For the numerical simulation of the conservation laws we employ a high resolution central scheme. The second order accuracy of the scheme is achieved by using MUSCL-type reconstructions and Runge-Kutta time discretizations. A constrained transport-type technique is used to enforce the geometric solenoidal constraint. The results of several numerical experiments are presented, which confirm the efficiency and robustness of the proposed numerical method and the control of the Jordan mode.

Directional Diffusion Regulator (DDR) for some numerical solvers of hyperbolic conservation laws

A computational tool called ``Directional Diffusion Regulator (DDR)'' is proposed to bring forth real multidimensional physics into the upwind discretization in some numerical schemes of hyperbolic conservation laws. The direction based regulator when used with dimension splitting solvers, is set to moderate the excess multidimensional diffusion and hence cause genuine multidimensional upwinding like effect. The basic idea of this regulator driven method is to retain a full upwind scheme across local discontinuities, with the upwind bias decreasing smoothly to a minimum in the farthest direction. The discontinuous solutions are quantified as gradients and the regulator parameter across a typical finite volume interface or a finite difference interpolation point is formulated based on fractional local maximum gradient in any of the weak solution flow variables (say density, pressure, temperature, Mach number or even wave velocity etc.). DDR is applied to both the non-convective as well as whole unsplit dissipative flux terms of some numerical schemes, mainly of Local Lax-Friedrichs, to solve some benchmark problems describing inviscid compressible flow, shallow water dynamics and magneto-hydrodynamics. The first order solutions consistently improved depending on the extent of grid non-alignment to discontinuities, with the major influence due to regulation of non-convective diffusion. The application is also experimented on schemes such as Roe, Jameson-Schmidt-Turkel and some second order accurate methods. The consistent improvement in accuracy either at moderate or marked levels, for a variety of problems and with increasing grid size, reasonably indicate a scope for DDR as a regular tool to impart genuine multidimensional upwinding effect in a simpler framework. (C) 2012 Elsevier Inc. All rights reserved.

Upper bound solution for pullout capacity of vertical anchors in sand using finite elements and limit analysis

The horizontal pullout capacity of vertical anchors embedded in sand has been determined by using an upper bound theorem of the limit analysis in combination with finite elements. The numerical results are presented in nondimensional form to determine the pullout resistance for various combinations of embedment ratio of the anchor (H/B), internal friction angle (ϕ) of sand, and the anchor-soil interface friction angle (δ). The pullout resistance increases with increases in the values of embedment ratio, friction angle of sand and anchor-soil interface friction angle. As compared to earlier reported solutions in literature, the present solution provides a better upper bound on the ultimate collapse load.

Weakly corrected numerical solutions to stochastically driven nonlinear dynamical systems

A method to weakly correct the solutions of stochastically driven nonlinear dynamical systems, herein numerically approximated through the Eule-Maruyama (EM) time-marching map, is proposed. An essential feature of the method is a change of measures that aims at rendering the EM-approximated solution measurable with respect to the filtration generated by an appropriately defined error process. Using Ito's formula and adopting a Monte Carlo (MC) setup, it is shown that the correction term may be additively applied to the realizations of the numerically integrated trajectories. Numerical evidence, presently gathered via applications of the proposed method to a few nonlinear mechanical oscillators and a semi-discrete form of a 1-D Burger's equation, lends credence to the remarkably improved numerical accuracy of the corrected solutions even with relatively large time step sizes. (C) 2015 Elsevier Inc. All rights reserved.