A
Andrea Walther
Researcher at University of Paderborn
Publications - 112
Citations - 6027
Andrea Walther is an academic researcher from University of Paderborn. The author has contributed to research in topics: Automatic differentiation & Jacobian matrix and determinant. The author has an hindex of 23, co-authored 109 publications receiving 5497 citations. Previous affiliations of Andrea Walther include Dresden University of Technology & Humboldt University of Berlin.
Papers
More filters
Journal ArticleDOI
Evaluating higher derivative tensors by forward propagation of univariate Taylor series
TL;DR: With the approach presented, much simpler data access patterns and similar or lower computational counts can be achieved through propagating a family of univariate Taylor series of a suitable degree.
Journal ArticleDOI
Automatic differentiation of explicit Runge-Kutta methods for optimal control
TL;DR: This paper presents the integration schemes that are automatically generated when differentiating the discretization of the state equation using Automatic Differentiation (AD), and shows that they can be seen as discretized methods for the and adjoint differential equation of the underlying control problem.
Journal ArticleDOI
Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
TL;DR: The experimental results show that sparsity exploitation via coloring yields enormous savings in runtime and makes the computation of Hessians of very large size feasible and the results also show that evaluating a Hessian via an indirect method is often faster than a direct evaluation.
BookDOI
Recent Advances in Algorithmic Differentiation
TL;DR: The proceedings represent the state of knowledge in the area of algorithmic differentiation (AD) and the described characteristics and of the techniques for successfully using AD should make the proceedings a valuable source of information for users of AD tools.
Journal ArticleDOI
MultiStage Approaches for Optimal Offline Checkpointing
Philipp Stumm,Andrea Walther +1 more
TL;DR: The write and read counts for each checkpoint in a binomial checkpointing approach are examined and show that checkpointing techniques may reduce the overall computing time despite the required recalculations.