Related papers: Computing with functions in spherical and polar ge…
This paper describes a suite of algorithms for constructing low-rank approximations of an input matrix from a random linear image of the matrix, called a sketch. These methods can preserve structural properties of the input matrix, such as…
In this paper, we introduce and investigate a novel class of analytic and univalent functions of negative coefficients in the open unit disk. For this function class, we obtain characterization and distortion theorems as well as the radii…
Real-space refinement of atomic models in macromolecular crystallography or in cryo electron microscopy fits a model to a map obtained experimentally. This requires generating model maps of a limited resolution which moreover may vary from…
A fast algorithm for the approximation of a low rank LU decomposition is presented. In order to achieve a low complexity, the algorithm uses sparse random projections combined with FFT-based random projections. The asymptotic approximation…
Many algorithms in scientific computing and data science take advantage of low-rank approximation of matrices and kernels, and understanding why nearly-low-rank structure occurs is essential for their analysis and further development. This…
The direct and inverse theorems are established for the best approximation in the weighted $L^p$ space on the unit sphere of $\RR^{d+1}$, in which the weight functions are invariant under finite reflection groups. The theorems are stated…
Stochastic approximation techniques have been used in various contexts in data science. We propose a stochastic version of the forward-backward algorithm for minimizing the sum of two convex functions, one of which is not necessarily…
A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…
This paper considers filtered polynomial approximations on the unit sphere $\mathbb{S}^d\subset \mathbb{R}^{d+1}$, obtained by truncating smoothly the Fourier series of an integrable function $f$ with the help of a "filter" $h$, which is a…
In this paper, we propose a general algorithmic framework to solve a class of optimization problems on the product of complex Stiefel manifolds based on the matrix polar decomposition. We establish the weak convergence, global convergence…
Analytic methods are emerging in solid and configuration modeling, while providing new insights into a variety of shape and motion related problems by exploiting tools from group morphology, convolution algebras, and harmonic analysis.…
We describe efficient differentiation methods for computing Jacobians and gradients of a large class of matrix functions including the matrix logarithm $\log(A)$ and $p$-th roots $A^{\frac{1}{p}}$. We exploit contour integrals and conformal…
This paper reports on constructive approximation methods for three classes of holomorphic functions on the unit disk which are closely connected each other: the class of starlike and spirallike functions, the class of semigroup generators,…
In metric of spaces $L_{s}, \ 1< s\leq\infty$, we obtain exact order estimates of best approximations and approximations by Fourier sums of classes of convolutions the periodic functions that belong to unit ball of space $L_{1}$, with…
We consider the problem of approximating an affinely structured matrix, for example a Hankel matrix, by a low-rank matrix with the same structure. This problem occurs in system identification, signal processing and computer algebra, among…
We present a Fourier-based approach for high-dimensional function approximation. To this end, we analyze the truncated ANOVA (analysis of variance) decomposition and learn the anisotropic smoothness properties of the target function from…
Approximating a function with a finite series, e.g., involving polynomials or trigonometric functions, is a critical tool in computing and data analysis. The construction of such approximations via now-standard approaches like least squares…
Polynomial reproduction plays a relevant role in deriving error estimates for various approximation schemes. Local reproduction in a quasi-uniform setting is a significant factor in the estimation of error and the assessment of stability…
Sonar systems are frequently used to classify objects at a distance by using the structure of the echoes of acoustic waves as a proxy for the object's shape and composition. Traditional synthetic aperture processing is highly effective in…
The approximation properties of the finite element method can often be substantially improved by choosing smooth high-order basis functions. It is extremely difficult to devise such basis functions for partitions consisting of arbitrarily…