AI Chat AI Image Generator AI Video Text to Speech

Minimal Rank Completions for Overlapping Blocks

06/21/2021

∙

by Ethan N. Epperly, et al.

∙

∙

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.

Ethan N. Epperly
6 publications
Nithin Govindarajan
2 publications
Shivkumar Chandrasekaran
20 publications

research

∙ 04/19/2022

The Binary Rank of Circulant Block Matrices

The binary rank of a 0,1 matrix is the smallest size of a partition of i...

0 Ishay Haviv, et al. ∙

research

∙ 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...

0 Svetlana Puzynina, et al. ∙

research

∙ 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...

0 Ranveer Singh, et al. ∙

research

∙ 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...

0 Josh Brunner, et al. ∙

research

∙ 05/06/2022

Linear-Complexity Black-Box Randomized Compression of Hierarchically Block Separable Matrices

A randomized algorithm for computing a compressed representation of a gi...

0 James Levitt, et al. ∙

research

∙ 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...

0 Markus Faustmann, et al. ∙

research

∙ 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...

0 Susanne Bradley, et al. ∙