License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09061.15
URN: urn:nbn:de:0030-drops-20868
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/2086/
Go to the corresponding Portal

Lyons, Andrew ; Safro, Ilya

Randomized Heuristics for Exploiting Jacobian Scarcity

pdf-format:
09061.LyonsAndrew.ExtAbstract.2086.pdf (0.1 MB)

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:DagSemProc.09061.15,
  author =	{Lyons, Andrew and Safro, Ilya},
  title =	{{Randomized Heuristics for Exploiting Jacobian Scarcity}},
  booktitle =	{Combinatorial Scientific Computing},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9061},
  editor =	{Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2009/2086},
  URN =		{urn:nbn:de:0030-drops-20868},
  doi =		{10.4230/DagSemProc.09061.15},
  annote =	{Keywords: Jacobian, scarcity, accumulation, directed acyclic graph}
}

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

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI