Related papers: Fast polynomial transforms based on Toeplitz and H…
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform several modular operations with machine integer or floating point…
The quantum Fourier transform and quantum wavelet transform have been cornerstones of quantum information processing. However, for non-stationary signals and anomaly detection, the Hilbert transform can be a more powerful tool, yet no prior…
In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…
Efficient algorithms for computing linear convolutions based on the fast Fourier transform are developed. A hybrid approach is described that combines the conventional practice of explicit dealiasing (explicitly padding the input data with…
We consider the classical problems of interpolating a polynomial given a black box for evaluation, and of multiplying two polynomials, in the setting where the bit-lengths of the coefficients may vary widely, so-called unbalanced…
In recent work, Darmon, Pozzi and Vonk explicitly construct a modular form whose spectral coefficients are $p$-adic logarithms of Gross-Stark units and Stark-Heegner points. Here we describe how this construction gives rise to a practical…
Discrete orthogonal matrices have several applications in information technology, such as in coding and cryptography. It is often challenging to generate discrete orthogonal matrices. A common approach widely in use is to discretize…
Recently Hashemi and Kapur published an algorithm [1] for Groebner basis conversion by truncating polynomials according to a source and a target monomial order. Here we present a counterexample to this algorithm.
Let p be prime and Zpn the degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast algorithms for common operations in Zpn modulo p^N. Combining existing methods with recent work…
This paper provides an accurate method to obtain the bidiagonal factorization of many generalized Pascal matrices, which in turn can be used to compute with high relative accuracy the eigenvalues, singular values and inverses of these…
We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…
This paper introduces the interpolative butterfly factorization for nearly optimal implementation of several transforms in harmonic analysis, when their explicit formulas satisfy certain analytic properties and the matrix representations of…
We present two conjectures regarding the running time of computing symmetric factorizations for a Hankel matrix $\mathbf{H}$ and its inverse $\mathbf{H}^{-1}$ as $\mathbf{B}\mathbf{B}^*$ under fixed-point arithmetic. If solved, these would…
We give a characterization of compact and Fredholm operators on polyanalytic Fock spaces in terms of limit operators. As an application we obtain a generalization of the Bauer-Isralowitz theorem using a matrix valued Berezin type transform.…
The fast multipole method (FMM) has had great success in reducing the computational complexity of solving the boundary integral form of the Helmholtz equation. We present a formulation of the Helmholtz FMM that uses Fourier basis functions…
In this paper, we develop fast multipole methods for 3D Helmholtz kernel in layered media. Two algorithms based on different forms of Taylor expansion of layered media Green's function are developed. A key component of the first algorithm…
In this paper, we achieve three primary objectives related to the rigorous computational analysis of nonlinear PDEs posed on complex geometries such as disks and cylinders. First, we introduce a validated Matrix Multiplication Transform…
A generalization of the classical one-dimensional Darboux transformation to arbitrary n-dimensional oriented Riemannian manifolds is constructed using an intrinsic formulation based on the properties of twisted Hodge Laplacians. The…
We study how to estimate a nearly low-rank Toeplitz covariance matrix $T$ from compressed measurements. Recent work of Qiao and Pal addresses this problem by combining sparse rulers (sparse linear arrays) with frequency finding (sparse…
Kronecker products of unitary Fourier matrices play important role in solving multilevel circulant systems by a multidimensional Fast Fourier Transform. They are also special cases of complex Hadamard (Zeilinger) matrices arising in many…