Related papers: An efficient algorithm for Cholesky decomposition …
Cryo-Electron Microscopy (Cryo-EM) is a Nobel prize-winning technology for determining the 3D structure of particles at near-atomic resolution. A fundamental step in the recovering of the 3D single-particle structure is to align its 2D…
We present an algorithm to reduce the computational effort for the multiplication of a given matrix with an unknown column vector. The algorithm decomposes the given matrix into a product of matrices whose entries are either zero or integer…
We consider an $\ell_1$-regularized inverse problem where both the forward and regularization operators have a Kronecker product structure. By leveraging this structure, a joint decomposition can be obtained using generalized singular value…
A fast algorithm for inverse Cholesky factorization is proposed, to compute a triangular square-root of the estimation error covariance matrix for Vertical Bell Laboratories Layered Space-Time architecture (V-BLAST). It is then applied to…
The Hadamard decomposition is a powerful technique for data analysis and matrix compression, which decomposes a given matrix into the element-wise product of two or more low-rank matrices. In this paper, we develop an efficient algorithm to…
We study Chebyshev filter diagonalization as a tool for the computation of many interior eigenvalues of very large sparse symmetric matrices. In this technique the subspace projection onto the target space of wanted eigenvectors is…
Two methods to decompose block matrices analogous to Singular Matrix Decomposition are proposed, one yielding the so called economy decomposition, and other yielding the full decomposition. This method is devised to avoid handling matrices…
Given a (possibly approximate) Cauchy matrix, how can we efficiently compute its generators? Expanding on previous work by Liesen and Luce [Linear Algebra Appl. 493 (2016) 261--280], we present a general family of algorithms for Cauchy…
A proof-of-concept framework for identifying molecules of unknown elemental composition and structure using experimental rotational data and probabilistic deep learning is presented. Using a minimal set of input data determined…
In recent years, several algorithms, which approximate matrix decomposition, have been developed. These algorithms are based on metric conservation features for linear spaces of random projection types. We show that an i.i.d sub-Gaussian…
In a previous paper, we described a computer program called Qubiter which can decompose an arbitrary unitary matrix into elementary operations of the type used in quantum computation. In this paper, we describe a method of reducing the…
Confocal microscopy of fluorescent labeled particles has been used to study the dynamical and structural properties of colloidal and granular matter in real space. Localization algorithms allow for a fully automatized determination of the…
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…
In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new…
This paper considers the use of Robust PCA in a CUR decomposition framework and applications thereof. Our main algorithms produce a robust version of column-row factorizations of matrices $\mathbf{D}=\mathbf{L}+\mathbf{S}$ where…
In this paper we present an efficient algorithm to compute the eigen decomposition of a matrix that is a weighted sum of the self outer products of vectors such as a covariance matrix of data. A well known algorithm to compute the eigen…
Cherenkov rings play a crucial role in identifying charged particles in high-energy physics (HEP) experiments. Most Cherenkov ring pattern reconstruction algorithms currently used in HEP experiments rely on a likelihood fit to the…
If a tensor with various symmetries is properly unfolded, then the resulting matrix inherits those symmetries. As tensor computations become increasingly important it is imperative that we develop efficient structure preserving methods for…
The volume of data processed by the Large Hadron Collider experiments demands sophisticated selection rules typically based on machine learning algorithms. One of the shortcomings of these approaches is their profound sensitivity to the…
We adapt the simulated annealing algorithm to the search of periodic orbits for classical multi-electron atomic systems. This is done by minimizing the n-th return distance to the initial position on a Poincare surface of section under an…