Numerical Simulation of Groundwater Flow with Gradually Increasing Heterogeneity due to Clogging

Well injection replenishes depleting water levels in a well field. Observation well water levels some distance away from the injection well are the indicators of the success of a well injection program. Simulation of the observation well response, located a few tens of meters from the injection well, is likely to be affected by the effects of nonhomogeneous medium, inclined initial water table, and aquifer clogging. Existing algorithms, such as the U.S. Geological Survey groundwater flow software MODFLOW, are capable of handling the first two conditions, whereas time-dependent clogging effects are yet to be introduced in the groundwater flow models. Elsewhere, aquifer clogging is extensively researched in theory of filtration; scope for its application in a well field is a potential research problem. In the present paper, coupling of one such filtration theory to MODFLOW is introduced. Simulation of clogging effects during “Hansol” well recharge in the parts of western India is found to be encouraging.

Network flow-control using asynchronous stochastic approximation

We propose several stochastic approximation implementations for related algorithms in flow-control of communication networks. First, a discrete-time implementation of Kelly's primal flow-control algorithm is proposed. Convergence with probability 1 is shown, even in the presence of communication delays and stochastic effects seen in link congestion indications. This ensues from an analysis of the flow-control algorithm using the asynchronous stochastic approximation (ASA) framework. Two relevant enhancements are then pursued: a) an implementation of the primal algorithm using second-order information, and b) an implementation where edge-routers rectify misbehaving flows. Next, discretetime implementations of Kelly's dual algorithm and primaldual algorithm are proposed. Simulation results a) verifying the proposed algorithms and, b) comparing the stability properties are presented.

New approximation algorithms for minimum cycle bases of graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Numerical studies on channel formation and growth during solidification: Effect of process parameters

In the present work, solidification of a hyper-eutectic ammonium chloride solution in a bottom-cooled cavity (i.e. with stable thermal gradient) is numerically studied. A Rayleigh number based criterion is developed, which determines the conditions favorable for freckles formation. This criterion, when expressed in terms of physical properties and process parameters, yields the condition for plume formation as a function of concentration, liquid fraction, permeability, growth rate of a mushy layer and thermophysical properties. Subsequently, numerical simulations are performed for cases with initial and boundary conditions favoring freckle formation. The effects of parameters, such as cooling rate and initial concentration, on the formation and growth of freckles are investigated. It was found that a high cooling rate produced larger and more defined channels which are retained for a longer durations. Similarly, a lower initial concentration of solute resulted in fewer but more pronounced channels. The number and size of channels are also found to be related to the mushy zone thickness. The trends predicted with regard to the variation of number of channels with time under different process conditions are in accordance with the experimental observations reported in the literature.

Excitation energy transfer from a fluorophore to single-walled carbon nanotubes

We study the process of electronic excitation energy transfer from a fluorophore to the electronic energy levels of a single-walled carbon nanotube. The matrix element for the energy transfer involves the Coulombic interaction between the transition densities on the donor and the acceptor. In the Foumlrster approach, this is approximated as the interaction between the corresponding transition dipoles. For energy transfer from a dye to a nanotube, one can use the dipole approximation for the dye, but not for the nanotube. We have therefore calculated the rate using an approach that avoids the dipole approximation for the nanotube. We find that for the metallic nanotubes, the rate has an exponential dependence if the energy that is to be transferred, h is less than a threshold and a d(-5) dependence otherwise. The threshold is the minimum energy required for a transition other than the k(i,perpendicular to)=0 and l=0 transition. Our numerical evaluation of the rate of energy transfer from the dye pyrene to a (5,5) carbon nanotube, which is metallic leads to a distance of similar to 165 A degrees up to which energy transfer is appreciable. For the case of transfer to semiconducting carbon nanotubes, apart from the process of transfer to the electronic energy levels within the one electron picture, we also consider the possibility of energy transfer to the lowest possible excitonic state. Transfer to semiconducting carbon nanotubes is possible only if>=epsilon(g)-epsilon(b). The long range behavior of the rate of transfer has been found to have a d(-5) dependence if h >=epsilon(g). But, when the emission energy of the fluorophore is in the range epsilon(g)>h >=epsilon(g)-epsilon(b), the rate has an exponential dependence on the distance. For the case of transfer from pyrene to the semiconducting (6,4) carbon nanotube, energy transfer is found to be appreciable up to a distance of similar to 175 A degrees.

An asymptotic analysis of a simple model for the structure and dynamics of the Ramdas layer

This paper presents a complete asymptotic analysis of a simple model for the evolution of the nocturnal temperature distribution on bare soil in calm clear conditions. The model is based on a simplified flux emissivity scheme that provides a nondiffusive local approximation for estimating longwave radiative cooling near ground. An examination of the various parameters involved shows that the ratio of the characteristic radiative to the diffusive timescale in the problem is of order 10(-3), and can therefore be treated as a small parameter (mu). Certain other plausible approximations and linearization lead to a new equation whose asymptotic solution as mu --> 0 can be written in closed form. Four regimes, consishttp://eprints.iisc.ernet.in/cgi/users/home?screen=EPrint::Edit&eprintid=27192&stage=core#tting of a transient at nominal sunset, a radiative-diffusive boundary ('Ramdas') layer on ground, a boundary layer transient and a radiative outer solution, are identified. The asymptotic solution reproduces all the qualitative features of more exact numerical simulations, including the occurrence of a lifted temperature minimum and its evolution during night, ranging from continuing growth to relatively sudden collapse of the Ramdas layer.

Solution of MDPS using simulation-based value iteration

This article proposes a three-timescale simulation based algorithm for solution of infinite horizon Markov Decision Processes (MDPs). We assume a finite state space and discounted cost criterion and adopt the value iteration approach. An approximation of the Dynamic Programming operator T is applied to the value function iterates. This 'approximate' operator is implemented using three timescales, the slowest of which updates the value function iterates. On the middle timescale we perform a gradient search over the feasible action set of each state using Simultaneous Perturbation Stochastic Approximation (SPSA) gradient estimates, thus finding the minimizing action in T. On the fastest timescale, the 'critic' estimates, over which the gradient search is performed, are obtained. A sketch of convergence explaining the dynamics of the algorithm using associated ODEs is also presented. Numerical experiments on rate based flow control on a bottleneck node using a continuous-time queueing model are performed using the proposed algorithm. The results obtained are verified against classical value iteration where the feasible set is suitably discretized. Over such a discretized setting, a variant of the algorithm of [12] is compared and the proposed algorithm is found to converge faster.

Numerical procedure for second order non-linear ordinary differential equations and application to heat transfer problem

In this paper, we have first given a numerical procedure for the solution of second order non-linear ordinary differential equations of the type y″ = f (x;y, y′) with given initial conditions. The method is based on geometrical interpretation of the equation, which suggests a simple geometrical construction of the integral curve. We then translate this geometrical method to the numerical procedure adaptable to desk calculators and digital computers. We have studied the efficacy of this method with the help of an illustrative example with known exact solution. We have also compared it with Runge-Kutta method. We have then applied this method to a physical problem, namely, the study of the temperature distribution in a semi-infinite solid homogeneous medium for temperature-dependent conductivity coefficient.

First passage probability during random vibration

The probability that a random process crosses an arbitrary level for the first time is expressed as a Gram—Charlier series, the leading term of which is the Poisson approximation. The coefficients of this series are related to the moments of the number of level crossings. The results are applicable to both stationary and non-stationary processes. Some numerical results are presented for the response process of a linear single-degree-of-freedom oscillator under Gaussian white noise excitation.

Approximation of solutions to fractional integral equation

In this paper we shall study a fractional integral equation in an arbitrary Banach space X. We used the analytic semigroups theory of linear operators and the fixed point method to establish the existence and uniqueness of solutions of the given problem. We also prove the existence of global solution. The existence and convergence of the Faedo–Galerkin solution to the given problem is also proved in a separable Hilbert space with some additional assumptions on the operator A. Finally we give an example to illustrate the applications of the abstract results.

Numerical simulations of crack tip fields in polycrystalline plastic solids

In this paper, modes I and II crack tip fields in polycrystalline plastic solids are studied under plane strain, small scale yielding conditions. Two different initial textures of an Al–Mg alloy, viz., continuous cast AA5754 sheets in the recrystallized and cold rolled conditions, are considered. The former is nearly-isotropic, while the latter displays distinct anisotropy. Finite element simulations are performed by employing crystal plasticity constitutive equations along with a Taylor-type homogenization as well as by using the Hill quadratic yield theory. It is found that significant texture evolution occurs close to the notch tip which profoundly influences the stress and plastic strain distributions. Also, the cold rolling texture gives rise to higher magnitude of plastic strain near the tip.

Numerical simulations of crack tip fields in polycrystalline plastic solids

In this paper, modes I and II crack tip fields in polycrystalline plastic solids are studied under plane strain, small scale yielding conditions. Two different initial textures of an Al-Mg alloy, viz.,continuous cast AA5754 sheets in the recrystallized and cold rolled conditions, are considered. The former is nearly-isotropic, while the latter displays distinct anisotropy. Finite element simulations are performed by employing crystal plasticity constitutive equations along with a Taylor-type homogenization as well as by using the Hill quadratic yield theory. It is found that significant texture evolution occurs close to the notch tip which profoundly influences the stress and plastic strain distributions. Also, the cold rolling texture gives rise to higher magnitude of plastic strain near the tip. (C) 2010 Elsevier Ltd. All rights reserved.

Hardness of approximation results for the problem of finding the stopping distance in Tanner graphs

Tanner Graph representation of linear block codes is widely used by iterative decoding algorithms for recovering data transmitted across a noisy communication channel from errors and erasures introduced by the channel. The stopping distance of a Tanner graph T for a binary linear block code C determines the number of erasures correctable using iterative decoding on the Tanner graph T when data is transmitted across a binary erasure channel using the code C. We show that the problem of finding the stopping distance of a Tanner graph is hard to approximate within any positive constant approximation ratio in polynomial time unless P = NP. It is also shown as a consequence that there can be no approximation algorithm for the problem achieving an approximation ratio of 2(log n)(1-epsilon) for any epsilon > 0 unless NP subset of DTIME(n(poly(log n))).