Name
Abstract | ||
|---|---|---|
An implementation of Automatic Sparsity Detection (ASD) as a new source-to-source transformation is presented. Given a code for evaluation of a function, ASD generates code to evaluate the sparsity pattern of the function’s Jacobian by operations on bit-vectors. Similar to Automatic Differentiation (AD), there are forward and reverse modes of ASD. As ASD code has significantly fewer required variables than AD, ASD should be operated in pure mode, i.e. without an evaluation of the underlying function included in the ASD code. In a performance comparison of ASD to AD on five small test problems, ASD is about two orders of magnitude faster than AD. Hence, for a particular class of sparse Jacobians, it is efficient to determine first the sparsity patten via ASD. In a subsequent AD step, this allows to reduce the effective dimension for the evaluation of the Jacobian by avoiding the evaluation of zero elements via a selection of seed matrices according to the sparsity pattern. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11758549_81 | International Conference on Computational Science (4) |
Keywords | Field | DocType |
automatic sparsity detection,automatic differentiation,subsequent ad step,sparsity patten,asd code,fewer required variable,effective dimension,new source-to-source transformation,underlying function,sparsity pattern | Effective dimension,Jacobian matrix and determinant,Computer science,Sparse approximation,Algorithm,Automatic differentiation,Function Code,Code generation,Code (cryptography),Source transformation | Conference |
Volume | ISSN | ISBN |
3994 | 0302-9743 | 3-540-34385-7 |
Citations | PageRank | References |
3 | 0.47 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ralf Giering | 1 | 117 | 14.57 |
| T. Kaminski | 2 | 106 | 13.03 |