Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/98872
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Applied Mathematicsen_US
dc.creatorCui, Jen_US
dc.creatorDieci, Len_US
dc.creatorZhou, Hen_US
dc.date.accessioned2023-06-01T06:05:19Z-
dc.date.available2023-06-01T06:05:19Z-
dc.identifier.issn1064-8275en_US
dc.identifier.urihttp://hdl.handle.net/10397/98872-
dc.language.isoenen_US
dc.publisherSociety for Industrial and Applied Mathematicsen_US
dc.rights© 2022 Society for Industrial and Applied Mathematicsen_US
dc.rightsThe following publication Cui, J., Dieci, L., & Zhou, H. (2022). A continuation multiple shooting method for Wasserstein geodesic equation. SIAM Journal on Scientific Computing, 44(5), A2918-A2943 is available at https://doi.org/10.1137/21M142160X.en_US
dc.subjectBoundary value problemen_US
dc.subjectHamiltonian flowen_US
dc.subjectMultiple shooting methoden_US
dc.subjectOptimal transporten_US
dc.titleA continuation multiple shooting method for Wasserstein geodesic equationen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spageA2918en_US
dc.identifier.epageA2943en_US
dc.identifier.volume44en_US
dc.identifier.issue5en_US
dc.identifier.doi10.1137/21M142160Xen_US
dcterms.abstractIn this paper, we propose a numerical method to solve the classic L2-optimal transport problem. Our algorithm is based on the use of multiple shooting, in combination with a continuation procedure, to solve the boundary value problem associated to the transport problem. Based on the viewpoint of Wasserstein Hamiltonian flow with initial and target densities, our algorithm reflects the Hamiltonian structure of the underlying problem and exploits it in the numerical discretization. Several numerical examples are presented to illustrate the performance of the method.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationSIAM journal on scientific computing, 2022, v. 44, no. 5, A2918-A2943en_US
dcterms.isPartOfSIAM journal on scientific computingen_US
dcterms.issued2022-
dc.identifier.scopus2-s2.0-85140377588-
dc.identifier.eissn1095-7197en_US
dc.description.validate202305 bcwwen_US
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumbera2051-
dc.identifier.SubFormID46380-
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextThis research was partially supported by the Georgia Tech Mathematics Application Portal (GT-MAP) and by research grants NSF DMS-1620345, NSF DMS-1830225, and ONR N00014- 18-1-2852. The research of the first author was partially supported by the Hong Kong Research Grant Council ECS grant 25302822, internal funds P0039016 and P0041274 from The Hong Kong Polytechnic University, and the CAS AMSS-PolyU Joint Laboratory of Applied Mathematics.en_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryVoR alloweden_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
21m142160x.pdf3.88 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

62
Citations as of Sep 22, 2024

Downloads

39
Citations as of Sep 22, 2024

SCOPUSTM   
Citations

3
Citations as of Sep 26, 2024

WEB OF SCIENCETM
Citations

3
Citations as of Jun 27, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.