English

Algorithmic Differentiation of Linear Algebra Functions with Application in Optimum Experimental Design (Extended Version)

Data Structures and Algorithms 2010-02-19 v2 Mathematical Software Numerical Analysis

Abstract

We derive algorithms for higher order derivative computation of the rectangular QRQR and eigenvalue decomposition of symmetric matrices with distinct eigenvalues in the forward and reverse mode of algorithmic differentiation (AD) using univariate Taylor propagation of matrices (UTPM). Linear algebra functions are regarded as elementary functions and not as algorithms. The presented algorithms are implemented in the BSD licensed AD tool \texttt{ALGOPY}. Numerical tests show that the UTPM algorithms derived in this paper produce results close to machine precision accuracy. The theory developed in this paper is applied to compute the gradient of an objective function motivated from optimum experimental design: xΦ(C(J(F(x,y))))\nabla_x \Phi(C(J(F(x,y)))), where Φ={λ1:λ1C}\Phi = \{\lambda_1 : \lambda_1 C\}, C=(JTJ)1C = (J^T J)^{-1}, J=\ddF\ddyJ = \frac{\dd F}{\dd y} and F=F(x,y)F = F(x,y).

Keywords

Cite

@article{arxiv.1001.1654,
  title  = {Algorithmic Differentiation of Linear Algebra Functions with Application in Optimum Experimental Design (Extended Version)},
  author = {S. F. Walter and L. Lehmann},
  journal= {arXiv preprint arXiv:1001.1654},
  year   = {2010}
}
R2 v1 2026-06-21T14:33:08.703Z