Linearity analysis for automatic differentiation

Michelle Mills Strout, Paul Hovland

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

Linearity analysis determines which variables depend on which other variables and whether the dependence is linear or nonlinear. One of the many applications of this analysis is determining whether a loop involves only linear loop-carried dependences and therefore the adjoint of the loop may be reversed and fused with the computation of the original function. This paper specifies the data-flow equations that compute linearity analysis. In addition, the paper describes using linearity analysis with array dependence analysis to determine whether a loop-carried dependence is linear or nonlinear.

Original languageEnglish (US)
Title of host publicationComputational Science - ICCS 2006
Subtitle of host publication6th International Conference, Proceedings
PublisherSpringer-Verlag
Pages574-581
Number of pages8
ISBN (Print)3540343857, 9783540343851
DOIs
StatePublished - 2006
Externally publishedYes
EventICCS 2006: 6th International Conference on Computational Science - Reading, United Kingdom
Duration: May 28 2006May 31 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3994 LNCS - IV
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceICCS 2006: 6th International Conference on Computational Science
Country/TerritoryUnited Kingdom
CityReading
Period5/28/065/31/06

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Linearity analysis for automatic differentiation'. Together they form a unique fingerprint.

Cite this