Harish Kumar

NA
5papers
14citations
Novelty36%
AI Score39

5 Papers

NANov 10, 2011
Entropy Stable Numerical Schemes for Two-Fluid Plasma Equations

Harish Kumar, Siddhartha Mishra

Two-fluid ideal plasma equations are a generalized form of the ideal MHD equations in which electrons and ions are considered as separate species. The design of efficient numerical schemes for the these equations is complicated on account of their non-linear nature and the presence of stiff source terms, especially for high charge to mass ratios and for low Larmor radii. In this article, we design entropy stable finite difference schemes for the two-fluid equations by combining entropy conservative fluxes and suitable numerical diffusion operators. Furthermore, to overcome the time step restrictions imposed by the stiff source terms, we devise time-stepping routines based on implicit-explicit (IMEX)-Runge Kutta (RK) schemes. The special structure of the two-fluid plasma equations is exploited by us to design IMEX schemes in which only local (in each cell) linear equations need to be solved at each time step. Benchmark numerical experiments are presented to illustrate the robustness and accuracy of these schemes.

63.4NAMay 15
Entropy stable finite difference schemes for One-Fluid Two-Temperature Euler Non-equilibrium Hydrodynamics

Chetan Singh, Harish Kumar

In this work, we consider the One-Fluid Two-Temperature Euler (OFTT-Euler) equations used for modeling non-equilibrium hydrodynamics. The model comprises a system of nonlinear hyperbolic partial differential equations with non-conservative products. The model decomposed the total pressure into two scalar components: one for electrons and one for ions. Our aim in this work is to design entropy-stable finite difference numerical schemes for the model. This is achieved by reformulating the equations such that the reformulated non-conservative part does not contribute to the entropy. Then, we design higher-order entropy-conservative numerical schemes by using Tadmor's relation for the conservative part and higher-order central differences for the non-conservative parts. Finally, we design the entropy-dissipation terms using the entropy-scaled right eigenvectors of the conservative part, thereby deriving the entropy inequality for the entire system. We present several test cases in one and two dimensions to demonstrate the accuracy and stability of the proposed schemes.

9.1NAApr 22
Admissible Lax-Wendroff Flux Reconstruction Method with Automatic Differentiation on Adaptive Curved Meshes for Relativistic Hydrodynamics

Sujoy Basak, Arpit Babbar, Harish Kumar et al.

The relativistic hydrodynamics (RHD) equations can give rise to solutions which have shocks, contact discontinuities, and other sharp structures, which interact and evolve over time. Capturing these sharp waves effectively requires a mesh with high resolution, making the scheme computationally expensive. In this work, adaptive mesh refinement is used with the high-order Lax-Wendroff flux reconstruction (LWFR) method to solve the system of RHD equations, which is closed with general equations of state. To make the scheme Jacobian-free, the idea of automatic differentiation is incorporated for computing the temporal derivatives in the time average flux approximations. The high-order method is blended with an admissible low-order method at the subcell level to control the Gibbs oscillations and maintain the physical admissibility of the solution. Finally, several test cases involving high Lorentz factors, low densities, low pressures, strong shock waves, and other discontinuities are used to demonstrate the robustness, accuracy, and effectiveness of the proposed method. These simulations are performed with AMR using various linear and curved meshes to show the scheme's efficiency and ability to handle complex geometries.

SDFeb 5, 2019
Polyphonic Music Composition with LSTM Neural Networks and Reinforcement Learning

Harish Kumar, Balaraman Ravindran

In the domain of algorithmic music composition, machine learning-driven systems eliminate the need for carefully hand-crafting rules for composition. In particular, the capability of recurrent neural networks to learn complex temporal patterns lends itself well to the musical domain. Promising results have been observed across a number of recent attempts at music composition using deep RNNs. These approaches generally aim at first training neural networks to reproduce subsequences drawn from existing songs. Subsequently, they are used to compose music either at the audio sample-level or at the note-level. We designed a representation that divides polyphonic music into a small number of monophonic streams. This representation greatly reduces the complexity of the problem and eliminates an exponential number of probably poor compositions. On top of our LSTM neural network that learnt musical sequences in this representation, we built an RL agent that learnt to find combinations of songs whose joint dominance produced pleasant compositions. We present Amadeus, an algorithmic music composition system that composes music that consists of intricate melodies, basic chords, and even occasional contrapuntal sequences.

NINov 12, 2013
Sampling Based Approaches to Handle Imbalances in Network Traffic Dataset for Machine Learning Techniques

Raman Singh, Harish Kumar, R. K. Singla

Network traffic data is huge, varying and imbalanced because various classes are not equally distributed. Machine learning (ML) algorithms for traffic analysis uses the samples from this data to recommend the actions to be taken by the network administrators as well as training. Due to imbalances in dataset, it is difficult to train machine learning algorithms for traffic analysis and these may give biased or false results leading to serious degradation in performance of these algorithms. Various techniques can be applied during sampling to minimize the effect of imbalanced instances. In this paper various sampling techniques have been analysed in order to compare the decrease in variation in imbalances of network traffic datasets sampled for these algorithms. Various parameters like missing classes in samples, probability of sampling of the different instances have been considered for comparison.