Application of the Sparse Cardinal Sine Decomposition to 3d Stokes Flows

Application of the Sparse Cardinal Sine Decomposition to 3d Stokes Flows

F. Alouges M. Aussal A. Lefebvre-Lepot F. Pigeonneau A. Sellier

Centre de Mathématiques Appliquées, Ecole polytechnique, France

Surface du Verre et Interfaces, Saint-Gobain, France

adHyX, Ecole polytechnique, France

Page: 
387-394
|
DOI: 
https://doi.org/10.2495/CMEM-V5-N3-387-394
Received: 
N/A
| |
Accepted: 
N/A
| | Citation

OPEN ACCESS

Abstract: 

In boundary element method (BEM), one encounters linear system with a dense and non-symmetric square matrix which might be so large that inverting the linear system is too prohibitive in terms of cpu time and/or memory. Each usual powerful treatment (Fast Multipole Method, H-matrices) developed to deal with this issue is optimized to efficiently perform matrix vector products. This work presents a new technique to adequately and quickly handle such products: the Sparse Cardinal Sine Decomposition. This approach, recently pioneered for the Laplace and Helmholtz equations, rests on the decomposition of each encountered kernel as series of radial Cardinal Sine functions. Here, we achieve this decompo- sition for the Stokes problem and implement it in MyBEM, a new fast solver for multi-physical BEM. The reported computational examples permit us to compare the advocated method against a usual BEM in terms of both accuracy and convergence.

Keywords: 

boundary element method, fast convolution, Stokes equations

  References

[1] Pozrikidis, C., Boundary Integral and Singularity Methods for Linearized Viscous Flow, Cambridge University Press: Cambridge, 1992.

[2] Greengard, L. & Rokhlin, V., The Rapid Evaluation of Potential Fields in Three Dimen-sions, In Vortex Methods, Springer Verlag, pp. 121–141, 1988.

[3] Greengard, L., The Rapid Evaluation of Potential Fields in Particle Systems, MIT Press, 1988.

[4] Hackbusch, W., A Sparse Matrix Arithmetic Based on H-Matrices. Part I. Introduction to H-matrices, Computing, 62(2), pp. 89–108, 1999.

[5] Hackbusch, W., Hierarchische Matrizen, Springer, 2009.

[6] Alouges, F. & Aussal, M., The sparse cardinal sine decomposition and its application for fast numerical convolution. Numerical Algorithms, 70(2), pp. 427–448, 2015. http://dx.doi.org/10.1007/s11075-014-9953-6

[7] Dutt, A. & Rokhlin, V., Fast fourier transforms for nonequispaced data. SIAM Journal on Scientific Computing, 14(6), pp. 1368–1393, 1993. http://dx.doi.org/10.1137/0914081

[8] Lee, J.-Y. & Greengard, L., The type 3 nonuniform FFT and its application. Journal of Computational Physics, 206(1), pp. 1–5, 2005. http://dx.doi.org/10.1016/j.jcp.2004.12.004

[9] Alouges, F., Aussal, M., Lefebvre-Lepot, A., Pigeonneau, F. & Sellier, A. The sparse cardinal sine decomposition applied to Stokes integral equations. Proceedings of the ICMF-2016, 9th International Conference on Multiphase Flow, Florence, 2016.