Minimal Rank Completions for Overlapping Blocks

06/21/2021
by   Ethan N. Epperly, et al.
0

We consider the multi-objective optimization problem of choosing the bottom left block-entry of a block lower triangular matrix to minimize the ranks of all block sub-matrices. We provide a proof that there exists a simultaneous rank-minimizer by constructing the complete set of all minimizers.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 7

12/17/2020

On entropies of block-gluing subshifts

A subshift X is called c-block gluing if for any integer n≥ c and any tw...
07/11/2018

Rank of weighted digraphs with blocks

Let G be a digraph and r(G) be its rank. Many interesting results on the...
03/27/2021

ℋ-matrix approximability of inverses of FEM matrices for the time-harmonic Maxwell equations

The inverse of the stiffness matrix of the time-harmonic Maxwell equatio...
03/22/2020

1 x 1 Rush Hour with Fixed Blocks is PSPACE-complete

Consider n^2-1 unit-square blocks in an n × n square board, where each b...
07/23/2018

Ideal Preconditioners for Saddle Point Systems with a Rank-Deficient Leading Block

We consider the iterative solution of symmetric saddle point systems wit...
04/27/2021

Particle Number Conservation and Block Structures in Matrix Product States

The eigenvectors of the particle number operator in second quantization ...
05/11/2020

Approximating inverse FEM matrices on non-uniform meshes with H-matrices

We consider the approximation of the inverse of the finite element stiff...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.