Bohemian Matrix Geometry

02/15/2022
by   Robert M. Corless, et al.
0

A Bohemian matrix family is a set of matrices all of whose entries are drawn from a fixed, usually discrete and hence bounded, subset of a field of characteristic zero. Originally these were integers – hence the name, from the acronym BOunded HEight Matrix of Integers (BOHEMI) – but other kinds of entries are also interesting. Some kinds of questions about Bohemian matrices can be answered by numerical computation, but sometimes exact computation is better. In this paper we explore some Bohemian families (symmetric, upper Hessenberg, or Toeplitz) computationally, and answer some open questions posed about the distributions of eigenvalue densities.

READ FULL TEXT

page 2

page 3

page 8

page 9

page 11

page 12

page 18

page 19

research
09/27/2018

Bohemian Upper Hessenberg Matrices

We look at Bohemian matrices, specifically those with entries from {-1, ...
research
09/27/2018

Bohemian Upper Hessenberg Toeplitz Matrices

We look at Bohemian matrices, specifically those with entries from {-1, ...
research
07/22/2022

Ladder Matrix Recovery from Permutations

We give unique recovery guarantees for matrices of bounded rank that hav...
research
03/01/2020

Maximum Absolute Determinants of Upper Hessenberg Bohemian Matrices

A matrix is called Bohemian if its entries are sampled from a finite set...
research
05/10/2023

Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra

Given 𝐀∈ℝ^n × n with entries bounded in magnitude by 1, it is well-known...
research
07/23/2019

Upper Hessenberg and Toeplitz Bohemians

We look at Bohemians, specifically those with population {-1, 0, +1} and...
research
11/19/2013

Near-Optimal Entrywise Sampling for Data Matrices

We consider the problem of selecting non-zero entries of a matrix A in o...

Please sign up or login with your details

Forgot password? Click here to reset