Related papers: Superfast solution of Toeplitz systems based on sy…
We present a very fast algorithm for general matrix factorization of a data matrix for use in the statistical analysis of high-dimensional data via latent factors. Such data are prevalent across many application areas and generate an…
We present a new algorithm for fast matrix multiplication using tensor decompositions which have special features. Thanks to these features we obtain exponents lower than what the rank of the tensor decomposition suggests. In particular for…
A Riemannian gradient descent algorithm and a truncated variant are presented to solve systems of phaseless equations $|Ax|^2=y$. The algorithms are developed by exploiting the inherent low rank structure of the problem based on the…
In quantum mechanics, the Rosen-Zener model represents a two-level quantum system. Its generalization to multiple degenerate sets of states leads to larger non-autonomous linear system of ordinary differential equations (ODEs). We propose a…
The higher-order superintegrability of separable potentials is studied. It is proved that these potentials possess (in addition to the two quadratic integrals) a third integral of higher-order in the momenta that can be obtained as the…
We consider the class of positive bounded and semi-continuous functions defined on the two dimensional torus If f belongs to this class, then f will be considered as the symbol of a Toeplitz operator truncated on a triangle parametrised by…
In this paper we describe a new algorithm called Fast Adaptive Sequencing Technique (FAST) for maximizing a monotone submodular function under a cardinality constraint $k$ whose approximation ratio is arbitrarily close to $1-1/e$, is…
In recent years, there has been a renewed interest in preconditioning for multilevel Toeplitz systems, a research field that has been extensively explored over the past several decades. This work introduces novel preconditioning strategies…
We survey some results on linear-time algorithms for systolic arrays. In particular, we show how the greatest common divisor (GCD) of two polynomials of degree n over a finite field can be computed in time O(n) on a linear systolic array of…
We disprove a conjecture by Ye and Lim, by showing that there are $3 \times 3$ complex matrices which can't be expressed as the product of two Toeplitz matrices of the same size. We also improve previous estimates by Ye and Lim on the…
Submodular functions describe a variety of discrete problems in machine learning, signal processing, and computer vision. However, minimizing submodular functions poses a number of algorithmic challenges. Recent work introduced an…
Source enumeration typically relies on subspace-based techniques that require accurate separation of signal and noise subspaces. However, prior works do not address coherent sources in small uniform linear arrays, where ambiguities arise in…
We present a simple and convenient analytical formula for efficient exact computation of the hafnian of Toeplitz matrices of a special type. An interpretation of the obtained results is given in the language of perfect matchings and Bessel…
In this paper, we consider robust system identification under sparse outliers and random noises. In this problem, system parameters are observed through a Toeplitz matrix. All observations are subject to random noises and a few are…
A method of fast linear transform algorithm synthesis for an arbitrary tensor, matrix, or vector is proposed. The method is based on factorization of a tensor and using the factors for building computational structures performing fast…
We propose an effective and flexible way to implement 2D and 3D elastoplastic problems in MATLAB using fully vectorized codes. Our technique is applied to a broad class of the problems including perfect plasticity or plasticity with…
We prove a higher order asymptotic formula for traces of finite block Toeplitz matrices with symbols belonging to H\"older-Zygmund spaces. The remainder in this formula goes to zero very rapidly for very smooth symbols. This formula refine…
"Toeplitzification" or "redundancy (spatial) averaging", the well-known routine for deriving the Toeplitz covariance matrix estimate from the standard sample covariance matrix, recently regained new attention due to the important Random…
We obtain algorithms for computing Tverberg partitions based on centerpoint approximations. This applies to a wide range of convexity spaces, from the classic Euclidean setting to geodetic convexity in graphs. In the Euclidean setting, we…
The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…