A note on the computational complexity of chain rule differentiation

被引：0
|
作者：
Naumann, U. [1 ,2 ]
机构：
[1] Rhein Westfal TH Aachen, Software & Tools Computat Engn, Aachen, Germany
[2] Rhein Westfal TH Aachen, Software & Tools Computat Engn, D-52062 Aachen, Germany
来源：
OPTIMIZATION METHODS & SOFTWARE | 2023年
关键词：
Chain rule of differentiation; computational complexity; algorithmic differentiation;
D O I：
10.1080/10556788.2023.2263809
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We generalize the proof of NP-completeness of Jacobian accumulation using a given number of floating-point operations to arbitrary order.
引用
收藏
页数：8
相关论文
共 50 条
12345