English
Related papers

Related papers: New classes of matrix decompositions

200 papers

We show that every n-by-n matrix is generically a product of [n/2] + 1 Toeplitz matrices and always a product of at most 2n+5 Toeplitz matrices. The same result holds true if the word "Toeplitz" is replaced by "Hankel", and the generic…

Algebraic Geometry · Mathematics 2014-07-04 Ke Ye , Lek-Heng Lim

We consider a new class of matrices associated to a real square matrix $A$ and to a vector $\vec{c} \in \{-1,1\}^n$ such that $c_1=1$ by using a map $\varphi_{\vec{c}}$ which turns out to be a conjugation of a matrix $A$ by a signature…

Rings and Algebras · Mathematics 2023-09-19 Jovan Mikić

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

Optimization and Control · Mathematics 2023-10-02 Levent Tunçel , Stephen A. Vavasis , Jingye Xu

We study the problem when every matrix over a division ring is representable as either the product of traceless matrices or the product of semi-traceless matrices, and also give some applications of such decompositions. Specifically, we…

Rings and Algebras · Mathematics 2023-08-01 Peter V. Danchev , Truong Huu Dung , Tran Nam Son

This is the second in a series of papers on rank decompositions of the matrix multiplication tensor. We present new rank $23$ decompositions for the $3\times 3$ matrix multiplication tensor $M_{\langle 3\rangle}$. All our decompositions…

Computational Complexity · Computer Science 2018-01-04 Grey Ballard , Christian Ikenmeyer , J. M. Landsberg , Nick Ryder

We present a method to derive new explicit expressions for bidiagonal decompositions of Vandermonde and related matrices such as the (q-, h-) Bernstein-Vandermonde ones, among others. These results generalize the existing expressions for…

In this paper, the canonical polyadic (CP) decomposition of tensors that corresponds to matrix multiplications is studied. Finding the rank of these tensors and computing the decompositions is a fundamental problem of algebraic complexity…

Computational Complexity · Computer Science 2021-04-13 Petr Tichavsky

We show how to construct highly symmetric algorithms for matrix multiplication. In particular, we consider algorithms which decompose the matrix multiplication tensor into a sum of rank-1 tensors, where the decomposition itself consists of…

Computational Complexity · Computer Science 2016-12-13 Joshua A. Grochow , Cristopher Moore

In a recent article, we gave a full characterization of matrices that can be decomposed as a linear combination of two idempotents with prescribed coefficients. In this one, we use those results to improve on a recent theorem of V.…

Rings and Algebras · Mathematics 2010-05-26 Clément de Seguins Pazzis

An $n\times n$ complex matrix $A$ is called coninvolutory if $\bar AA=I_n$ and skew-coninvolutory if $\bar AA=-I_n$ (which implies that $n$ is even). We prove that each matrix of size $n\times n$ with $n>1$ is a sum of 5 coninvolutory…

Matrices with the structures of Toeplitz, Hankel, Vandermonde and Cauchy types are omnipresent in modern computation. The four classes have distinct features, but in 1990 we showed that Vandermonde and Hankel multipliers transform all these…

Numerical Analysis · Mathematics 2013-11-18 Victor Y. Pan

In this paper we consider the decomposition of positive semidefinite matrices as a sum of rank one matrices. We introduce and investigate the properties of various measures of optimality of such decompositions. For some classes of positive…

Functional Analysis · Mathematics 2022-02-03 Radu Balan , Kasso A. Okoudjou , Michael Rawson , Yang Wang , Rui Zhang

We begin by showing that any $n \times n$ matrix can be decomposed into a sum of $n$ circulant matrices with periodic relaxations on the unit circle. This decomposition is orthogonal with respect to a Frobenius inner product, allowing…

Numerical Analysis · Mathematics 2022-09-29 Hariprasad M. , Murugesan Venkatapathi

Finite quandles with n elements can be represented as n-by-n matrices. We show how to use these matrices to distinguish all isomorphism classes of finite quandles for a given cardinality n, as well as how to compute the automorphism group…

Geometric Topology · Mathematics 2007-05-23 Benita Ho , Sam Nelson

This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix…

Computational Complexity · Computer Science 2016-10-27 Luca Chiantini , Christian Ikenmeyer , J. M. Landsberg , Giorgio Ottaviani

In order to precondition Toeplitz systems, we present a new class of simultaneously diagonalizable real matrices, the Gamma-matrices, which include both symmetric circulant matrices and a subclass of the set of all reverse circulant…

Numerical Analysis · Mathematics 2021-07-14 Antonio Boccuto , Ivan Gerace , Valentina Giorgetti , Federico Greco

Totally equimodular matrices generalize totally unimodular matrices and arise in the context of box-total dual integral polyhedra. This work further explores the parallels between these two classes and introduces foundational building…

Combinatorics · Mathematics 2026-03-31 Patrick Chervet , Roland Grappe , Mathieu Vallée

For $n\ge 2$ and fixed $k\ge 1$, we study when a square matrix $A$ over an arbitrary field $\mathbb{F}$ can be decomposed as $T+N$ where $T$ is a torsion matrix and $N$ is a nilpotent matrix with $N^k=0$. For fields of prime characteristic,…

Rings and Algebras · Mathematics 2024-03-25 Peter Danchev , Esther García , Miguel Gómez Lozano

A new class of structured matrices is presented and a closed form formula for their determinant is established. This formula has strong connections with the one for Vandermonde matrices.

Combinatorics · Mathematics 2019-10-31 Augusto Ferrante , Fabrizio Padula , Lorenzo Ntogramatzidis

In this paper, we analyze the process of "assembling" new matrix geometric means from existing ones, through function composition or limit processes. We show that for n=4 a new matrix mean exists which is simpler to compute than the…

Numerical Analysis · Mathematics 2011-04-29 Federico Poloni
‹ Prev 1 2 3 10 Next ›