Corpus ID: 119065553

Graph coloring in sparse derivative matrix computation

@inproceedings{Goyal2005GraphCI,
  title={Graph coloring in sparse derivative matrix computation},
  author={Mini Goyal},
  year={2005}
}
  • Mini Goyal
  • Published 2005
  • Mathematics
  • There has been extensive research activities in the last couple of years to efficiently determine large sparse Jacobian matrices. It is now well known that the estimation of Jacobian matrices can be posed as a graph coloring problem. Unidirectional coloring by Coleman and More [9] and bidirectional coloring independently proposed by Hossain and Steihaug [23] and Coleman and Verma [12] are techniques that employ graph theoretic ideas. In this thesis we present heuristic and exact bidirectional… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.