A practical approach is proposed to the problem of simultaneously computing a function, its partial derivatives with respect to all the variables, and an estimate of the rounding error incurred in the computed value of the function. Theoretically, it has a complexity at most a constant times as large as that of evaluating the function alone, the constant being independent of the number of variables of the function, and it is an alternative graphical interpretation of W. Baur and V. Strassen’s results, with some generalizations. Practically, it is stated in a form easily implementable as a computer program, which enables us to automatically compute the derivatives if we are given only the program for computing the function. Remarks are added also on the cases of several functions, of higher derivatives and of non-straght-line programs, and on application to problems containing differential equations.
[1]
J. H. Wilkinson.
Error analysis of floating-point computation
,
1960
.
[2]
Frank Harary,et al.
Graph Theory
,
2016
.
[3]
伊理 正夫,et al.
Network flow, transportation and scheduling : theory and algorithms
,
1969
.
[4]
Stuart E. Dreyfus,et al.
An Appraisal of Some Shortest-Path Algorithms
,
1969,
Oper. Res..
[5]
C. Berge.
Graphes et hypergraphes
,
1970
.
[6]
F. L. Bauer.
Computational Graphs and Rounding Error
,
1974
.
[7]
Walter Baur,et al.
The Complexity of Partial Derivatives
,
1983,
Theor. Comput. Sci..
[8]
室田 一雄.
Structural solvability and controllability of systems
,
1983
.