2021
DOI: 10.1093/mnras/stab1676
|View full text |Cite
|
Sign up to set email alerts
|

A fast semidiscrete optimal transport algorithm for a unique reconstruction of the early Universe

Abstract: We leverage powerful mathematical tools stemming from optimal transport theory and transform them into an efficient algorithm to reconstruct the fluctuations of the primordial density field, built on solving the Monge-Ampère-Kantorovich equation. Our algorithm computes the optimal transport between an initial uniform continuous density field, partitioned into Laguerre cells, and a final input set of discrete point masses, linking the early to the late Universe. While existing early universe reconstruction algo… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
26
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 27 publications
(28 citation statements)
references
References 82 publications
1
26
0
Order By: Relevance
“…where ν : Ω → R + is a square-integrable density 4 . In the constraint (second line), ψ c corresponds to the Legendre-Fenchel transform of ψ, and the condition that applying it twice to ψ does not change ψ means that ψ is convex (because the graph of ψ cc corresponds to the convex hull of the graph of ψ).…”
Section: Volume Control Through Optimal Transportmentioning
confidence: 99%
See 4 more Smart Citations
“…where ν : Ω → R + is a square-integrable density 4 . In the constraint (second line), ψ c corresponds to the Legendre-Fenchel transform of ψ, and the condition that applying it twice to ψ does not change ψ means that ψ is convex (because the graph of ψ cc corresponds to the convex hull of the graph of ψ).…”
Section: Volume Control Through Optimal Transportmentioning
confidence: 99%
“…• second, the ghost cells have a significant computational cost: computing a Laguerre diagram costs O(N d √ N ) (where d ∈ {2, 3} is the dimension), and the Newton algorithm converges in O(N log(N )) iterations (empirical results in [4]). The "ghost cells" techniques computes a diagram with N + M vertices (instead of N ), where M needs to be sufficiently large to accurately capture the free boundary.…”
Section: Free Boundaries Through Partial Optimal Transportmentioning
confidence: 99%
See 3 more Smart Citations