English
Related papers

Related papers: Dual $r$-Rank Decomposition and Its Applications

200 papers

In this manuscript, we research on the behaviors of surrogates for the rank function on different image processing problems and their optimization algorithms. We first propose a novel nonconvex rank surrogate on the general rank…

Machine Learning · Computer Science 2024-09-23 Cho-Ying Wu , Jian-Jiun Ding

In this paper, we propose a domain decomposition dynamical low-rank method to solve high-dimensional radiative transfer problems and similar kinetic equations. The algorithm uses a separate low-rank approximation on each spatial subdomain,…

Numerical Analysis · Mathematics 2026-02-17 Stefan Brunner , Lukas Einkemmer , Terry Haut

New methods for $D$-decomposition analysis are presented. They are based on topology of real algebraic varieties and computational real algebraic geometry. The estimate of number of root invariant regions for polynomial parametric families…

Optimization and Control · Mathematics 2015-12-31 Oleg O. Vasil'ev

For any real diagonalizable matrix with complex eigenvalues we provide a real, coordinate free decomposition with a clear geometric interpretation.

History and Overview · Mathematics 2022-08-29 Cristobal Arratia

In this article we survey recent results on rigid dualizing complexes over commutative algebras. We begin by recalling what are dualizing complexes. Next we define rigid complexes, and explain their functorial properties. Due to the…

Algebraic Geometry · Mathematics 2008-07-20 Amnon Yekutieli

The inverse of the Vandermonde and confluent Vandermonde matrices are presented. In the case of the Vandermonde matrix, we present a decomposition in three factors, one of them a diagonal matrix. The evaluation of such inverse matrices is a…

Mathematical Physics · Physics 2016-11-26 Héctor Moya-Cessa , Francisco Soto-Eguibar

Dual complex numbers can represent rigid body motion in 2D spaces. Dual complex matrices are linked with screw theory, and have potential applications in various areas. In this paper, we study low rank approximation of dual complex…

Numerical Analysis · Mathematics 2022-02-01 Liqun Qi , David M. Alexander , Zhongming Chen , Chen Ling , Ziyan Luo

In this work we provide a decomposition theorem for the class of quaternary and non-binary signed-graphic matroids. This generalizes previous results for binary signed-graphic matroids and graphic matroids, and it provides the theoretical…

Combinatorics · Mathematics 2015-10-26 Leonidas Pitsoulis , Eleni-Maria Vretta

Tensor decomposition of high-dimensional data often struggles to capture semantically or physically meaningful structures, particularly when relying on reconstruction objectives and fixed-rank constraints. We introduce a no-rank tensor…

Machine Learning · Computer Science 2026-03-03 Maryam Bagherian

Darboux transformations in one independent variable have found numerous applications in various field of mathematics and physics. In this paper we show that the extension of these transformations to two dimensions can be used to decouple…

Mathematical Physics · Physics 2015-05-27 Mayer Humi

In this paper, we first introduce the new class of vertically-recurrent matrices, using a generalization of "the Hockey stick and Puck theorem" in Pascal's triangle. Then, we give an interesting formula for the lower triangular…

Combinatorics · Mathematics 2022-06-07 Hossein Teimoori Faal

This work studies the linear approximation of high-dimensional dynamical systems using low-rank dynamic mode decomposition (DMD). Searching this approximation in a data-driven approach is formalised as attempting to solve a low-rank…

Machine Learning · Statistics 2021-08-23 Patrick Héas , Cédric Herzet

We develop the first stochastic incremental method for calculating the Moore-Penrose pseudoinverse of a real matrix. By leveraging three alternative characterizations of pseudoinverse matrices, we design three methods for calculating the…

Numerical Analysis · Mathematics 2019-05-02 Robert M. Gower , Peter Richtárik

This paper is concerned with the problem of low rank plus sparse matrix decomposition for big data. Conventional algorithms for matrix decomposition use the entire data to extract the low-rank and sparse components, and are based on…

Numerical Analysis · Computer Science 2017-03-17 Mostafa Rahmani , George Atia

This paper is twofold. In the first part, we present a refinement of the R\'enyi Entropy Power Inequality (EPI) recently obtained in \cite{BM16}. The proof largely follows the approach in \cite{DCT91} of employing Young's convolution…

Probability · Mathematics 2018-05-01 Jiange Li

We propose a functional view of matrix decomposition problems on graphs such as geometric matrix completion and graph regularized dimensionality reduction. Our unifying framework is based on the key idea that using a reduced basis to…

Machine Learning · Computer Science 2021-02-08 Abhishek Sharma , Maks Ovsjanikov

We introduce a structured low rank matrix completion algorithm to recover a series of images from their under-sampled measurements, where the signal along the parameter dimension at every pixel is described by a linear combination of…

Computer Vision and Pattern Recognition · Computer Science 2017-07-13 Arvind Balachandrasekaran , Vincent Magnotta , Mathews Jacob

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with diameter $D \geq 3$ and standard module $V$. Recently Ito and Terwilliger introduced four direct sum decompositions of $V$; we call these the $(\mu,\nu)$--{\it split…

Combinatorics · Mathematics 2007-05-23 Joohyung Kim

In this note, I discuss in some detail the dual version of the ribbon graph decomposition of the moduli spaces of Riemann surfaces with boundary and marked points, which I introduced in math.AG/0402015, and used in math.QA/0412149 to…

Geometric Topology · Mathematics 2007-05-23 Kevin J. Costello

In the paper we address the problem of finding the most probable state of discrete Markov random field (MRF) with associative pairwise terms. Although of practical importance, this problem is known to be NP-hard in general. We propose a new…

Computer Vision and Pattern Recognition · Computer Science 2015-03-19 Anton Osokin , Dmitry Vetrov , Vladimir Kolmogorov