activity
19942023
most citedThe degree-diameter problem for several varieties of Cayley graphs, I: the Abelian case

44 citations · 71 across the 21 of their papers we have counts for

collaborators
Showing 2013Show all

2 papers · 1 filter

math.CO2013

Global communication algorithms for Cayley graphs

Vance Faber

We discuss several combinatorial problems that arise when one looks at computational algorithms for highly symmetric networks of processors. More specifically, we are interested in…

math.NA2013★ 1 cited

Characterization of worst-case GMRES

Vance Faber, Jörg Liesen, Petr Tichý

Given a matrix and iteration step , we study a best possible attainable upper bound on the GMRES residual norm that does not depend on the initial vector . This quantity…