How to compute fast a function and all its derivatives: a variation on the theorem of Baur-strassen

Authors:
Jacques Morgenstern
Affiliations:
-
Venue:
ACM SIGACT News
Year:
1985

Citing 0
Cited 4

On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Fast computation of discrete invariants associated to a differential rational mapping

Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Comparing global strategies for coding adjoints

Scientific Programming
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This note is about a simple and algorithmic proof of the striking result of BAUR-STRASSEN [1] showing that the complexity of the evaluation of a rational function of several variables and all its derivatives is bounded above by three times the complexity of the evaluation of the function itself.