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 2 of 2 for “"sparse derivative matrices"”.

  1. An improved implementation of sparsity detection of sparse derivative matrices

    … and represent sparsity of unknown Jacobian matrices. Automated sparsity detection algorithms find an optimal or near-optimal solution, which reduces time and space complexity for large scale data. Our proposed approach efficiently generates symmetric pattern utilizing band matrix and reduces …

    lethbridge Repository record for An improved implementation of sparsity detection of sparse derivative matrices (opens in a new tab)

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

    Estimation of large sparse Jacobian matrix is a prerequisite for many scientific and engineering problems. It is known that determining the nonzero entries of a sparse matrix can be modeled as a graph coloring problem. To find out the optimal partitioning, we have proposed a new algorithm that …

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