Singular integral transforms and fast numerical algorithms
From MaRDI portal
Fast algorithms for the evaluation of the singular integral transforms \[ T_mh(\sigma)= -{1\over\pi} \int \int_{B(0,1)} {h(\zeta)\over(\zeta- \sigma)^m} d\xi d\eta, \] \(\zeta= \xi+ i\eta\), where \(m= 1,2,\dots\), a complex-valued function \(h\) defiend on \(B(0,1)= \{z:| z|< 1\}\), are presented. They are based on some recursive relations in Fourier space and fast Fourier transform and have theoretical computational complexity of the order \(O(\log N)\) per point, where \(N^2\) is the total number of grid points.
Recommendations
Cited in
(14)- Recurrence relations and fast algorithms
- Methods for fast computation of integral transforms
- A parallel version of a fast algorithm for singular integral transforms
- The FFTRR-based fast direct algorithms for complex inhomogeneous biharmonic problems with applications to incompressible flows
- scientific article; zbMATH DE number 4100583 (Why is no real title available?)
- scientific article; zbMATH DE number 1301766 (Why is no real title available?)
- A brief review of some application driven fast algorithms for elliptic partial differential equations
- scientific article; zbMATH DE number 723990 (Why is no real title available?)
- Complex geometrical optics solutions for anisotropic equations and applications
- Complex geometrical optics solutions for anisotropic equations and applications
- A fast parallel algorithm for the Poisson equation on a disk
- Two-dimensional density estimation using smooth invertible transformations
- The numerical evaluation of a class of logarithmically singular integral transforms
- Convergence of a numerical solver for an \(\mathbb R\)-linear Beltrami equation
This page was built for publication: Singular integral transforms and fast numerical algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1275441)