The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Polar factorization and monotone rearrangement of vector‐valued functions
Brenier, Y. (1991) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160440402 · Cited by 1,641
Self-citationTopological Methods in Hydrodynamics
Arnold, V. I., & Khesin, B. A. (1992) · Annual Review of Fluid Mechanics · doi:10.1146/annurev.fl.24.010192.001045 · Cited by 1,024
The geometry of optimal transportation
Gangbo, W., & McCann, R. J. (1996) · Acta Mathematica · doi:10.1007/bf02392620 · Cited by 813
Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems
(1983) · Studies in Mathematics and Its Applications · doi:10.1016/s0168-2024(08)x7003-1 · Cited by 760
Computable Elastic Distances Between Shapes
Younes, L. (1998) · SIAM Journal on Applied Mathematics · doi:10.1137/s0036139995287685 · Cited by 349
On the optimal mapping of distributions
Knott, M., & Smith, C. S. (1984) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934745 · Cited by 248
Cited by
Optimal Transport for Domain Adaptation
Courty, N., Flamary, R., Tuia, D., & Rakotomamonjy, A. (2017) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2615921 · Cited by 989
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
Iterative Bregman Projections for Regularized Transportation Problems
Benamou, J.-D., Carlier, G., Cuturi, M., Nenna, L., & Peyré, G. (2015) · SIAM Journal on Scientific Computing · doi:10.1137/141000439 · Cited by 672
Self-citationConvolutional wasserstein distances: efficient optimal transportation on geometric domains
Solomon, J., de Goes, F., Peyré, G., Cuturi, M., Butscher, A., Nguyen, A., Du, T., & Guibas, L. (2015) · ACM Transactions on Graphics · doi:10.1145/2766963 · Cited by 481
Sliced and Radon Wasserstein Barycenters of Measures
Bonneel, N., Rabin, J., Peyré, G., & Pfister, H. (2015) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-014-0506-3 · Cited by 467
Metadata
- Authors
- Benamou, J.-D., & Brenier, Y.
- Venue
- Numerische Mathematik
- Published
- 2000-01-01
- Volume
- 84
- Issue
- 3
- Pages
- 375-393
- ISSN
- 0029-599X (ISSN-L)
- 0945-3245
- OpenAlex
- W1985506636
- Cited by
- 1,609
- References
- 6
- FWCI
- 25.86
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.