Related papers: Approximate inversion of discrete Fourier integral…
A fast direct inversion scheme for the large sparse systems of linear equations resulting from the discretization of elliptic partial differential equations in two dimensions is given. The scheme is described for the particular case of a…
This paper analyzes the convergence of fixed-point iterations of the form u = f(u) and the properties of the inverse of the related pentadiagonal matrices, associated with the fourth-order nonlinear beam equation. This nonlinear problem is…
In calculating integral or discrete transforms, use has been made of fast algorithms for multiplying vectors by matrices whose elements are specified as values of special (Chebyshev, Legendre, Laguerre, etc.) functions. The currently…
The purpose of this paper is twofold. First, basic concepts such as Gamma function, almost convergence, fractional order difference operator and sequence spaces are given as a survey character. Thus, the current knowledge about those…
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…
The graph fractional Fourier transform (GFRFT) for unitary graph Fourier transform (GFT) matrices can be interpreted through the scalar function $e^{j\alpha\theta}$ on the unit circle. Under the principal branch, its Fourier-series…
This paper is concerned with the inverse elastic scattering problem to determine the shape and location of an elastic cavity. By establishing a one-to-one correspondence between the Herglotz wave function and its kernel, we introduce the…
We present and analyze an approximation scheme for a class of highly oscillatory kernel functions, taking the 2D and 3D Helmholtz kernels as examples. The scheme is based on polynomial interpolation combined with suitable pre- and…
We introduce efficient $(1+\varepsilon)$-approximation algorithms for the binary matrix factorization (BMF) problem, where the inputs are a matrix $\mathbf{A}\in\{0,1\}^{n\times d}$, a rank parameter $k>0$, as well as an accuracy parameter…
This paper discusses the explicit inverse of a class of seven-diagonal (near) Toeplitz matrices, which arises in the numerical solutions of nonlinear fourth-order differential equation with a finite difference method. A non-recurrence…
We present a general framework of localized operators, i.e., operators whose matrix coefficients with respect to the Gabor frame are concentrated on the diagonal. We show that localized operators are bounded between modulation spaces, and…
The FFT algorithm that implements the discrete Fourier transform is considered one of the top ten algorithms of the $20$th century. Its main strengths are the low computational cost of $\mathcal{O}(n \log n$) and its stability. It is one of…
We propose a novel framework for fast integral operations by uncovering hidden geometries in the row and column structures of the underlying operators. This is accomplished through the \texttt{Questionnaire} algorithm, an iterative…
Finite Cartesian products of operators play a central role in monotone operator theory and its applications. Extending such products to arbitrary families of operators acting on different Hilbert spaces is an open problem, which we address…
This investigation seeks to establish the practicality of numerical frame approximations. Specifically, it develops a new method to approximate the inverse frame operator and analyzes its convergence properties. It is established that…
In this work we deal with parametric inverse problems, which consist in recovering a finite number of parameters describing the structure of an unknown object, from indirect measurements. State-of-the-art methods for approximating a…
We propose an entropic Fourier method for the numerical discretization of the Boltzmann collision operator. The method, which is obtained by modifying a Fourier Galerkin method to match the form of the discrete velocity method, can be…
We continue studies on phase retrieval for continuous and discrete Fourier transforms in multidimensions. Using finite difference operators, we give a large class of unexpected examples of non-uniqueness for this problem, including examples…
The ability to efficiently and accurately construct an inverse frame operator is critical for establishing the utility of numerical frame approximations. Recently, the admissible frame method was developed to approximate inverse frame…
In this paper, we consider optimizing a smooth, convex, lower semicontinuous function in Riemannian space with constraints. To solve the problem, we first convert it to a dual problem and then propose a general primal-dual algorithm to…