Related papers: FaVeST: Fast Vector Spherical Harmonic Transforms
The third medium contact has been proven to be an effective approach for simulating contact problems involving large deformations. Unlike traditional contact algorithms, the third medium contact introduces a third medium between two…
Recently the study of modeling a non-stationary signal as a superposition of amplitude and frequency-modulated Fourier-like oscillatory modes has been a very active research area. The synchrosqueezing transform (SST) is a powerful method…
A fast algorithm is developed for the directional correlation of scalar band-limited signals and band-limited steerable filters on the sphere. The asymptotic complexity associated to it through simple quadrature is of order O(L^5), where 2L…
In this article, we present an $O(N \log N)$ rapidly convergent algorithm for the numerical approximation of the convolution integral with radially symmetric weakly singular kernels and compactly supported densities. To achieve the reduced…
Fast Fourier Transform (FFT) is an essential tool in scientific and engineering computation. The increasing demand for mixed-precision FFT has made it possible to utilize half-precision floating-point (FP16) arithmetic for faster speed and…
In this paper, we develop a high-order adaptive virtual element method (VEM) to simulate the self-consistent field theory (SCFT) model in arbitrary domains. The VEM is very flexible in handling general polygon elements and can treat hanging…
The evolution of thin axisymmetric viscous accretion disks is a classic problem in astrophysics. While models based on this simplified geometry provide only approximations to the true processes of instability-driven mass and angular…
The fast Fourier transform, FFT, is a useful and prevalent algorithm in signal processing. It characterizes the spectral components of a signal, or is used in combination with other operations to perform more complex computations such as…
We develop an efficient numerical method for calculating the image stress field induced by spherical voids in materials. The method is applied to dislocation-void interactions in dislocation dynamics simulations. We obtain a complete set of…
3D image processing constitutes nowadays a challenging topic in many scientific fields such as medicine, computational physics and informatics. Therefore, development of suitable tools that guaranty a best treatment is a necessity.…
Trotterization-based, iterative approaches to quantum simulation are restricted to simulation times less than the coherence time of the quantum computer, which limits their utility in the near term. Here, we present a hybrid…
This paper describes a method of calculating the transforms, currently obtained via Fourier and reverse Fourier transforms. The method allows calculating efficiently the transforms of a signal having an arbitrary dimension of the digital…
Convolutional Neural Networks (CNNs) have become the method of choice for learning problems involving 2D planar images. However, a number of problems of recent interest have created a demand for models that can analyze spherical images.…
This paper introduces a generalised 3rd-order Spectral Representation Method for the simulation of multi-dimensional stochastic fields with asymmetric non-linearities. The simulated random fields satisfy a prescribed Power Spectrum and…
The growing interest in omnidirectional videos (ODVs) that capture the full field-of-view (FOV) has gained 360-degree saliency prediction importance in computer vision. However, predicting where humans look in 360-degree scenes presents…
The dynamics in the photosphere is governed by the multi-scale turbulent convection termed as granulation and supergranulation. It is important to derive 3-dimensional velocity vectors to understand the nature of the turbulent convection.…
Future cosmological surveys will provide 3D large scale structure maps with large sky coverage, for which a 3D Spherical Fourier-Bessel (SFB) analysis in spherical coordinates is natural. Wavelets are particularly well-suited to the…
The semivarying coefficient models are widely used in the application of finance, economics, medical science and many other areas. The functional coefficients are commonly estimated by local smoothing methods, e.g. local linear estimator.…
Recently, the butterfly approximation scheme and hierarchical approximations have been proposed for the efficient computation of integral transforms with oscillatory and with asymptotically smooth kernels. Combining both approaches, we…
We present Fast Approximate Minimum Spanning Tree (FAMST), a novel algorithm that addresses the computational challenges of constructing Minimum Spanning Trees (MSTs) for large-scale and high-dimensional datasets. FAMST utilizes a…