Uwe Naumann

Orcid: 0000-0002-7518-5922

Affiliations:
  • RWTH Aachen


According to our database1, Uwe Naumann authored at least 98 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Differenzierbare Forschungssoftware.
Softwaretechnik-Trends, February, 2024

A Matrix-Free Exact Newton Method.
SIAM J. Sci. Comput., 2024

Discrete Algorithms on Modern and Emerging Compute Infrastructure (Dagstuhl Seminar 24201).
Dagstuhl Reports, 2024

An Efficient Local Optimizer-Tracking Solver for Differential-Algebriac Equations with Optimization Criteria.
CoRR, 2024

Differential Inversion of the Implicit Euler Method: Symbolic Analysis.
CoRR, 2024

Matrix-Free Jacobian Chaining.
CoRR, 2024

Seasons's Greetings by AD.
CoRR, 2024

Towards Sobolev Pruning.
Proceedings of the Platform for Advanced Scientific Computing Conference, 2024

2023
Subdomain separability in global optimization.
J. Glob. Optim., July, 2023

Differentiable Programming: Efficient Smoothing of Control-Flow-Induced Discontinuities.
CoRR, 2023

A Matrix-Free Newton Method.
CoRR, 2023

Seven open problems in applied combinatorics.
CoRR, 2023

Parallel Adjoint Taping Using MPI.
Proceedings of the Computational Science - ICCS 2023, 2023

Elimination Techniques for Algorithmic Differentiation Revisited.
Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

2022
Reduction of the Random Access Memory Size in Adjoint Algorithmic Differentiation by Overloading.
CoRR, 2022

Direct single shooting for dynamic optimization of differential-algebraic equation systems with optimization criteria embedded.
Comput. Chem. Eng., 2022

Numerical Stability of Tangents and Adjoints of Implicit Functions.
Proceedings of the Computational Science - ICCS 2022, 2022

A Note on Adjoint Linear Algebra.
Proceedings of the Computational Science - ICCS 2022, 2022

2021
Algorithmic differentiation of hyperbolic flow problems.
J. Comput. Phys., 2021

Differentiable Scripting.
CoRR, 2021

On the Computational Complexity of the Chain Rule of Differential Calculus.
CoRR, 2021

A Dynamic Programming Heuristic for Dense Hessian Chain Bracketing.
CoRR, 2021

Differential Invariants.
CoRR, 2021

2020
Optimization of Generalized Jacobian Chain Products without Memory Constraints.
CoRR, 2020

On Sparse Matrix Chain Products.
Proceedings of the SIAM Workshop on Combinatorial Scientific Computing, 2020

Eigen-AD: Algorithmic Differentiation of the Eigen Library.
Proceedings of the Computational Science - ICCS 2020, 2020

MCMC for Bayesian Uncertainty Quantification from Time-Series Data.
Proceedings of the Computational Science - ICCS 2020, 2020

Patient-Specific Cardiac Parametrization from Eikonal Simulations.
Proceedings of the Computational Science - ICCS 2020, 2020

Interval Adjoint Significance Analysis for Neural Networks.
Proceedings of the Computational Science - ICCS 2020, 2020

2019
Adjoint Code Design Patterns.
ACM Trans. Math. Softw., 2019

Discrete Interval Adjoints in Unconstrained Global Optimization.
Proceedings of the Optimization of Complex Systems: Theory, 2019

Toward Global Search for Local Optima.
Proceedings of the Operations Research Proceedings 2019, 2019

Efficient Computation of Sparse Higher Derivative Tensors.
Proceedings of the Computational Science - ICCS 2019, 2019

2018
Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures.
SIAM J. Sci. Comput., 2018

SIMPLE adjoint message passing.
Optim. Methods Softw., 2018

On lower bounds for optimal Jacobian accumulation.
Optim. Methods Softw., 2018

Low-Memory Algorithmic Adjoint Propagation.
Proceedings of the Eighth SIAM Workshop on Combinatorial Scientific Computing, 2018

2016
First-order uncertainty analysis using Algorithmic Differentiation of morphodynamic models.
Comput. Geosci., 2016

GPU-accelerated adjoint algorithmic differentiation.
Comput. Phys. Commun., 2016

Mixed Integer Programming for Call Tree Reversal.
Proceedings of the 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, 2016

Algorithmic Differentiation of Numerical Methods: Second-Order Adjoint Solvers for Parameterized Systems of Nonlinear Equations.
Proceedings of the International Conference on Computational Science 2016, 2016

A Case Study in Adjoint Sensitivity Analysis of Parameter Calibration.
Proceedings of the International Conference on Computational Science 2016, 2016

Towards automatic significance analysis for approximate computing.
Proceedings of the 2016 International Symposium on Code Generation and Optimization, 2016

2015
Algorithmic Differentiation of Numerical Methods: Tangent and Adjoint Solvers for Parameterized Systems of Nonlinear Equations.
ACM Trans. Math. Softw., 2015

GPU-Accelerated Sparse Matrix-Matrix Multiplication by Iterative Row Merging.
SIAM J. Sci. Comput., 2015

The IceProd framework: Distributed data processing for the IceCube neutrino observatory.
, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ,
J. Parallel Distributed Comput., 2015

Automation of Significance Analyses with Interval Splitting.
Proceedings of the Parallel Computing: On the Road to Exascale, 2015

MPI-Parallel Discrete Adjoint OpenFOAM.
Proceedings of the International Conference on Computational Science, 2015

Second-order Tangent Solvers for Systems of Parameterized Nonlinear Equations.
Proceedings of the International Conference on Computational Science, 2015

Higher-order Discrete Adjoint ODE Solver in C++ for Dynamic Optimization.
Proceedings of the International Conference on Computational Science, 2015

2014
Adjoint Methods in Computational Science, Engineering, and Finance (Dagstuhl Seminar 14371).
Dagstuhl Reports, 2014

Energy Efficiency through Significance-Based Computing.
Computer, 2014

2013
Fast and accurate parameter sensitivities for the general rate model of column liquid chromatography.
Comput. Chem. Eng., 2013

Towards tangent-linear GPU programs using OpenACC.
Proceedings of the 4th International Symposium on Information and Communication Technology, 2013

A Discrete Adjoint Model for OpenFOAM.
Proceedings of the International Conference on Computational Science, 2013

Algorithmic Differentiation of a Complex C++ Code with Underlying Libraries.
Proceedings of the International Conference on Computational Science, 2013

Discrete Adjoints of PETSc through dco/c++ and Adjoint MPI.
Proceedings of the Euro-Par 2013 Parallel Processing, 2013

Solving a Least-Squares Problem with Algorithmic Differentiation and OpenMP.
Proceedings of the Euro-Par 2013 Parallel Processing, 2013

2012
Software for Higher-order Sensitivity Analysis of Parametric DAEs.
Simul. Notes Eur., 2012

On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs.
Optim. Methods Softw., 2012

Preface.
Optim. Methods Softw., 2012

A Wish List for Efficient Adjoints of One-Sided MPI Communication.
Proceedings of the Recent Advances in the Message Passing Interface, 2012

The Art of Differentiating Computer Programs - An Introduction to Algorithmic Differentiation.
Software, environments, tools 24, SIAM, ISBN: 978-1-611972-06-1, 2012

2011
Optimization and Evaluation of a Multimedia Streaming Service on Hybrid Telco cloud
CoRR, 2011

2010
Interpretative adjoints for numerical simulation codes using MPI.
Proceedings of the International Conference on Computational Science, 2010

On the use of discrete adjoints in goal error estimation for shallow water equations.
Proceedings of the International Conference on Computational Science, 2010

Discrete first- and second-order adjoints and automatic differentiation for the sensitivity analysis of dynamic models.
Proceedings of the International Conference on Computational Science, 2010

Second-Order Algorithmic Differentiation by Source Transformation of MPI Code.
Proceedings of the Recent Advances in the Message Passing Interface, 2010

2009
DAG reversal is NP-complete.
J. Discrete Algorithms, 2009

Toward adjoinable MPI.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Combinatorial Problems in OpenAD.
Proceedings of the Combinatorial Scientific Computing, 01.02. - 06.02.2009, 2009

09061 Abstracts Collection - Combinatorial Scientific Computing.
Proceedings of the Combinatorial Scientific Computing, 01.02. - 06.02.2009, 2009

Low-Memory Tour Reversal in Directed Graphs.
Proceedings of the Combinatorial Scientific Computing, 01.02. - 06.02.2009, 2009

2008
OpenAD/F: A Modular Open-Source Tool for Automatic Differentiation of Fortran Codes.
ACM Trans. Math. Softw., 2008

Optimal vertex elimination in single-expression-use graphs.
ACM Trans. Math. Softw., 2008

Cheaper adjoints by reversing address computations.
Sci. Program., 2008

Optimal Jacobian accumulation is NP-complete.
Math. Program., 2008

A Framework for Proving Correctness of Adjoint Message-Passing Programs.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2008

2007
On syntax-directed adjoint fortran code.
Comput. Sci. Inf. Syst., 2007

Parallel Jacobian Accumulation.
Proceedings of the Parallel Computing: Architectures, 2007

2006
Efficient reversal of the intraprocedural flow of control in adjoint computations.
J. Syst. Softw., 2006

Tangent-Linear Models by Augmented LL-Parsers.
Proceedings of the Computational Science and Its Applications, 2006

2005
A differentiation-enabled fortran 95 compiler.
ACM Trans. Math. Softw., 2005

"To be recorded" analysis in reverse-mode automatic differentiation.
Future Gener. Comput. Syst., 2005

Source Templates for the Automatic Generation of Adjoint Code Through Static Call Graph Reversal.
Proceedings of the Computational Science, 2005

2004
Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph.
Math. Program., 2004

Control Flow Reversal for Adjoint Code Generation.
Proceedings of the 4th IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2004), 2004

Separating language dependent and independent tasks for the semantic transformation of numerical programs.
Proceedings of the IASTED Conference on Software Engineering and Applications, 2004

2003
Accumulating Jacobians as chained sparse matrix products.
Math. Program., 2003

An Introduction to Using Software Tools for Automatic Differentiation
CoRR, 2003

Simulated Annealing for Optimal Pivot Selection in Jacobian Accumulation.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2003

Towards Differentiation-Enabled FORTRAN 95 Compiler Technology.
Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003

Coupling Tangent-Linear and Adjoint Models.
Proceedings of the Computational Science and Its Applications, 2003

Markowitz-Type Heuristics for Computing Jacobian Matrices Efficiently.
Proceedings of the Computational Science - ICCS 2003, 2003

2002
Cheaper Jacobians by Simulated Annealing.
SIAM J. Optim., 2002

Reducing the Memory Requirement in Reverse Mode Automatic Differentiation by Solving TBR Flow Equations.
Proceedings of the Computational Science - ICCS 2002, 2002

2001
Prospects for Simulated Annealing Algorithms in Automatic Differentiation.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2001

1999
Efficient calculation of Jacobian matrices by optimized application of the chain rule to computational graphs.
PhD thesis, 1999


  Loading...