Related papers: A Butterfly-Accelerated Manifold Harmonic Transfor…
We propose fast, exact and efficient algorithms for the convolution of two arbitrary functions on the sphere which speed up computations by a factor \order{\sqrt{N}} compared to present methods where $N$ is the number of pixels. No…
We demonstrate a fast spin-s spherical harmonic transform algorithm, which is flexible and exact for band-limited functions. In contrast to previous work, where spin transforms are computed independently, our algorithm permits the…
A real-space formalism for density-functional perturbation theory (DFPT) is derived and applied for the computation of harmonic vibrational properties in molecules and solids. The practical implementation using numeric atom-centered…
We propose a method to simultaneously compute scalar basis functions with an associated functional map for a given pair of triangle meshes. Unlike previous techniques that put emphasis on smoothness with respect to the Laplace--Beltrami…
Laplacian eigenmodes on homogeneous Clifford--Klein factors of the three--sphere are obtained as pullbacks of harmonics on the orbifolded two--sphere using the Hopf map. A method of obtaining these polyhedral, or crystal, harmonics using…
Eigenfunctions of the Laplace-Beltrami operator on a hyperboloid are studied in the spirit of the treatment of the spherical harmonics by Stein and Weiss. As a special case, a simple self-contained proof of Laplace's integral for a Legendre…
We present and implement an algorithm for computing the invariant circle and the corresponding stable manifolds for 2-dimensional maps. The algorithm is based on the parameterization method, and it is backed up by an a-posteriori theorem…
Fitting an unknown number of hyperplanes to data is a fundamental yet challenging problem in machine learning, characterized by its non-convexity, non-differentiability, and unknown model order. Existing approaches often struggle with local…
Smoothness and low dimensional structures play central roles in improving generalization and stability in learning and statistics. This work combines techniques from semi-infinite constrained learning and manifold regularization to learn…
We present a unified representation-theoretic method to compute the Laplace-Beltrami spectrum on homogeneous principal bundles. For this setting, we introduce a multi-parameter family of metric deformations called generalized canonical…
The following two inversion methods for Radon-like transforms are widely used in integral geometry and related harmonic analysis. The first method invokes mean value operators in accordance with the classical Funk-Radon-Helgason scheme. The…
For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…
Many areas of science and engineering encounter data defined on spherical manifolds. Modelling and analysis of spherical data often necessitates spherical harmonic transforms, at high degrees, and increasingly requires efficient computation…
We consider a compact Riemannian manifold with boundary and a metric that is singular at the boundary. The associated Laplace-Beltrami operator is of the form of a Grushin operator plus a singular potential. In a supercritical parameter…
Fast Fourier Transforms (FFT) are widely used to reduce memory and computational costs in deep learning. However, existing implementations, including standard FFT and real FFT (rFFT), cannot achieve true in-place computation. In particular,…
The conjugate function method is an algorithm for numerical computation of conformal mappings for simply and multiply connected domains. In this paper, the conjugate function method is extended to cover conformal mappings between Riemannian…
Eigenvalue problems are fundamental to mathematics and science. We present a simple algorithm for determining eigenvalues and eigenfunctions of the Laplace--Beltrami operator on rather general curved surfaces. Our algorithm, which is based…
Multi-scale processing is essential in image processing and computer graphics. Halos are a central issue in multi-scale processing. Several edge-preserving decompositions resolve halos, e.g., local Laplacian filtering (LLF), by extending…
The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$. If $q$ or $q-1$ is a…
We use the well-known observation that the solutions of Jacobi's differential equation can be represented via non-oscillatory phase and amplitude functions to develop a fast algorithm for computing multi-dimensional Jacobi polynomial…