Veerapaneni, Shravan K

Email Address
ORCID
Disciplines
Research Projects
Organizational Units
Position
Introduction
Research Interests

Filters

22
20072
2
2
Reset filters

Settings

Search Results

Now showing 1 - 2 of 2
  • Publication
    A High-Order Solver for the Heat Equation in 1d Domains with Moving Boundaries
    (2007-11-01) Veerapaneni, Shravan K; Biros, George
    We describe a fast high-order accurate method for the solution of the heat equation in domains with moving Dirichlet or Neumann boundaries and distributed forces. We assume that the motion of the boundary is prescribed. Our method extends the work of Greengard and Strain [Comm. Pure Appl. Math., XLIII (1990), pp. 949–963]. Our scheme is based on a time-space Chebyshev pseudo-spectral collocation discretization, which is combined with a recursive product quadrature rule to accurately and efficiently approximate convolutions with Green's function for the heat equation. We present numerical results that exhibit up to eighth-order convergence rates. Assuming N time steps and M spatial discretization points, the evaluation of the solution of the heat equation at the same number of points in space-time requires O(NM log M) work. Thus, our scheme can be characterized as "fast"; that is, it is work-optimal up to a logarithmic factor.
  • Publication
    A High-Order Solver for the Heat Equation in 1D Domains with Moving Boundaries
    (2007-10-24) Veerapaneni, Shravan K; Biros, George
    We describe a fast high-order accurate method for the solution of the heat equation in domains with moving Dirichlet or Neumann boundaries and distributed forces. We assume that the motion of the boundary is prescribed. Our method extends the work of Greengard and Strain [Comm. Pure Appl. Math., XLIII (1990), pp. 949–963]. Our scheme is based on a time-space Chebyshev pseudo-spectral collocation discretization, which is combined with a recursive product quadrature rule to accurately and efficiently approximate convolutions with Green’s function for the heat equation. We present numerical results that exhibit up to eighth-order convergence rates. Assuming N time steps and M spatial discretization points, the evaluation of the solution of the heat equation at the same number of points in space-time requires O(N M log M) work. Thus, our scheme can be characterized as “fast”; that is, it is work-optimal up to a logarithmic factor.