License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-20868
URL: http://drops.dagstuhl.de/opus/volltexte/2009/2086/
Lyons, Andrew ; Safro, Ilya

Randomized Heuristics for Exploiting Jacobian Scarcity

pdf-format:
Dokument 1.pdf (114 KB)

Abstract

Griewank and Vogel introduced the notion of Jacobian scarcity, which generalizes the properties of sparsity and rank to capture a kind of deficiency in the degrees of freedom of the Jacobian matrix $F'(mathbf{x}).$ We describe new randomized heuristics that exploit scarcity for the optimized evaluation of collections of Jacobian-vector or Jacobian-transpose-vector products.

BibTeX - Entry

@InProceedings{lyons_et_al:DSP:2009:2086,
  author =	{Andrew Lyons and Ilya Safro},
  title =	{Randomized Heuristics for Exploiting Jacobian Scarcity},
  booktitle =	{Combinatorial Scientific Computing},
  year =	{2009},
  editor =	{Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
  number =	{09061},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2086},
  annote =	{Keywords: Jacobian, scarcity, accumulation, directed acyclic graph}
}

Keywords: Jacobian, scarcity, accumulation, directed acyclic graph
Seminar: 09061 - Combinatorial Scientific Computing
Issue date: 2009
Date of publication: 24.07.2009

DROPS-Home | Fulltext Search | Imprint Published by LZI