Implementation of partial separability in a source-to-source transformation AD Tool

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A significant number of large optimization problems exhibit structure known as partial separability, for example, least squares problems, where elemental functions are gathered into groups that are then squared. The sparsity of the Jacobian of a partially separable function can be exploited by computing the smaller Jacobians of the elemental functions and then assembling them into the full Jacobian. We implemented partial separability support in ADIC2 by using pragmas to identify partially separable function values, applying source transformations to subdivide the elemental gradient computations, and using the ColPack coloring toolkit to compress the sparse elemental Jacobians. We present experimental results for an elastic-plastic torsion optimization problem from the MINPACK-2 test suite. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Narayanan, S. H. K., Norris, B., Hovland, P., & Gebremedhin, A. (2012). Implementation of partial separability in a source-to-source transformation AD Tool. In Lecture Notes in Computational Science and Engineering (Vol. 87 LNCSE, pp. 343–353). https://doi.org/10.1007/978-3-642-30023-3_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free