Prabir Daripa
Texas A&M University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Prabir Daripa.
Applied Mathematics and Computation | 1999
Prabir Daripa; Wei Hua
We consider an ill-posed Boussinesq equation which arises in shallow water waves and nonlinear lattices. This equation has growing and decaying modes in the linear as well as nonlinear regimes and its linearized growth rate @s for short-waves of wavenumber k is given by @s~k^2. Previous numerical studies have addressed numerical difficulties and construction of approximate solutions for ill-posed problems with short-wave instability up to @s~k, e.g. Kelvin-Helmholtz (@s~k) and Rayleigh-Taylor (@s~k) instabilities. These same issues are addressed and critically examined here for the present problem which has more severe short-wave instability. In order to develop numerical techniques for constructing good approximate solutions of this equation, we use a finite difference scheme to investigate the effect of this short-wave instability on the numerical accuracy of the exact solitary wave solution of this equation. Computational evidence is presented which indicates that numerical accuracy of the solutions is lost very quickly due to severe growth of numerical errors, roundoff as well as truncation. We use both filtering and regularization techniques to control growth of these errors and to provide better approximate solutions of this equation. In the filtering technique, numerical experiments with three types of spectral filters of increasing order of regularity are performed. We examine the role of regularity of these filters on the accuracy of the numerical solutions. Numerical evidence is provided which indicates that the regularity of a filter plays an important role in improving the accuracy of the solutions. In the regularization technique, the ill-posed equation is regularized by adding a higher order term to the equation. Two types of higher order terms are discussed: (i) one that diminishes the growth rate of all modes below a cutoff wavenumber and sets the growth rate of all modes above it to zero; and (ii) the other one diminishes the growth rate of all modes and the growth rate asymptotically approaches to zero as the wavenumber approaches infinity. We have argued in favor of the first type of regularization and numerical results using a finite difference scheme are presented. Numerical evidence is provided which suggests that regularization in combination with the most regular (C^2 here) spectral filter for small values of the regularization parameter can provide good approximate solutions of the ill-posed Boussinesq equation for longer time than possible otherwise. Some of the ideas presented here can possibly be utilized for solving other ill-posed problems with severe short-wave instabilities and may have an important role to play in numerical studies of their solutions.
Siam Journal on Applied Mathematics | 1988
Prabir Daripa; James Glimm; Brent Lindquist; Oliver A. McBryan
Polymer flooding in oil reservoir simulation is considered in two space dimensions. The wave structures associated with such a process give rise to interesting phenomena in the nonlinear regime which have direct bearing on the efficiency of oil recovery. These waves influence and can prevent surface instabilities of the fingering mode. In this paper we resolve these waves by a front tracking method. We consider the fingering problem and the issue of oil recovery for the polymer flood. The details of these two phenomena depend on the separation between the waves and upon the viscosity contrast between the oil, water and polymer. We identify a nonlinear transfer of instability between adjacent waves and a nonlinear enhancement of recovery due to successive waves. The conclusions produced by this work are also pertinent to tracer flooding.One interesting conclusion applies to polymer injection followed by pure water injection. In this case the instability is transferred to the polymer-water interface, and th...
International Journal of Engineering Science | 2003
Prabir Daripa; Ranjan K. Dash
A class of model equations that describe the bi-directional propagation of small amplitude long waves on the surface of shallow water is derived from two-dimensional potential flow equations at various orders of approximation in two small parameters, namely the amplitude parameter a ¼ a=h0 and wavelength parameter b ¼ð h0=lÞ 2 , where a and l are the actual amplitude and wavelength of the surface wave, and h0 is the height of the undisturbed water surface from the flat bottom topography.These equations are also characterized by the surface tension parameter, namely the Bond number s ¼ C=qgh 2 , where C is the surface tension coefficient, q is the density of water, and g is the acceleration due to gravity. The traveling solitary wave solutions are explicitly constructed for a class of lower order Boussinesq
Siam Journal on Scientific and Statistical Computing | 1992
Prabir Daripa
An algorithm is provided for the fast and accurate computation of the solution of nonhomogeneous Cauchy–Riemann equations in the complex plane in the interior of a unit disk. The algorithm is based on the representation of the solution in terms of a double integral, some recursive relations in Fourier space, and fast Fourier transforms. The numerical evaluation of the solution at
Physics of Fluids | 2008
Prabir Daripa
N^2
Journal of Engineering Mathematics | 2002
Prabir Daripa; Ranjan K. Dash
points on a polar coordinate grid by straightforward summation for the double integral would require
Numerical Algorithms | 1998
Prabir Daripa; Daoud S. Mashat
O(N^2 )
Applied Mathematics Letters | 2005
Prabir Daripa; G. Paşa
floating point operations per point. Evaluation of these integrals has been optimized in this paper giving an asymptotic operation count of
Numerical Algorithms | 2003
Lori Badea; Prabir Daripa
O(\ln N)
Applied Mathematics and Computation | 2002
Ranjan K. Dash; Prabir Daripa
per point on the average. In actual implementation, the algorithm has even better computational complexity, approximately of the order of