Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"unidirectional partitioning"”.

  1. Bi-directional determination of sparse Jacobian matrices : algorithms and lower bounds

    … to the presence of dense rows or dense columns, unidirectional partitioning does not always give good results. Bi-Directional partitioning handles the problem of dense rows and dense columns quite well[16]. Lower bound to determine the non-zeroes of a sparse Jacobian matrix can be defined as the …

    lethbridge Repository record for Bi-directional determination of sparse Jacobian matrices : algorithms and lower bounds (opens in a new tab)

  2. Star bi-coloring of bipartite graphs

    … reduces the computational cost. Bi-directional partitioning to determine non-zeroes in the sparse matrix works better than unidirectional partitioning for dense rows and dense columns. We have developed a bidirectional coloring algorithm that determines all the non-zeroes of a sparse Jacobian …

    lethbridge Repository record for Star bi-coloring of bipartite graphs (opens in a new tab)

  3. Coloring and degeneracy for determining very large and sparse derivative matrices

    … graph coloring problem. To find out the optimal partitioning, we have proposed a new algorithm that combines existing exact and heuristic algorithms. We have introduced degeneracy and maximum k-core for sparse matrices to solve the problem in stages. Our combined approach produce better results …

    lethbridge Repository record for Coloring and degeneracy for determining very large and sparse derivative matrices (opens in a new tab)