In this paper we consider the rational canonical form of arbitrary polyphase matrices and use it to derive a simple implementation of paraunitary filter banks (PUFBs) based on a c...
We present a method for automatically selecting optimal implementations of sparse matrixvector operations. Our software ‘AcCELS’ (Accelerated Compress-storage Elements for Lin...
Alfredo Buttari, Victor Eijkhout, Julien Langou, S...
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
The sparse Cholesky factorization of some large matrices can require a two dimensional partitioning of the matrix. The sparse hypermatrix storage scheme produces a recursive 2D par...
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...