Please use this identifier to cite or link to this item:
http://hdl.handle.net/10773/26588
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Goloubentsev, Dmitri | pt_PT |
dc.contributor.author | Lakshtanov, Evgeny | pt_PT |
dc.date.accessioned | 2019-09-19T17:05:33Z | - |
dc.date.issued | 2019-09-18 | - |
dc.identifier.issn | 1540-6962 | pt_PT |
dc.identifier.uri | http://hdl.handle.net/10773/26588 | - |
dc.description.abstract | In this article we present a new approach for automatic adjoint differentiation (AAD) with a special focus on computations where derivatives ∂F(X) ∂X are required for multiple instances of vectors X. In practice, the presented approach is able to calculate all the differentials faster than the primal (original) C++ program for F. | pt_PT |
dc.language.iso | eng | pt_PT |
dc.publisher | Wiley | pt_PT |
dc.relation | UID/MAT/0416/2019 | pt_PT |
dc.rights | openAccess | pt_PT |
dc.subject | AAD | pt_PT |
dc.subject | Automatic adjoint differentiation | pt_PT |
dc.subject | Automatic differentiation | pt_PT |
dc.subject | C++ | pt_PT |
dc.subject | Code transformation | pt_PT |
dc.subject | Operator overloading | pt_PT |
dc.title | AAD: breaking the primal barrier | pt_PT |
dc.type | article | pt_PT |
dc.description.version | published | pt_PT |
dc.peerreviewed | yes | pt_PT |
degois.publication.firstPage | 8 | pt_PT |
degois.publication.issue | 103 | pt_PT |
degois.publication.lastPage | 11 | pt_PT |
degois.publication.title | Wilmott | pt_PT |
degois.publication.volume | 2019 | pt_PT |
dc.date.embargo | 2020-09-01 | - |
dc.identifier.essn | 1541-8286 | pt_PT |
Appears in Collections: | CIDMA - Artigos OGTCG - Artigos |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
wilmott.pdf | 180.21 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.