Digital Library

cab1

 
Title:      FILL-OUT EXPLOITATION ON COMPRESSED ROW STORAGE OF EXTENDED JACOBIANS
Author(s):      Ebadollah Varnik , Uwe Naumann
ISBN:      978-972-8924-30-0
Editors:      Nuno Guimarães and Pedro Isaías
Year:      2007
Edition:      Single
Keywords:      Jacobian Accumulation, Extended Jacobian, Compressed Row Storage.
Type:      Poster/Demonstration
First Page:      793
Last Page:      796
Language:      English
Cover:      cover          
Full Contents:      click to dowload Download
Paper Abstract:      Derivatives are essential ingredients of a wide range of numerical algorithms. We focus on a fast accumulation of Jacobian matrices by Gaussian elimination on a statically allocated compressed row storage representation of the extended Jacobian. We compare our algorithm with centered finite difference approximation whose computational complexity increases exponentially with the number of inputs. Our first algorithm uses reverse elimination on compressed row storage scheme. For scalar vector functions is may yield a linear complexity if reusing fill-out memory getting freed during the elimination process. Moreover, our algorithm is faster than Jacobian computation by reverse elimination on a dynamically maintained computational graph.
   

Social Media Links

Search

Login