MSAug 1, 2014
Software for Computing the Spheroidal Wave Functions Using Arbitrary Precision ArithmeticRoss Adelman, Nail A. Gumerov, Ramani Duraiswami
The spheroidal wave functions, which are the solutions to the Helmholtz equation in spheroidal coordinates, are notoriously difficult to compute. Because of this, practically no programming language comes equipped with the means to compute them. This makes problems that require their use hard to tackle. We have developed computational software for calculating these special functions. Our software is called spheroidal and includes several novel features, such as: using arbitrary precision arithmetic; adaptively choosing the number of expansion coefficients to compute and use; and using the Wronskian to choose from several different methods for computing the spheroidal radial functions to improve their accuracy. There are two types of spheroidal wave functions: the prolate kind when prolate spheroidal coordinates are used; and the oblate kind when oblate spheroidal coordinate are used. In this paper, we describe both, methods for computing them, and our software. We have made our software freely available on our webpage.
COMP-PHOct 3, 2012
Efficient FMM accelerated vortex methods in three dimensions via the Lamb-Helmholtz decompositionNail A. Gumerov, Ramani Duraiswami
Vortex element methods are often used to efficiently simulate incompressible flows using Lagrangian techniques. Use of the FMM (Fast Multipole Method) allows considerable speed up of both velocity evaluation and vorticity evolution terms in these methods. Both equations require field evaluation of constrained (divergence free) vector valued quantities (velocity, vorticity) and cross terms from these. These are usually evaluated by performing several FMM accelerated sums of scalar harmonic functions. We present a formulation of the vortex methods based on the Lamb-Helmholtz decomposition of the velocity in terms of two scalar potentials. In its original form, this decomposition is not invariant with respect to translation, violating a key requirement for the FMM. One of the key contributions of this paper is a theory for translation for this representation. The translation theory is developed by introducing "conversion" operators, which enable the representation to be restored in an arbitrary reference frame. Using this form, extremely efficient vortex element computations can be made, which need evaluation of just two scalar harmonic FMM sums for evaluating the velocity and vorticity evolution terms. Details of the decomposition, translation and conversion formulae, and sample numerical results are presented.
NAAug 6, 2014
Preconditioned Krylov solvers for kernel regressionBalaji Vasan Srinivasan, Qi Hu, Nail A. Gumerov et al.
A primary computational problem in kernel regression is solution of a dense linear system with the $N\times N$ kernel matrix. Because a direct solution has an O($N^3$) cost, iterative Krylov methods are often used with fast matrix-vector products. For poorly conditioned problems, convergence of the iteration is slow and preconditioning becomes necessary. We investigate preconditioning from the viewpoint of scalability and efficiency. The problems that conventional preconditioners face when applied to kernel methods are demonstrated. A \emph{novel flexible preconditioner }that not only improves convergence but also allows utilization of fast kernel matrix-vector products is introduced. The performance of this preconditioner is first illustrated on synthetic data, and subsequently on a suite of test problems in kernel regression and geostatistical kriging.
NANov 28, 2016
Fast Multipole Method based filtering of non-uniformly sampled dataNail A. Gumerov, Ramani Duraiswami
Non-uniform fast Fourier Transform (NUFFT) and inverse NUFFT (INUFFT) algorithms, based on the Fast Multipole Method (FMM) are developed and tested. Our algorithms are based on a novel factorization of the FFT kernel, and are implemented with attention to data structures and error analysis. Note: This unpublished manuscript was available on our web pages and has been referred to by others in the literature. To provide a proper archival reference we are placing it on arXiv.
COMP-PHJun 15, 2015Code
Accurate computation of Galerkin double surface integrals in the 3-D boundary element methodRoss Adelman, Nail A. Gumerov, Ramani Duraiswami
Many boundary element integral equation kernels are based on the Green's functions of the Laplace and Helmholtz equations in three dimensions. These include, for example, the Laplace, Helmholtz, elasticity, Stokes, and Maxwell's equations. Integral equation formulations lead to more compact, but dense linear systems. These dense systems are often solved iteratively via Krylov subspace methods, which may be accelerated via the fast multipole method. There are advantages to Galerkin formulations for such integral equations, as they treat problems associated with kernel singularity, and lead to symmetric and better conditioned matrices. However, the Galerkin method requires each entry in the system matrix to be created via the computation of a double surface integral over one or more pairs of triangles. There are a number of semi-analytical methods to treat these integrals, which all have some issues, and are discussed in this paper. We present novel methods to compute all the integrals that arise in Galerkin formulations involving kernels based on the Laplace and Helmholtz Green's functions to any specified accuracy. Integrals involving completely geometrically separated triangles are non-singular and are computed using a technique based on spherical harmonics and multipole expansions and translations, which results in the integration of polynomial functions over the triangles. Integrals involving cases where the triangles have common vertices, edges, or are coincident are treated via scaling and symmetry arguments, combined with automatic recursive geometric decomposition of the integrals. Example results are presented, and the developed software is available as open source.
MSAug 5, 2014
Semi-Analytical Computation of Acoustic Scattering by Spheroids and DisksRoss Adelman, Nail A. Gumerov, Ramani Duraiswami
Analytical solutions to acoustic scattering problems involving nonspherical shapes, such as spheroids and disks, have long been known and have many applications. However, these solutions require special functions that are not easily computable. For this reason, their asymptotic forms are typically used since they are more readily available. We explore these solutions and provide computational software for calculating their nonasymptotic forms, which are accurate over a wide range of frequencies and distances. This software, which runs in MATLAB, computes the solutions to acoustic scattering problems involving spheroids and disks by semi-analytical means, and is freely available from our webpage.