| dc.contributor.author | Christianson, B. | |
| dc.date.accessioned | 2012-08-23T13:00:38Z | |
| dc.date.available | 2012-08-23T13:00:38Z | |
| dc.date.issued | 2012 | |
| dc.identifier.citation | Christianson , B 2012 , A Leibniz notation for automatic differentiation . in Recent Advances in Algorithmic Differentiation . Lecture Notes in Computational Science and Engineering , vol. 87 , Springer Nature Link , pp. 1-9 . https://doi.org/10.1007/978-3-642-30023-3_1 | |
| dc.identifier.isbn | 978-3-642-30022-6 | |
| dc.identifier.uri | http://hdl.handle.net/2299/8933 | |
| dc.description.abstract | Notwithstanding the superiority of the Leibniz notation for differential calculus, the dot-and-bar notation predominantly used by the Automatic Differentiation community is resolutely Newtonian. In this paper we extend the Leibnitz notation to include the reverse (or adjoint) mode of Automatic Differentiation, and use it to demonstrate the stepwise numerical equivalence of the three approaches using the reverse mode to obtain second order derivatives, namely forward-over-reverse, reverse-over-forward, and reverse-over-reverse. | en |
| dc.format.extent | 130417 | |
| dc.language.iso | eng | |
| dc.publisher | Springer Nature Link | |
| dc.relation.ispartof | Recent Advances in Algorithmic Differentiation | |
| dc.relation.ispartofseries | Lecture Notes in Computational Science and Engineering | |
| dc.title | A Leibniz notation for automatic differentiation | en |
| dc.contributor.institution | Centre for Computer Science and Informatics Research | |
| dc.contributor.institution | School of Physics, Engineering & Computer Science | |
| dc.description.status | Non peer reviewed | |
| rioxxterms.versionofrecord | 10.1007/978-3-642-30023-3_1 | |
| rioxxterms.type | Other | |
| herts.preservation.rarelyaccessed | true | |
