The FFTRR-based fast decomposition methods for solving complex biharmonic problems and incompressible flows Academic Article uri icon

abstract

  • © 2015 The authors 2015. Published by Oxford University Press on behalf of the Institute of Mathematics and its Applications. All rights reserved. In this work, we present several computational results on the complex biharmonic problems. First, we derive fast Fourier transform recursive relation (FFTRR)-based fast algorithms for solving Dirichlet- and Neumann-type complex Poisson problems in the complex plane. These are based on the use of FFT, analysis-based RRs in Fourier space, and high-order quadrature methods. Our second result is the application of these fast Poisson algorithms to solving four types of inhomogeneous biharmonic problems in the complex plane using decomposition methods. Lastly, we apply these high-order accurate fast algorithms for the complex inhomogeneous biharmonic problems to solving Stokes flow problems at low and moderate Reynolds number. All these algorithms are inherently parallelizable, though only sequential implementations have been performed. These algorithms have theoretical complexity of the order O(log N) per grid point, where N2 is the total number of grid points in the discretization of the domain. These algorithms have many other desirable features, some of which are discussed in the paper. Numerical results have been presented which show performance of these algorithms.

author list (cited authors)

  • Ghosh, A., & Daripa, P.

citation count

  • 1

publication date

  • April 2016