dc.creator | Papadimitriou D.I. | en |
dc.date.accessioned | 2023-01-31T09:42:17Z | |
dc.date.available | 2023-01-31T09:42:17Z | |
dc.date.issued | 2016 | |
dc.identifier | 10.1080/10618562.2016.1194978 | |
dc.identifier.issn | 10618562 | |
dc.identifier.uri | http://hdl.handle.net/11615/77575 | |
dc.description.abstract | A new algorithm for the solution of the unsteady adjoint equations is proposed in this article, aiming at overcoming the excessive computational cost and memory requirements of the conventional adjoint approach for the optimisation of unsteady problems in computational mechanics. The total cost is equal to four times the cost of the unsteady state solution, which is twice the cost of the conventional backward-in-time adjoint calculation but the memory requirements are very small, equivalent to those of a steady-state problem, while stability is acceptable. The proposed algorithm is validated in the case of the 1D unsteady Burgers equation with non-smooth source terms. © 2016, Informa UK Limited, trading as Taylor & Francis Group. | en |
dc.language.iso | en | en |
dc.source | International Journal of Computational Fluid Dynamics | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84978903894&doi=10.1080%2f10618562.2016.1194978&partnerID=40&md5=2fc06884d0d15bd65f0a9c9575a447c5 | |
dc.subject | Algorithms | en |
dc.subject | Computational mechanics | en |
dc.subject | Costs | en |
dc.subject | Partial differential equations | en |
dc.subject | Adjoint approach | en |
dc.subject | Adjoint equations | en |
dc.subject | Adjoint methods | en |
dc.subject | Burgers equations | en |
dc.subject | Computational costs | en |
dc.subject | Memory requirements | en |
dc.subject | Steady-state problems | en |
dc.subject | Unsteady problems | en |
dc.subject | Optimization | en |
dc.subject | Taylor and Francis Ltd. | en |
dc.title | A two-step back–forth algorithm for the solution of the unsteady adjoint equations | en |
dc.type | journalArticle | en |