A fast BIE iteration method for an arbitrary body in a flow of incompressible inviscid fluid

Authors:
Antonio Scalia;Mezhlum A. Sumbatyan;Vitaly Popuzin
Affiliations:
D.M.I., University of Catania, 95125 Viale A. Doria 6 (CT), Italy;Faculty of Mathematics, Mechanics and Computer Science, Southern Federal University, Milchakova Street 8a, 344090-Rostov-on-Don, Russia;D.M.I., University of Catania, 95125 Viale A. Doria 6 (CT), Italy
Venue:
Journal of Computational and Applied Mathematics
Year:
2013

Citing 11
Cited 0

Matrix analysis

Matrix analysis
A proposal for toeplitz matrix calculations

Studies in Applied Mathematics
A fast algorithm for particle simulations

Journal of Computational Physics
Multilevel matrix multiplication and fast solution of integral equations

Journal of Computational Physics
Computational frameworks for the fast Fourier transform

Computational frameworks for the fast Fourier transform
Numerical recipes in C (2nd ed.): the art of scientific computing

Numerical recipes in C (2nd ed.): the art of scientific computing
Incomplete cross approximation in the mosaic-skeleton method

Computing
Parallel **-Matrix Arithmetics on Shared Memory Systems

Computing
An Accelerated Kernel-Independent Fast Multipole Method in One Dimension

SIAM Journal on Scientific Computing
Parallel black box $$\mathcal {H}$$-LU preconditioning for elliptic boundary value problems

Computing and Visualization in Science
A precorrected-FFT method for electrostatic analysis of complicated 3-D structures

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	7.29

Visualization

Abstract

The paper is concerned with the new iteration algorithm to solve boundary integral equations arising in boundary value problems of mathematical physics. The stability of the algorithm is demonstrated on the problem of a flow around bodies placed in the incompressible inviscid fluid. With a discrete numerical treatment, we approximate the exact matrix by a certain Toeplitz one and then apply a fast algorithm for this matrix, on each iteration step. We illustrate the convergence of this iteration scheme by a number of numerical examples, both for hard and soft boundary conditions. It appears that the method is highly efficient for hard boundaries, being much less efficient for soft boundaries.