Bohemian Matrices and Applications

20 Jun 2018, by chrystalcherniwchan in Sponsored events

Organiser: Professor Nick Higham

Bohemian matrices are matrices with entries drawn from a fixed discrete set of small integers (BOunded HEight Matrix of Integers). Such matrices arise in many applications. For instance, graph incidence matrices have entries from {0, 1} and Bernoulli matrices, which occur in compressed sensing, have entries from {-1, 1}. This workshop aims to investigate existing open questions and applications revolving around such matrices, identify new ones, and plan future activities. The attendees have research expertise drawn from matrix theory, numerical linear algebra, computer algebra, algebraic geometry, number theory, combinatorics, and high performance computing.


For further information, please visit their website here.