Uwe Naumann

From MaRDI portal
Revision as of 02:44, 25 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:871159

Available identifiers

zbMath Open naumann.uweMaRDI QIDQ871159

List of research outcomes





PublicationDate of PublicationType
On sparse matrix chain products2024-05-15Paper
A matrix-free exact Newton method2024-05-07Paper
Subdomain separability in global optimization2023-07-13Paper
Numerical simulation of differential-algebraic equations with embedded global optimization criteria2023-05-09Paper
A Matrix-Free Newton Method2023-05-02Paper
Hessian chain bracketing2023-04-19Paper
Seven open problems in applied combinatorics2023-03-20Paper
Elimination Techniques for Algorithmic Differentiation Revisited2023-03-20Paper
Discrete Adjoint Approaches for CHT Applications in OpenFOAM2022-09-01Paper
Algorithmic differentiation of hyperbolic flow problems2022-04-11Paper
Numerical Stability of Tangents and Adjoints of Implicit Functions2021-06-16Paper
Hessian Chain Bracketing2021-03-17Paper
Differential Invariants2021-01-09Paper
Algorithmic differentiation of hyperbolic flow problems2020-07-10Paper
Adjoint Code Design Patterns2020-04-24Paper
Optimization of Generalized Jacobian Chain Products without Memory Constraints2020-03-12Paper
SIMPLE adjoint message passing2018-10-09Paper
On lower bounds for optimal Jacobian accumulation2018-10-09Paper
Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures2018-07-18Paper
Algorithmic Differentiation of Numerical Methods2016-10-24Paper
GPU-Accelerated Sparse Matrix-Matrix Multiplication by Iterative Row Merging2015-11-27Paper
https://portal.mardi4nfdi.de/entity/Q28442302013-08-28Paper
Adjoint Mode Computation of Subgradients for McCormick Relaxations2012-09-26Paper
Hierarchical Algorithmic Differentiation A Case Study2012-09-26Paper
On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs2012-05-23Paper
The Art of Differentiating Computer Programs2012-03-19Paper
DAG reversal is NP-complete2009-12-10Paper
Stochastic Algorithms: Foundations and Applications2009-05-26Paper
https://portal.mardi4nfdi.de/entity/Q36010792009-02-09Paper
Tangent-Linear Models by Augmented LL-Parsers2009-01-27Paper
OpenAD/F2008-12-21Paper
https://portal.mardi4nfdi.de/entity/Q35287652008-10-17Paper
https://portal.mardi4nfdi.de/entity/Q35287832008-10-17Paper
https://portal.mardi4nfdi.de/entity/Q35288012008-10-17Paper
Markowitz-Type Heuristics for Computing Jacobian Matrices Efficiently2008-09-30Paper
A differentiation-enabled Fortran 95 compiler2008-06-18Paper
Optimal Jacobian accumulation is NP-complete2008-01-07Paper
Optimality-preserving elimination of linearities in Jacobian accumulation2007-03-16Paper
Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph2004-09-27Paper
https://portal.mardi4nfdi.de/entity/Q47378402004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47396072004-08-06Paper
Accumulating Jacobians as chained sparse matrix products2003-07-13Paper
Cheaper Jacobians by Simulated Annealing2003-01-05Paper
https://portal.mardi4nfdi.de/entity/Q27531202001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42363141999-03-26Paper
A Note on Adjoint Linear AlgebraN/APaper

Research outcomes over time

This page was built for person: Uwe Naumann