12,333 research outputs found

    Calculation of renormalized viscosity and resistivity in magnetohydrodynamic turbulence

    Full text link
    A self-consistent renormalization (RG) scheme has been applied to nonhelical magnetohydrodynamic turbulence with normalized cross helicity σc=0\sigma_c =0 and σc1\sigma_c \to 1. Kolmogorov's 5/3 powerlaw is assumed in order to compute the renormalized parameters. It has been shown that the RG fixed point is stable for ddc2.2d \ge d_c \approx 2.2. The renormalized viscosity ν\nu^* and resistivity η\eta^* have been calculated, and they are found to be positive for all parameter regimes. For σc=0\sigma_c=0 and large Alfv\'{e}n ratio (ratio of kinetic and magnetic energies) rAr_A, ν=0.36\nu^*=0.36 and η=0.85\eta^*=0.85. As rAr_A is decreased, ν\nu^* increases and η\eta^* decreases, untill rA0.25r_A \approx 0.25 where both ν\nu^* and η\eta^* are approximately zero. For large dd, both ν\nu^* and η\eta^* vary as d1/2d^{-1/2}. The renormalized parameters for the case σc1\sigma_c \to 1 are also reported.Comment: 19 pages REVTEX, 3 ps files (Phys. Plasmas, v8, 3945, 2001

    Computation of Kolmogorov's Constant in Magnetohydrodynamic Turbulence

    Get PDF
    In this paper we calculate Kolmogorov's constant for magnetohydrodynamic turbulence to one loop order in perturbation theory using the direct interaction approximation technique of Kraichnan. We have computed the constants for various Eu(k)/Eb(k)E^u(k)/E^b(k), i.e., fluid to magnetic energy ratios when the normalized cross helicity is zero. We find that KK increases from 1.47 to 4.12 as we go from fully fluid case (Eb=0)(E^b=0) to a situation when Eu/Eb=0.5% E^u/E^b=0.5, then it decreases to 3.55 in a fully magnetic limit (Eu=0)(E^u=0). When Eu/Eb=1E^u/E^b=1, we find that K=3.43K=3.43.Comment: Latex, 10 pages, no figures, To appear in Euro. Phys. Lett., 199

    Field theoretic calculation of scalar turbulence

    Full text link
    The cascade rate of passive scalar and Bachelor's constant in scalar turbulence are calculated using the flux formula. This calculation is done to first order in perturbation series. Batchelor's constant in three dimension is found to be approximately 1.25. In higher dimension, the constant increases as d1/3d^{1/3}.Comment: RevTex4, publ. in Int. J. Mod. Phy. B, v.15, p.3419, 200

    Incompressible Turbulence as Nonlocal Field Theory

    Full text link
    It is well known that incompressible turbulence is nonlocal in real space because sound speed is infinite in incompressible fluids. The equation in Fourier space indicates that it is nonlocal in Fourier space as well. Contrast this with Burgers equation which is local in real space. Note that the sound speed in Burgers equation is zero. In our presentation we will contrast these two equations using nonlocal field theory. Energy spectrum and renormalized parameters will be discussed.Comment: 7 pages; Talk presented in Conference on "Perspectives in Nonlinear Dynamics (PNLD 2004)" held in Chennai, 200

    Large-Eddy Simulations of Fluid and Magnetohydrodynamic Turbulence Using Renormalized Parameters

    Full text link
    In this paper a procedure for large-eddy simulation (LES) has been devised for fluid and magnetohydrodynamic turbulence in Fourier space using the renormalized parameters. The parameters calculated using field theory have been taken from recent papers by Verma [Phys. Rev. E, 2001; Phys. Plasmas, 2001]. We have carried out LES on 64364^3 grid. These results match quite well with direct numerical simulations of 1283128^3. We show that proper choice of parameter is necessary in LES.Comment: 12 pages, 4 figures: Proper figures inserte

    Going against the flow: A critical analysis of virtual water trade in the context of India's National River Linking Programme

    Get PDF
    Virtual water trade has been promoted as a tool to address national and regional water scarcity. In the context of international (food) trade, this concept has been applied with a view to optimize the flow of commodities considering the water endowments of nations. The concept states that water-rich countries should produce and export water intensive commodities (which indirectly carry embedded water needed for producing them) to water-scarce countries, thereby enabling the water-scarce countries to divert their precious water resources to alternative, higher productivity uses.\ud While progress has been made on quantifying virtual water flows between countries, there exists little information on virtual water trade within large countries like India. This report quantifies and critically analyzes inter-state virtual water flows in India in the context of a large inter-basin transfer plan of the Government of India.\ud Our analysis shows that the existing pattern of inter-state virtual water trade is exacerbating scarcities in already water scarce states and that rather than being dictated by water endowments, virtual water flows are influenced by other factors such as "per capita gross cropped area" and "access to secured markets". We therefore argue that in order to have a comprehensive understanding of virtual water trade, non-water factors of production need to be taken into consideration

    Optimal Data-Dependent Hashing for Approximate Near Neighbors

    Full text link
    We show an optimal data-dependent hashing scheme for the approximate near neighbor problem. For an nn-point data set in a dd-dimensional space our data structure achieves query time O(dnρ+o(1))O(d n^{\rho+o(1)}) and space O(n1+ρ+o(1)+dn)O(n^{1+\rho+o(1)} + dn), where ρ=12c21\rho=\tfrac{1}{2c^2-1} for the Euclidean space and approximation c>1c>1. For the Hamming space, we obtain an exponent of ρ=12c1\rho=\tfrac{1}{2c-1}. Our result completes the direction set forth in [AINR14] who gave a proof-of-concept that data-dependent hashing can outperform classical Locality Sensitive Hashing (LSH). In contrast to [AINR14], the new bound is not only optimal, but in fact improves over the best (optimal) LSH data structures [IM98,AI06] for all approximation factors c>1c>1. From the technical perspective, we proceed by decomposing an arbitrary dataset into several subsets that are, in a certain sense, pseudo-random.Comment: 36 pages, 5 figures, an extended abstract appeared in the proceedings of the 47th ACM Symposium on Theory of Computing (STOC 2015
    corecore