Related papers: Fast Hermite interpolation and evaluation over fin…
A trigonometric interpolation algorithm for non-periodic functions has been recently proposed and applied to study general ordinary differential equation (ODE). This paper enhances the algorithm to approximate functions in $2$-dim space.…
Spline interpolation has been used in several applications due to its favorable properties regarding smoothness and accuracy of the interpolant. However, when there exists a discontinuity or a steep gradient in the data, some artifacts can…
Most feature selection algorithms, especially wrapper methods, run inefficiently on CPU based platforms because of their high computational complexity. This inefficiency makes them unsuitable for processing large scale datasets. To address…
Various post-quantum cryptography algorithms have been recently proposed. Supersingluar isogeny Diffie-Hellman key exchange (SIKE) is one of the most promising candidates due to its small key size. However, the SIKE scheme requires numerous…
We present new, practical algorithms for the hypersurface implicitization problem: namely, given a parametric description (in terms of polynomials or rational functions) of the hypersurface, find its implicit equation. Two of them are for…
This article introduces a new fast direct solver for linear systems arising out of wide range of applications, integral equations, multivariate statistics, radial basis interpolation, etc., to name a few. \emph{The highlight of this new…
Discrete transforms such as the discrete Fourier transform (DFT) and the discrete Hartley transform (DHT) are important tools in numerical analysis. The successful application of transform techniques relies on the existence of efficient…
We propose a fast greedy algorithm to compute sparse representations of signals from continuous dictionaries that are factorizable, i.e., with atoms that can be separated as a product of sub-atoms. Existing algorithms strongly reduce the…
Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of…
We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…
The multigrid algorithm is a multilevel approach to accelerate the numerical solution of discretized differential equations in physical problems involving long-range interactions. Multiresolution analysis of wavelet theory provides an…
Analytic interpolation problems with rationality and derivative constraints occur in many applications in systems and control. In this paper we present a new method for the multivariable case, which generalizes our previous results on the…
In this paper we present a new problem, the fast set intersection problem, which is to preprocess a collection of sets in order to efficiently report the intersection of any two sets in the collection. In addition we suggest new solutions…
A coherent state representation of the expectation value of an arbitrary (but still polynomial) normal ordered quantum operator is discussed. This serves as a basis for developing a fast and easy-to-handle algorithm, based on series of…
We give a complete characterization of limiting interpolation spa\-ces for the real method of interpolation using extrapolation theory. For this purpose the usual tools (e.g., Boyd indices or the boundedness of Hardy type operators) are not…
In this paper, we propose new deterministic and Monte Carlo interpolation algorithms for sparse multivariate polynomials represented by straight-line programs. Let $f$ be an $n$-variate polynomial given by a straight-line program, which has…
Numerically solving ordinary differential equations (ODEs) is a naturally serial process and as a result the vast majority of ODE solver software are serial. In this manuscript we developed a set of parallelized ODE solvers using…
We introduce a numerical scheme for the full multi-species Boltzmann equation based on Hermite spectral method. With the proper choice of expansion centers for different species, a practical algorithm is derived to evaluate the complicated…
We examine implicit representations of parametric or point cloud models, based on interpolation matrices, which are not sensitive to base points. We show how interpolation matrices can be used for ray shooting of a parametric ray with a…
This paper deals with speeding up the convergence of a class of two-step iterative methods for solving linear systems of equations. To implement the acceleration technique, the residual norm associated with computed approximations for each…