Now showing items 1-2 of 2

    • Decomposing linear programs for parallel solution 

      Pınar, Ali (Bilkent University, 1996)
      Many current research efforts are based on better exploitation of sparsity— common in most large scaled problems—for computational efEciency. This work proposes different methods for permuting sparse matrices to block ...
    • Locality aware reordering for sparse triangular solve 

      Torun, Tuğba (Bilkent University, 2014)
      Sparse Triangular Solve (SpTS) is a commonly used kernel in a wide variety of scientific and engineering applications. Efficient implementation of this kernel on current architectures that involve deep cache hierarchy ...