Assessment of algorithms for computing moist available potential energy
Bethan L. Harris, Remi Tailleux

TL;DR
This paper evaluates various algorithms for computing moist available potential energy (MAPE), identifying the most practical method, analyzing its shortcomings, and proposing a new approach linked to CAPE for better physical insight and efficiency.
Contribution
It provides a comprehensive assessment of existing algorithms for MAPE, highlights their limitations, and introduces a new algorithm based on a theoretical link to CAPE, improving physical understanding and computational efficiency.
Findings
Divide-and-conquer algorithm is most suitable for practical use.
This algorithm can sometimes produce negative MAPE values.
A new algorithm exploiting a theoretical link to CAPE offers comparable accuracy with better physical insight.
Abstract
Atmospheric moist available potential energy (MAPE) has been traditionally defined as the potential energy of a moist atmosphere relative to that of the adiabatically sorted reference state defining a global potential energy minimum. Finding such a reference state was recently shown to be a linear assignment problem, and therefore exactly solvable. However, this is computationally extremely expensive, so there has been much interest in developing heuristic methods for computing MAPE in practice. Comparisons of the accuracy of such approximate algorithms have so far been limited to a small number of test cases; this work provides an assessment of the algorithms' performance across a wide range of atmospheric soundings, in two different locations. We determine that the divide-and-conquer algorithm is the best suited to practical application, but suffers from the previously overlooked…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
